./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-bad-threaded-sum-2.wvr.c --full-output --traceabstraction.positions.where.we.compute.the.hoare.annotation All --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 273a578a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/weaver/popl20-bad-threaded-sum-2.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 e4c79b7a5b8db7237eb9e98d6143d48d2d4ec5b8465b95c5ccb44c5e387749db --traceabstraction.positions.where.we.compute.the.hoare.annotation All --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.owicki-witnesses-273a578-m [2024-02-19 14:47:45,799 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-19 14:47:45,875 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-19 14:47:45,879 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-19 14:47:45,879 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-19 14:47:45,904 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-19 14:47:45,904 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-19 14:47:45,905 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-19 14:47:45,905 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-19 14:47:45,908 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-19 14:47:45,908 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-19 14:47:45,909 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-19 14:47:45,909 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-19 14:47:45,910 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-19 14:47:45,910 INFO L153 SettingsManager]: * Use SBE=true [2024-02-19 14:47:45,910 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-19 14:47:45,910 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-19 14:47:45,911 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-19 14:47:45,911 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-19 14:47:45,911 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-19 14:47:45,911 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-19 14:47:45,912 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-19 14:47:45,912 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-19 14:47:45,912 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-19 14:47:45,912 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-19 14:47:45,912 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-19 14:47:45,913 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-19 14:47:45,913 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-19 14:47:45,913 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-19 14:47:45,913 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-19 14:47:45,914 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-19 14:47:45,914 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-19 14:47:45,914 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-19 14:47:45,915 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-19 14:47:45,915 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-19 14:47:45,915 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-19 14:47:45,915 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-19 14:47:45,916 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-19 14:47:45,916 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-19 14:47:45,916 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-19 14:47:45,916 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-19 14:47:45,916 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-19 14:47:45,916 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-19 14:47:45,916 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 -> e4c79b7a5b8db7237eb9e98d6143d48d2d4ec5b8465b95c5ccb44c5e387749db Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All [2024-02-19 14:47:46,193 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-19 14:47:46,214 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-19 14:47:46,216 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-19 14:47:46,217 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-19 14:47:46,217 INFO L274 PluginConnector]: CDTParser initialized [2024-02-19 14:47:46,218 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-threaded-sum-2.wvr.c [2024-02-19 14:47:47,381 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-19 14:47:47,541 INFO L384 CDTParser]: Found 1 translation units. [2024-02-19 14:47:47,542 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-threaded-sum-2.wvr.c [2024-02-19 14:47:47,548 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e65c044b/83185046a4474e10b114624162baa073/FLAG82e7f62f6 [2024-02-19 14:47:47,566 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e65c044b/83185046a4474e10b114624162baa073 [2024-02-19 14:47:47,568 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-19 14:47:47,570 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-02-19 14:47:47,572 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-19 14:47:47,573 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-19 14:47:47,577 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-19 14:47:47,577 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.02 02:47:47" (1/1) ... [2024-02-19 14:47:47,578 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66668202 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:47:47, skipping insertion in model container [2024-02-19 14:47:47,578 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.02 02:47:47" (1/1) ... [2024-02-19 14:47:47,594 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-19 14:47:47,760 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-threaded-sum-2.wvr.c[2476,2489] [2024-02-19 14:47:47,764 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-19 14:47:47,774 INFO L202 MainTranslator]: Completed pre-run [2024-02-19 14:47:47,805 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-threaded-sum-2.wvr.c[2476,2489] [2024-02-19 14:47:47,806 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-19 14:47:47,825 INFO L206 MainTranslator]: Completed translation [2024-02-19 14:47:47,826 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:47:47 WrapperNode [2024-02-19 14:47:47,826 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-19 14:47:47,827 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-19 14:47:47,827 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-19 14:47:47,827 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-19 14:47:47,832 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:47:47" (1/1) ... [2024-02-19 14:47:47,843 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:47:47" (1/1) ... [2024-02-19 14:47:47,867 INFO L138 Inliner]: procedures = 21, calls = 34, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 60 [2024-02-19 14:47:47,868 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-19 14:47:47,868 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-19 14:47:47,869 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-19 14:47:47,869 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-19 14:47:47,876 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:47:47" (1/1) ... [2024-02-19 14:47:47,877 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:47:47" (1/1) ... [2024-02-19 14:47:47,881 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:47:47" (1/1) ... [2024-02-19 14:47:47,900 INFO L175 MemorySlicer]: Split 6 memory accesses to 3 slices as follows [2, 2, 2]. 33 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2024-02-19 14:47:47,900 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:47:47" (1/1) ... [2024-02-19 14:47:47,900 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:47:47" (1/1) ... [2024-02-19 14:47:47,909 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:47:47" (1/1) ... [2024-02-19 14:47:47,912 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:47:47" (1/1) ... [2024-02-19 14:47:47,916 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:47:47" (1/1) ... [2024-02-19 14:47:47,917 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:47:47" (1/1) ... [2024-02-19 14:47:47,921 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-19 14:47:47,922 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-19 14:47:47,922 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-19 14:47:47,922 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-19 14:47:47,923 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:47:47" (1/1) ... [2024-02-19 14:47:47,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-19 14:47:47,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 14:47:47,969 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-02-19 14:47:47,988 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-02-19 14:47:48,015 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-19 14:47:48,016 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-19 14:47:48,016 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-19 14:47:48,016 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-19 14:47:48,016 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-19 14:47:48,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-19 14:47:48,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-19 14:47:48,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-19 14:47:48,018 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-19 14:47:48,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-19 14:47:48,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-19 14:47:48,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-19 14:47:48,018 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-02-19 14:47:48,018 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-02-19 14:47:48,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-19 14:47:48,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-19 14:47:48,019 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-02-19 14:47:48,019 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-02-19 14:47:48,019 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-02-19 14:47:48,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-19 14:47:48,021 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-19 14:47:48,124 INFO L244 CfgBuilder]: Building ICFG [2024-02-19 14:47:48,126 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-19 14:47:48,291 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-19 14:47:48,291 INFO L293 CfgBuilder]: Performing block encoding [2024-02-19 14:47:48,399 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-19 14:47:48,399 INFO L320 CfgBuilder]: Removed 2 assume(true) statements. [2024-02-19 14:47:48,399 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.02 02:47:48 BoogieIcfgContainer [2024-02-19 14:47:48,399 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-19 14:47:48,401 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-19 14:47:48,401 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-19 14:47:48,403 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-19 14:47:48,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.02 02:47:47" (1/3) ... [2024-02-19 14:47:48,404 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d701147 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.02 02:47:48, skipping insertion in model container [2024-02-19 14:47:48,404 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:47:47" (2/3) ... [2024-02-19 14:47:48,404 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d701147 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.02 02:47:48, skipping insertion in model container [2024-02-19 14:47:48,404 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.02 02:47:48" (3/3) ... [2024-02-19 14:47:48,405 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-threaded-sum-2.wvr.c [2024-02-19 14:47:48,418 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-19 14:47:48,418 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-02-19 14:47:48,418 INFO L631 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-19 14:47:48,453 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-02-19 14:47:48,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 24 transitions, 62 flow [2024-02-19 14:47:48,508 INFO L124 PetriNetUnfolderBase]: 2/22 cut-off events. [2024-02-19 14:47:48,515 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-19 14:47:48,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31 conditions, 22 events. 2/22 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 24 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 16. Up to 2 conditions per place. [2024-02-19 14:47:48,518 INFO L82 GeneralOperation]: Start removeDead. Operand has 29 places, 24 transitions, 62 flow [2024-02-19 14:47:48,520 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 26 places, 21 transitions, 54 flow [2024-02-19 14:47:48,533 INFO L368 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-19 14:47:48,551 INFO L369 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@4121a83d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-19 14:47:48,551 INFO L370 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-02-19 14:47:48,564 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-19 14:47:48,567 INFO L124 PetriNetUnfolderBase]: 2/20 cut-off events. [2024-02-19 14:47:48,567 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-19 14:47:48,567 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:47:48,568 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:47:48,568 INFO L432 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 14:47:48,575 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:47:48,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1119396265, now seen corresponding path program 1 times [2024-02-19 14:47:48,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:47:48,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128762806] [2024-02-19 14:47:48,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:47:48,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:47:48,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:47:49,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:47:49,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:47:49,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128762806] [2024-02-19 14:47:49,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128762806] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:47:49,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:47:49,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-19 14:47:49,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533651443] [2024-02-19 14:47:49,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:47:49,049 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-19 14:47:49,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:47:49,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-19 14:47:49,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-02-19 14:47:49,132 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 24 [2024-02-19 14:47:49,135 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 21 transitions, 54 flow. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 14:47:49,135 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:47:49,135 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 24 [2024-02-19 14:47:49,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:47:49,217 INFO L124 PetriNetUnfolderBase]: 69/153 cut-off events. [2024-02-19 14:47:49,217 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2024-02-19 14:47:49,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 306 conditions, 153 events. 69/153 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 586 event pairs, 6 based on Foata normal form. 8/158 useless extension candidates. Maximal degree in co-relation 223. Up to 79 conditions per place. [2024-02-19 14:47:49,220 INFO L140 encePairwiseOnDemand]: 20/24 looper letters, 25 selfloop transitions, 3 changer transitions 0/33 dead transitions. [2024-02-19 14:47:49,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 33 transitions, 140 flow [2024-02-19 14:47:49,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-19 14:47:49,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-19 14:47:49,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2024-02-19 14:47:49,241 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.59375 [2024-02-19 14:47:49,244 INFO L308 CegarLoopForPetriNet]: 26 programPoint places, 3 predicate places. [2024-02-19 14:47:49,244 INFO L507 AbstractCegarLoop]: Abstraction has has 29 places, 33 transitions, 140 flow [2024-02-19 14:47:49,244 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 14:47:49,244 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:47:49,245 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:47:49,245 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-19 14:47:49,245 INFO L432 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 14:47:49,246 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:47:49,246 INFO L85 PathProgramCache]: Analyzing trace with hash 337880122, now seen corresponding path program 1 times [2024-02-19 14:47:49,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:47:49,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442492119] [2024-02-19 14:47:49,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:47:49,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:47:49,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:47:49,409 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-19 14:47:49,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:47:49,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442492119] [2024-02-19 14:47:49,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442492119] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:47:49,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:47:49,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-19 14:47:49,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145448619] [2024-02-19 14:47:49,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:47:49,411 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-19 14:47:49,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:47:49,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-19 14:47:49,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-19 14:47:49,425 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 24 [2024-02-19 14:47:49,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 33 transitions, 140 flow. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-02-19 14:47:49,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:47:49,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 24 [2024-02-19 14:47:49,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:47:49,514 INFO L124 PetriNetUnfolderBase]: 83/166 cut-off events. [2024-02-19 14:47:49,514 INFO L125 PetriNetUnfolderBase]: For 48/50 co-relation queries the response was YES. [2024-02-19 14:47:49,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 444 conditions, 166 events. 83/166 cut-off events. For 48/50 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 509 event pairs, 12 based on Foata normal form. 11/177 useless extension candidates. Maximal degree in co-relation 383. Up to 91 conditions per place. [2024-02-19 14:47:49,516 INFO L140 encePairwiseOnDemand]: 20/24 looper letters, 26 selfloop transitions, 4 changer transitions 0/35 dead transitions. [2024-02-19 14:47:49,516 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 35 transitions, 201 flow [2024-02-19 14:47:49,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-02-19 14:47:49,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-02-19 14:47:49,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2024-02-19 14:47:49,518 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2024-02-19 14:47:49,518 INFO L308 CegarLoopForPetriNet]: 26 programPoint places, 6 predicate places. [2024-02-19 14:47:49,519 INFO L507 AbstractCegarLoop]: Abstraction has has 32 places, 35 transitions, 201 flow [2024-02-19 14:47:49,519 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-02-19 14:47:49,519 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:47:49,519 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:47:49,519 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-19 14:47:49,519 INFO L432 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 14:47:49,520 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:47:49,520 INFO L85 PathProgramCache]: Analyzing trace with hash -2129940392, now seen corresponding path program 2 times [2024-02-19 14:47:49,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:47:49,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981189052] [2024-02-19 14:47:49,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:47:49,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:47:49,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:47:49,617 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:47:49,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:47:49,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981189052] [2024-02-19 14:47:49,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981189052] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:47:49,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:47:49,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-19 14:47:49,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975747659] [2024-02-19 14:47:49,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:47:49,619 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-19 14:47:49,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:47:49,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-19 14:47:49,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-02-19 14:47:49,635 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 24 [2024-02-19 14:47:49,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 35 transitions, 201 flow. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 14:47:49,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:47:49,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 24 [2024-02-19 14:47:49,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:47:49,721 INFO L124 PetriNetUnfolderBase]: 108/216 cut-off events. [2024-02-19 14:47:49,722 INFO L125 PetriNetUnfolderBase]: For 177/189 co-relation queries the response was YES. [2024-02-19 14:47:49,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 740 conditions, 216 events. 108/216 cut-off events. For 177/189 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 773 event pairs, 22 based on Foata normal form. 14/223 useless extension candidates. Maximal degree in co-relation 662. Up to 129 conditions per place. [2024-02-19 14:47:49,724 INFO L140 encePairwiseOnDemand]: 19/24 looper letters, 31 selfloop transitions, 5 changer transitions 0/41 dead transitions. [2024-02-19 14:47:49,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 41 transitions, 307 flow [2024-02-19 14:47:49,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-19 14:47:49,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-19 14:47:49,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2024-02-19 14:47:49,726 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.575 [2024-02-19 14:47:49,726 INFO L308 CegarLoopForPetriNet]: 26 programPoint places, 10 predicate places. [2024-02-19 14:47:49,726 INFO L507 AbstractCegarLoop]: Abstraction has has 36 places, 41 transitions, 307 flow [2024-02-19 14:47:49,727 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 14:47:49,727 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:47:49,727 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:47:49,727 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-19 14:47:49,727 INFO L432 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 14:47:49,728 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:47:49,728 INFO L85 PathProgramCache]: Analyzing trace with hash 32301366, now seen corresponding path program 3 times [2024-02-19 14:47:49,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:47:49,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438677019] [2024-02-19 14:47:49,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:47:49,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:47:49,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:47:50,165 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:47:50,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:47:50,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438677019] [2024-02-19 14:47:50,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438677019] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 14:47:50,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1069162528] [2024-02-19 14:47:50,167 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-02-19 14:47:50,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 14:47:50,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 14:47:50,181 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-02-19 14:47:50,183 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-02-19 14:47:50,242 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-02-19 14:47:50,242 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 14:47:50,244 INFO L262 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 14 conjunts are in the unsatisfiable core [2024-02-19 14:47:50,247 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 14:47:50,474 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:47:50,475 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 14:47:50,706 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:47:50,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1069162528] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 14:47:50,706 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 14:47:50,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2024-02-19 14:47:50,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528144541] [2024-02-19 14:47:50,707 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 14:47:50,707 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-02-19 14:47:50,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:47:50,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-02-19 14:47:50,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2024-02-19 14:47:50,792 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 24 [2024-02-19 14:47:50,793 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 41 transitions, 307 flow. Second operand has 17 states, 17 states have (on average 8.470588235294118) internal successors, (144), 17 states have internal predecessors, (144), 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-02-19 14:47:50,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:47:50,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 24 [2024-02-19 14:47:50,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:47:52,081 INFO L124 PetriNetUnfolderBase]: 656/1211 cut-off events. [2024-02-19 14:47:52,081 INFO L125 PetriNetUnfolderBase]: For 1923/1989 co-relation queries the response was YES. [2024-02-19 14:47:52,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5061 conditions, 1211 events. 656/1211 cut-off events. For 1923/1989 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 6269 event pairs, 30 based on Foata normal form. 13/1202 useless extension candidates. Maximal degree in co-relation 4814. Up to 807 conditions per place. [2024-02-19 14:47:52,089 INFO L140 encePairwiseOnDemand]: 15/24 looper letters, 140 selfloop transitions, 81 changer transitions 28/253 dead transitions. [2024-02-19 14:47:52,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 253 transitions, 2402 flow [2024-02-19 14:47:52,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-02-19 14:47:52,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2024-02-19 14:47:52,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 368 transitions. [2024-02-19 14:47:52,096 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5111111111111111 [2024-02-19 14:47:52,097 INFO L308 CegarLoopForPetriNet]: 26 programPoint places, 39 predicate places. [2024-02-19 14:47:52,097 INFO L507 AbstractCegarLoop]: Abstraction has has 65 places, 253 transitions, 2402 flow [2024-02-19 14:47:52,098 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 8.470588235294118) internal successors, (144), 17 states have internal predecessors, (144), 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-02-19 14:47:52,098 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:47:52,098 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:47:52,124 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-02-19 14:47:52,310 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 14:47:52,311 INFO L432 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 14:47:52,311 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:47:52,311 INFO L85 PathProgramCache]: Analyzing trace with hash -727830827, now seen corresponding path program 4 times [2024-02-19 14:47:52,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:47:52,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345212056] [2024-02-19 14:47:52,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:47:52,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:47:52,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:47:52,456 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:47:52,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:47:52,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345212056] [2024-02-19 14:47:52,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345212056] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:47:52,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:47:52,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-02-19 14:47:52,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809434751] [2024-02-19 14:47:52,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:47:52,457 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-19 14:47:52,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:47:52,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-19 14:47:52,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-02-19 14:47:52,466 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2024-02-19 14:47:52,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 253 transitions, 2402 flow. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 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-02-19 14:47:52,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:47:52,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2024-02-19 14:47:52,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:47:52,758 INFO L124 PetriNetUnfolderBase]: 1057/1814 cut-off events. [2024-02-19 14:47:52,758 INFO L125 PetriNetUnfolderBase]: For 5416/5500 co-relation queries the response was YES. [2024-02-19 14:47:52,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9109 conditions, 1814 events. 1057/1814 cut-off events. For 5416/5500 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 9288 event pairs, 9 based on Foata normal form. 90/1885 useless extension candidates. Maximal degree in co-relation 8820. Up to 1223 conditions per place. [2024-02-19 14:47:52,770 INFO L140 encePairwiseOnDemand]: 16/24 looper letters, 355 selfloop transitions, 73 changer transitions 58/506 dead transitions. [2024-02-19 14:47:52,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 506 transitions, 5810 flow [2024-02-19 14:47:52,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-02-19 14:47:52,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-02-19 14:47:52,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 96 transitions. [2024-02-19 14:47:52,772 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2024-02-19 14:47:52,772 INFO L308 CegarLoopForPetriNet]: 26 programPoint places, 47 predicate places. [2024-02-19 14:47:52,772 INFO L507 AbstractCegarLoop]: Abstraction has has 73 places, 506 transitions, 5810 flow [2024-02-19 14:47:52,773 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 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-02-19 14:47:52,773 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:47:52,773 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:47:52,773 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-19 14:47:52,773 INFO L432 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 14:47:52,774 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:47:52,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1071088710, now seen corresponding path program 1 times [2024-02-19 14:47:52,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:47:52,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554047084] [2024-02-19 14:47:52,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:47:52,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:47:52,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:47:53,476 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:47:53,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:47:53,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554047084] [2024-02-19 14:47:53,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554047084] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 14:47:53,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754094990] [2024-02-19 14:47:53,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:47:53,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 14:47:53,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 14:47:53,478 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-02-19 14:47:53,480 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-02-19 14:47:53,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:47:53,559 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 20 conjunts are in the unsatisfiable core [2024-02-19 14:47:53,560 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 14:48:04,384 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:48:04,384 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 14:48:05,140 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:48:05,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1754094990] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 14:48:05,144 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 14:48:05,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 22 [2024-02-19 14:48:05,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112074400] [2024-02-19 14:48:05,144 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 14:48:05,145 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-02-19 14:48:05,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:48:05,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-02-19 14:48:05,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=396, Unknown=2, NotChecked=0, Total=506 [2024-02-19 14:48:09,220 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-19 14:48:13,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-19 14:48:13,264 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2024-02-19 14:48:13,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 506 transitions, 5810 flow. Second operand has 23 states, 23 states have (on average 6.391304347826087) internal successors, (147), 23 states have internal predecessors, (147), 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-02-19 14:48:13,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:48:13,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2024-02-19 14:48:13,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:48:26,609 WARN L293 SmtUtils]: Spent 12.04s on a formula simplification. DAG size of input: 64 DAG size of output: 52 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-19 14:48:38,832 WARN L293 SmtUtils]: Spent 12.05s on a formula simplification. DAG size of input: 64 DAG size of output: 49 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-19 14:48:46,658 INFO L124 PetriNetUnfolderBase]: 2675/4674 cut-off events. [2024-02-19 14:48:46,658 INFO L125 PetriNetUnfolderBase]: For 15724/15724 co-relation queries the response was YES. [2024-02-19 14:48:46,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27602 conditions, 4674 events. 2675/4674 cut-off events. For 15724/15724 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 28806 event pairs, 30 based on Foata normal form. 13/4687 useless extension candidates. Maximal degree in co-relation 26913. Up to 3214 conditions per place. [2024-02-19 14:48:46,687 INFO L140 encePairwiseOnDemand]: 15/24 looper letters, 788 selfloop transitions, 369 changer transitions 396/1558 dead transitions. [2024-02-19 14:48:46,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 1558 transitions, 21203 flow [2024-02-19 14:48:46,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-02-19 14:48:46,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2024-02-19 14:48:46,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 502 transitions. [2024-02-19 14:48:46,690 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4450354609929078 [2024-02-19 14:48:46,691 INFO L308 CegarLoopForPetriNet]: 26 programPoint places, 93 predicate places. [2024-02-19 14:48:46,691 INFO L507 AbstractCegarLoop]: Abstraction has has 119 places, 1558 transitions, 21203 flow [2024-02-19 14:48:46,691 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 6.391304347826087) internal successors, (147), 23 states have internal predecessors, (147), 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-02-19 14:48:46,691 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:48:46,691 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:48:46,705 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-02-19 14:48:46,902 WARN L489 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-02-19 14:48:46,903 INFO L432 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 14:48:46,903 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:48:46,903 INFO L85 PathProgramCache]: Analyzing trace with hash -687391626, now seen corresponding path program 2 times [2024-02-19 14:48:46,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:48:46,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231806487] [2024-02-19 14:48:46,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:48:46,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:48:46,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:48:47,781 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:48:47,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:48:47,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231806487] [2024-02-19 14:48:47,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231806487] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 14:48:47,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [121553676] [2024-02-19 14:48:47,782 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-19 14:48:47,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 14:48:47,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 14:48:47,783 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-02-19 14:48:47,784 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-02-19 14:48:47,882 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-19 14:48:47,883 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 14:48:47,884 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 23 conjunts are in the unsatisfiable core [2024-02-19 14:48:47,885 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 14:49:01,634 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:49:01,634 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 14:49:08,307 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:49:08,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [121553676] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 14:49:08,308 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 14:49:08,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 29 [2024-02-19 14:49:08,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745236928] [2024-02-19 14:49:08,309 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 14:49:08,309 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-02-19 14:49:08,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:49:08,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-02-19 14:49:08,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=681, Unknown=4, NotChecked=0, Total=870 [2024-02-19 14:49:13,288 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-19 14:49:13,288 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2024-02-19 14:49:13,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 1558 transitions, 21203 flow. Second operand has 30 states, 30 states have (on average 6.066666666666666) internal successors, (182), 30 states have internal predecessors, (182), 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-02-19 14:49:13,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:49:13,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2024-02-19 14:49:13,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:49:25,809 WARN L293 SmtUtils]: Spent 8.04s on a formula simplification. DAG size of input: 44 DAG size of output: 40 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-19 14:49:51,451 WARN L293 SmtUtils]: Spent 12.07s on a formula simplification. DAG size of input: 75 DAG size of output: 57 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-19 14:49:55,665 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-19 14:50:05,900 WARN L293 SmtUtils]: Spent 8.36s on a formula simplification. DAG size of input: 75 DAG size of output: 42 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-19 14:50:12,673 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-19 14:50:16,679 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-19 14:50:20,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-19 14:50:30,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-19 14:50:34,997 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-19 14:50:39,667 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-19 14:50:43,840 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-19 14:50:47,721 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.88s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-19 14:50:51,724 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-19 14:50:55,733 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-19 14:50:59,740 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-19 14:51:04,051 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-19 14:51:08,057 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-19 14:51:12,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-19 14:51:16,108 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-19 14:51:22,021 INFO L124 PetriNetUnfolderBase]: 4341/7778 cut-off events. [2024-02-19 14:51:22,022 INFO L125 PetriNetUnfolderBase]: For 32236/32236 co-relation queries the response was YES. [2024-02-19 14:51:22,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53545 conditions, 7778 events. 4341/7778 cut-off events. For 32236/32236 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 53818 event pairs, 24 based on Foata normal form. 18/7796 useless extension candidates. Maximal degree in co-relation 52400. Up to 5676 conditions per place. [2024-02-19 14:51:22,071 INFO L140 encePairwiseOnDemand]: 15/24 looper letters, 1339 selfloop transitions, 551 changer transitions 996/2891 dead transitions. [2024-02-19 14:51:22,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 2891 transitions, 45261 flow [2024-02-19 14:51:22,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2024-02-19 14:51:22,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2024-02-19 14:51:22,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 708 transitions. [2024-02-19 14:51:22,074 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4338235294117647 [2024-02-19 14:51:22,074 INFO L308 CegarLoopForPetriNet]: 26 programPoint places, 160 predicate places. [2024-02-19 14:51:22,075 INFO L507 AbstractCegarLoop]: Abstraction has has 186 places, 2891 transitions, 45261 flow [2024-02-19 14:51:22,075 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 6.066666666666666) internal successors, (182), 30 states have internal predecessors, (182), 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-02-19 14:51:22,075 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:51:22,075 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:51:22,086 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-02-19 14:51:22,286 WARN L489 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-02-19 14:51:22,287 INFO L432 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 14:51:22,287 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:51:22,287 INFO L85 PathProgramCache]: Analyzing trace with hash 133773148, now seen corresponding path program 3 times [2024-02-19 14:51:22,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:51:22,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855983337] [2024-02-19 14:51:22,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:51:22,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:51:22,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:51:27,389 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:51:27,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:51:27,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855983337] [2024-02-19 14:51:27,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855983337] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 14:51:27,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1486934711] [2024-02-19 14:51:27,389 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-02-19 14:51:27,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 14:51:27,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 14:51:27,391 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-02-19 14:51:27,392 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-02-19 14:51:27,471 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-02-19 14:51:27,472 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 14:51:27,473 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 23 conjunts are in the unsatisfiable core [2024-02-19 14:51:27,474 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 14:51:47,927 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:51:47,927 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 14:51:54,689 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:51:54,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1486934711] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 14:51:54,690 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 14:51:54,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2024-02-19 14:51:54,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800254141] [2024-02-19 14:51:54,691 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 14:51:54,691 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-02-19 14:51:54,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:51:54,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-02-19 14:51:54,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=692, Unknown=4, NotChecked=0, Total=870 [2024-02-19 14:51:58,713 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-19 14:51:58,744 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2024-02-19 14:51:58,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 2891 transitions, 45261 flow. Second operand has 30 states, 30 states have (on average 5.866666666666666) internal successors, (176), 30 states have internal predecessors, (176), 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-02-19 14:51:58,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:51:58,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2024-02-19 14:51:58,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:52:02,852 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-19 14:52:06,923 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-19 14:52:12,927 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-19 14:52:27,026 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-19 14:52:36,118 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-19 14:52:40,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-19 14:52:53,698 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-19 14:52:57,753 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-19 14:53:08,259 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-19 14:53:20,400 WARN L293 SmtUtils]: Spent 8.05s on a formula simplification. DAG size of input: 61 DAG size of output: 56 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-19 14:53:23,369 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.87s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-19 14:53:36,419 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-19 14:54:01,837 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.49s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-19 14:54:21,344 WARN L293 SmtUtils]: Spent 19.11s on a formula simplification. DAG size of input: 118 DAG size of output: 75 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-19 14:54:23,139 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-19 14:54:44,039 WARN L293 SmtUtils]: Spent 15.88s on a formula simplification. DAG size of input: 91 DAG size of output: 71 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-19 14:54:48,051 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-19 14:54:49,082 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-19 14:55:06,576 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-19 14:55:10,578 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-19 14:55:42,299 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-19 14:55:44,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-19 14:55:46,525 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-19 14:55:48,217 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-19 14:56:08,006 WARN L293 SmtUtils]: Spent 19.31s on a formula simplification. DAG size of input: 109 DAG size of output: 68 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-19 14:56:13,403 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-19 14:56:16,925 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.20s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-19 14:56:29,022 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-19 14:56:33,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-19 14:56:39,056 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-19 14:56:43,536 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-19 14:56:45,375 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-19 14:56:53,320 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.80s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-19 14:57:04,799 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-19 14:57:14,535 INFO L124 PetriNetUnfolderBase]: 6592/11833 cut-off events. [2024-02-19 14:57:14,536 INFO L125 PetriNetUnfolderBase]: For 60709/60709 co-relation queries the response was YES. [2024-02-19 14:57:14,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92381 conditions, 11833 events. 6592/11833 cut-off events. For 60709/60709 co-relation queries the response was YES. Maximal size of possible extension queue 525. Compared 88808 event pairs, 18 based on Foata normal form. 13/11846 useless extension candidates. Maximal degree in co-relation 90700. Up to 8841 conditions per place. [2024-02-19 14:57:14,650 INFO L140 encePairwiseOnDemand]: 12/24 looper letters, 2180 selfloop transitions, 830 changer transitions 1584/4599 dead transitions. [2024-02-19 14:57:14,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 4599 transitions, 81090 flow [2024-02-19 14:57:14,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2024-02-19 14:57:14,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2024-02-19 14:57:14,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 807 transitions. [2024-02-19 14:57:14,655 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.40512048192771083 [2024-02-19 14:57:14,657 INFO L308 CegarLoopForPetriNet]: 26 programPoint places, 242 predicate places. [2024-02-19 14:57:14,658 INFO L507 AbstractCegarLoop]: Abstraction has has 268 places, 4599 transitions, 81090 flow [2024-02-19 14:57:14,659 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 5.866666666666666) internal successors, (176), 30 states have internal predecessors, (176), 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-02-19 14:57:14,659 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:57:14,659 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:57:14,670 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-02-19 14:57:14,870 WARN L489 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-02-19 14:57:14,871 INFO L432 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 14:57:14,871 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:57:14,872 INFO L85 PathProgramCache]: Analyzing trace with hash -10540132, now seen corresponding path program 4 times [2024-02-19 14:57:14,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:57:14,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635448337] [2024-02-19 14:57:14,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:57:14,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:57:14,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:57:15,926 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:57:15,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:57:15,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635448337] [2024-02-19 14:57:15,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635448337] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 14:57:15,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [331367931] [2024-02-19 14:57:15,927 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-02-19 14:57:15,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 14:57:15,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 14:57:15,929 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-02-19 14:57:15,930 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-02-19 14:57:16,007 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-02-19 14:57:16,007 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 14:57:16,008 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 20 conjunts are in the unsatisfiable core [2024-02-19 14:57:16,009 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 14:57:28,743 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:57:28,743 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 14:57:37,759 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:57:37,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [331367931] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 14:57:37,759 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 14:57:37,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 22 [2024-02-19 14:57:37,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507958835] [2024-02-19 14:57:37,760 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 14:57:37,760 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-02-19 14:57:37,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:57:37,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-02-19 14:57:37,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=393, Unknown=5, NotChecked=0, Total=506 [2024-02-19 14:57:41,971 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-19 14:57:41,971 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 24 [2024-02-19 14:57:41,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 4599 transitions, 81090 flow. Second operand has 23 states, 23 states have (on average 6.3478260869565215) internal successors, (146), 23 states have internal predecessors, (146), 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-02-19 14:57:41,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:57:41,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 24 [2024-02-19 14:57:41,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:57:54,233 WARN L293 SmtUtils]: Spent 8.02s on a formula simplification. DAG size of input: 48 DAG size of output: 35 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-19 14:58:02,314 WARN L293 SmtUtils]: Spent 8.03s on a formula simplification. DAG size of input: 60 DAG size of output: 43 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-19 14:58:15,988 WARN L293 SmtUtils]: Spent 8.04s on a formula simplification. DAG size of input: 50 DAG size of output: 42 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-19 14:58:25,513 WARN L293 SmtUtils]: Spent 8.05s on a formula simplification. DAG size of input: 57 DAG size of output: 51 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-19 14:58:34,044 WARN L293 SmtUtils]: Spent 8.17s on a formula simplification. DAG size of input: 75 DAG size of output: 69 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-19 14:58:42,253 WARN L293 SmtUtils]: Spent 8.07s on a formula simplification. DAG size of input: 60 DAG size of output: 55 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-19 14:58:48,082 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-19 14:58:50,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.41s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-19 14:59:00,648 INFO L124 PetriNetUnfolderBase]: 8293/14834 cut-off events. [2024-02-19 14:59:00,648 INFO L125 PetriNetUnfolderBase]: For 94085/94145 co-relation queries the response was YES. [2024-02-19 14:59:00,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129444 conditions, 14834 events. 8293/14834 cut-off events. For 94085/94145 co-relation queries the response was YES. Maximal size of possible extension queue 704. Compared 115964 event pairs, 22 based on Foata normal form. 9/14840 useless extension candidates. Maximal degree in co-relation 127345. Up to 11164 conditions per place. [2024-02-19 14:59:00,748 INFO L140 encePairwiseOnDemand]: 15/24 looper letters, 2890 selfloop transitions, 976 changer transitions 1984/5855 dead transitions. [2024-02-19 14:59:00,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 5855 transitions, 114629 flow [2024-02-19 14:59:00,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-02-19 14:59:00,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2024-02-19 14:59:00,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 459 transitions. [2024-02-19 14:59:00,750 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.40691489361702127 [2024-02-19 14:59:00,750 INFO L308 CegarLoopForPetriNet]: 26 programPoint places, 288 predicate places. [2024-02-19 14:59:00,751 INFO L507 AbstractCegarLoop]: Abstraction has has 314 places, 5855 transitions, 114629 flow [2024-02-19 14:59:00,751 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 6.3478260869565215) internal successors, (146), 23 states have internal predecessors, (146), 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-02-19 14:59:00,751 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:59:00,751 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:59:00,764 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-02-19 14:59:00,962 WARN L489 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-02-19 14:59:00,962 INFO L432 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 14:59:00,963 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:59:00,963 INFO L85 PathProgramCache]: Analyzing trace with hash -6629127, now seen corresponding path program 5 times [2024-02-19 14:59:00,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:59:00,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060709635] [2024-02-19 14:59:00,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:59:00,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:59:00,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:59:01,546 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:59:01,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:59:01,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060709635] [2024-02-19 14:59:01,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060709635] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 14:59:01,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [207121655] [2024-02-19 14:59:01,547 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-02-19 14:59:01,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 14:59:01,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 14:59:01,549 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-02-19 14:59:01,551 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-02-19 14:59:01,630 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2024-02-19 14:59:01,630 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 14:59:01,631 INFO L262 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 29 conjunts are in the unsatisfiable core [2024-02-19 14:59:01,633 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 14:59:06,793 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:59:06,794 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 14:59:08,016 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:59:08,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [207121655] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 14:59:08,017 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 14:59:08,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 12] total 34 [2024-02-19 14:59:08,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617024439] [2024-02-19 14:59:08,019 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 14:59:08,019 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-02-19 14:59:08,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:59:08,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-02-19 14:59:08,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=978, Unknown=1, NotChecked=0, Total=1190 [2024-02-19 14:59:08,104 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 24 [2024-02-19 14:59:08,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 5855 transitions, 114629 flow. Second operand has 35 states, 35 states have (on average 4.942857142857143) internal successors, (173), 35 states have internal predecessors, (173), 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-02-19 14:59:08,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:59:08,105 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 24 [2024-02-19 14:59:08,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:59:13,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-19 14:59:27,194 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-19 14:59:32,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-19 14:59:37,378 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-19 14:59:41,431 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-19 14:59:47,150 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-19 14:59:51,217 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-19 14:59:55,230 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-19 15:00:04,624 WARN L293 SmtUtils]: Spent 8.05s on a formula simplification. DAG size of input: 51 DAG size of output: 46 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-19 15:00:09,159 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-19 15:00:15,296 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-19 15:00:36,861 INFO L124 PetriNetUnfolderBase]: 13404/24114 cut-off events. [2024-02-19 15:00:36,861 INFO L125 PetriNetUnfolderBase]: For 152507/152507 co-relation queries the response was YES. [2024-02-19 15:00:36,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 232375 conditions, 24114 events. 13404/24114 cut-off events. For 152507/152507 co-relation queries the response was YES. Maximal size of possible extension queue 1088. Compared 201379 event pairs, 32 based on Foata normal form. 16/24130 useless extension candidates. Maximal degree in co-relation 228626. Up to 17817 conditions per place. [2024-02-19 15:00:37,040 INFO L140 encePairwiseOnDemand]: 11/24 looper letters, 4502 selfloop transitions, 3136 changer transitions 4305/11944 dead transitions. [2024-02-19 15:00:37,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 440 places, 11944 transitions, 256375 flow [2024-02-19 15:00:37,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2024-02-19 15:00:37,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2024-02-19 15:00:37,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 1035 transitions. [2024-02-19 15:00:37,045 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.3395669291338583 [2024-02-19 15:00:37,045 INFO L308 CegarLoopForPetriNet]: 26 programPoint places, 414 predicate places. [2024-02-19 15:00:37,045 INFO L507 AbstractCegarLoop]: Abstraction has has 440 places, 11944 transitions, 256375 flow [2024-02-19 15:00:37,046 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 4.942857142857143) internal successors, (173), 35 states have internal predecessors, (173), 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-02-19 15:00:37,046 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 15:00:37,046 INFO L234 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 15:00:37,058 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-02-19 15:00:37,256 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:00:37,257 INFO L432 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 15:00:37,257 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 15:00:37,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1874037922, now seen corresponding path program 6 times [2024-02-19 15:00:37,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 15:00:37,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406074081] [2024-02-19 15:00:37,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 15:00:37,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 15:00:37,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 15:00:38,325 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:00:38,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 15:00:38,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406074081] [2024-02-19 15:00:38,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406074081] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 15:00:38,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [592338308] [2024-02-19 15:00:38,326 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-02-19 15:00:38,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 15:00:38,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 15:00:38,328 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-02-19 15:00:38,329 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-02-19 15:00:38,446 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2024-02-19 15:00:38,446 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 15:00:38,447 INFO L262 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 21 conjunts are in the unsatisfiable core [2024-02-19 15:00:38,448 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 15:00:47,849 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:00:47,850 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 15:00:49,606 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 15:00:49,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [592338308] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 15:00:49,606 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 15:00:49,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 26 [2024-02-19 15:00:49,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165350763] [2024-02-19 15:00:49,607 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 15:00:49,607 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-02-19 15:00:49,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 15:00:49,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-02-19 15:00:49,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=569, Unknown=2, NotChecked=0, Total=702 [2024-02-19 15:00:51,332 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-19 15:00:52,958 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-19 15:00:53,287 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 24 [2024-02-19 15:00:53,287 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 440 places, 11944 transitions, 256375 flow. Second operand has 27 states, 27 states have (on average 5.518518518518518) internal successors, (149), 27 states have internal predecessors, (149), 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-02-19 15:00:53,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 15:00:53,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 24 [2024-02-19 15:00:53,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 15:01:30,481 WARN L293 SmtUtils]: Spent 8.71s on a formula simplification. DAG size of input: 100 DAG size of output: 61 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-19 15:01:52,258 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-19 15:02:07,271 WARN L293 SmtUtils]: Spent 5.48s on a formula simplification. DAG size of input: 106 DAG size of output: 103 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Killed by 15