./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/bench-exp2x4.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/bench-exp2x4.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 f3514ef3a93910f9ac9453b24d3813c22e07d2a41de38e0bc0d58abd31257770 --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:19:24,729 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-19 14:19:24,795 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-19 14:19:24,806 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-19 14:19:24,807 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-19 14:19:24,839 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-19 14:19:24,839 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-19 14:19:24,840 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-19 14:19:24,840 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-19 14:19:24,844 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-19 14:19:24,845 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-19 14:19:24,845 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-19 14:19:24,845 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-19 14:19:24,847 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-19 14:19:24,847 INFO L153 SettingsManager]: * Use SBE=true [2024-02-19 14:19:24,847 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-19 14:19:24,847 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-19 14:19:24,848 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-19 14:19:24,848 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-19 14:19:24,848 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-19 14:19:24,849 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-19 14:19:24,849 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-19 14:19:24,850 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-19 14:19:24,850 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-19 14:19:24,850 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-19 14:19:24,851 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-19 14:19:24,851 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-19 14:19:24,851 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-19 14:19:24,852 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-19 14:19:24,852 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-19 14:19:24,853 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-19 14:19:24,853 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-19 14:19:24,854 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-19 14:19:24,854 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-19 14:19:24,854 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-19 14:19:24,854 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-19 14:19:24,855 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-19 14:19:24,855 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-19 14:19:24,856 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-19 14:19:24,856 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-19 14:19:24,856 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-19 14:19:24,856 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-19 14:19:24,857 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-19 14:19:24,857 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 -> f3514ef3a93910f9ac9453b24d3813c22e07d2a41de38e0bc0d58abd31257770 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All [2024-02-19 14:19:25,182 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-19 14:19:25,201 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-19 14:19:25,203 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-19 14:19:25,204 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-19 14:19:25,205 INFO L274 PluginConnector]: CDTParser initialized [2024-02-19 14:19:25,206 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp2x4.wvr.c [2024-02-19 14:19:26,580 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-19 14:19:26,781 INFO L384 CDTParser]: Found 1 translation units. [2024-02-19 14:19:26,782 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x4.wvr.c [2024-02-19 14:19:26,795 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16663a9a7/39bd61cac63c4791bb493b115622d0cc/FLAG33db6ba79 [2024-02-19 14:19:26,811 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16663a9a7/39bd61cac63c4791bb493b115622d0cc [2024-02-19 14:19:26,813 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-19 14:19:26,815 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-02-19 14:19:26,818 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-19 14:19:26,818 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-19 14:19:26,823 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-19 14:19:26,824 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.02 02:19:26" (1/1) ... [2024-02-19 14:19:26,824 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d959d1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:19:26, skipping insertion in model container [2024-02-19 14:19:26,825 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.02 02:19:26" (1/1) ... [2024-02-19 14:19:26,845 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-19 14:19:27,049 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/bench-exp2x4.wvr.c[2309,2322] [2024-02-19 14:19:27,053 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-19 14:19:27,061 INFO L202 MainTranslator]: Completed pre-run [2024-02-19 14:19:27,080 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/bench-exp2x4.wvr.c[2309,2322] [2024-02-19 14:19:27,082 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-19 14:19:27,095 INFO L206 MainTranslator]: Completed translation [2024-02-19 14:19:27,096 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:19:27 WrapperNode [2024-02-19 14:19:27,096 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-19 14:19:27,097 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-19 14:19:27,097 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-19 14:19:27,097 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-19 14:19:27,103 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:19:27" (1/1) ... [2024-02-19 14:19:27,120 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:19:27" (1/1) ... [2024-02-19 14:19:27,138 INFO L138 Inliner]: procedures = 20, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 95 [2024-02-19 14:19:27,139 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-19 14:19:27,140 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-19 14:19:27,140 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-19 14:19:27,140 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-19 14:19:27,150 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:19:27" (1/1) ... [2024-02-19 14:19:27,150 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:19:27" (1/1) ... [2024-02-19 14:19:27,165 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:19:27" (1/1) ... [2024-02-19 14:19:27,186 INFO L175 MemorySlicer]: Split 10 memory accesses to 5 slices as follows [2, 2, 2, 2, 2]. 20 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 4 writes are split as follows [0, 1, 1, 1, 1]. [2024-02-19 14:19:27,191 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:19:27" (1/1) ... [2024-02-19 14:19:27,191 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:19:27" (1/1) ... [2024-02-19 14:19:27,198 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:19:27" (1/1) ... [2024-02-19 14:19:27,213 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:19:27" (1/1) ... [2024-02-19 14:19:27,215 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:19:27" (1/1) ... [2024-02-19 14:19:27,224 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:19:27" (1/1) ... [2024-02-19 14:19:27,227 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-19 14:19:27,228 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-19 14:19:27,228 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-19 14:19:27,228 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-19 14:19:27,229 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:19:27" (1/1) ... [2024-02-19 14:19:27,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-19 14:19:27,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 14:19:27,263 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:19:27,270 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:19:27,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-19 14:19:27,305 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-19 14:19:27,305 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-19 14:19:27,305 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-19 14:19:27,305 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-19 14:19:27,305 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-02-19 14:19:27,306 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-02-19 14:19:27,307 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-02-19 14:19:27,307 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-02-19 14:19:27,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-19 14:19:27,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-19 14:19:27,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-19 14:19:27,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-02-19 14:19:27,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-02-19 14:19:27,308 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-19 14:19:27,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-19 14:19:27,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-19 14:19:27,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-19 14:19:27,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-02-19 14:19:27,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-02-19 14:19:27,309 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-19 14:19:27,309 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-19 14:19:27,309 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-02-19 14:19:27,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-02-19 14:19:27,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-02-19 14:19:27,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-02-19 14:19:27,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-02-19 14:19:27,310 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-19 14:19:27,311 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:19:27,406 INFO L244 CfgBuilder]: Building ICFG [2024-02-19 14:19:27,408 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-19 14:19:27,587 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-19 14:19:27,587 INFO L293 CfgBuilder]: Performing block encoding [2024-02-19 14:19:27,773 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-19 14:19:27,774 INFO L320 CfgBuilder]: Removed 4 assume(true) statements. [2024-02-19 14:19:27,774 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.02 02:19:27 BoogieIcfgContainer [2024-02-19 14:19:27,774 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-19 14:19:27,776 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-19 14:19:27,776 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-19 14:19:27,779 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-19 14:19:27,779 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.02 02:19:26" (1/3) ... [2024-02-19 14:19:27,780 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f363743 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.02 02:19:27, skipping insertion in model container [2024-02-19 14:19:27,780 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:19:27" (2/3) ... [2024-02-19 14:19:27,780 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f363743 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.02 02:19:27, skipping insertion in model container [2024-02-19 14:19:27,780 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.02 02:19:27" (3/3) ... [2024-02-19 14:19:27,781 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp2x4.wvr.c [2024-02-19 14:19:27,801 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-19 14:19:27,801 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-02-19 14:19:27,802 INFO L631 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-19 14:19:27,879 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-02-19 14:19:27,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 31 transitions, 90 flow [2024-02-19 14:19:27,963 INFO L124 PetriNetUnfolderBase]: 4/27 cut-off events. [2024-02-19 14:19:27,967 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-02-19 14:19:27,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 27 events. 4/27 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 11 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 21. Up to 2 conditions per place. [2024-02-19 14:19:27,972 INFO L82 GeneralOperation]: Start removeDead. Operand has 40 places, 31 transitions, 90 flow [2024-02-19 14:19:27,978 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 26 transitions, 76 flow [2024-02-19 14:19:28,000 INFO L368 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-19 14:19:28,009 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;@70a70ea2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-19 14:19:28,009 INFO L370 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-02-19 14:19:28,034 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-19 14:19:28,034 INFO L124 PetriNetUnfolderBase]: 4/25 cut-off events. [2024-02-19 14:19:28,034 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-02-19 14:19:28,034 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:19:28,035 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:19:28,036 INFO L432 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-02-19 14:19:28,041 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:19:28,041 INFO L85 PathProgramCache]: Analyzing trace with hash 477268388, now seen corresponding path program 1 times [2024-02-19 14:19:28,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:19:28,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327637428] [2024-02-19 14:19:28,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:19:28,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:19:28,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:19:28,561 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:19:28,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:19:28,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327637428] [2024-02-19 14:19:28,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327637428] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:19:28,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:19:28,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-19 14:19:28,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409072688] [2024-02-19 14:19:28,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:19:28,574 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-19 14:19:28,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:19:28,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-19 14:19:28,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-19 14:19:28,606 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-02-19 14:19:28,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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:19:28,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:19:28,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-02-19 14:19:28,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:19:28,854 INFO L124 PetriNetUnfolderBase]: 497/678 cut-off events. [2024-02-19 14:19:28,854 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2024-02-19 14:19:28,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1449 conditions, 678 events. 497/678 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1777 event pairs, 117 based on Foata normal form. 1/415 useless extension candidates. Maximal degree in co-relation 1016. Up to 471 conditions per place. [2024-02-19 14:19:28,863 INFO L140 encePairwiseOnDemand]: 25/31 looper letters, 41 selfloop transitions, 5 changer transitions 1/48 dead transitions. [2024-02-19 14:19:28,863 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 48 transitions, 235 flow [2024-02-19 14:19:28,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-19 14:19:28,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-19 14:19:28,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2024-02-19 14:19:28,877 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6774193548387096 [2024-02-19 14:19:28,880 INFO L308 CegarLoopForPetriNet]: 35 programPoint places, 2 predicate places. [2024-02-19 14:19:28,881 INFO L507 AbstractCegarLoop]: Abstraction has has 37 places, 48 transitions, 235 flow [2024-02-19 14:19:28,881 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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:19:28,881 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:19:28,881 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:19:28,882 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-19 14:19:28,882 INFO L432 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-02-19 14:19:28,883 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:19:28,883 INFO L85 PathProgramCache]: Analyzing trace with hash -561648060, now seen corresponding path program 1 times [2024-02-19 14:19:28,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:19:28,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839009986] [2024-02-19 14:19:28,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:19:28,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:19:28,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:19:29,033 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:19:29,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:19:29,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839009986] [2024-02-19 14:19:29,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839009986] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:19:29,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:19:29,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-19 14:19:29,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102836752] [2024-02-19 14:19:29,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:19:29,035 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-19 14:19:29,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:19:29,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-19 14:19:29,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-19 14:19:29,037 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-02-19 14:19:29,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 48 transitions, 235 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:19:29,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:19:29,037 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-02-19 14:19:29,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:19:29,237 INFO L124 PetriNetUnfolderBase]: 699/959 cut-off events. [2024-02-19 14:19:29,238 INFO L125 PetriNetUnfolderBase]: For 114/114 co-relation queries the response was YES. [2024-02-19 14:19:29,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2999 conditions, 959 events. 699/959 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2904 event pairs, 15 based on Foata normal form. 0/599 useless extension candidates. Maximal degree in co-relation 2676. Up to 751 conditions per place. [2024-02-19 14:19:29,246 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 90 selfloop transitions, 12 changer transitions 1/104 dead transitions. [2024-02-19 14:19:29,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 104 transitions, 701 flow [2024-02-19 14:19:29,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-19 14:19:29,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-19 14:19:29,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 101 transitions. [2024-02-19 14:19:29,249 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6516129032258065 [2024-02-19 14:19:29,250 INFO L308 CegarLoopForPetriNet]: 35 programPoint places, 6 predicate places. [2024-02-19 14:19:29,250 INFO L507 AbstractCegarLoop]: Abstraction has has 41 places, 104 transitions, 701 flow [2024-02-19 14:19:29,250 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:19:29,250 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:19:29,250 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:19:29,251 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-19 14:19:29,251 INFO L432 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-02-19 14:19:29,252 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:19:29,254 INFO L85 PathProgramCache]: Analyzing trace with hash 626528102, now seen corresponding path program 2 times [2024-02-19 14:19:29,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:19:29,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273441182] [2024-02-19 14:19:29,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:19:29,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:19:29,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:19:29,383 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:19:29,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:19:29,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273441182] [2024-02-19 14:19:29,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273441182] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:19:29,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:19:29,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-19 14:19:29,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515153204] [2024-02-19 14:19:29,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:19:29,390 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-19 14:19:29,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:19:29,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-19 14:19:29,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-19 14:19:29,391 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-02-19 14:19:29,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 104 transitions, 701 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:19:29,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:19:29,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-02-19 14:19:29,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:19:29,603 INFO L124 PetriNetUnfolderBase]: 811/1107 cut-off events. [2024-02-19 14:19:29,603 INFO L125 PetriNetUnfolderBase]: For 139/139 co-relation queries the response was YES. [2024-02-19 14:19:29,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4565 conditions, 1107 events. 811/1107 cut-off events. For 139/139 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3566 event pairs, 15 based on Foata normal form. 0/705 useless extension candidates. Maximal degree in co-relation 4096. Up to 899 conditions per place. [2024-02-19 14:19:29,614 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 116 selfloop transitions, 10 changer transitions 1/128 dead transitions. [2024-02-19 14:19:29,614 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 128 transitions, 1114 flow [2024-02-19 14:19:29,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-19 14:19:29,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-19 14:19:29,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 101 transitions. [2024-02-19 14:19:29,618 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6516129032258065 [2024-02-19 14:19:29,620 INFO L308 CegarLoopForPetriNet]: 35 programPoint places, 10 predicate places. [2024-02-19 14:19:29,620 INFO L507 AbstractCegarLoop]: Abstraction has has 45 places, 128 transitions, 1114 flow [2024-02-19 14:19:29,620 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:19:29,620 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:19:29,621 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:19:29,621 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-19 14:19:29,621 INFO L432 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-02-19 14:19:29,622 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:19:29,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1635944624, now seen corresponding path program 1 times [2024-02-19 14:19:29,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:19:29,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937471887] [2024-02-19 14:19:29,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:19:29,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:19:29,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:19:29,749 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:19:29,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:19:29,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937471887] [2024-02-19 14:19:29,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937471887] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:19:29,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:19:29,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-19 14:19:29,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176667317] [2024-02-19 14:19:29,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:19:29,755 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-19 14:19:29,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:19:29,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-19 14:19:29,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-19 14:19:29,757 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-02-19 14:19:29,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 128 transitions, 1114 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:19:29,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:19:29,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-02-19 14:19:29,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:19:29,984 INFO L124 PetriNetUnfolderBase]: 769/1065 cut-off events. [2024-02-19 14:19:29,985 INFO L125 PetriNetUnfolderBase]: For 123/123 co-relation queries the response was YES. [2024-02-19 14:19:29,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5461 conditions, 1065 events. 769/1065 cut-off events. For 123/123 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3441 event pairs, 15 based on Foata normal form. 0/705 useless extension candidates. Maximal degree in co-relation 4896. Up to 857 conditions per place. [2024-02-19 14:19:29,993 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 135 selfloop transitions, 11 changer transitions 1/148 dead transitions. [2024-02-19 14:19:29,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 148 transitions, 1583 flow [2024-02-19 14:19:29,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-19 14:19:29,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-19 14:19:29,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 100 transitions. [2024-02-19 14:19:29,995 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6451612903225806 [2024-02-19 14:19:29,996 INFO L308 CegarLoopForPetriNet]: 35 programPoint places, 14 predicate places. [2024-02-19 14:19:29,996 INFO L507 AbstractCegarLoop]: Abstraction has has 49 places, 148 transitions, 1583 flow [2024-02-19 14:19:29,997 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:19:29,997 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:19:29,997 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:19:29,997 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-19 14:19:29,997 INFO L432 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-02-19 14:19:29,998 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:19:29,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1915217838, now seen corresponding path program 1 times [2024-02-19 14:19:29,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:19:29,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774724177] [2024-02-19 14:19:29,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:19:29,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:19:30,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:19:30,076 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:19:30,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:19:30,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774724177] [2024-02-19 14:19:30,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774724177] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:19:30,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:19:30,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-19 14:19:30,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551246620] [2024-02-19 14:19:30,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:19:30,078 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-19 14:19:30,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:19:30,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-19 14:19:30,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-19 14:19:30,079 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-02-19 14:19:30,079 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 148 transitions, 1583 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:19:30,079 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:19:30,079 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-02-19 14:19:30,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:19:30,306 INFO L124 PetriNetUnfolderBase]: 1063/1470 cut-off events. [2024-02-19 14:19:30,306 INFO L125 PetriNetUnfolderBase]: For 229/229 co-relation queries the response was YES. [2024-02-19 14:19:30,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8993 conditions, 1470 events. 1063/1470 cut-off events. For 229/229 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5017 event pairs, 6 based on Foata normal form. 0/986 useless extension candidates. Maximal degree in co-relation 8284. Up to 1261 conditions per place. [2024-02-19 14:19:30,320 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 293 selfloop transitions, 48 changer transitions 8/350 dead transitions. [2024-02-19 14:19:30,321 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 350 transitions, 4403 flow [2024-02-19 14:19:30,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-19 14:19:30,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-19 14:19:30,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 97 transitions. [2024-02-19 14:19:30,322 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6258064516129033 [2024-02-19 14:19:30,323 INFO L308 CegarLoopForPetriNet]: 35 programPoint places, 18 predicate places. [2024-02-19 14:19:30,323 INFO L507 AbstractCegarLoop]: Abstraction has has 53 places, 350 transitions, 4403 flow [2024-02-19 14:19:30,323 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:19:30,323 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:19:30,324 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:19:30,324 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-19 14:19:30,324 INFO L432 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-02-19 14:19:30,324 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:19:30,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1422314616, now seen corresponding path program 1 times [2024-02-19 14:19:30,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:19:30,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287548263] [2024-02-19 14:19:30,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:19:30,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:19:30,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:19:30,407 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:19:30,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:19:30,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287548263] [2024-02-19 14:19:30,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287548263] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 14:19:30,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1384800676] [2024-02-19 14:19:30,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:19:30,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 14:19:30,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 14:19:30,461 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:19:30,464 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:19:30,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:19:30,548 INFO L262 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 3 conjunts are in the unsatisfiable core [2024-02-19 14:19:30,560 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 14:19:30,728 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:19:30,729 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 14:19:30,804 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:19:30,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1384800676] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 14:19:30,805 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 14:19:30,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2024-02-19 14:19:30,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139076171] [2024-02-19 14:19:30,806 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 14:19:30,806 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-19 14:19:30,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:19:30,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-19 14:19:30,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-02-19 14:19:30,807 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-02-19 14:19:30,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 350 transitions, 4403 flow. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 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:19:30,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:19:30,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-02-19 14:19:30,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:19:31,149 INFO L124 PetriNetUnfolderBase]: 1407/1964 cut-off events. [2024-02-19 14:19:31,149 INFO L125 PetriNetUnfolderBase]: For 319/319 co-relation queries the response was YES. [2024-02-19 14:19:31,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13941 conditions, 1964 events. 1407/1964 cut-off events. For 319/319 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 7250 event pairs, 6 based on Foata normal form. 0/1348 useless extension candidates. Maximal degree in co-relation 13002. Up to 1753 conditions per place. [2024-02-19 14:19:31,168 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 512 selfloop transitions, 57 changer transitions 8/578 dead transitions. [2024-02-19 14:19:31,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 578 transitions, 8407 flow [2024-02-19 14:19:31,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-19 14:19:31,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-19 14:19:31,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 99 transitions. [2024-02-19 14:19:31,170 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6387096774193548 [2024-02-19 14:19:31,170 INFO L308 CegarLoopForPetriNet]: 35 programPoint places, 22 predicate places. [2024-02-19 14:19:31,171 INFO L507 AbstractCegarLoop]: Abstraction has has 57 places, 578 transitions, 8407 flow [2024-02-19 14:19:31,171 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 6 states have internal predecessors, (72), 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:19:31,171 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:19:31,171 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:19:31,190 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:19:31,380 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-02-19 14:19:31,380 INFO L432 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-02-19 14:19:31,381 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:19:31,381 INFO L85 PathProgramCache]: Analyzing trace with hash 2063306054, now seen corresponding path program 2 times [2024-02-19 14:19:31,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:19:31,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27542603] [2024-02-19 14:19:31,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:19:31,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:19:31,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:19:31,465 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:19:31,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:19:31,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27542603] [2024-02-19 14:19:31,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27542603] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:19:31,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:19:31,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-19 14:19:31,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765836338] [2024-02-19 14:19:31,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:19:31,467 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-19 14:19:31,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:19:31,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-19 14:19:31,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-19 14:19:31,469 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-02-19 14:19:31,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 578 transitions, 8407 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:19:31,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:19:31,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-02-19 14:19:31,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:19:31,889 INFO L124 PetriNetUnfolderBase]: 1611/2236 cut-off events. [2024-02-19 14:19:31,890 INFO L125 PetriNetUnfolderBase]: For 363/363 co-relation queries the response was YES. [2024-02-19 14:19:31,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18091 conditions, 2236 events. 1611/2236 cut-off events. For 363/363 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 8370 event pairs, 6 based on Foata normal form. 0/1554 useless extension candidates. Maximal degree in co-relation 17026. Up to 2025 conditions per place. [2024-02-19 14:19:31,963 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 628 selfloop transitions, 49 changer transitions 8/686 dead transitions. [2024-02-19 14:19:31,964 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 686 transitions, 11325 flow [2024-02-19 14:19:31,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-19 14:19:31,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-19 14:19:31,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 93 transitions. [2024-02-19 14:19:31,965 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6 [2024-02-19 14:19:31,966 INFO L308 CegarLoopForPetriNet]: 35 programPoint places, 26 predicate places. [2024-02-19 14:19:31,966 INFO L507 AbstractCegarLoop]: Abstraction has has 61 places, 686 transitions, 11325 flow [2024-02-19 14:19:31,966 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:19:31,966 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:19:31,966 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:19:31,967 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-02-19 14:19:31,967 INFO L432 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-02-19 14:19:31,967 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:19:31,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1726756330, now seen corresponding path program 2 times [2024-02-19 14:19:31,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:19:31,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567115457] [2024-02-19 14:19:31,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:19:31,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:19:31,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:19:32,042 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:19:32,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:19:32,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567115457] [2024-02-19 14:19:32,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567115457] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:19:32,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:19:32,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-19 14:19:32,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346770731] [2024-02-19 14:19:32,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:19:32,043 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-19 14:19:32,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:19:32,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-19 14:19:32,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-19 14:19:32,044 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-02-19 14:19:32,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 686 transitions, 11325 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:19:32,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:19:32,045 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-02-19 14:19:32,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:19:32,444 INFO L124 PetriNetUnfolderBase]: 1441/1988 cut-off events. [2024-02-19 14:19:32,444 INFO L125 PetriNetUnfolderBase]: For 317/317 co-relation queries the response was YES. [2024-02-19 14:19:32,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18089 conditions, 1988 events. 1441/1988 cut-off events. For 317/317 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 7165 event pairs, 6 based on Foata normal form. 0/1406 useless extension candidates. Maximal degree in co-relation 16976. Up to 1779 conditions per place. [2024-02-19 14:19:32,462 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 596 selfloop transitions, 55 changer transitions 18/670 dead transitions. [2024-02-19 14:19:32,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 670 transitions, 12395 flow [2024-02-19 14:19:32,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-19 14:19:32,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-19 14:19:32,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions. [2024-02-19 14:19:32,463 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6193548387096774 [2024-02-19 14:19:32,465 INFO L308 CegarLoopForPetriNet]: 35 programPoint places, 30 predicate places. [2024-02-19 14:19:32,465 INFO L507 AbstractCegarLoop]: Abstraction has has 65 places, 670 transitions, 12395 flow [2024-02-19 14:19:32,465 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:19:32,465 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:19:32,466 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:19:32,466 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-02-19 14:19:32,466 INFO L432 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-02-19 14:19:32,466 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:19:32,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1291015312, now seen corresponding path program 2 times [2024-02-19 14:19:32,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:19:32,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539481477] [2024-02-19 14:19:32,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:19:32,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:19:32,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:19:32,535 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:19:32,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:19:32,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539481477] [2024-02-19 14:19:32,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539481477] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 14:19:32,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [850183009] [2024-02-19 14:19:32,536 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-19 14:19:32,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 14:19:32,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 14:19:32,538 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:19:32,550 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:19:32,642 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-19 14:19:32,642 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 14:19:32,643 INFO L262 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 3 conjunts are in the unsatisfiable core [2024-02-19 14:19:32,645 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 14:19:32,740 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:19:32,741 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 14:19:32,796 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:19:32,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [850183009] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 14:19:32,797 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 14:19:32,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2024-02-19 14:19:32,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585655320] [2024-02-19 14:19:32,797 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 14:19:32,798 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-19 14:19:32,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:19:32,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-19 14:19:32,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-02-19 14:19:32,799 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-02-19 14:19:32,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 670 transitions, 12395 flow. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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:19:32,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:19:32,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-02-19 14:19:32,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:19:33,252 INFO L124 PetriNetUnfolderBase]: 1657/2272 cut-off events. [2024-02-19 14:19:33,252 INFO L125 PetriNetUnfolderBase]: For 331/331 co-relation queries the response was YES. [2024-02-19 14:19:33,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22935 conditions, 2272 events. 1657/2272 cut-off events. For 331/331 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 8279 event pairs, 6 based on Foata normal form. 0/1616 useless extension candidates. Maximal degree in co-relation 21580. Up to 2063 conditions per place. [2024-02-19 14:19:33,277 INFO L140 encePairwiseOnDemand]: 26/31 looper letters, 724 selfloop transitions, 51 changer transitions 18/794 dead transitions. [2024-02-19 14:19:33,278 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 794 transitions, 16243 flow [2024-02-19 14:19:33,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-19 14:19:33,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-19 14:19:33,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 97 transitions. [2024-02-19 14:19:33,279 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6258064516129033 [2024-02-19 14:19:33,280 INFO L308 CegarLoopForPetriNet]: 35 programPoint places, 34 predicate places. [2024-02-19 14:19:33,280 INFO L507 AbstractCegarLoop]: Abstraction has has 69 places, 794 transitions, 16243 flow [2024-02-19 14:19:33,280 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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:19:33,280 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:19:33,281 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:19:33,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-02-19 14:19:33,495 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,SelfDestructingSolverStorable8 [2024-02-19 14:19:33,496 INFO L432 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-02-19 14:19:33,496 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:19:33,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1595704006, now seen corresponding path program 1 times [2024-02-19 14:19:33,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:19:33,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409729136] [2024-02-19 14:19:33,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:19:33,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:19:33,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:19:34,006 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:19:34,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:19:34,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409729136] [2024-02-19 14:19:34,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409729136] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 14:19:34,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630157986] [2024-02-19 14:19:34,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:19:34,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 14:19:34,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 14:19:34,012 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:19:34,029 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:19:34,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:19:34,317 INFO L262 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 9 conjunts are in the unsatisfiable core [2024-02-19 14:19:34,319 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 14:19:36,318 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:19:36,318 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 14:19:37,049 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:19:37,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [630157986] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 14:19:37,050 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 14:19:37,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2024-02-19 14:19:37,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090928906] [2024-02-19 14:19:37,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 14:19:37,051 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-02-19 14:19:37,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:19:37,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-02-19 14:19:37,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2024-02-19 14:19:37,052 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-02-19 14:19:37,052 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 794 transitions, 16243 flow. Second operand has 16 states, 16 states have (on average 8.8125) internal successors, (141), 16 states have internal predecessors, (141), 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:19:37,052 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:19:37,052 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-02-19 14:19:37,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:19:41,063 INFO L124 PetriNetUnfolderBase]: 3569/4958 cut-off events. [2024-02-19 14:19:41,064 INFO L125 PetriNetUnfolderBase]: For 750/750 co-relation queries the response was YES. [2024-02-19 14:19:41,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55062 conditions, 4958 events. 3569/4958 cut-off events. For 750/750 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 21535 event pairs, 18 based on Foata normal form. 3/3549 useless extension candidates. Maximal degree in co-relation 51132. Up to 4746 conditions per place. [2024-02-19 14:19:41,124 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 1349 selfloop transitions, 247 changer transitions 86/1683 dead transitions. [2024-02-19 14:19:41,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 1683 transitions, 37972 flow [2024-02-19 14:19:41,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-02-19 14:19:41,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-02-19 14:19:41,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 342 transitions. [2024-02-19 14:19:41,127 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6895161290322581 [2024-02-19 14:19:41,128 INFO L308 CegarLoopForPetriNet]: 35 programPoint places, 49 predicate places. [2024-02-19 14:19:41,128 INFO L507 AbstractCegarLoop]: Abstraction has has 84 places, 1683 transitions, 37972 flow [2024-02-19 14:19:41,129 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 8.8125) internal successors, (141), 16 states have internal predecessors, (141), 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:19:41,129 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:19:41,129 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:19:41,145 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-02-19 14:19:41,344 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 14:19:41,345 INFO L432 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-02-19 14:19:41,345 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:19:41,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1143338426, now seen corresponding path program 1 times [2024-02-19 14:19:41,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:19:41,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814953933] [2024-02-19 14:19:41,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:19:41,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:19:41,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:19:41,820 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:19:41,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:19:41,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814953933] [2024-02-19 14:19:41,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814953933] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 14:19:41,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [3583858] [2024-02-19 14:19:41,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:19:41,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 14:19:41,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 14:19:41,823 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:19:41,825 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:19:41,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:19:41,988 INFO L262 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 7 conjunts are in the unsatisfiable core [2024-02-19 14:19:41,990 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 14:19:42,435 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:19:42,435 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 14:19:42,722 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:19:42,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [3583858] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 14:19:42,722 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 14:19:42,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 11 [2024-02-19 14:19:42,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875002346] [2024-02-19 14:19:42,723 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 14:19:42,723 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-02-19 14:19:42,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:19:42,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-02-19 14:19:42,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-02-19 14:19:42,724 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-02-19 14:19:42,724 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 1683 transitions, 37972 flow. Second operand has 12 states, 12 states have (on average 10.583333333333334) internal successors, (127), 12 states have internal predecessors, (127), 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:19:42,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:19:42,724 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-02-19 14:19:42,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:19:47,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:19:49,556 INFO L124 PetriNetUnfolderBase]: 4207/5860 cut-off events. [2024-02-19 14:19:49,556 INFO L125 PetriNetUnfolderBase]: For 909/909 co-relation queries the response was YES. [2024-02-19 14:19:49,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70905 conditions, 5860 events. 4207/5860 cut-off events. For 909/909 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 26329 event pairs, 18 based on Foata normal form. 3/4167 useless extension candidates. Maximal degree in co-relation 66124. Up to 5647 conditions per place. [2024-02-19 14:19:49,607 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 1763 selfloop transitions, 75 changer transitions 127/1966 dead transitions. [2024-02-19 14:19:49,608 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 1966 transitions, 48275 flow [2024-02-19 14:19:49,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-02-19 14:19:49,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-02-19 14:19:49,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 186 transitions. [2024-02-19 14:19:49,610 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-02-19 14:19:49,610 INFO L308 CegarLoopForPetriNet]: 35 programPoint places, 57 predicate places. [2024-02-19 14:19:49,610 INFO L507 AbstractCegarLoop]: Abstraction has has 92 places, 1966 transitions, 48275 flow [2024-02-19 14:19:49,610 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 10.583333333333334) internal successors, (127), 12 states have internal predecessors, (127), 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:19:49,611 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:19:49,611 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:19:49,628 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-02-19 14:19:49,814 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 14:19:49,814 INFO L432 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-02-19 14:19:49,815 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:19:49,815 INFO L85 PathProgramCache]: Analyzing trace with hash -487160698, now seen corresponding path program 2 times [2024-02-19 14:19:49,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:19:49,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42985672] [2024-02-19 14:19:49,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:19:49,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:19:49,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:19:50,212 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:19:50,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:19:50,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42985672] [2024-02-19 14:19:50,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42985672] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 14:19:50,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1285373864] [2024-02-19 14:19:50,213 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-19 14:19:50,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 14:19:50,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 14:19:50,216 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:19:50,240 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:19:50,583 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-19 14:19:50,583 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 14:19:50,584 INFO L262 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 9 conjunts are in the unsatisfiable core [2024-02-19 14:19:50,586 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 14:20:54,579 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:20:54,579 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 14:21:10,318 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:21:10,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1285373864] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 14:21:10,319 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 14:21:10,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2024-02-19 14:21:10,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711336630] [2024-02-19 14:21:10,319 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 14:21:10,320 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-02-19 14:21:10,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:21:10,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-02-19 14:21:10,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=172, Unknown=6, NotChecked=0, Total=240 [2024-02-19 14:21:10,321 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-02-19 14:21:10,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 1966 transitions, 48275 flow. Second operand has 16 states, 16 states have (on average 9.0625) internal successors, (145), 16 states have internal predecessors, (145), 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:21:10,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:21:10,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-02-19 14:21:10,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:21:47,433 WARN L293 SmtUtils]: Spent 21.13s on a formula simplification. DAG size of input: 86 DAG size of output: 66 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-19 14:21:53,014 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:21:54,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-19 14:21:57,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.13s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-19 14:21:58,989 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-19 14:22:02,991 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:22:06,918 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.93s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-19 14:22:11,018 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:22:16,839 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse14 (div c_~x4~0 4294967296))) (let ((.cse4 (* .cse14 4294967296)) (.cse12 (* (- 1) c_~x4~0)) (.cse2 (* c_~x3~0 4)) (.cse13 (div c_~n~0 4294967296))) (let ((.cse6 (mod c_~x4~0 4294967296)) (.cse5 (mod c_~n~0 4294967296)) (.cse0 (mod c_~x1~0 4294967296)) (.cse8 (= (+ c_~x1~0 (* (div c_~x2~0 4294967296) 4294967296)) (+ (* 4294967296 (div c_~x1~0 4294967296)) c_~x2~0))) (.cse1 (* 4294967296 .cse13)) (.cse3 (* (div (+ .cse12 .cse2) 4294967296) 4294967296)) (.cse10 (mod c_~x3~0 4294967296)) (.cse9 (+ .cse2 .cse4)) (.cse11 (* (div (+ (- 1) c_~x3~0) 1073741824) 4294967296))) (and (= .cse0 (mod c_~x2~0 4294967296)) (= (mod (* 3 c_~x4~0) 4) 0) (<= (+ .cse1 .cse2) (+ .cse3 c_~n~0 .cse4 4294967293)) (<= .cse5 .cse6) (let ((.cse7 (+ .cse10 1))) (or (< .cse6 .cse7) (and .cse8 (= .cse9 (+ (* (div c_~x3~0 1073741824) 4294967296) c_~x4~0))) (< (* 4 (mod c_~x3~0 1073741824)) .cse7))) (or (and (= (+ (* 4294967296 (div c_~x3~0 4294967296)) c_~x4~0) (+ c_~x3~0 .cse4)) .cse8) (< .cse10 .cse5)) (<= .cse9 (+ .cse11 c_~x4~0)) (<= 1 .cse0) .cse8 (<= 1 .cse10) (<= (+ 2 .cse1 .cse2) (+ .cse3 c_~n~0 c_~x4~0)) (= .cse10 (mod (* 4294967295 (div .cse12 4)) 4294967296)) (or (< .cse9 (+ .cse11 c_~x4~0 1)) (< .cse2 (+ (* (div (+ (* c_~x3~0 3) .cse12 (* (- 4294967296) .cse13) c_~n~0 (* .cse14 1073741824) (- 1073741825)) 3221225472) 4294967296) c_~x4~0 1))))))) is different from false [2024-02-19 14:22:19,473 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.38s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-19 14:22:23,494 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:22:34,488 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-19 14:22:35,635 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-19 14:22:39,413 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.78s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-19 14:22:43,417 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:22:47,421 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:22:49,296 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-19 14:22:53,588 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:22:57,594 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:23:02,033 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:23:06,037 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:23:08,565 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.53s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-19 14:23:12,567 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:23:16,571 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:23:20,575 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:23:22,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.34s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-19 14:23:26,959 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:23:30,963 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:23:34,972 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-19 14:23:38,979 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~x1~0 4294967296)) (.cse1 (mod c_~x3~0 4294967296))) (and (= .cse0 (mod c_~x2~0 4294967296)) (= (mod (* 3 c_~x4~0) 4) 0) (<= (mod c_~n~0 4294967296) (mod c_~x4~0 4294967296)) (= (+ (* 4294967296 (div c_~x3~0 4294967296)) c_~x4~0) (+ c_~x3~0 (* (div c_~x4~0 4294967296) 4294967296))) (<= 1 .cse0) (= (+ c_~x1~0 (* (div c_~x2~0 4294967296) 4294967296)) (+ (* 4294967296 (div c_~x1~0 4294967296)) c_~x2~0)) (<= 1 .cse1) (= .cse1 (mod (* 4294967295 (div (* (- 1) c_~x4~0) 4)) 4294967296)))) is different from false [2024-02-19 14:24:29,556 WARN L293 SmtUtils]: Spent 10.86s on a formula simplification. DAG size of input: 59 DAG size of output: 36 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-19 14:24:33,560 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:24:37,987 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:24:41,993 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:24:46,007 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:24:50,010 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:24:54,015 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:24:58,019 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:25:02,069 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-19 14:25:06,073 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:25:10,078 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:25:12,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-19 14:25:16,546 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:25:21,982 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-19 14:25:25,987 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:25:29,990 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:25:32,015 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-19 14:25:37,741 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:25:41,756 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-19 14:25:44,467 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.71s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-19 14:25:48,881 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:25:52,884 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:25:56,887 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:25:58,369 INFO L124 PetriNetUnfolderBase]: 5773/8255 cut-off events. [2024-02-19 14:25:58,370 INFO L125 PetriNetUnfolderBase]: For 1333/1333 co-relation queries the response was YES. [2024-02-19 14:25:58,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108064 conditions, 8255 events. 5773/8255 cut-off events. For 1333/1333 co-relation queries the response was YES. Maximal size of possible extension queue 369. Compared 41689 event pairs, 18 based on Foata normal form. 3/5927 useless extension candidates. Maximal degree in co-relation 101365. Up to 8034 conditions per place. [2024-02-19 14:25:58,457 INFO L140 encePairwiseOnDemand]: 16/31 looper letters, 2215 selfloop transitions, 412 changer transitions 222/2850 dead transitions. [2024-02-19 14:25:58,457 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 2850 transitions, 75696 flow [2024-02-19 14:25:58,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-02-19 14:25:58,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2024-02-19 14:25:58,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 387 transitions. [2024-02-19 14:25:58,460 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6241935483870967 [2024-02-19 14:25:58,461 INFO L308 CegarLoopForPetriNet]: 35 programPoint places, 76 predicate places. [2024-02-19 14:25:58,461 INFO L507 AbstractCegarLoop]: Abstraction has has 111 places, 2850 transitions, 75696 flow [2024-02-19 14:25:58,461 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 9.0625) internal successors, (145), 16 states have internal predecessors, (145), 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:25:58,461 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:25:58,461 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:25:58,478 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-02-19 14:25:58,675 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-02-19 14:25:58,676 INFO L432 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-02-19 14:25:58,677 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:25:58,677 INFO L85 PathProgramCache]: Analyzing trace with hash 268044904, now seen corresponding path program 3 times [2024-02-19 14:25:58,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:25:58,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688762613] [2024-02-19 14:25:58,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:25:58,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:25:58,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:25:59,181 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:25:59,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:25:59,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688762613] [2024-02-19 14:25:59,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688762613] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 14:25:59,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [598057795] [2024-02-19 14:25:59,182 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-02-19 14:25:59,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 14:25:59,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 14:25:59,183 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:25:59,184 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:25:59,575 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-02-19 14:25:59,576 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 14:25:59,577 INFO L262 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 9 conjunts are in the unsatisfiable core [2024-02-19 14:25:59,578 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 14:27:14,298 WARN L293 SmtUtils]: Spent 12.07s on a formula simplification that was a NOOP. DAG size: 37 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-19 14:28:02,791 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:28:02,792 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 14:28:43,559 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:28:43,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [598057795] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 14:28:43,559 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 14:28:43,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2024-02-19 14:28:43,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421468297] [2024-02-19 14:28:43,559 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 14:28:43,560 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-02-19 14:28:43,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:28:43,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-02-19 14:28:43,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=170, Unknown=20, NotChecked=0, Total=240 [2024-02-19 14:28:43,561 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-02-19 14:28:43,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 2850 transitions, 75696 flow. Second operand has 16 states, 16 states have (on average 9.0625) internal successors, (145), 16 states have internal predecessors, (145), 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:28:43,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:28:43,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-02-19 14:28:43,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:29:04,149 WARN L293 SmtUtils]: Spent 11.04s on a formula simplification. DAG size of input: 85 DAG size of output: 47 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-19 14:29:25,730 WARN L293 SmtUtils]: Spent 12.85s on a formula simplification. DAG size of input: 82 DAG size of output: 49 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-19 14:29:29,739 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:29:32,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-19 14:29:34,450 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-19 14:29:38,776 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:29:44,287 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:29:48,290 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:29:52,295 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:29:56,297 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:29:59,137 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.51s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-19 14:30:12,287 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:30:15,917 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-19 14:30:17,366 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-19 14:30:21,373 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:30:23,563 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-19 14:30:25,089 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:30:29,112 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:30:44,089 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:30:48,095 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:30:53,331 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:30:55,076 INFO L124 PetriNetUnfolderBase]: 6474/9244 cut-off events. [2024-02-19 14:30:55,077 INFO L125 PetriNetUnfolderBase]: For 1467/1467 co-relation queries the response was YES. [2024-02-19 14:30:55,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130183 conditions, 9244 events. 6474/9244 cut-off events. For 1467/1467 co-relation queries the response was YES. Maximal size of possible extension queue 411. Compared 47395 event pairs, 18 based on Foata normal form. 2/6622 useless extension candidates. Maximal degree in co-relation 122608. Up to 9021 conditions per place. [2024-02-19 14:30:55,147 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 2432 selfloop transitions, 526 changer transitions 285/3244 dead transitions. [2024-02-19 14:30:55,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 3244 transitions, 92564 flow [2024-02-19 14:30:55,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-02-19 14:30:55,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2024-02-19 14:30:55,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 362 transitions. [2024-02-19 14:30:55,149 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6487455197132617 [2024-02-19 14:30:55,150 INFO L308 CegarLoopForPetriNet]: 35 programPoint places, 92 predicate places. [2024-02-19 14:30:55,150 INFO L507 AbstractCegarLoop]: Abstraction has has 127 places, 3244 transitions, 92564 flow [2024-02-19 14:30:55,150 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 9.0625) internal successors, (145), 16 states have internal predecessors, (145), 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:30:55,150 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:30:55,150 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:30:55,161 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 14:30:55,351 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 14:30:55,351 INFO L432 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-02-19 14:30:55,351 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:30:55,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1360908102, now seen corresponding path program 2 times [2024-02-19 14:30:55,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:30:55,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413813922] [2024-02-19 14:30:55,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:30:55,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:30:55,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:30:55,711 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:30:55,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:30:55,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413813922] [2024-02-19 14:30:55,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413813922] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 14:30:55,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092036079] [2024-02-19 14:30:55,711 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-19 14:30:55,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 14:30:55,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 14:30:55,716 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 14:30:55,718 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 14:30:55,938 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-19 14:30:55,938 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 14:30:55,939 INFO L262 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 9 conjunts are in the unsatisfiable core [2024-02-19 14:30:55,940 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 14:31:21,365 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:31:21,365 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 14:31:21,914 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:31:21,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2092036079] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 14:31:21,914 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 14:31:21,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2024-02-19 14:31:21,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721267922] [2024-02-19 14:31:21,914 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 14:31:21,914 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-02-19 14:31:21,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:31:21,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-02-19 14:31:21,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=168, Unknown=2, NotChecked=0, Total=240 [2024-02-19 14:31:21,916 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-02-19 14:31:21,917 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 3244 transitions, 92564 flow. Second operand has 16 states, 16 states have (on average 8.6875) internal successors, (139), 16 states have internal predecessors, (139), 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:31:21,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:31:21,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-02-19 14:31:21,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:31:24,385 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-19 14:31:31,424 INFO L124 PetriNetUnfolderBase]: 8516/12242 cut-off events. [2024-02-19 14:31:31,424 INFO L125 PetriNetUnfolderBase]: For 1965/1965 co-relation queries the response was YES. [2024-02-19 14:31:31,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 184709 conditions, 12242 events. 8516/12242 cut-off events. For 1965/1965 co-relation queries the response was YES. Maximal size of possible extension queue 535. Compared 66612 event pairs, 30 based on Foata normal form. 6/8784 useless extension candidates. Maximal degree in co-relation 172977. Up to 12013 conditions per place. [2024-02-19 14:31:31,521 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 3584 selfloop transitions, 290 changer transitions 392/4267 dead transitions. [2024-02-19 14:31:31,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 4267 transitions, 130433 flow [2024-02-19 14:31:31,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-02-19 14:31:31,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-02-19 14:31:31,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 334 transitions. [2024-02-19 14:31:31,523 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6733870967741935 [2024-02-19 14:31:31,523 INFO L308 CegarLoopForPetriNet]: 35 programPoint places, 107 predicate places. [2024-02-19 14:31:31,523 INFO L507 AbstractCegarLoop]: Abstraction has has 142 places, 4267 transitions, 130433 flow [2024-02-19 14:31:31,523 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 8.6875) internal successors, (139), 16 states have internal predecessors, (139), 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:31:31,524 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:31:31,524 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:31:31,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-02-19 14:31:31,724 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 14:31:31,724 INFO L432 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-02-19 14:31:31,725 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:31:31,725 INFO L85 PathProgramCache]: Analyzing trace with hash 479357488, now seen corresponding path program 3 times [2024-02-19 14:31:31,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:31:31,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797194131] [2024-02-19 14:31:31,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:31:31,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:31:31,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:31:31,880 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:31:31,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:31:31,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797194131] [2024-02-19 14:31:31,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797194131] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 14:31:31,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1931611597] [2024-02-19 14:31:31,881 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-02-19 14:31:31,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 14:31:31,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 14:31:31,882 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 14:31:31,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-02-19 14:31:32,283 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-02-19 14:31:32,283 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 14:31:32,285 INFO L262 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 9 conjunts are in the unsatisfiable core [2024-02-19 14:31:32,286 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 14:31:57,708 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:31:57,708 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 14:32:26,099 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:32:26,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1931611597] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 14:32:26,099 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 14:32:26,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 7] total 15 [2024-02-19 14:32:26,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244829491] [2024-02-19 14:32:26,099 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 14:32:26,099 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-02-19 14:32:26,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:32:26,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-02-19 14:32:26,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=180, Unknown=12, NotChecked=0, Total=240 [2024-02-19 14:32:26,100 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-02-19 14:32:26,101 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 4267 transitions, 130433 flow. Second operand has 16 states, 16 states have (on average 8.9375) internal successors, (143), 16 states have internal predecessors, (143), 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:32:26,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:32:26,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-02-19 14:32:26,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:32:28,539 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-19 14:32:47,602 INFO L124 PetriNetUnfolderBase]: 11326/16339 cut-off events. [2024-02-19 14:32:47,602 INFO L125 PetriNetUnfolderBase]: For 2667/2667 co-relation queries the response was YES. [2024-02-19 14:32:47,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 262877 conditions, 16339 events. 11326/16339 cut-off events. For 2667/2667 co-relation queries the response was YES. Maximal size of possible extension queue 678. Compared 93318 event pairs, 40 based on Foata normal form. 0/11749 useless extension candidates. Maximal degree in co-relation 246284. Up to 16103 conditions per place. [2024-02-19 14:32:47,742 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 4584 selfloop transitions, 671 changer transitions 568/5824 dead transitions. [2024-02-19 14:32:47,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 5824 transitions, 189749 flow [2024-02-19 14:32:47,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-02-19 14:32:47,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-02-19 14:32:47,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 254 transitions. [2024-02-19 14:32:47,744 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6827956989247311 [2024-02-19 14:32:47,745 INFO L308 CegarLoopForPetriNet]: 35 programPoint places, 118 predicate places. [2024-02-19 14:32:47,745 INFO L507 AbstractCegarLoop]: Abstraction has has 153 places, 5824 transitions, 189749 flow [2024-02-19 14:32:47,745 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 8.9375) internal successors, (143), 16 states have internal predecessors, (143), 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:32:47,745 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:32:47,745 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:32:47,757 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-02-19 14:32:47,948 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-02-19 14:32:47,948 INFO L432 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-02-19 14:32:47,949 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:32:47,949 INFO L85 PathProgramCache]: Analyzing trace with hash -924797620, now seen corresponding path program 4 times [2024-02-19 14:32:47,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:32:47,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636693669] [2024-02-19 14:32:47,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:32:47,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:32:47,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:32:48,080 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:32:48,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:32:48,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636693669] [2024-02-19 14:32:48,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636693669] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 14:32:48,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [688199440] [2024-02-19 14:32:48,081 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-02-19 14:32:48,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 14:32:48,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 14:32:48,084 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 14:32:48,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-02-19 14:32:48,403 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-02-19 14:32:48,403 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 14:32:48,405 INFO L262 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 9 conjunts are in the unsatisfiable core [2024-02-19 14:32:48,406 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 14:32:49,329 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:32:49,330 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 14:32:50,063 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:32:50,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [688199440] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 14:32:50,064 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 14:32:50,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 7] total 15 [2024-02-19 14:32:50,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480342096] [2024-02-19 14:32:50,064 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 14:32:50,064 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-02-19 14:32:50,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:32:50,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-02-19 14:32:50,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2024-02-19 14:32:50,065 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-02-19 14:32:50,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 5824 transitions, 189749 flow. Second operand has 16 states, 16 states have (on average 8.8125) internal successors, (141), 16 states have internal predecessors, (141), 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:32:50,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:32:50,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-02-19 14:32:50,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:33:07,585 INFO L124 PetriNetUnfolderBase]: 11956/17245 cut-off events. [2024-02-19 14:33:07,586 INFO L125 PetriNetUnfolderBase]: For 2812/2812 co-relation queries the response was YES. [2024-02-19 14:33:07,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 294654 conditions, 17245 events. 11956/17245 cut-off events. For 2812/2812 co-relation queries the response was YES. Maximal size of possible extension queue 721. Compared 99341 event pairs, 40 based on Foata normal form. 0/12443 useless extension candidates. Maximal degree in co-relation 276215. Up to 17007 conditions per place. [2024-02-19 14:33:07,742 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 5060 selfloop transitions, 577 changer transitions 568/6206 dead transitions. [2024-02-19 14:33:07,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 6206 transitions, 214590 flow [2024-02-19 14:33:07,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-02-19 14:33:07,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-02-19 14:33:07,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 238 transitions. [2024-02-19 14:33:07,743 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6979472140762464 [2024-02-19 14:33:07,744 INFO L308 CegarLoopForPetriNet]: 35 programPoint places, 128 predicate places. [2024-02-19 14:33:07,744 INFO L507 AbstractCegarLoop]: Abstraction has has 163 places, 6206 transitions, 214590 flow [2024-02-19 14:33:07,744 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 8.8125) internal successors, (141), 16 states have internal predecessors, (141), 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:33:07,744 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:33:07,744 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:33:07,755 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-02-19 14:33:07,944 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-02-19 14:33:07,945 INFO L432 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-02-19 14:33:07,945 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:33:07,945 INFO L85 PathProgramCache]: Analyzing trace with hash -977552488, now seen corresponding path program 4 times [2024-02-19 14:33:07,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:33:07,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203508522] [2024-02-19 14:33:07,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:33:07,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:33:07,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:33:08,065 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:33:08,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:33:08,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203508522] [2024-02-19 14:33:08,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203508522] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 14:33:08,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [998259685] [2024-02-19 14:33:08,066 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-02-19 14:33:08,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 14:33:08,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 14:33:08,067 INFO L229 MonitoredProcess]: Starting monitored process 11 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:33:08,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-02-19 14:33:08,303 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-02-19 14:33:08,303 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 14:33:08,304 INFO L262 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 9 conjunts are in the unsatisfiable core [2024-02-19 14:33:08,305 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 14:33:08,766 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:33:08,767 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 14:33:09,110 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:33:09,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [998259685] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 14:33:09,110 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 14:33:09,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 7] total 15 [2024-02-19 14:33:09,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339225198] [2024-02-19 14:33:09,111 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 14:33:09,111 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-02-19 14:33:09,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:33:09,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-02-19 14:33:09,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2024-02-19 14:33:09,112 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-02-19 14:33:09,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 6206 transitions, 214590 flow. Second operand has 16 states, 16 states have (on average 9.375) internal successors, (150), 16 states have internal predecessors, (150), 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:33:09,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:33:09,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-02-19 14:33:09,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:33:35,441 INFO L124 PetriNetUnfolderBase]: 17510/25220 cut-off events. [2024-02-19 14:33:35,442 INFO L125 PetriNetUnfolderBase]: For 4074/4074 co-relation queries the response was YES. [2024-02-19 14:33:35,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 455623 conditions, 25220 events. 17510/25220 cut-off events. For 4074/4074 co-relation queries the response was YES. Maximal size of possible extension queue 999. Compared 152054 event pairs, 40 based on Foata normal form. 0/18282 useless extension candidates. Maximal degree in co-relation 430436. Up to 24956 conditions per place. [2024-02-19 14:33:35,685 INFO L140 encePairwiseOnDemand]: 24/31 looper letters, 8296 selfloop transitions, 981 changer transitions 583/9861 dead transitions. [2024-02-19 14:33:35,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 9861 transitions, 360266 flow [2024-02-19 14:33:35,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-02-19 14:33:35,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-02-19 14:33:35,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 310 transitions. [2024-02-19 14:33:35,686 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-02-19 14:33:35,687 INFO L308 CegarLoopForPetriNet]: 35 programPoint places, 142 predicate places. [2024-02-19 14:33:35,687 INFO L507 AbstractCegarLoop]: Abstraction has has 177 places, 9861 transitions, 360266 flow [2024-02-19 14:33:35,687 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 9.375) internal successors, (150), 16 states have internal predecessors, (150), 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:33:35,687 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:33:35,687 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:33:35,699 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-02-19 14:33:35,888 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-02-19 14:33:35,888 INFO L432 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-02-19 14:33:35,889 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:33:35,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1085011128, now seen corresponding path program 5 times [2024-02-19 14:33:35,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:33:35,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53249193] [2024-02-19 14:33:35,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:33:35,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:33:35,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:33:36,019 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:33:36,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:33:36,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53249193] [2024-02-19 14:33:36,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53249193] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 14:33:36,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1313581450] [2024-02-19 14:33:36,020 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-02-19 14:33:36,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 14:33:36,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 14:33:36,024 INFO L229 MonitoredProcess]: Starting monitored process 12 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:33:36,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-02-19 14:33:36,210 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-19 14:33:36,210 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 14:33:36,211 INFO L262 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 7 conjunts are in the unsatisfiable core [2024-02-19 14:33:36,212 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 14:33:36,631 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:33:36,631 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 14:33:36,726 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:33:36,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1313581450] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 14:33:36,727 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 14:33:36,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2024-02-19 14:33:36,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983741936] [2024-02-19 14:33:36,727 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 14:33:36,727 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-02-19 14:33:36,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:33:36,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-02-19 14:33:36,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-02-19 14:33:36,728 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 31 [2024-02-19 14:33:36,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 9861 transitions, 360266 flow. Second operand has 12 states, 12 states have (on average 10.166666666666666) internal successors, (122), 12 states have internal predecessors, (122), 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:33:36,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:33:36,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 31 [2024-02-19 14:33:36,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Killed by 15