./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/bench-exp1x3.wvr.c --full-output --traceabstraction.positions.where.we.compute.the.hoare.annotation All --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 448d4d75 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-exp1x3.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 3241bc7a4fb5fce7b9ee4eb3820005fca7c10e90159ff3c3ee85c2790d085281 --traceabstraction.positions.where.we.compute.the.hoare.annotation All --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.owicki-witnesses-448d4d7-m [2024-02-20 11:38:17,199 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-20 11:38:17,259 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-20 11:38:17,263 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-20 11:38:17,264 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-20 11:38:17,295 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-20 11:38:17,296 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-20 11:38:17,296 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-20 11:38:17,297 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-20 11:38:17,299 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-20 11:38:17,300 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-20 11:38:17,300 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-20 11:38:17,300 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-20 11:38:17,301 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-20 11:38:17,302 INFO L153 SettingsManager]: * Use SBE=true [2024-02-20 11:38:17,302 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-20 11:38:17,302 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-20 11:38:17,302 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-20 11:38:17,302 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-20 11:38:17,303 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-20 11:38:17,303 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-20 11:38:17,303 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-20 11:38:17,303 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-20 11:38:17,304 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-20 11:38:17,304 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-20 11:38:17,304 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-20 11:38:17,304 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-20 11:38:17,304 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-20 11:38:17,305 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-20 11:38:17,305 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-20 11:38:17,306 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-20 11:38:17,306 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-20 11:38:17,306 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-20 11:38:17,306 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-20 11:38:17,307 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-20 11:38:17,307 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-20 11:38:17,307 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-20 11:38:17,307 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-20 11:38:17,307 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-20 11:38:17,308 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-20 11:38:17,308 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-20 11:38:17,308 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-20 11:38:17,308 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-20 11:38:17,308 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 -> 3241bc7a4fb5fce7b9ee4eb3820005fca7c10e90159ff3c3ee85c2790d085281 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All [2024-02-20 11:38:17,484 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-20 11:38:17,497 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-20 11:38:17,499 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-20 11:38:17,500 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-20 11:38:17,500 INFO L274 PluginConnector]: CDTParser initialized [2024-02-20 11:38:17,501 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp1x3.wvr.c [2024-02-20 11:38:18,472 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-20 11:38:18,645 INFO L384 CDTParser]: Found 1 translation units. [2024-02-20 11:38:18,645 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp1x3.wvr.c [2024-02-20 11:38:18,656 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/910e302ff/d8a2a682bc13429d8739693b576c853d/FLAGa7f2b4ec9 [2024-02-20 11:38:18,665 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/910e302ff/d8a2a682bc13429d8739693b576c853d [2024-02-20 11:38:18,667 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-20 11:38:18,668 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-02-20 11:38:18,669 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-20 11:38:18,669 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-20 11:38:18,673 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-20 11:38:18,674 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:38:18" (1/1) ... [2024-02-20 11:38:18,674 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73d2b04f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:38:18, skipping insertion in model container [2024-02-20 11:38:18,675 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:38:18" (1/1) ... [2024-02-20 11:38:18,689 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-20 11:38:18,803 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-exp1x3.wvr.c[1849,1862] [2024-02-20 11:38:18,807 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-20 11:38:18,813 INFO L202 MainTranslator]: Completed pre-run [2024-02-20 11:38:18,826 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-exp1x3.wvr.c[1849,1862] [2024-02-20 11:38:18,827 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-20 11:38:18,838 INFO L206 MainTranslator]: Completed translation [2024-02-20 11:38:18,838 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:38:18 WrapperNode [2024-02-20 11:38:18,839 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-20 11:38:18,840 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-20 11:38:18,840 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-20 11:38:18,840 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-20 11:38:18,845 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:38:18" (1/1) ... [2024-02-20 11:38:18,851 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:38:18" (1/1) ... [2024-02-20 11:38:18,866 INFO L138 Inliner]: procedures = 18, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 59 [2024-02-20 11:38:18,866 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-20 11:38:18,867 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-20 11:38:18,867 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-20 11:38:18,867 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-20 11:38:18,878 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:38:18" (1/1) ... [2024-02-20 11:38:18,879 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:38:18" (1/1) ... [2024-02-20 11:38:18,880 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:38:18" (1/1) ... [2024-02-20 11:38:18,889 INFO L175 MemorySlicer]: Split 6 memory accesses to 3 slices as follows [2, 2, 2]. 33 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2024-02-20 11:38:18,889 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:38:18" (1/1) ... [2024-02-20 11:38:18,889 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:38:18" (1/1) ... [2024-02-20 11:38:18,893 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:38:18" (1/1) ... [2024-02-20 11:38:18,895 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:38:18" (1/1) ... [2024-02-20 11:38:18,896 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:38:18" (1/1) ... [2024-02-20 11:38:18,897 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:38:18" (1/1) ... [2024-02-20 11:38:18,898 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-20 11:38:18,899 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-20 11:38:18,899 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-20 11:38:18,899 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-20 11:38:18,900 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:38:18" (1/1) ... [2024-02-20 11:38:18,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-20 11:38:18,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 11:38:18,941 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-20 11:38:18,946 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-20 11:38:18,989 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-20 11:38:18,989 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-20 11:38:18,989 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-20 11:38:18,989 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-20 11:38:18,989 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-20 11:38:18,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-20 11:38:18,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-20 11:38:18,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-20 11:38:18,990 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-20 11:38:18,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-20 11:38:18,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-20 11:38:18,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-20 11:38:18,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-20 11:38:18,991 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-20 11:38:18,991 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-02-20 11:38:18,991 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-02-20 11:38:18,991 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-02-20 11:38:18,991 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-20 11:38:18,992 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-20 11:38:19,071 INFO L244 CfgBuilder]: Building ICFG [2024-02-20 11:38:19,072 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-20 11:38:19,187 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-20 11:38:19,187 INFO L293 CfgBuilder]: Performing block encoding [2024-02-20 11:38:19,301 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-20 11:38:19,302 INFO L320 CfgBuilder]: Removed 2 assume(true) statements. [2024-02-20 11:38:19,302 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:38:19 BoogieIcfgContainer [2024-02-20 11:38:19,302 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-20 11:38:19,303 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-20 11:38:19,304 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-20 11:38:19,306 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-20 11:38:19,306 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:38:18" (1/3) ... [2024-02-20 11:38:19,306 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c4c97c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:38:19, skipping insertion in model container [2024-02-20 11:38:19,306 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:38:18" (2/3) ... [2024-02-20 11:38:19,307 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c4c97c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:38:19, skipping insertion in model container [2024-02-20 11:38:19,307 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:38:19" (3/3) ... [2024-02-20 11:38:19,307 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp1x3.wvr.c [2024-02-20 11:38:19,320 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-20 11:38:19,320 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-02-20 11:38:19,320 INFO L635 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-20 11:38:19,356 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-02-20 11:38:19,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 22 places, 17 transitions, 48 flow [2024-02-20 11:38:19,406 INFO L124 PetriNetUnfolderBase]: 2/15 cut-off events. [2024-02-20 11:38:19,406 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-20 11:38:19,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24 conditions, 15 events. 2/15 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 7 event pairs, 0 based on Foata normal form. 0/12 useless extension candidates. Maximal degree in co-relation 9. Up to 2 conditions per place. [2024-02-20 11:38:19,408 INFO L82 GeneralOperation]: Start removeDead. Operand has 22 places, 17 transitions, 48 flow [2024-02-20 11:38:19,411 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 19 places, 14 transitions, 40 flow [2024-02-20 11:38:19,421 INFO L368 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-20 11:38:19,426 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;@aaa3567, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-20 11:38:19,426 INFO L370 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-02-20 11:38:19,431 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-20 11:38:19,431 INFO L124 PetriNetUnfolderBase]: 2/13 cut-off events. [2024-02-20 11:38:19,431 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-20 11:38:19,431 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:38:19,432 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:38:19,437 INFO L432 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:38:19,441 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:38:19,441 INFO L85 PathProgramCache]: Analyzing trace with hash -799987644, now seen corresponding path program 1 times [2024-02-20 11:38:19,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:38:19,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223209819] [2024-02-20 11:38:19,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:38:19,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:38:19,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:38:19,781 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-20 11:38:19,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:38:19,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223209819] [2024-02-20 11:38:19,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223209819] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:38:19,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:38:19,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-20 11:38:19,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578077947] [2024-02-20 11:38:19,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:38:19,790 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-20 11:38:19,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:38:19,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-20 11:38:19,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-20 11:38:19,818 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 17 [2024-02-20 11:38:19,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 19 places, 14 transitions, 40 flow. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-20 11:38:19,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:38:19,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 17 [2024-02-20 11:38:19,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:38:19,884 INFO L124 PetriNetUnfolderBase]: 41/78 cut-off events. [2024-02-20 11:38:19,884 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-02-20 11:38:19,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175 conditions, 78 events. 41/78 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 168 event pairs, 9 based on Foata normal form. 1/55 useless extension candidates. Maximal degree in co-relation 120. Up to 51 conditions per place. [2024-02-20 11:38:19,887 INFO L140 encePairwiseOnDemand]: 13/17 looper letters, 19 selfloop transitions, 3 changer transitions 1/24 dead transitions. [2024-02-20 11:38:19,888 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 24 transitions, 115 flow [2024-02-20 11:38:19,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-20 11:38:19,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-20 11:38:19,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2024-02-20 11:38:19,898 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6470588235294118 [2024-02-20 11:38:19,901 INFO L308 CegarLoopForPetriNet]: 19 programPoint places, 2 predicate places. [2024-02-20 11:38:19,901 INFO L507 AbstractCegarLoop]: Abstraction has has 21 places, 24 transitions, 115 flow [2024-02-20 11:38:19,902 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-20 11:38:19,902 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:38:19,902 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:38:19,903 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-20 11:38:19,903 INFO L432 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:38:19,904 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:38:19,905 INFO L85 PathProgramCache]: Analyzing trace with hash -103439356, now seen corresponding path program 1 times [2024-02-20 11:38:19,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:38:19,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96613616] [2024-02-20 11:38:19,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:38:19,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:38:19,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:38:20,040 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-20 11:38:20,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:38:20,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96613616] [2024-02-20 11:38:20,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96613616] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:38:20,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:38:20,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-20 11:38:20,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304152176] [2024-02-20 11:38:20,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:38:20,043 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-20 11:38:20,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:38:20,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-20 11:38:20,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-20 11:38:20,044 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 17 [2024-02-20 11:38:20,044 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 24 transitions, 115 flow. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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-20 11:38:20,044 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:38:20,044 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 17 [2024-02-20 11:38:20,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:38:20,140 INFO L124 PetriNetUnfolderBase]: 39/76 cut-off events. [2024-02-20 11:38:20,140 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-02-20 11:38:20,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 247 conditions, 76 events. 39/76 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 165 event pairs, 2 based on Foata normal form. 0/54 useless extension candidates. Maximal degree in co-relation 170. Up to 49 conditions per place. [2024-02-20 11:38:20,141 INFO L140 encePairwiseOnDemand]: 12/17 looper letters, 24 selfloop transitions, 6 changer transitions 4/35 dead transitions. [2024-02-20 11:38:20,141 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 35 transitions, 233 flow [2024-02-20 11:38:20,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-20 11:38:20,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-20 11:38:20,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2024-02-20 11:38:20,143 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5882352941176471 [2024-02-20 11:38:20,143 INFO L308 CegarLoopForPetriNet]: 19 programPoint places, 6 predicate places. [2024-02-20 11:38:20,143 INFO L507 AbstractCegarLoop]: Abstraction has has 25 places, 35 transitions, 233 flow [2024-02-20 11:38:20,144 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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-20 11:38:20,144 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:38:20,144 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:38:20,144 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-20 11:38:20,144 INFO L432 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:38:20,145 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:38:20,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1699697398, now seen corresponding path program 2 times [2024-02-20 11:38:20,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:38:20,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959305467] [2024-02-20 11:38:20,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:38:20,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:38:20,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:38:20,212 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-20 11:38:20,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:38:20,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959305467] [2024-02-20 11:38:20,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959305467] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:38:20,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:38:20,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-20 11:38:20,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501969885] [2024-02-20 11:38:20,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:38:20,213 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-20 11:38:20,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:38:20,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-20 11:38:20,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-20 11:38:20,214 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 17 [2024-02-20 11:38:20,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 35 transitions, 233 flow. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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-20 11:38:20,214 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:38:20,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 17 [2024-02-20 11:38:20,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:38:20,310 INFO L124 PetriNetUnfolderBase]: 47/90 cut-off events. [2024-02-20 11:38:20,310 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-02-20 11:38:20,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 380 conditions, 90 events. 47/90 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 215 event pairs, 2 based on Foata normal form. 0/66 useless extension candidates. Maximal degree in co-relation 277. Up to 63 conditions per place. [2024-02-20 11:38:20,312 INFO L140 encePairwiseOnDemand]: 12/17 looper letters, 31 selfloop transitions, 7 changer transitions 4/43 dead transitions. [2024-02-20 11:38:20,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 43 transitions, 368 flow [2024-02-20 11:38:20,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-20 11:38:20,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-20 11:38:20,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2024-02-20 11:38:20,314 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5882352941176471 [2024-02-20 11:38:20,315 INFO L308 CegarLoopForPetriNet]: 19 programPoint places, 10 predicate places. [2024-02-20 11:38:20,315 INFO L507 AbstractCegarLoop]: Abstraction has has 29 places, 43 transitions, 368 flow [2024-02-20 11:38:20,315 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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-20 11:38:20,315 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:38:20,315 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:38:20,316 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-20 11:38:20,316 INFO L432 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:38:20,317 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:38:20,317 INFO L85 PathProgramCache]: Analyzing trace with hash -77211738, now seen corresponding path program 1 times [2024-02-20 11:38:20,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:38:20,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547242359] [2024-02-20 11:38:20,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:38:20,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:38:20,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:38:20,410 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-20 11:38:20,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:38:20,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547242359] [2024-02-20 11:38:20,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547242359] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:38:20,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:38:20,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-20 11:38:20,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115926602] [2024-02-20 11:38:20,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:38:20,414 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-20 11:38:20,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:38:20,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-20 11:38:20,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-20 11:38:20,417 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 17 [2024-02-20 11:38:20,417 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 43 transitions, 368 flow. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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-20 11:38:20,417 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:38:20,417 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 17 [2024-02-20 11:38:20,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:38:20,487 INFO L124 PetriNetUnfolderBase]: 43/86 cut-off events. [2024-02-20 11:38:20,488 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-02-20 11:38:20,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 450 conditions, 86 events. 43/86 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 210 event pairs, 2 based on Foata normal form. 0/66 useless extension candidates. Maximal degree in co-relation 325. Up to 59 conditions per place. [2024-02-20 11:38:20,489 INFO L140 encePairwiseOnDemand]: 12/17 looper letters, 32 selfloop transitions, 5 changer transitions 10/48 dead transitions. [2024-02-20 11:38:20,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 48 transitions, 505 flow [2024-02-20 11:38:20,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-20 11:38:20,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-20 11:38:20,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2024-02-20 11:38:20,492 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5764705882352941 [2024-02-20 11:38:20,493 INFO L308 CegarLoopForPetriNet]: 19 programPoint places, 14 predicate places. [2024-02-20 11:38:20,493 INFO L507 AbstractCegarLoop]: Abstraction has has 33 places, 48 transitions, 505 flow [2024-02-20 11:38:20,494 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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-20 11:38:20,494 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:38:20,494 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:38:20,494 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-20 11:38:20,495 INFO L432 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:38:20,495 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:38:20,495 INFO L85 PathProgramCache]: Analyzing trace with hash 196871332, now seen corresponding path program 2 times [2024-02-20 11:38:20,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:38:20,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455432700] [2024-02-20 11:38:20,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:38:20,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:38:20,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:38:20,575 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-20 11:38:20,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:38:20,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455432700] [2024-02-20 11:38:20,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455432700] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:38:20,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:38:20,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-20 11:38:20,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862631385] [2024-02-20 11:38:20,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:38:20,576 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-20 11:38:20,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:38:20,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-20 11:38:20,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-20 11:38:20,577 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 17 [2024-02-20 11:38:20,577 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 48 transitions, 505 flow. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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-20 11:38:20,577 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:38:20,577 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 17 [2024-02-20 11:38:20,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:38:20,658 INFO L124 PetriNetUnfolderBase]: 49/96 cut-off events. [2024-02-20 11:38:20,658 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-02-20 11:38:20,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 596 conditions, 96 events. 49/96 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 244 event pairs, 2 based on Foata normal form. 0/74 useless extension candidates. Maximal degree in co-relation 449. Up to 69 conditions per place. [2024-02-20 11:38:20,659 INFO L140 encePairwiseOnDemand]: 12/17 looper letters, 37 selfloop transitions, 6 changer transitions 10/54 dead transitions. [2024-02-20 11:38:20,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 54 transitions, 671 flow [2024-02-20 11:38:20,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-20 11:38:20,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-20 11:38:20,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2024-02-20 11:38:20,661 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5411764705882353 [2024-02-20 11:38:20,663 INFO L308 CegarLoopForPetriNet]: 19 programPoint places, 18 predicate places. [2024-02-20 11:38:20,663 INFO L507 AbstractCegarLoop]: Abstraction has has 37 places, 54 transitions, 671 flow [2024-02-20 11:38:20,663 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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-20 11:38:20,663 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:38:20,663 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:38:20,663 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-20 11:38:20,663 INFO L432 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:38:20,664 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:38:20,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1126895040, now seen corresponding path program 1 times [2024-02-20 11:38:20,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:38:20,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011438120] [2024-02-20 11:38:20,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:38:20,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:38:20,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:38:20,995 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-20 11:38:20,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:38:20,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011438120] [2024-02-20 11:38:20,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011438120] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 11:38:20,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401114177] [2024-02-20 11:38:20,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:38:20,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:38:20,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 11:38:20,998 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-20 11:38:21,011 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-20 11:38:21,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:38:21,095 INFO L262 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 9 conjunts are in the unsatisfiable core [2024-02-20 11:38:21,098 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 11:38:22,987 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-20 11:38:22,987 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 11:38:23,461 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-20 11:38:23,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [401114177] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-20 11:38:23,462 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-20 11:38:23,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2024-02-20 11:38:23,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161280883] [2024-02-20 11:38:23,463 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-20 11:38:23,463 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-02-20 11:38:23,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:38:23,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-02-20 11:38:23,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-02-20 11:38:23,465 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 17 [2024-02-20 11:38:23,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 54 transitions, 671 flow. Second operand has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 15 states have internal predecessors, (77), 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-20 11:38:23,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:38:23,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 17 [2024-02-20 11:38:23,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:38:24,914 INFO L124 PetriNetUnfolderBase]: 149/290 cut-off events. [2024-02-20 11:38:24,914 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2024-02-20 11:38:24,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2055 conditions, 290 events. 149/290 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1106 event pairs, 2 based on Foata normal form. 3/215 useless extension candidates. Maximal degree in co-relation 1754. Up to 260 conditions per place. [2024-02-20 11:38:24,917 INFO L140 encePairwiseOnDemand]: 11/17 looper letters, 94 selfloop transitions, 35 changer transitions 38/168 dead transitions. [2024-02-20 11:38:24,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 168 transitions, 2436 flow [2024-02-20 11:38:24,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-02-20 11:38:24,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-02-20 11:38:24,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 136 transitions. [2024-02-20 11:38:24,918 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6153846153846154 [2024-02-20 11:38:24,919 INFO L308 CegarLoopForPetriNet]: 19 programPoint places, 30 predicate places. [2024-02-20 11:38:24,919 INFO L507 AbstractCegarLoop]: Abstraction has has 49 places, 168 transitions, 2436 flow [2024-02-20 11:38:24,919 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 15 states have internal predecessors, (77), 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-20 11:38:24,919 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:38:24,919 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:38:24,935 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-20 11:38:25,132 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-20 11:38:25,134 INFO L432 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:38:25,134 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:38:25,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1544579584, now seen corresponding path program 2 times [2024-02-20 11:38:25,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:38:25,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748244694] [2024-02-20 11:38:25,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:38:25,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:38:25,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:38:25,350 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-20 11:38:25,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:38:25,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748244694] [2024-02-20 11:38:25,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748244694] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 11:38:25,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2125481460] [2024-02-20 11:38:25,351 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-20 11:38:25,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:38:25,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 11:38:25,352 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-20 11:38:25,376 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-20 11:38:25,422 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-20 11:38:25,423 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-20 11:38:25,423 INFO L262 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 10 conjunts are in the unsatisfiable core [2024-02-20 11:38:25,424 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 11:38:34,264 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-20 11:38:34,264 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 11:38:37,890 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-20 11:38:37,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2125481460] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-20 11:38:37,890 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-20 11:38:37,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2024-02-20 11:38:37,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065681266] [2024-02-20 11:38:37,891 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-20 11:38:37,891 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-02-20 11:38:37,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:38:37,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-02-20 11:38:37,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2024-02-20 11:38:37,892 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 17 [2024-02-20 11:38:37,892 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 168 transitions, 2436 flow. Second operand has 15 states, 15 states have (on average 5.0) internal successors, (75), 15 states have internal predecessors, (75), 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-20 11:38:37,892 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:38:37,892 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 17 [2024-02-20 11:38:37,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:38:45,684 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-20 11:38:46,216 INFO L124 PetriNetUnfolderBase]: 239/455 cut-off events. [2024-02-20 11:38:46,216 INFO L125 PetriNetUnfolderBase]: For 75/75 co-relation queries the response was YES. [2024-02-20 11:38:46,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3662 conditions, 455 events. 239/455 cut-off events. For 75/75 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 1981 event pairs, 2 based on Foata normal form. 3/324 useless extension candidates. Maximal degree in co-relation 3259. Up to 423 conditions per place. [2024-02-20 11:38:46,220 INFO L140 encePairwiseOnDemand]: 11/17 looper letters, 147 selfloop transitions, 56 changer transitions 62/266 dead transitions. [2024-02-20 11:38:46,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 266 transitions, 4380 flow [2024-02-20 11:38:46,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-02-20 11:38:46,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2024-02-20 11:38:46,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 160 transitions. [2024-02-20 11:38:46,227 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5536332179930796 [2024-02-20 11:38:46,227 INFO L308 CegarLoopForPetriNet]: 19 programPoint places, 46 predicate places. [2024-02-20 11:38:46,227 INFO L507 AbstractCegarLoop]: Abstraction has has 65 places, 266 transitions, 4380 flow [2024-02-20 11:38:46,227 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.0) internal successors, (75), 15 states have internal predecessors, (75), 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-20 11:38:46,228 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:38:46,228 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:38:46,241 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-02-20 11:38:46,428 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,SelfDestructingSolverStorable6 [2024-02-20 11:38:46,429 INFO L432 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:38:46,429 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:38:46,429 INFO L85 PathProgramCache]: Analyzing trace with hash 479557864, now seen corresponding path program 3 times [2024-02-20 11:38:46,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:38:46,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034835198] [2024-02-20 11:38:46,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:38:46,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:38:46,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:38:46,534 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-20 11:38:46,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:38:46,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034835198] [2024-02-20 11:38:46,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034835198] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 11:38:46,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [203087848] [2024-02-20 11:38:46,534 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-02-20 11:38:46,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:38:46,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 11:38:46,549 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-20 11:38:46,550 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-20 11:38:46,730 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-02-20 11:38:46,730 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-20 11:38:46,731 INFO L262 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core [2024-02-20 11:38:46,732 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 11:38:47,732 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-20 11:38:47,732 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 11:38:47,956 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-20 11:38:47,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [203087848] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-20 11:38:47,957 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-20 11:38:47,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 7] total 14 [2024-02-20 11:38:47,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601737831] [2024-02-20 11:38:47,957 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-20 11:38:47,957 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-02-20 11:38:47,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:38:47,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-02-20 11:38:47,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2024-02-20 11:38:47,958 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 17 [2024-02-20 11:38:47,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 266 transitions, 4380 flow. Second operand has 15 states, 15 states have (on average 5.6) internal successors, (84), 15 states have internal predecessors, (84), 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-20 11:38:47,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:38:47,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 17 [2024-02-20 11:38:47,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:38:52,108 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 11:38:57,126 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.75s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 11:38:57,126 INFO L124 PetriNetUnfolderBase]: 299/575 cut-off events. [2024-02-20 11:38:57,127 INFO L125 PetriNetUnfolderBase]: For 95/95 co-relation queries the response was YES. [2024-02-20 11:38:57,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5206 conditions, 575 events. 299/575 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2634 event pairs, 2 based on Foata normal form. 1/412 useless extension candidates. Maximal degree in co-relation 4717. Up to 543 conditions per place. [2024-02-20 11:38:57,132 INFO L140 encePairwiseOnDemand]: 11/17 looper letters, 187 selfloop transitions, 45 changer transitions 105/338 dead transitions. [2024-02-20 11:38:57,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 338 transitions, 6248 flow [2024-02-20 11:38:57,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-02-20 11:38:57,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-02-20 11:38:57,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 122 transitions. [2024-02-20 11:38:57,135 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5980392156862745 [2024-02-20 11:38:57,135 INFO L308 CegarLoopForPetriNet]: 19 programPoint places, 57 predicate places. [2024-02-20 11:38:57,135 INFO L507 AbstractCegarLoop]: Abstraction has has 76 places, 338 transitions, 6248 flow [2024-02-20 11:38:57,136 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.6) internal successors, (84), 15 states have internal predecessors, (84), 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-20 11:38:57,136 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:38:57,136 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:38:57,149 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-20 11:38:57,344 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:38:57,344 INFO L432 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:38:57,345 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:38:57,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1952274422, now seen corresponding path program 4 times [2024-02-20 11:38:57,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:38:57,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596913597] [2024-02-20 11:38:57,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:38:57,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:38:57,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:38:57,428 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-20 11:38:57,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:38:57,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596913597] [2024-02-20 11:38:57,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596913597] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 11:38:57,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1054797229] [2024-02-20 11:38:57,430 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-02-20 11:38:57,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:38:57,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 11:38:57,431 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-20 11:38:57,435 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-20 11:38:57,657 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-02-20 11:38:57,657 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-20 11:38:57,658 INFO L262 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 12 conjunts are in the unsatisfiable core [2024-02-20 11:38:57,659 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 11:38:59,679 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-20 11:38:59,680 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 11:39:00,460 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-20 11:39:00,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1054797229] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-20 11:39:00,460 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-20 11:39:00,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 7] total 15 [2024-02-20 11:39:00,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926470330] [2024-02-20 11:39:00,460 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-20 11:39:00,460 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-02-20 11:39:00,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:39:00,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-02-20 11:39:00,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2024-02-20 11:39:00,461 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 17 [2024-02-20 11:39:00,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 338 transitions, 6248 flow. Second operand has 16 states, 16 states have (on average 5.375) internal successors, (86), 16 states have internal predecessors, (86), 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-20 11:39:00,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:39:00,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 17 [2024-02-20 11:39:00,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:39:06,428 INFO L124 PetriNetUnfolderBase]: 544/1102 cut-off events. [2024-02-20 11:39:06,428 INFO L125 PetriNetUnfolderBase]: For 178/178 co-relation queries the response was YES. [2024-02-20 11:39:06,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11027 conditions, 1102 events. 544/1102 cut-off events. For 178/178 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 6283 event pairs, 2 based on Foata normal form. 4/792 useless extension candidates. Maximal degree in co-relation 9936. Up to 1060 conditions per place. [2024-02-20 11:39:06,437 INFO L140 encePairwiseOnDemand]: 11/17 looper letters, 348 selfloop transitions, 139 changer transitions 175/663 dead transitions. [2024-02-20 11:39:06,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 663 transitions, 13623 flow [2024-02-20 11:39:06,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-02-20 11:39:06,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2024-02-20 11:39:06,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 236 transitions. [2024-02-20 11:39:06,442 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6035805626598465 [2024-02-20 11:39:06,442 INFO L308 CegarLoopForPetriNet]: 19 programPoint places, 78 predicate places. [2024-02-20 11:39:06,443 INFO L507 AbstractCegarLoop]: Abstraction has has 97 places, 663 transitions, 13623 flow [2024-02-20 11:39:06,443 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.375) internal successors, (86), 16 states have internal predecessors, (86), 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-20 11:39:06,443 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:39:06,443 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:39:06,465 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-20 11:39:06,654 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:39:06,654 INFO L432 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:39:06,655 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:39:06,655 INFO L85 PathProgramCache]: Analyzing trace with hash 2078954120, now seen corresponding path program 5 times [2024-02-20 11:39:06,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:39:06,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370313825] [2024-02-20 11:39:06,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:39:06,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:39:06,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:39:06,745 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-20 11:39:06,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:39:06,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370313825] [2024-02-20 11:39:06,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370313825] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 11:39:06,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [267846363] [2024-02-20 11:39:06,746 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-02-20 11:39:06,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:39:06,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 11:39:06,747 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-20 11:39:06,775 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-20 11:39:07,024 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2024-02-20 11:39:07,024 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-20 11:39:07,025 INFO L262 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core [2024-02-20 11:39:07,026 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 11:39:07,775 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-20 11:39:07,776 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 11:39:08,087 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-20 11:39:08,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [267846363] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-20 11:39:08,088 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-20 11:39:08,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 7] total 14 [2024-02-20 11:39:08,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245437295] [2024-02-20 11:39:08,088 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-20 11:39:08,088 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-02-20 11:39:08,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:39:08,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-02-20 11:39:08,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2024-02-20 11:39:08,089 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 17 [2024-02-20 11:39:08,089 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 663 transitions, 13623 flow. Second operand has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 15 states have internal predecessors, (82), 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-20 11:39:08,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:39:08,090 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 17 [2024-02-20 11:39:08,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:39:12,126 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-20 11:39:15,212 INFO L124 PetriNetUnfolderBase]: 638/1312 cut-off events. [2024-02-20 11:39:15,213 INFO L125 PetriNetUnfolderBase]: For 230/230 co-relation queries the response was YES. [2024-02-20 11:39:15,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14422 conditions, 1312 events. 638/1312 cut-off events. For 230/230 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 8027 event pairs, 2 based on Foata normal form. 2/946 useless extension candidates. Maximal degree in co-relation 13074. Up to 1267 conditions per place. [2024-02-20 11:39:15,223 INFO L140 encePairwiseOnDemand]: 11/17 looper letters, 528 selfloop transitions, 52 changer transitions 213/794 dead transitions. [2024-02-20 11:39:15,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 794 transitions, 17913 flow [2024-02-20 11:39:15,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-02-20 11:39:15,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-02-20 11:39:15,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 112 transitions. [2024-02-20 11:39:15,224 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5989304812834224 [2024-02-20 11:39:15,225 INFO L308 CegarLoopForPetriNet]: 19 programPoint places, 88 predicate places. [2024-02-20 11:39:15,225 INFO L507 AbstractCegarLoop]: Abstraction has has 107 places, 794 transitions, 17913 flow [2024-02-20 11:39:15,225 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 15 states have internal predecessors, (82), 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-20 11:39:15,226 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:39:15,226 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:39:15,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-02-20 11:39:15,436 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,SelfDestructingSolverStorable9 [2024-02-20 11:39:15,437 INFO L432 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:39:15,437 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:39:15,437 INFO L85 PathProgramCache]: Analyzing trace with hash -593527516, now seen corresponding path program 6 times [2024-02-20 11:39:15,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:39:15,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809781011] [2024-02-20 11:39:15,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:39:15,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:39:15,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:39:15,527 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-20 11:39:15,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:39:15,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809781011] [2024-02-20 11:39:15,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809781011] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 11:39:15,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [176784955] [2024-02-20 11:39:15,528 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-02-20 11:39:15,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:39:15,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 11:39:15,529 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-20 11:39:15,530 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-20 11:39:15,685 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2024-02-20 11:39:15,685 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-20 11:39:15,686 INFO L262 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 11 conjunts are in the unsatisfiable core [2024-02-20 11:39:15,687 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 11:39:21,687 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-20 11:39:21,687 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 11:39:22,054 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-20 11:39:22,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [176784955] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-20 11:39:22,054 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-20 11:39:22,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 7] total 14 [2024-02-20 11:39:22,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343499283] [2024-02-20 11:39:22,055 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-20 11:39:22,055 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-02-20 11:39:22,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:39:22,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-02-20 11:39:22,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-02-20 11:39:22,056 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 17 [2024-02-20 11:39:22,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 794 transitions, 17913 flow. Second operand has 15 states, 15 states have (on average 5.6) internal successors, (84), 15 states have internal predecessors, (84), 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-20 11:39:22,056 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:39:22,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 17 [2024-02-20 11:39:22,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:39:25,027 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 11:39:28,259 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 11:39:33,429 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.49s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 11:39:34,592 INFO L124 PetriNetUnfolderBase]: 684/1395 cut-off events. [2024-02-20 11:39:34,593 INFO L125 PetriNetUnfolderBase]: For 222/222 co-relation queries the response was YES. [2024-02-20 11:39:34,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16753 conditions, 1395 events. 684/1395 cut-off events. For 222/222 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 8563 event pairs, 2 based on Foata normal form. 1/1020 useless extension candidates. Maximal degree in co-relation 15317. Up to 1353 conditions per place. [2024-02-20 11:39:34,605 INFO L140 encePairwiseOnDemand]: 11/17 looper letters, 457 selfloop transitions, 100 changer transitions 284/842 dead transitions. [2024-02-20 11:39:34,605 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 842 transitions, 20675 flow [2024-02-20 11:39:34,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-02-20 11:39:34,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2024-02-20 11:39:34,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 184 transitions. [2024-02-20 11:39:34,606 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5411764705882353 [2024-02-20 11:39:34,607 INFO L308 CegarLoopForPetriNet]: 19 programPoint places, 106 predicate places. [2024-02-20 11:39:34,607 INFO L507 AbstractCegarLoop]: Abstraction has has 125 places, 842 transitions, 20675 flow [2024-02-20 11:39:34,607 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.6) internal successors, (84), 15 states have internal predecessors, (84), 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-20 11:39:34,607 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:39:34,607 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:39:34,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-02-20 11:39:34,819 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:39:34,819 INFO L432 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:39:34,819 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:39:34,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1921638976, now seen corresponding path program 7 times [2024-02-20 11:39:34,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:39:34,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679921530] [2024-02-20 11:39:34,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:39:34,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:39:34,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:39:35,265 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:39:35,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:39:35,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679921530] [2024-02-20 11:39:35,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679921530] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 11:39:35,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2075564210] [2024-02-20 11:39:35,266 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-02-20 11:39:35,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:39:35,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 11:39:35,267 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-20 11:39:35,268 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-20 11:39:36,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:39:36,169 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 14 conjunts are in the unsatisfiable core [2024-02-20 11:39:36,170 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 11:39:43,290 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:39:43,290 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 11:39:48,261 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:39:48,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2075564210] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-20 11:39:48,262 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-20 11:39:48,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2024-02-20 11:39:48,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179012651] [2024-02-20 11:39:48,262 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-20 11:39:48,262 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-02-20 11:39:48,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:39:48,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-02-20 11:39:48,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2024-02-20 11:39:48,263 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 17 [2024-02-20 11:39:48,263 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 842 transitions, 20675 flow. Second operand has 21 states, 21 states have (on average 4.809523809523809) internal successors, (101), 21 states have internal predecessors, (101), 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-20 11:39:48,263 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:39:48,263 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 17 [2024-02-20 11:39:48,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:40:12,407 WARN L293 SmtUtils]: Spent 12.66s on a formula simplification. DAG size of input: 94 DAG size of output: 34 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-20 11:40:14,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-20 11:40:19,553 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-20 11:40:23,187 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 11:40:26,020 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-20 11:40:28,135 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-20 11:40:36,578 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 11:40:47,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 11:40:51,042 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-20 11:40:55,691 INFO L124 PetriNetUnfolderBase]: 814/1703 cut-off events. [2024-02-20 11:40:55,691 INFO L125 PetriNetUnfolderBase]: For 303/303 co-relation queries the response was YES. [2024-02-20 11:40:55,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22086 conditions, 1703 events. 814/1703 cut-off events. For 303/303 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 11220 event pairs, 2 based on Foata normal form. 4/1249 useless extension candidates. Maximal degree in co-relation 20202. Up to 1653 conditions per place. [2024-02-20 11:40:55,702 INFO L140 encePairwiseOnDemand]: 11/17 looper letters, 537 selfloop transitions, 145 changer transitions 348/1031 dead transitions. [2024-02-20 11:40:55,703 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 1031 transitions, 27406 flow [2024-02-20 11:40:55,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-02-20 11:40:55,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2024-02-20 11:40:55,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 252 transitions. [2024-02-20 11:40:55,704 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5294117647058824 [2024-02-20 11:40:55,705 INFO L308 CegarLoopForPetriNet]: 19 programPoint places, 133 predicate places. [2024-02-20 11:40:55,705 INFO L507 AbstractCegarLoop]: Abstraction has has 152 places, 1031 transitions, 27406 flow [2024-02-20 11:40:55,705 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.809523809523809) internal successors, (101), 21 states have internal predecessors, (101), 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-20 11:40:55,705 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:40:55,705 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:40:55,715 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-20 11:40:55,915 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:40:55,916 INFO L432 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:40:55,916 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:40:55,916 INFO L85 PathProgramCache]: Analyzing trace with hash 790522596, now seen corresponding path program 8 times [2024-02-20 11:40:55,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:40:55,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29078547] [2024-02-20 11:40:55,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:40:55,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:40:55,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:40:56,365 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:40:56,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:40:56,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29078547] [2024-02-20 11:40:56,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29078547] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 11:40:56,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1143265832] [2024-02-20 11:40:56,365 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-20 11:40:56,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:40:56,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 11:40:56,366 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-20 11:40:56,367 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-20 11:40:56,607 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-20 11:40:56,607 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-20 11:40:56,608 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 11 conjunts are in the unsatisfiable core [2024-02-20 11:40:56,608 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 11:40:58,251 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:40:58,251 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 11:40:58,734 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:40:58,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1143265832] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-20 11:40:58,734 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-20 11:40:58,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 16 [2024-02-20 11:40:58,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013164166] [2024-02-20 11:40:58,735 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-20 11:40:58,735 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-02-20 11:40:58,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:40:58,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-02-20 11:40:58,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2024-02-20 11:40:58,736 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 17 [2024-02-20 11:40:58,736 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 1031 transitions, 27406 flow. Second operand has 17 states, 17 states have (on average 5.117647058823529) internal successors, (87), 17 states have internal predecessors, (87), 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-20 11:40:58,736 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:40:58,736 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 17 [2024-02-20 11:40:58,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:41:03,052 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-20 11:41:04,378 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 11:41:05,721 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 11:41:16,286 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 11:41:23,178 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-20 11:41:26,940 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.43s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 11:41:28,637 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 11:41:30,174 INFO L124 PetriNetUnfolderBase]: 960/2007 cut-off events. [2024-02-20 11:41:30,174 INFO L125 PetriNetUnfolderBase]: For 349/349 co-relation queries the response was YES. [2024-02-20 11:41:30,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28006 conditions, 2007 events. 960/2007 cut-off events. For 349/349 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 13805 event pairs, 2 based on Foata normal form. 5/1460 useless extension candidates. Maximal degree in co-relation 25716. Up to 1953 conditions per place. [2024-02-20 11:41:30,187 INFO L140 encePairwiseOnDemand]: 12/17 looper letters, 753 selfloop transitions, 61 changer transitions 404/1219 dead transitions. [2024-02-20 11:41:30,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 1219 transitions, 34838 flow [2024-02-20 11:41:30,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-02-20 11:41:30,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-02-20 11:41:30,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 129 transitions. [2024-02-20 11:41:30,189 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.583710407239819 [2024-02-20 11:41:30,189 INFO L308 CegarLoopForPetriNet]: 19 programPoint places, 145 predicate places. [2024-02-20 11:41:30,189 INFO L507 AbstractCegarLoop]: Abstraction has has 164 places, 1219 transitions, 34838 flow [2024-02-20 11:41:30,189 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.117647058823529) internal successors, (87), 17 states have internal predecessors, (87), 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-20 11:41:30,189 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:41:30,189 INFO L234 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:41:30,200 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-20 11:41:30,400 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,SelfDestructingSolverStorable12 [2024-02-20 11:41:30,401 INFO L432 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:41:30,401 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:41:30,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1313933820, now seen corresponding path program 9 times [2024-02-20 11:41:30,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:41:30,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523439120] [2024-02-20 11:41:30,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:41:30,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:41:30,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:41:31,408 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:41:31,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:41:31,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523439120] [2024-02-20 11:41:31,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523439120] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 11:41:31,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1789413615] [2024-02-20 11:41:31,408 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-02-20 11:41:31,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:41:31,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 11:41:31,409 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-20 11:41:31,410 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-20 11:41:31,758 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-02-20 11:41:31,759 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-20 11:41:31,759 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 10 conjunts are in the unsatisfiable core [2024-02-20 11:41:31,760 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 11:41:38,871 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-20 11:41:38,871 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 11:41:39,327 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-20 11:41:39,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1789413615] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-20 11:41:39,327 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-20 11:41:39,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 7] total 16 [2024-02-20 11:41:39,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267848950] [2024-02-20 11:41:39,328 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-20 11:41:39,328 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-02-20 11:41:39,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:41:39,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-02-20 11:41:39,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=212, Unknown=1, NotChecked=0, Total=272 [2024-02-20 11:41:39,329 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 17 [2024-02-20 11:41:39,329 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 1219 transitions, 34838 flow. Second operand has 17 states, 17 states have (on average 5.235294117647059) internal successors, (89), 17 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:41:39,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:41:39,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 17 [2024-02-20 11:41:39,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:41:48,359 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 11:41:52,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.37s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 11:42:04,020 INFO L124 PetriNetUnfolderBase]: 993/2078 cut-off events. [2024-02-20 11:42:04,021 INFO L125 PetriNetUnfolderBase]: For 378/378 co-relation queries the response was YES. [2024-02-20 11:42:04,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31060 conditions, 2078 events. 993/2078 cut-off events. For 378/378 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 14427 event pairs, 2 based on Foata normal form. 1/1517 useless extension candidates. Maximal degree in co-relation 28584. Up to 2024 conditions per place. [2024-02-20 11:42:04,036 INFO L140 encePairwiseOnDemand]: 11/17 looper letters, 724 selfloop transitions, 91 changer transitions 445/1261 dead transitions. [2024-02-20 11:42:04,036 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 1261 transitions, 38561 flow [2024-02-20 11:42:04,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-02-20 11:42:04,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2024-02-20 11:42:04,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 197 transitions. [2024-02-20 11:42:04,038 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.48284313725490197 [2024-02-20 11:42:04,038 INFO L308 CegarLoopForPetriNet]: 19 programPoint places, 168 predicate places. [2024-02-20 11:42:04,038 INFO L507 AbstractCegarLoop]: Abstraction has has 187 places, 1261 transitions, 38561 flow [2024-02-20 11:42:04,038 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.235294117647059) internal successors, (89), 17 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:42:04,039 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:42:04,039 INFO L234 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:42:04,058 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-02-20 11:42:04,249 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,SelfDestructingSolverStorable13 [2024-02-20 11:42:04,249 INFO L432 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:42:04,250 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:42:04,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1907948096, now seen corresponding path program 10 times [2024-02-20 11:42:04,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:42:04,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250005155] [2024-02-20 11:42:04,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:42:04,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:42:04,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:42:04,617 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:42:04,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:42:04,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250005155] [2024-02-20 11:42:04,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250005155] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 11:42:04,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1365119027] [2024-02-20 11:42:04,617 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-02-20 11:42:04,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:42:04,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 11:42:04,619 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-20 11:42:04,620 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-20 11:42:04,810 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-02-20 11:42:04,810 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-20 11:42:04,811 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 14 conjunts are in the unsatisfiable core [2024-02-20 11:42:04,812 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 11:42:17,592 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-02-20 11:42:17,592 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 11:42:20,936 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:42:20,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1365119027] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-20 11:42:20,936 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-20 11:42:20,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 8] total 17 [2024-02-20 11:42:20,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996958598] [2024-02-20 11:42:20,936 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-20 11:42:20,936 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-02-20 11:42:20,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:42:20,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-02-20 11:42:20,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=243, Unknown=2, NotChecked=0, Total=306 [2024-02-20 11:42:20,937 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 17 [2024-02-20 11:42:20,937 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 1261 transitions, 38561 flow. Second operand has 18 states, 18 states have (on average 5.111111111111111) internal successors, (92), 18 states have internal predecessors, (92), 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-20 11:42:20,937 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:42:20,937 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 17 [2024-02-20 11:42:20,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:42:36,482 WARN L293 SmtUtils]: Spent 9.99s on a formula simplification. DAG size of input: 73 DAG size of output: 64 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-20 11:42:38,139 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 11:42:43,660 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-20 11:42:45,251 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 11:43:06,516 WARN L293 SmtUtils]: Spent 16.18s on a formula simplification. DAG size of input: 95 DAG size of output: 64 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-20 11:43:08,975 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-20 11:43:13,237 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-20 11:43:17,292 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-20 11:43:25,428 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-20 11:43:29,792 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-20 11:43:33,894 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-20 11:43:38,620 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 11:43:39,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 11:43:43,695 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-20 11:43:46,207 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 11:43:50,941 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-20 11:43:54,353 INFO L124 PetriNetUnfolderBase]: 1244/2582 cut-off events. [2024-02-20 11:43:54,353 INFO L125 PetriNetUnfolderBase]: For 445/445 co-relation queries the response was YES. [2024-02-20 11:43:54,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41123 conditions, 2582 events. 1244/2582 cut-off events. For 445/445 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 18666 event pairs, 2 based on Foata normal form. 5/1893 useless extension candidates. Maximal degree in co-relation 38083. Up to 2521 conditions per place. [2024-02-20 11:43:54,371 INFO L140 encePairwiseOnDemand]: 11/17 looper letters, 810 selfloop transitions, 209 changer transitions 545/1565 dead transitions. [2024-02-20 11:43:54,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 1565 transitions, 50968 flow [2024-02-20 11:43:54,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-02-20 11:43:54,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2024-02-20 11:43:54,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 285 transitions. [2024-02-20 11:43:54,373 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.4930795847750865 [2024-02-20 11:43:54,373 INFO L308 CegarLoopForPetriNet]: 19 programPoint places, 201 predicate places. [2024-02-20 11:43:54,374 INFO L507 AbstractCegarLoop]: Abstraction has has 220 places, 1565 transitions, 50968 flow [2024-02-20 11:43:54,374 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.111111111111111) internal successors, (92), 18 states have internal predecessors, (92), 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-20 11:43:54,374 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:43:54,374 INFO L234 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:43:54,388 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-20 11:43:54,584 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,SelfDestructingSolverStorable14 [2024-02-20 11:43:54,585 INFO L432 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:43:54,585 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:43:54,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1865109094, now seen corresponding path program 11 times [2024-02-20 11:43:54,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:43:54,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398766229] [2024-02-20 11:43:54,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:43:54,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:43:54,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:43:54,713 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:43:54,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:43:54,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398766229] [2024-02-20 11:43:54,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398766229] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 11:43:54,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [771530677] [2024-02-20 11:43:54,714 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-02-20 11:43:54,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:43:54,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 11:43:54,715 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-20 11:43:54,716 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-20 11:43:54,982 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2024-02-20 11:43:54,982 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-20 11:43:54,983 INFO L262 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 13 conjunts are in the unsatisfiable core [2024-02-20 11:43:54,984 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 11:44:05,488 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:44:05,488 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 11:44:06,585 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:44:06,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [771530677] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-20 11:44:06,586 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-20 11:44:06,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 20 [2024-02-20 11:44:06,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595952161] [2024-02-20 11:44:06,586 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-20 11:44:06,586 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-02-20 11:44:06,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:44:06,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-02-20 11:44:06,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=345, Unknown=1, NotChecked=0, Total=420 [2024-02-20 11:44:06,587 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 17 [2024-02-20 11:44:06,587 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 1565 transitions, 50968 flow. Second operand has 21 states, 21 states have (on average 5.142857142857143) internal successors, (108), 21 states have internal predecessors, (108), 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-20 11:44:06,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:44:06,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 17 [2024-02-20 11:44:06,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:44:15,149 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-20 11:44:19,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-20 11:44:21,542 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 11:44:23,782 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 11:44:26,536 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 11:44:29,234 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 11:44:33,528 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-20 11:44:36,113 INFO L124 PetriNetUnfolderBase]: 1415/2959 cut-off events. [2024-02-20 11:44:36,113 INFO L125 PetriNetUnfolderBase]: For 525/525 co-relation queries the response was YES. [2024-02-20 11:44:36,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50018 conditions, 2959 events. 1415/2959 cut-off events. For 525/525 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 22065 event pairs, 2 based on Foata normal form. 2/2163 useless extension candidates. Maximal degree in co-relation 46348. Up to 2891 conditions per place. [2024-02-20 11:44:36,141 INFO L140 encePairwiseOnDemand]: 11/17 looper letters, 1005 selfloop transitions, 167 changer transitions 624/1797 dead transitions. [2024-02-20 11:44:36,141 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 1797 transitions, 62134 flow [2024-02-20 11:44:36,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-02-20 11:44:36,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2024-02-20 11:44:36,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 171 transitions. [2024-02-20 11:44:36,143 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5916955017301038 [2024-02-20 11:44:36,144 INFO L308 CegarLoopForPetriNet]: 19 programPoint places, 217 predicate places. [2024-02-20 11:44:36,144 INFO L507 AbstractCegarLoop]: Abstraction has has 236 places, 1797 transitions, 62134 flow [2024-02-20 11:44:36,144 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 5.142857142857143) internal successors, (108), 21 states have internal predecessors, (108), 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-20 11:44:36,145 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:44:36,145 INFO L234 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:44:36,156 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-02-20 11:44:36,356 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-02-20 11:44:36,357 INFO L432 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:44:36,357 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:44:36,357 INFO L85 PathProgramCache]: Analyzing trace with hash -566723192, now seen corresponding path program 12 times [2024-02-20 11:44:36,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:44:36,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684687196] [2024-02-20 11:44:36,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:44:36,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:44:36,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:44:36,480 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:44:36,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:44:36,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684687196] [2024-02-20 11:44:36,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684687196] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 11:44:36,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1075304023] [2024-02-20 11:44:36,481 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-02-20 11:44:36,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:44:36,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 11:44:36,482 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-20 11:44:36,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-02-20 11:44:36,944 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2024-02-20 11:44:36,944 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-20 11:44:36,945 INFO L262 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 15 conjunts are in the unsatisfiable core [2024-02-20 11:44:36,946 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 11:44:53,276 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:44:53,276 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-20 11:45:21,313 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:45:21,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1075304023] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-20 11:45:21,313 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-20 11:45:21,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 9] total 21 [2024-02-20 11:45:21,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308417484] [2024-02-20 11:45:21,313 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-20 11:45:21,314 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-02-20 11:45:21,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:45:21,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-02-20 11:45:21,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=364, Unknown=5, NotChecked=0, Total=462 [2024-02-20 11:45:21,315 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 17 [2024-02-20 11:45:21,315 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 1797 transitions, 62134 flow. Second operand has 22 states, 22 states have (on average 5.0) internal successors, (110), 22 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:45:21,315 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:45:21,315 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 17 [2024-02-20 11:45:21,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:45:23,214 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 11:45:31,940 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-20 11:45:41,850 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-20 11:45:44,256 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 11:45:46,441 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 11:45:53,337 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-20 11:45:56,118 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.52s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 11:46:00,863 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-20 11:46:04,866 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-20 11:46:08,869 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-20 11:46:14,923 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 11:46:16,149 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 11:46:18,466 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 11:46:22,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-20 11:46:29,014 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 11:46:31,104 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 11:46:33,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 11:46:37,645 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-20 11:46:39,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 11:46:43,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.61s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 11:46:46,439 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.81s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 11:46:49,790 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-20 11:46:51,504 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-20 11:46:54,335 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 11:47:00,866 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 11:47:04,867 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-20 11:47:08,924 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-20 11:47:12,927 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-20 11:47:17,403 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-20 11:47:21,409 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-20 11:47:25,411 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-20 11:47:29,486 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-20 11:47:34,616 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-20 11:47:39,528 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-20 11:47:50,945 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-20 11:47:53,196 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 11:47:56,457 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 11:47:58,720 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-20 11:48:00,243 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-20 11:48:04,247 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-20 11:48:08,079 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 11:48:12,082 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 11:48:16,046 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.92s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 11:48:17,710 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 11:48:32,433 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 11:48:35,224 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.79s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 11:48:39,818 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-20 11:48:43,821 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-20 11:48:47,851 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-20 11:48:52,561 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-20 11:48:55,013 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-20 11:48:57,203 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-20 11:48:58,684 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-20 11:49:04,059 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-20 11:49:08,063 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-20 11:49:10,759 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.34s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 11:49:14,765 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-20 11:49:18,962 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-20 11:49:21,525 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 11:49:25,526 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-20 11:49:28,610 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.57s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-20 11:49:29,777 INFO L124 PetriNetUnfolderBase]: 1751/3733 cut-off events. [2024-02-20 11:49:29,778 INFO L125 PetriNetUnfolderBase]: For 662/662 co-relation queries the response was YES. [2024-02-20 11:49:29,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66578 conditions, 3733 events. 1751/3733 cut-off events. For 662/662 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 29486 event pairs, 2 based on Foata normal form. 4/2722 useless extension candidates. Maximal degree in co-relation 61469. Up to 3642 conditions per place. [2024-02-20 11:49:29,812 INFO L140 encePairwiseOnDemand]: 8/17 looper letters, 1336 selfloop transitions, 232 changer transitions 714/2283 dead transitions. [2024-02-20 11:49:29,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 2283 transitions, 83525 flow [2024-02-20 11:49:29,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-02-20 11:49:29,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2024-02-20 11:49:29,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 262 transitions. [2024-02-20 11:49:29,814 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5927601809954751 [2024-02-20 11:49:29,815 INFO L308 CegarLoopForPetriNet]: 19 programPoint places, 242 predicate places. [2024-02-20 11:49:29,815 INFO L507 AbstractCegarLoop]: Abstraction has has 261 places, 2283 transitions, 83525 flow [2024-02-20 11:49:29,815 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 5.0) internal successors, (110), 22 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:49:29,815 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:49:29,815 INFO L234 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:49:29,830 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-02-20 11:49:30,026 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-02-20 11:49:30,027 INFO L432 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:49:30,027 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:49:30,027 INFO L85 PathProgramCache]: Analyzing trace with hash -785359322, now seen corresponding path program 13 times [2024-02-20 11:49:30,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:49:30,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319361103] [2024-02-20 11:49:30,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:49:30,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:49:30,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:49:30,118 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:49:30,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:49:30,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319361103] [2024-02-20 11:49:30,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319361103] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-20 11:49:30,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2125078310] [2024-02-20 11:49:30,118 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-02-20 11:49:30,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-20 11:49:30,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 11:49:30,120 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-20 11:49:30,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-02-20 11:49:31,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:49:31,491 INFO L262 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 15 conjunts are in the unsatisfiable core [2024-02-20 11:49:31,492 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-20 11:50:58,262 WARN L293 SmtUtils]: Spent 16.01s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-02-20 11:51:18,294 WARN L293 SmtUtils]: Spent 12.01s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-02-20 11:51:34,366 WARN L293 SmtUtils]: Spent 12.01s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-02-20 11:51:46,378 WARN L293 SmtUtils]: Spent 12.01s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-02-20 11:51:50,383 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (div c_~x1~0 2)) (.cse4 (div c_~x2~0 2))) (let ((.cse1 (+ (mod .cse4 4294967296) 1)) (.cse3 (div c_~x2~0 4)) (.cse2 (mod (* 4294967295 (div (* (- 1) .cse0) 2)) 4294967296))) (and (= (mod .cse0 2) 0) (= (mod c_~x2~0 2) 0) (<= .cse1 (mod c_~x1~0 4294967296)) (<= .cse1 (mod c_~x2~0 4294967296)) (= (mod c_~x1~0 2) 0) (= .cse2 (mod (* (div (* (- 1) .cse3) 2) 4294967295) 4294967296)) (= (mod .cse3 2) 0) (<= 1 .cse2) (= (mod .cse4 2) 0)))) is different from false [2024-02-20 11:52:02,401 WARN L293 SmtUtils]: Spent 12.01s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-02-20 11:52:26,479 WARN L293 SmtUtils]: Spent 12.01s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-02-20 11:52:42,491 WARN L293 SmtUtils]: Spent 16.01s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) Killed by 15