./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 273a578a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/weaver/bench-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-273a578-m [2024-02-19 14:19:15,423 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-19 14:19:15,501 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-19 14:19:15,506 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-19 14:19:15,506 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-19 14:19:15,531 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-19 14:19:15,532 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-19 14:19:15,532 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-19 14:19:15,533 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-19 14:19:15,536 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-19 14:19:15,536 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-19 14:19:15,536 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-19 14:19:15,537 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-19 14:19:15,538 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-19 14:19:15,538 INFO L153 SettingsManager]: * Use SBE=true [2024-02-19 14:19:15,538 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-19 14:19:15,538 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-19 14:19:15,539 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-19 14:19:15,539 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-19 14:19:15,539 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-19 14:19:15,539 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-19 14:19:15,540 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-19 14:19:15,540 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-19 14:19:15,540 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-19 14:19:15,541 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-19 14:19:15,541 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-19 14:19:15,541 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-19 14:19:15,541 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-19 14:19:15,542 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-19 14:19:15,542 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-19 14:19:15,543 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-19 14:19:15,543 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-19 14:19:15,543 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-19 14:19:15,543 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-19 14:19:15,544 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-19 14:19:15,544 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-19 14:19:15,544 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-19 14:19:15,545 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-19 14:19:15,545 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-19 14:19:15,545 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-19 14:19:15,545 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-19 14:19:15,545 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-19 14:19:15,546 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-19 14:19:15,546 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-19 14:19:15,829 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-19 14:19:15,851 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-19 14:19:15,853 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-19 14:19:15,854 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-19 14:19:15,854 INFO L274 PluginConnector]: CDTParser initialized [2024-02-19 14:19:15,855 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-19 14:19:16,928 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-19 14:19:17,089 INFO L384 CDTParser]: Found 1 translation units. [2024-02-19 14:19:17,092 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp1x3.wvr.c [2024-02-19 14:19:17,097 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d34c2b48/8caa222deda5474c9c5e6c5789d3ae6d/FLAG8008cb94b [2024-02-19 14:19:17,107 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d34c2b48/8caa222deda5474c9c5e6c5789d3ae6d [2024-02-19 14:19:17,109 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-19 14:19:17,110 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-02-19 14:19:17,111 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-19 14:19:17,111 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-19 14:19:17,114 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-19 14:19:17,115 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.02 02:19:17" (1/1) ... [2024-02-19 14:19:17,116 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b1bce17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:19:17, skipping insertion in model container [2024-02-19 14:19:17,118 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.02 02:19:17" (1/1) ... [2024-02-19 14:19:17,138 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-19 14:19:17,284 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-19 14:19:17,288 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-19 14:19:17,300 INFO L202 MainTranslator]: Completed pre-run [2024-02-19 14:19:17,318 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-19 14:19:17,323 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-19 14:19:17,344 INFO L206 MainTranslator]: Completed translation [2024-02-19 14:19:17,345 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:19:17 WrapperNode [2024-02-19 14:19:17,345 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-19 14:19:17,346 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-19 14:19:17,346 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-19 14:19:17,346 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-19 14:19:17,351 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:19:17" (1/1) ... [2024-02-19 14:19:17,357 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:19:17" (1/1) ... [2024-02-19 14:19:17,376 INFO L138 Inliner]: procedures = 18, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 59 [2024-02-19 14:19:17,376 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-19 14:19:17,377 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-19 14:19:17,377 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-19 14:19:17,377 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-19 14:19:17,385 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:19:17" (1/1) ... [2024-02-19 14:19:17,386 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:19:17" (1/1) ... [2024-02-19 14:19:17,395 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:19:17" (1/1) ... [2024-02-19 14:19:17,410 INFO L175 MemorySlicer]: Split 6 memory accesses to 3 slices as follows [2, 2, 2]. 33 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2024-02-19 14:19:17,410 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:19:17" (1/1) ... [2024-02-19 14:19:17,411 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:19:17" (1/1) ... [2024-02-19 14:19:17,422 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:19:17" (1/1) ... [2024-02-19 14:19:17,425 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:19:17" (1/1) ... [2024-02-19 14:19:17,429 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:19:17" (1/1) ... [2024-02-19 14:19:17,430 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:19:17" (1/1) ... [2024-02-19 14:19:17,434 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-19 14:19:17,435 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-19 14:19:17,435 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-19 14:19:17,436 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-19 14:19:17,437 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:19:17" (1/1) ... [2024-02-19 14:19:17,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-19 14:19:17,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 14:19:17,465 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-02-19 14:19:17,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-02-19 14:19:17,511 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-19 14:19:17,512 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-19 14:19:17,512 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-19 14:19:17,512 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-19 14:19:17,512 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-19 14:19:17,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-19 14:19:17,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-19 14:19:17,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-19 14:19:17,514 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-19 14:19:17,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-19 14:19:17,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-19 14:19:17,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-19 14:19:17,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-19 14:19:17,514 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-19 14:19:17,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-02-19 14:19:17,515 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-02-19 14:19:17,515 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-02-19 14:19:17,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-19 14:19:17,516 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-19 14:19:17,609 INFO L244 CfgBuilder]: Building ICFG [2024-02-19 14:19:17,611 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-19 14:19:17,782 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-19 14:19:17,783 INFO L293 CfgBuilder]: Performing block encoding [2024-02-19 14:19:17,910 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-19 14:19:17,910 INFO L320 CfgBuilder]: Removed 2 assume(true) statements. [2024-02-19 14:19:17,911 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.02 02:19:17 BoogieIcfgContainer [2024-02-19 14:19:17,911 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-19 14:19:17,912 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-19 14:19:17,913 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-19 14:19:17,916 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-19 14:19:17,916 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.02 02:19:17" (1/3) ... [2024-02-19 14:19:17,917 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ce162bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.02 02:19:17, skipping insertion in model container [2024-02-19 14:19:17,917 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:19:17" (2/3) ... [2024-02-19 14:19:17,918 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ce162bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.02 02:19:17, skipping insertion in model container [2024-02-19 14:19:17,918 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.02 02:19:17" (3/3) ... [2024-02-19 14:19:17,919 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp1x3.wvr.c [2024-02-19 14:19:17,931 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-19 14:19:17,931 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-02-19 14:19:17,931 INFO L631 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-19 14:19:17,961 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-02-19 14:19:17,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 22 places, 17 transitions, 48 flow [2024-02-19 14:19:18,015 INFO L124 PetriNetUnfolderBase]: 2/15 cut-off events. [2024-02-19 14:19:18,016 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-19 14:19:18,019 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-19 14:19:18,019 INFO L82 GeneralOperation]: Start removeDead. Operand has 22 places, 17 transitions, 48 flow [2024-02-19 14:19:18,022 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 19 places, 14 transitions, 40 flow [2024-02-19 14:19:18,033 INFO L368 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-19 14:19:18,039 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;@70eedd5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-19 14:19:18,039 INFO L370 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-02-19 14:19:18,048 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-19 14:19:18,048 INFO L124 PetriNetUnfolderBase]: 2/13 cut-off events. [2024-02-19 14:19:18,048 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-19 14:19:18,048 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:19:18,049 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:19:18,049 INFO L432 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 14:19:18,052 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:19:18,053 INFO L85 PathProgramCache]: Analyzing trace with hash -799987644, now seen corresponding path program 1 times [2024-02-19 14:19:18,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:19:18,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234616550] [2024-02-19 14:19:18,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:19:18,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:19:18,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:19:18,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:19:18,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:19:18,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234616550] [2024-02-19 14:19:18,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234616550] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:19:18,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:19:18,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-19 14:19:18,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765136022] [2024-02-19 14:19:18,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:19:18,314 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-19 14:19:18,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:19:18,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-19 14:19:18,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-19 14:19:18,343 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 17 [2024-02-19 14:19:18,344 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-19 14:19:18,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:19:18,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 17 [2024-02-19 14:19:18,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:19:18,414 INFO L124 PetriNetUnfolderBase]: 41/78 cut-off events. [2024-02-19 14:19:18,414 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-02-19 14:19:18,423 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-19 14:19:18,425 INFO L140 encePairwiseOnDemand]: 13/17 looper letters, 19 selfloop transitions, 3 changer transitions 1/24 dead transitions. [2024-02-19 14:19:18,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 24 transitions, 115 flow [2024-02-19 14:19:18,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-19 14:19:18,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-19 14:19:18,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2024-02-19 14:19:18,434 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6470588235294118 [2024-02-19 14:19:18,437 INFO L308 CegarLoopForPetriNet]: 19 programPoint places, 2 predicate places. [2024-02-19 14:19:18,437 INFO L507 AbstractCegarLoop]: Abstraction has has 21 places, 24 transitions, 115 flow [2024-02-19 14:19:18,437 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-19 14:19:18,437 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:19:18,437 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:19:18,438 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-19 14:19:18,438 INFO L432 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 14:19:18,438 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:19:18,438 INFO L85 PathProgramCache]: Analyzing trace with hash -103439356, now seen corresponding path program 1 times [2024-02-19 14:19:18,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:19:18,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683096158] [2024-02-19 14:19:18,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:19:18,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:19:18,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:19:18,596 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:19:18,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:19:18,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683096158] [2024-02-19 14:19:18,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683096158] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:19:18,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:19:18,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-19 14:19:18,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883764659] [2024-02-19 14:19:18,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:19:18,599 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-19 14:19:18,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:19:18,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-19 14:19:18,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-19 14:19:18,601 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 17 [2024-02-19 14:19:18,601 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-19 14:19:18,601 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:19:18,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 17 [2024-02-19 14:19:18,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:19:18,692 INFO L124 PetriNetUnfolderBase]: 39/76 cut-off events. [2024-02-19 14:19:18,692 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-02-19 14:19:18,694 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-19 14:19:18,695 INFO L140 encePairwiseOnDemand]: 12/17 looper letters, 24 selfloop transitions, 6 changer transitions 4/35 dead transitions. [2024-02-19 14:19:18,695 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 35 transitions, 233 flow [2024-02-19 14:19:18,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-19 14:19:18,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-19 14:19:18,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2024-02-19 14:19:18,698 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5882352941176471 [2024-02-19 14:19:18,698 INFO L308 CegarLoopForPetriNet]: 19 programPoint places, 6 predicate places. [2024-02-19 14:19:18,698 INFO L507 AbstractCegarLoop]: Abstraction has has 25 places, 35 transitions, 233 flow [2024-02-19 14:19:18,699 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-19 14:19:18,699 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:19:18,699 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:19:18,699 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-19 14:19:18,700 INFO L432 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 14:19:18,700 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:19:18,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1699697398, now seen corresponding path program 2 times [2024-02-19 14:19:18,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:19:18,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446285034] [2024-02-19 14:19:18,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:19:18,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:19:18,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:19:18,808 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:19:18,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:19:18,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446285034] [2024-02-19 14:19:18,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446285034] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:19:18,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:19:18,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-19 14:19:18,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114202417] [2024-02-19 14:19:18,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:19:18,812 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-19 14:19:18,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:19:18,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-19 14:19:18,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-19 14:19:18,813 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 17 [2024-02-19 14:19:18,813 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-19 14:19:18,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:19:18,816 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 17 [2024-02-19 14:19:18,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:19:18,892 INFO L124 PetriNetUnfolderBase]: 47/90 cut-off events. [2024-02-19 14:19:18,892 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-02-19 14:19:18,892 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-19 14:19:18,893 INFO L140 encePairwiseOnDemand]: 12/17 looper letters, 31 selfloop transitions, 7 changer transitions 4/43 dead transitions. [2024-02-19 14:19:18,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 43 transitions, 368 flow [2024-02-19 14:19:18,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-19 14:19:18,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-19 14:19:18,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2024-02-19 14:19:18,894 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5882352941176471 [2024-02-19 14:19:18,895 INFO L308 CegarLoopForPetriNet]: 19 programPoint places, 10 predicate places. [2024-02-19 14:19:18,895 INFO L507 AbstractCegarLoop]: Abstraction has has 29 places, 43 transitions, 368 flow [2024-02-19 14:19:18,895 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-19 14:19:18,895 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:19:18,895 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:19:18,895 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-02-19 14:19:18,895 INFO L432 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 14:19:18,896 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:19:18,896 INFO L85 PathProgramCache]: Analyzing trace with hash -77211738, now seen corresponding path program 1 times [2024-02-19 14:19:18,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:19:18,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299184224] [2024-02-19 14:19:18,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:19:18,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:19:18,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:19:18,954 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:19:18,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:19:18,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299184224] [2024-02-19 14:19:18,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299184224] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:19:18,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:19:18,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-19 14:19:18,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605279772] [2024-02-19 14:19:18,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:19:18,955 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-19 14:19:18,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:19:18,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-19 14:19:18,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-19 14:19:18,956 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 17 [2024-02-19 14:19:18,957 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-19 14:19:18,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:19:18,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 17 [2024-02-19 14:19:18,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:19:19,024 INFO L124 PetriNetUnfolderBase]: 43/86 cut-off events. [2024-02-19 14:19:19,025 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-02-19 14:19:19,025 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-19 14:19:19,026 INFO L140 encePairwiseOnDemand]: 12/17 looper letters, 32 selfloop transitions, 5 changer transitions 10/48 dead transitions. [2024-02-19 14:19:19,026 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 48 transitions, 505 flow [2024-02-19 14:19:19,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-19 14:19:19,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-19 14:19:19,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2024-02-19 14:19:19,029 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5764705882352941 [2024-02-19 14:19:19,030 INFO L308 CegarLoopForPetriNet]: 19 programPoint places, 14 predicate places. [2024-02-19 14:19:19,030 INFO L507 AbstractCegarLoop]: Abstraction has has 33 places, 48 transitions, 505 flow [2024-02-19 14:19:19,031 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-19 14:19:19,031 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:19:19,031 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:19:19,031 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-19 14:19:19,031 INFO L432 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 14:19:19,032 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:19:19,032 INFO L85 PathProgramCache]: Analyzing trace with hash 196871332, now seen corresponding path program 2 times [2024-02-19 14:19:19,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:19:19,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067277120] [2024-02-19 14:19:19,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:19:19,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:19:19,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:19:19,124 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:19:19,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:19:19,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067277120] [2024-02-19 14:19:19,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067277120] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:19:19,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:19:19,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-02-19 14:19:19,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736897305] [2024-02-19 14:19:19,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:19:19,126 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-19 14:19:19,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:19:19,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-19 14:19:19,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-19 14:19:19,127 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 17 [2024-02-19 14:19:19,127 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-19 14:19:19,127 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:19:19,127 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 17 [2024-02-19 14:19:19,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:19:19,195 INFO L124 PetriNetUnfolderBase]: 49/96 cut-off events. [2024-02-19 14:19:19,195 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-02-19 14:19:19,195 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-19 14:19:19,196 INFO L140 encePairwiseOnDemand]: 12/17 looper letters, 37 selfloop transitions, 6 changer transitions 10/54 dead transitions. [2024-02-19 14:19:19,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 54 transitions, 671 flow [2024-02-19 14:19:19,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-19 14:19:19,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-19 14:19:19,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2024-02-19 14:19:19,197 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5411764705882353 [2024-02-19 14:19:19,199 INFO L308 CegarLoopForPetriNet]: 19 programPoint places, 18 predicate places. [2024-02-19 14:19:19,199 INFO L507 AbstractCegarLoop]: Abstraction has has 37 places, 54 transitions, 671 flow [2024-02-19 14:19:19,200 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-19 14:19:19,200 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:19:19,200 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:19:19,200 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-19 14:19:19,200 INFO L432 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 14:19:19,200 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:19:19,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1126895040, now seen corresponding path program 1 times [2024-02-19 14:19:19,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:19:19,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925853091] [2024-02-19 14:19:19,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:19:19,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:19:19,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:19:19,539 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:19:19,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:19:19,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925853091] [2024-02-19 14:19:19,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925853091] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 14:19:19,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990873629] [2024-02-19 14:19:19,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:19:19,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 14:19:19,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 14:19:19,542 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 14:19:19,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-02-19 14:19:19,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:19:19,644 INFO L262 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 9 conjunts are in the unsatisfiable core [2024-02-19 14:19:19,647 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 14:19:21,508 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:19:21,508 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 14:19:21,934 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:19:21,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [990873629] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 14:19:21,935 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 14:19:21,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2024-02-19 14:19:21,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003056828] [2024-02-19 14:19:21,935 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 14:19:21,936 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-02-19 14:19:21,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:19:21,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-02-19 14:19:21,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-02-19 14:19:21,937 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 17 [2024-02-19 14:19:21,937 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-19 14:19:21,937 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:19:21,937 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 17 [2024-02-19 14:19:21,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:19:23,376 INFO L124 PetriNetUnfolderBase]: 149/290 cut-off events. [2024-02-19 14:19:23,376 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2024-02-19 14:19:23,377 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-19 14:19:23,379 INFO L140 encePairwiseOnDemand]: 11/17 looper letters, 94 selfloop transitions, 35 changer transitions 38/168 dead transitions. [2024-02-19 14:19:23,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 168 transitions, 2436 flow [2024-02-19 14:19:23,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-02-19 14:19:23,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-02-19 14:19:23,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 136 transitions. [2024-02-19 14:19:23,382 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6153846153846154 [2024-02-19 14:19:23,382 INFO L308 CegarLoopForPetriNet]: 19 programPoint places, 30 predicate places. [2024-02-19 14:19:23,383 INFO L507 AbstractCegarLoop]: Abstraction has has 49 places, 168 transitions, 2436 flow [2024-02-19 14:19:23,383 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-19 14:19:23,383 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:19:23,383 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:19:23,400 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-02-19 14:19:23,600 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-02-19 14:19:23,601 INFO L432 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 14:19:23,602 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:19:23,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1544579584, now seen corresponding path program 2 times [2024-02-19 14:19:23,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:19:23,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673025733] [2024-02-19 14:19:23,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:19:23,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:19:23,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:19:23,792 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:19:23,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:19:23,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673025733] [2024-02-19 14:19:23,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673025733] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 14:19:23,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2096719602] [2024-02-19 14:19:23,793 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-19 14:19:23,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 14:19:23,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 14:19:23,795 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 14:19:23,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-02-19 14:19:23,865 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-19 14:19:23,865 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 14:19:23,866 INFO L262 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 10 conjunts are in the unsatisfiable core [2024-02-19 14:19:23,867 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 14:19:30,458 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:19:30,459 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 14:19:33,136 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:19:33,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2096719602] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 14:19:33,136 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 14:19:33,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2024-02-19 14:19:33,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824519026] [2024-02-19 14:19:33,137 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 14:19:33,137 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-02-19 14:19:33,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:19:33,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-02-19 14:19:33,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2024-02-19 14:19:33,138 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 17 [2024-02-19 14:19:33,138 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-19 14:19:33,138 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:19:33,138 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 17 [2024-02-19 14:19:33,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:19:37,157 INFO L124 PetriNetUnfolderBase]: 239/455 cut-off events. [2024-02-19 14:19:37,157 INFO L125 PetriNetUnfolderBase]: For 75/75 co-relation queries the response was YES. [2024-02-19 14:19:37,158 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-19 14:19:37,161 INFO L140 encePairwiseOnDemand]: 11/17 looper letters, 147 selfloop transitions, 56 changer transitions 62/266 dead transitions. [2024-02-19 14:19:37,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 266 transitions, 4380 flow [2024-02-19 14:19:37,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-02-19 14:19:37,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2024-02-19 14:19:37,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 160 transitions. [2024-02-19 14:19:37,163 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5536332179930796 [2024-02-19 14:19:37,164 INFO L308 CegarLoopForPetriNet]: 19 programPoint places, 46 predicate places. [2024-02-19 14:19:37,164 INFO L507 AbstractCegarLoop]: Abstraction has has 65 places, 266 transitions, 4380 flow [2024-02-19 14:19:37,164 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-19 14:19:37,164 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:19:37,164 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:19:37,176 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-02-19 14:19:37,364 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-19 14:19:37,365 INFO L432 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 14:19:37,365 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:19:37,365 INFO L85 PathProgramCache]: Analyzing trace with hash 479557864, now seen corresponding path program 3 times [2024-02-19 14:19:37,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:19:37,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031153970] [2024-02-19 14:19:37,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:19:37,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:19:37,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:19:37,454 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:19:37,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:19:37,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031153970] [2024-02-19 14:19:37,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031153970] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 14:19:37,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [472667122] [2024-02-19 14:19:37,455 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-02-19 14:19:37,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 14:19:37,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 14:19:37,456 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 14:19:37,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-02-19 14:19:37,644 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-02-19 14:19:37,644 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 14:19:37,645 INFO L262 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core [2024-02-19 14:19:37,646 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 14:19:42,368 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:19:42,368 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 14:19:42,566 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:19:42,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [472667122] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 14:19:42,566 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 14:19:42,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 7] total 14 [2024-02-19 14:19:42,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489954380] [2024-02-19 14:19:42,566 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 14:19:42,566 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-02-19 14:19:42,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:19:42,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-02-19 14:19:42,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2024-02-19 14:19:42,567 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 17 [2024-02-19 14:19:42,567 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-19 14:19:42,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:19:42,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 17 [2024-02-19 14:19:42,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:19:46,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-19 14:19:49,477 INFO L124 PetriNetUnfolderBase]: 299/575 cut-off events. [2024-02-19 14:19:49,477 INFO L125 PetriNetUnfolderBase]: For 95/95 co-relation queries the response was YES. [2024-02-19 14:19:49,478 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-19 14:19:49,482 INFO L140 encePairwiseOnDemand]: 11/17 looper letters, 187 selfloop transitions, 45 changer transitions 105/338 dead transitions. [2024-02-19 14:19:49,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 338 transitions, 6248 flow [2024-02-19 14:19:49,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-02-19 14:19:49,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-02-19 14:19:49,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 122 transitions. [2024-02-19 14:19:49,484 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5980392156862745 [2024-02-19 14:19:49,484 INFO L308 CegarLoopForPetriNet]: 19 programPoint places, 57 predicate places. [2024-02-19 14:19:49,485 INFO L507 AbstractCegarLoop]: Abstraction has has 76 places, 338 transitions, 6248 flow [2024-02-19 14:19:49,485 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-19 14:19:49,485 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:19:49,485 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:19:49,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-02-19 14:19:49,700 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-19 14:19:49,700 INFO L432 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 14:19:49,701 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:19:49,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1952274422, now seen corresponding path program 4 times [2024-02-19 14:19:49,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:19:49,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696898647] [2024-02-19 14:19:49,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:19:49,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:19:49,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:19:49,781 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:19:49,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:19:49,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696898647] [2024-02-19 14:19:49,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696898647] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 14:19:49,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [332795542] [2024-02-19 14:19:49,786 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-02-19 14:19:49,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 14:19:49,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 14:19:49,787 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 14:19:49,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-02-19 14:19:50,014 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-02-19 14:19:50,014 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 14:19:50,015 INFO L262 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 12 conjunts are in the unsatisfiable core [2024-02-19 14:19:50,016 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 14:19:51,606 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:19:51,607 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 14:19:51,983 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:19:51,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [332795542] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 14:19:51,984 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 14:19:51,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 7] total 15 [2024-02-19 14:19:51,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878456491] [2024-02-19 14:19:51,984 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 14:19:51,984 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-02-19 14:19:51,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:19:51,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-02-19 14:19:51,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2024-02-19 14:19:51,985 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 17 [2024-02-19 14:19:51,985 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-19 14:19:51,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:19:51,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 17 [2024-02-19 14:19:51,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:19:58,276 INFO L124 PetriNetUnfolderBase]: 544/1102 cut-off events. [2024-02-19 14:19:58,277 INFO L125 PetriNetUnfolderBase]: For 178/178 co-relation queries the response was YES. [2024-02-19 14:19:58,278 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-19 14:19:58,286 INFO L140 encePairwiseOnDemand]: 11/17 looper letters, 348 selfloop transitions, 139 changer transitions 175/663 dead transitions. [2024-02-19 14:19:58,286 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 663 transitions, 13623 flow [2024-02-19 14:19:58,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-02-19 14:19:58,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2024-02-19 14:19:58,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 236 transitions. [2024-02-19 14:19:58,287 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6035805626598465 [2024-02-19 14:19:58,288 INFO L308 CegarLoopForPetriNet]: 19 programPoint places, 78 predicate places. [2024-02-19 14:19:58,288 INFO L507 AbstractCegarLoop]: Abstraction has has 97 places, 663 transitions, 13623 flow [2024-02-19 14:19:58,288 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-19 14:19:58,288 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:19:58,288 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:19:58,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-02-19 14:19:58,496 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-19 14:19:58,496 INFO L432 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 14:19:58,496 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:19:58,496 INFO L85 PathProgramCache]: Analyzing trace with hash 2078954120, now seen corresponding path program 5 times [2024-02-19 14:19:58,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:19:58,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669423108] [2024-02-19 14:19:58,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:19:58,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:19:58,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:19:58,574 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:19:58,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:19:58,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669423108] [2024-02-19 14:19:58,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669423108] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 14:19:58,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1561594904] [2024-02-19 14:19:58,575 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-02-19 14:19:58,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 14:19:58,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 14:19:58,576 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 14:19:58,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-02-19 14:19:58,859 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2024-02-19 14:19:58,859 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 14:19:58,860 INFO L262 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core [2024-02-19 14:19:58,861 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 14:19:59,453 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:19:59,454 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 14:19:59,664 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:19:59,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1561594904] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 14:19:59,665 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 14:19:59,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 7] total 14 [2024-02-19 14:19:59,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845918712] [2024-02-19 14:19:59,665 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 14:19:59,665 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-02-19 14:19:59,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:19:59,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-02-19 14:19:59,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2024-02-19 14:19:59,666 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 17 [2024-02-19 14:19:59,667 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-19 14:19:59,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:19:59,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 17 [2024-02-19 14:19:59,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:20:03,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-19 14:20:05,387 INFO L124 PetriNetUnfolderBase]: 638/1312 cut-off events. [2024-02-19 14:20:05,387 INFO L125 PetriNetUnfolderBase]: For 230/230 co-relation queries the response was YES. [2024-02-19 14:20:05,388 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-19 14:20:05,396 INFO L140 encePairwiseOnDemand]: 11/17 looper letters, 528 selfloop transitions, 52 changer transitions 213/794 dead transitions. [2024-02-19 14:20:05,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 794 transitions, 17913 flow [2024-02-19 14:20:05,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-02-19 14:20:05,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-02-19 14:20:05,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 112 transitions. [2024-02-19 14:20:05,398 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5989304812834224 [2024-02-19 14:20:05,398 INFO L308 CegarLoopForPetriNet]: 19 programPoint places, 88 predicate places. [2024-02-19 14:20:05,398 INFO L507 AbstractCegarLoop]: Abstraction has has 107 places, 794 transitions, 17913 flow [2024-02-19 14:20:05,398 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-19 14:20:05,398 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:20:05,398 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:20:05,409 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-02-19 14:20:05,599 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-19 14:20:05,599 INFO L432 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-19 14:20:05,599 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:20:05,599 INFO L85 PathProgramCache]: Analyzing trace with hash -593527516, now seen corresponding path program 6 times [2024-02-19 14:20:05,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:20:05,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527064064] [2024-02-19 14:20:05,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:20:05,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:20:05,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:20:05,681 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:20:05,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:20:05,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527064064] [2024-02-19 14:20:05,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527064064] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 14:20:05,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1978567551] [2024-02-19 14:20:05,682 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-02-19 14:20:05,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 14:20:05,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 14:20:05,683 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 14:20:05,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-02-19 14:20:05,841 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2024-02-19 14:20:05,841 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 14:20:05,842 INFO L262 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 11 conjunts are in the unsatisfiable core [2024-02-19 14:20:05,842 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 14:20:24,460 WARN L293 SmtUtils]: Spent 8.53s on a formula simplification. DAG size of input: 11 DAG size of output: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-02-19 14:20:25,202 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:20:25,202 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 14:20:26,264 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:20:26,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1978567551] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 14:20:26,264 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 14:20:26,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 7] total 14 [2024-02-19 14:20:26,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185722166] [2024-02-19 14:20:26,264 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 14:20:26,265 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-02-19 14:20:26,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:20:26,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-02-19 14:20:26,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=152, Unknown=1, NotChecked=0, Total=210 [2024-02-19 14:20:26,265 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 17 [2024-02-19 14:20:26,265 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-19 14:20:26,265 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:20:26,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 17 [2024-02-19 14:20:26,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:20:31,236 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.56s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-19 14:20:32,919 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-19 14:20:37,439 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.61s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-19 14:20:40,213 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.77s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-19 14:20:44,799 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.41s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-19 14:20:47,590 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.79s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-19 14:20:48,073 INFO L124 PetriNetUnfolderBase]: 684/1395 cut-off events. [2024-02-19 14:20:48,073 INFO L125 PetriNetUnfolderBase]: For 222/222 co-relation queries the response was YES. [2024-02-19 14:20:48,074 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-19 14:20:48,084 INFO L140 encePairwiseOnDemand]: 11/17 looper letters, 457 selfloop transitions, 100 changer transitions 284/842 dead transitions. [2024-02-19 14:20:48,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 842 transitions, 20675 flow [2024-02-19 14:20:48,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-02-19 14:20:48,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2024-02-19 14:20:48,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 184 transitions. [2024-02-19 14:20:48,085 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5411764705882353 [2024-02-19 14:20:48,086 INFO L308 CegarLoopForPetriNet]: 19 programPoint places, 106 predicate places. [2024-02-19 14:20:48,086 INFO L507 AbstractCegarLoop]: Abstraction has has 125 places, 842 transitions, 20675 flow [2024-02-19 14:20:48,086 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-19 14:20:48,086 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:20:48,086 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:20:48,100 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-19 14:20:48,297 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-19 14:20:48,300 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-19 14:20:48,300 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:20:48,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1921638976, now seen corresponding path program 7 times [2024-02-19 14:20:48,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:20:48,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586456897] [2024-02-19 14:20:48,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:20:48,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:20:48,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:20:48,925 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:20:48,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:20:48,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586456897] [2024-02-19 14:20:48,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586456897] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 14:20:48,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [706192618] [2024-02-19 14:20:48,926 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-02-19 14:20:48,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 14:20:48,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 14:20:48,928 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 14:20:48,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-02-19 14:20:49,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:20:49,881 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 14 conjunts are in the unsatisfiable core [2024-02-19 14:20:49,882 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 14:21:01,964 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:21:01,964 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 14:21:08,660 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:21:08,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [706192618] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 14:21:08,660 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 14:21:08,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2024-02-19 14:21:08,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21813260] [2024-02-19 14:21:08,660 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 14:21:08,660 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-02-19 14:21:08,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:21:08,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-02-19 14:21:08,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2024-02-19 14:21:08,661 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 17 [2024-02-19 14:21:08,661 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-19 14:21:08,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:21:08,662 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 17 [2024-02-19 14:21:08,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:21:37,357 WARN L293 SmtUtils]: Spent 17.84s on a formula simplification. DAG size of input: 94 DAG size of output: 59 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-02-19 14:21:44,388 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-19 14:21:47,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-19 14:21:56,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.63s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-19 14:22:00,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-02-19 14:22:07,521 INFO L124 PetriNetUnfolderBase]: 814/1703 cut-off events. [2024-02-19 14:22:07,521 INFO L125 PetriNetUnfolderBase]: For 303/303 co-relation queries the response was YES. [2024-02-19 14:22:07,522 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 11224 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-19 14:22:07,534 INFO L140 encePairwiseOnDemand]: 11/17 looper letters, 537 selfloop transitions, 145 changer transitions 348/1031 dead transitions. [2024-02-19 14:22:07,534 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 1031 transitions, 27406 flow [2024-02-19 14:22:07,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-02-19 14:22:07,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2024-02-19 14:22:07,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 252 transitions. [2024-02-19 14:22:07,536 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5294117647058824 [2024-02-19 14:22:07,541 INFO L308 CegarLoopForPetriNet]: 19 programPoint places, 133 predicate places. [2024-02-19 14:22:07,541 INFO L507 AbstractCegarLoop]: Abstraction has has 152 places, 1031 transitions, 27406 flow [2024-02-19 14:22:07,543 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-19 14:22:07,543 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:22:07,543 INFO L234 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:22:07,557 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-02-19 14:22:07,755 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-19 14:22:07,755 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-19 14:22:07,756 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:22:07,756 INFO L85 PathProgramCache]: Analyzing trace with hash 790522596, now seen corresponding path program 8 times [2024-02-19 14:22:07,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:22:07,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815920733] [2024-02-19 14:22:07,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:22:07,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:22:07,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:22:08,259 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:22:08,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:22:08,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815920733] [2024-02-19 14:22:08,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815920733] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 14:22:08,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2097971274] [2024-02-19 14:22:08,259 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-19 14:22:08,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 14:22:08,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 14:22:08,260 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-02-19 14:22:08,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-02-19 14:22:08,515 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-19 14:22:08,515 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 14:22:08,516 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 11 conjunts are in the unsatisfiable core [2024-02-19 14:22:08,517 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 14:22:09,564 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:22:09,564 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 14:22:09,930 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:22:09,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2097971274] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 14:22:09,930 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 14:22:09,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 16 [2024-02-19 14:22:09,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012628571] [2024-02-19 14:22:09,930 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 14:22:09,930 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-02-19 14:22:09,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:22:09,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-02-19 14:22:09,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2024-02-19 14:22:09,931 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 17 [2024-02-19 14:22:09,932 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-19 14:22:09,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:22:09,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 17 [2024-02-19 14:22:09,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:22:14,880 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.75s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-19 14:22:19,411 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-19 14:22:20,805 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-19 14:22:28,769 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-02-19 14:22:30,420 INFO L124 PetriNetUnfolderBase]: 960/2007 cut-off events. [2024-02-19 14:22:30,420 INFO L125 PetriNetUnfolderBase]: For 369/369 co-relation queries the response was YES. [2024-02-19 14:22:30,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28006 conditions, 2007 events. 960/2007 cut-off events. For 369/369 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 13819 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-19 14:22:30,432 INFO L140 encePairwiseOnDemand]: 12/17 looper letters, 753 selfloop transitions, 61 changer transitions 404/1219 dead transitions. [2024-02-19 14:22:30,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 1219 transitions, 34838 flow [2024-02-19 14:22:30,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-02-19 14:22:30,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-02-19 14:22:30,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 129 transitions. [2024-02-19 14:22:30,433 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.583710407239819 [2024-02-19 14:22:30,434 INFO L308 CegarLoopForPetriNet]: 19 programPoint places, 145 predicate places. [2024-02-19 14:22:30,434 INFO L507 AbstractCegarLoop]: Abstraction has has 164 places, 1219 transitions, 34838 flow [2024-02-19 14:22:30,434 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-19 14:22:30,434 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:22:30,434 INFO L234 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:22:30,448 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-02-19 14:22:30,645 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-19 14:22:30,646 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-19 14:22:30,646 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:22:30,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1907948096, now seen corresponding path program 9 times [2024-02-19 14:22:30,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:22:30,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578909975] [2024-02-19 14:22:30,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:22:30,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:22:30,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Killed by 15