./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/parallel-misc-2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a340643f 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/parallel-misc-2.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 387afe7095db5eeb3a9188bc3fe181fa803bb62f73944f6d781c5c9340fce39e --- Real Ultimate output --- This is Ultimate 0.2.4-dev-a340643-m [2024-01-27 15:31:29,325 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-01-27 15:31:29,394 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-01-27 15:31:29,399 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-01-27 15:31:29,400 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-01-27 15:31:29,444 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-01-27 15:31:29,446 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-01-27 15:31:29,456 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-01-27 15:31:29,457 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-01-27 15:31:29,462 INFO L153 SettingsManager]: * Use memory slicer=true [2024-01-27 15:31:29,463 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-01-27 15:31:29,463 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-01-27 15:31:29,464 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-01-27 15:31:29,465 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-01-27 15:31:29,466 INFO L153 SettingsManager]: * Use SBE=true [2024-01-27 15:31:29,466 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-01-27 15:31:29,466 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-01-27 15:31:29,466 INFO L153 SettingsManager]: * sizeof long=4 [2024-01-27 15:31:29,467 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-01-27 15:31:29,467 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-01-27 15:31:29,467 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-01-27 15:31:29,468 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-01-27 15:31:29,468 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-01-27 15:31:29,468 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-01-27 15:31:29,469 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-01-27 15:31:29,469 INFO L153 SettingsManager]: * sizeof long double=12 [2024-01-27 15:31:29,469 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-01-27 15:31:29,469 INFO L153 SettingsManager]: * Use constant arrays=true [2024-01-27 15:31:29,470 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-01-27 15:31:29,470 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-01-27 15:31:29,471 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-01-27 15:31:29,471 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-01-27 15:31:29,471 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 15:31:29,472 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-01-27 15:31:29,472 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-01-27 15:31:29,472 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-01-27 15:31:29,472 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-01-27 15:31:29,472 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-01-27 15:31:29,473 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-01-27 15:31:29,473 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-01-27 15:31:29,473 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-01-27 15:31:29,473 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-01-27 15:31:29,474 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-01-27 15:31:29,474 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 -> 387afe7095db5eeb3a9188bc3fe181fa803bb62f73944f6d781c5c9340fce39e [2024-01-27 15:31:29,729 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-01-27 15:31:29,753 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-01-27 15:31:29,755 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-01-27 15:31:29,756 INFO L270 PluginConnector]: Initializing CDTParser... [2024-01-27 15:31:29,757 INFO L274 PluginConnector]: CDTParser initialized [2024-01-27 15:31:29,758 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-misc-2.wvr.c [2024-01-27 15:31:30,872 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-01-27 15:31:31,065 INFO L384 CDTParser]: Found 1 translation units. [2024-01-27 15:31:31,065 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-2.wvr.c [2024-01-27 15:31:31,072 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec90ac10c/2b130be976ed4cb1a38c2b83d1549364/FLAG52cd2abbc [2024-01-27 15:31:31,085 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec90ac10c/2b130be976ed4cb1a38c2b83d1549364 [2024-01-27 15:31:31,088 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-01-27 15:31:31,090 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-01-27 15:31:31,091 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-01-27 15:31:31,092 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-01-27 15:31:31,096 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-01-27 15:31:31,096 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 03:31:31" (1/1) ... [2024-01-27 15:31:31,099 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56558fc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:31:31, skipping insertion in model container [2024-01-27 15:31:31,099 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 03:31:31" (1/1) ... [2024-01-27 15:31:31,123 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-01-27 15:31:31,333 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/parallel-misc-2.wvr.c[2580,2593] [2024-01-27 15:31:31,343 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 15:31:31,353 INFO L202 MainTranslator]: Completed pre-run [2024-01-27 15:31:31,380 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/parallel-misc-2.wvr.c[2580,2593] [2024-01-27 15:31:31,383 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-01-27 15:31:31,396 INFO L206 MainTranslator]: Completed translation [2024-01-27 15:31:31,396 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:31:31 WrapperNode [2024-01-27 15:31:31,396 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-01-27 15:31:31,397 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-01-27 15:31:31,397 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-01-27 15:31:31,397 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-01-27 15:31:31,403 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:31:31" (1/1) ... [2024-01-27 15:31:31,426 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:31:31" (1/1) ... [2024-01-27 15:31:31,440 INFO L138 Inliner]: procedures = 21, calls = 28, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 71 [2024-01-27 15:31:31,440 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-01-27 15:31:31,441 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-01-27 15:31:31,441 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-01-27 15:31:31,441 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-01-27 15:31:31,457 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:31:31" (1/1) ... [2024-01-27 15:31:31,458 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:31:31" (1/1) ... [2024-01-27 15:31:31,460 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:31:31" (1/1) ... [2024-01-27 15:31:31,483 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-01-27 15:31:31,483 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:31:31" (1/1) ... [2024-01-27 15:31:31,484 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:31:31" (1/1) ... [2024-01-27 15:31:31,489 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:31:31" (1/1) ... [2024-01-27 15:31:31,498 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:31:31" (1/1) ... [2024-01-27 15:31:31,500 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:31:31" (1/1) ... [2024-01-27 15:31:31,500 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:31:31" (1/1) ... [2024-01-27 15:31:31,502 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-01-27 15:31:31,503 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-01-27 15:31:31,503 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-01-27 15:31:31,503 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-01-27 15:31:31,504 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:31:31" (1/1) ... [2024-01-27 15:31:31,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-01-27 15:31:31,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:31:31,537 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-01-27 15:31:31,538 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-01-27 15:31:31,575 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-01-27 15:31:31,575 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-01-27 15:31:31,575 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-01-27 15:31:31,576 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-01-27 15:31:31,576 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-01-27 15:31:31,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-01-27 15:31:31,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-01-27 15:31:31,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-01-27 15:31:31,576 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-01-27 15:31:31,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-01-27 15:31:31,576 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-01-27 15:31:31,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-01-27 15:31:31,577 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-01-27 15:31:31,577 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-01-27 15:31:31,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-01-27 15:31:31,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-01-27 15:31:31,578 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-01-27 15:31:31,578 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-01-27 15:31:31,579 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-01-27 15:31:31,579 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-01-27 15:31:31,580 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-01-27 15:31:31,661 INFO L244 CfgBuilder]: Building ICFG [2024-01-27 15:31:31,663 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-01-27 15:31:31,876 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-01-27 15:31:31,876 INFO L293 CfgBuilder]: Performing block encoding [2024-01-27 15:31:32,000 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-01-27 15:31:32,000 INFO L320 CfgBuilder]: Removed 2 assume(true) statements. [2024-01-27 15:31:32,000 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 03:31:32 BoogieIcfgContainer [2024-01-27 15:31:32,001 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-01-27 15:31:32,003 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-01-27 15:31:32,003 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-01-27 15:31:32,005 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-01-27 15:31:32,006 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 03:31:31" (1/3) ... [2024-01-27 15:31:32,006 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7af4e673 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 03:31:32, skipping insertion in model container [2024-01-27 15:31:32,006 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 03:31:31" (2/3) ... [2024-01-27 15:31:32,007 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7af4e673 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 03:31:32, skipping insertion in model container [2024-01-27 15:31:32,007 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 03:31:32" (3/3) ... [2024-01-27 15:31:32,008 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-misc-2.wvr.c [2024-01-27 15:31:32,016 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-01-27 15:31:32,023 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-01-27 15:31:32,023 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-01-27 15:31:32,023 INFO L518 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-01-27 15:31:32,063 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-01-27 15:31:32,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 29 transitions, 72 flow [2024-01-27 15:31:32,129 INFO L124 PetriNetUnfolderBase]: 4/27 cut-off events. [2024-01-27 15:31:32,129 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-01-27 15:31:32,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 27 events. 4/27 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 44 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 21. Up to 2 conditions per place. [2024-01-27 15:31:32,132 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 29 transitions, 72 flow [2024-01-27 15:31:32,134 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 26 transitions, 64 flow [2024-01-27 15:31:32,143 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-01-27 15:31:32,149 INFO L357 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=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6225e4ba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-01-27 15:31:32,149 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-01-27 15:31:32,158 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-01-27 15:31:32,158 INFO L124 PetriNetUnfolderBase]: 4/25 cut-off events. [2024-01-27 15:31:32,158 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-01-27 15:31:32,159 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:31:32,159 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:31:32,160 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 15:31:32,164 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:31:32,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1683761517, now seen corresponding path program 1 times [2024-01-27 15:31:32,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:31:32,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572602130] [2024-01-27 15:31:32,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:31:32,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:31:32,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:31:32,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:31:32,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:31:32,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572602130] [2024-01-27 15:31:32,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572602130] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:31:32,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:31:32,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-01-27 15:31:32,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866244384] [2024-01-27 15:31:32,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:31:32,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-01-27 15:31:32,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:31:32,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-01-27 15:31:32,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-01-27 15:31:32,628 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 29 [2024-01-27 15:31:32,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 26 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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-01-27 15:31:32,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:31:32,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 29 [2024-01-27 15:31:32,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:31:32,784 INFO L124 PetriNetUnfolderBase]: 140/271 cut-off events. [2024-01-27 15:31:32,785 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2024-01-27 15:31:32,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 499 conditions, 271 events. 140/271 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1045 event pairs, 13 based on Foata normal form. 1/230 useless extension candidates. Maximal degree in co-relation 404. Up to 178 conditions per place. [2024-01-27 15:31:32,791 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 23 selfloop transitions, 5 changer transitions 1/38 dead transitions. [2024-01-27 15:31:32,792 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 38 transitions, 155 flow [2024-01-27 15:31:32,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-01-27 15:31:32,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-01-27 15:31:32,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2024-01-27 15:31:32,803 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7241379310344828 [2024-01-27 15:31:32,804 INFO L175 Difference]: Start difference. First operand has 29 places, 26 transitions, 64 flow. Second operand 3 states and 63 transitions. [2024-01-27 15:31:32,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 38 transitions, 155 flow [2024-01-27 15:31:32,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 38 transitions, 141 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-01-27 15:31:32,810 INFO L231 Difference]: Finished difference. Result has 28 places, 30 transitions, 89 flow [2024-01-27 15:31:32,812 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=89, PETRI_PLACES=28, PETRI_TRANSITIONS=30} [2024-01-27 15:31:32,815 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, -1 predicate places. [2024-01-27 15:31:32,816 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 30 transitions, 89 flow [2024-01-27 15:31:32,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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-01-27 15:31:32,816 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:31:32,816 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:31:32,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-01-27 15:31:32,817 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 15:31:32,818 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:31:32,818 INFO L85 PathProgramCache]: Analyzing trace with hash -547186125, now seen corresponding path program 1 times [2024-01-27 15:31:32,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:31:32,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296491327] [2024-01-27 15:31:32,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:31:32,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:31:32,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:31:32,964 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:31:32,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:31:32,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296491327] [2024-01-27 15:31:32,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296491327] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:31:32,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:31:32,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 15:31:32,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079891305] [2024-01-27 15:31:32,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:31:32,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 15:31:32,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:31:32,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 15:31:32,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 15:31:32,972 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 29 [2024-01-27 15:31:32,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 30 transitions, 89 flow. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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-01-27 15:31:32,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:31:32,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 29 [2024-01-27 15:31:32,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:31:33,139 INFO L124 PetriNetUnfolderBase]: 183/337 cut-off events. [2024-01-27 15:31:33,140 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2024-01-27 15:31:33,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 716 conditions, 337 events. 183/337 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1411 event pairs, 17 based on Foata normal form. 0/248 useless extension candidates. Maximal degree in co-relation 358. Up to 129 conditions per place. [2024-01-27 15:31:33,147 INFO L140 encePairwiseOnDemand]: 22/29 looper letters, 37 selfloop transitions, 9 changer transitions 3/60 dead transitions. [2024-01-27 15:31:33,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 60 transitions, 262 flow [2024-01-27 15:31:33,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 15:31:33,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 15:31:33,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 103 transitions. [2024-01-27 15:31:33,152 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7103448275862069 [2024-01-27 15:31:33,152 INFO L175 Difference]: Start difference. First operand has 28 places, 30 transitions, 89 flow. Second operand 5 states and 103 transitions. [2024-01-27 15:31:33,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 60 transitions, 262 flow [2024-01-27 15:31:33,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 60 transitions, 255 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-01-27 15:31:33,159 INFO L231 Difference]: Finished difference. Result has 34 places, 37 transitions, 141 flow [2024-01-27 15:31:33,159 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=141, PETRI_PLACES=34, PETRI_TRANSITIONS=37} [2024-01-27 15:31:33,160 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 5 predicate places. [2024-01-27 15:31:33,160 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 37 transitions, 141 flow [2024-01-27 15:31:33,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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-01-27 15:31:33,160 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:31:33,161 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:31:33,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-01-27 15:31:33,164 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 15:31:33,167 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:31:33,167 INFO L85 PathProgramCache]: Analyzing trace with hash 995437461, now seen corresponding path program 2 times [2024-01-27 15:31:33,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:31:33,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513513741] [2024-01-27 15:31:33,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:31:33,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:31:33,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:31:33,340 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:31:33,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:31:33,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513513741] [2024-01-27 15:31:33,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513513741] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:31:33,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:31:33,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 15:31:33,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493634223] [2024-01-27 15:31:33,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:31:33,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 15:31:33,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:31:33,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 15:31:33,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 15:31:33,352 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 29 [2024-01-27 15:31:33,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 37 transitions, 141 flow. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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-01-27 15:31:33,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:31:33,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 29 [2024-01-27 15:31:33,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:31:33,487 INFO L124 PetriNetUnfolderBase]: 172/354 cut-off events. [2024-01-27 15:31:33,487 INFO L125 PetriNetUnfolderBase]: For 215/219 co-relation queries the response was YES. [2024-01-27 15:31:33,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 887 conditions, 354 events. 172/354 cut-off events. For 215/219 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1577 event pairs, 13 based on Foata normal form. 18/332 useless extension candidates. Maximal degree in co-relation 248. Up to 86 conditions per place. [2024-01-27 15:31:33,491 INFO L140 encePairwiseOnDemand]: 22/29 looper letters, 41 selfloop transitions, 12 changer transitions 3/67 dead transitions. [2024-01-27 15:31:33,491 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 67 transitions, 359 flow [2024-01-27 15:31:33,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 15:31:33,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 15:31:33,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 105 transitions. [2024-01-27 15:31:33,497 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7241379310344828 [2024-01-27 15:31:33,497 INFO L175 Difference]: Start difference. First operand has 34 places, 37 transitions, 141 flow. Second operand 5 states and 105 transitions. [2024-01-27 15:31:33,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 67 transitions, 359 flow [2024-01-27 15:31:33,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 67 transitions, 359 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-01-27 15:31:33,501 INFO L231 Difference]: Finished difference. Result has 42 places, 42 transitions, 227 flow [2024-01-27 15:31:33,501 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=227, PETRI_PLACES=42, PETRI_TRANSITIONS=42} [2024-01-27 15:31:33,502 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 13 predicate places. [2024-01-27 15:31:33,502 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 42 transitions, 227 flow [2024-01-27 15:31:33,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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-01-27 15:31:33,503 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:31:33,503 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:31:33,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-01-27 15:31:33,504 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 15:31:33,504 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:31:33,504 INFO L85 PathProgramCache]: Analyzing trace with hash 267782639, now seen corresponding path program 1 times [2024-01-27 15:31:33,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:31:33,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325849601] [2024-01-27 15:31:33,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:31:33,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:31:33,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:31:33,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:31:33,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:31:33,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325849601] [2024-01-27 15:31:33,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325849601] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:31:33,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:31:33,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 15:31:33,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600947280] [2024-01-27 15:31:33,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:31:33,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 15:31:33,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:31:33,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 15:31:33,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 15:31:33,640 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 29 [2024-01-27 15:31:33,640 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 42 transitions, 227 flow. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 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-01-27 15:31:33,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:31:33,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 29 [2024-01-27 15:31:33,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:31:33,752 INFO L124 PetriNetUnfolderBase]: 169/337 cut-off events. [2024-01-27 15:31:33,752 INFO L125 PetriNetUnfolderBase]: For 653/677 co-relation queries the response was YES. [2024-01-27 15:31:33,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1123 conditions, 337 events. 169/337 cut-off events. For 653/677 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1481 event pairs, 17 based on Foata normal form. 12/310 useless extension candidates. Maximal degree in co-relation 333. Up to 158 conditions per place. [2024-01-27 15:31:33,755 INFO L140 encePairwiseOnDemand]: 22/29 looper letters, 45 selfloop transitions, 8 changer transitions 4/68 dead transitions. [2024-01-27 15:31:33,756 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 68 transitions, 447 flow [2024-01-27 15:31:33,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 15:31:33,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 15:31:33,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 102 transitions. [2024-01-27 15:31:33,757 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7034482758620689 [2024-01-27 15:31:33,757 INFO L175 Difference]: Start difference. First operand has 42 places, 42 transitions, 227 flow. Second operand 5 states and 102 transitions. [2024-01-27 15:31:33,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 68 transitions, 447 flow [2024-01-27 15:31:33,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 68 transitions, 443 flow, removed 2 selfloop flow, removed 0 redundant places. [2024-01-27 15:31:33,762 INFO L231 Difference]: Finished difference. Result has 48 places, 45 transitions, 274 flow [2024-01-27 15:31:33,762 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=274, PETRI_PLACES=48, PETRI_TRANSITIONS=45} [2024-01-27 15:31:33,763 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 19 predicate places. [2024-01-27 15:31:33,763 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 45 transitions, 274 flow [2024-01-27 15:31:33,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 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-01-27 15:31:33,763 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:31:33,764 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:31:33,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-01-27 15:31:33,764 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 15:31:33,764 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:31:33,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1954630385, now seen corresponding path program 2 times [2024-01-27 15:31:33,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:31:33,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650346371] [2024-01-27 15:31:33,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:31:33,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:31:33,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:31:33,862 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:31:33,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:31:33,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650346371] [2024-01-27 15:31:33,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650346371] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:31:33,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:31:33,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-01-27 15:31:33,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56847301] [2024-01-27 15:31:33,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:31:33,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 15:31:33,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:31:33,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 15:31:33,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 15:31:33,870 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 29 [2024-01-27 15:31:33,870 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 45 transitions, 274 flow. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 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-01-27 15:31:33,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:31:33,870 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 29 [2024-01-27 15:31:33,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:31:33,980 INFO L124 PetriNetUnfolderBase]: 155/328 cut-off events. [2024-01-27 15:31:33,981 INFO L125 PetriNetUnfolderBase]: For 670/678 co-relation queries the response was YES. [2024-01-27 15:31:33,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1085 conditions, 328 events. 155/328 cut-off events. For 670/678 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1313 event pairs, 15 based on Foata normal form. 16/308 useless extension candidates. Maximal degree in co-relation 769. Up to 91 conditions per place. [2024-01-27 15:31:33,984 INFO L140 encePairwiseOnDemand]: 22/29 looper letters, 41 selfloop transitions, 12 changer transitions 3/67 dead transitions. [2024-01-27 15:31:33,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 67 transitions, 490 flow [2024-01-27 15:31:33,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 15:31:33,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 15:31:33,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 98 transitions. [2024-01-27 15:31:33,986 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6758620689655173 [2024-01-27 15:31:33,986 INFO L175 Difference]: Start difference. First operand has 48 places, 45 transitions, 274 flow. Second operand 5 states and 98 transitions. [2024-01-27 15:31:33,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 67 transitions, 490 flow [2024-01-27 15:31:33,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 67 transitions, 474 flow, removed 6 selfloop flow, removed 1 redundant places. [2024-01-27 15:31:33,995 INFO L231 Difference]: Finished difference. Result has 54 places, 48 transitions, 337 flow [2024-01-27 15:31:33,995 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=337, PETRI_PLACES=54, PETRI_TRANSITIONS=48} [2024-01-27 15:31:33,997 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 25 predicate places. [2024-01-27 15:31:33,997 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 48 transitions, 337 flow [2024-01-27 15:31:33,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 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-01-27 15:31:33,997 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:31:33,998 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:31:33,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-01-27 15:31:33,998 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 15:31:33,999 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:31:34,003 INFO L85 PathProgramCache]: Analyzing trace with hash -922958189, now seen corresponding path program 1 times [2024-01-27 15:31:34,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:31:34,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399069801] [2024-01-27 15:31:34,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:31:34,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:31:34,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:31:34,236 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:31:34,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:31:34,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399069801] [2024-01-27 15:31:34,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399069801] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:31:34,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305814501] [2024-01-27 15:31:34,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:31:34,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:31:34,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:31:34,244 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-01-27 15:31:34,263 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-01-27 15:31:34,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:31:34,527 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 5 conjunts are in the unsatisfiable core [2024-01-27 15:31:34,531 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:31:34,689 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:31:34,689 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:31:34,867 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:31:34,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1305814501] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:31:34,867 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:31:34,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 11 [2024-01-27 15:31:34,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346571503] [2024-01-27 15:31:34,867 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:31:34,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-01-27 15:31:34,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:31:34,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-01-27 15:31:34,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-01-27 15:31:34,892 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 29 [2024-01-27 15:31:34,892 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 48 transitions, 337 flow. Second operand has 12 states, 12 states have (on average 12.5) internal successors, (150), 12 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:31:34,892 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:31:34,892 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 29 [2024-01-27 15:31:34,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:31:35,822 INFO L124 PetriNetUnfolderBase]: 619/1134 cut-off events. [2024-01-27 15:31:35,822 INFO L125 PetriNetUnfolderBase]: For 3562/3562 co-relation queries the response was YES. [2024-01-27 15:31:35,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4213 conditions, 1134 events. 619/1134 cut-off events. For 3562/3562 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 5035 event pairs, 16 based on Foata normal form. 70/1124 useless extension candidates. Maximal degree in co-relation 1614. Up to 329 conditions per place. [2024-01-27 15:31:35,832 INFO L140 encePairwiseOnDemand]: 18/29 looper letters, 147 selfloop transitions, 63 changer transitions 0/217 dead transitions. [2024-01-27 15:31:35,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 217 transitions, 1836 flow [2024-01-27 15:31:35,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-01-27 15:31:35,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2024-01-27 15:31:35,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 380 transitions. [2024-01-27 15:31:35,834 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6239737274220033 [2024-01-27 15:31:35,835 INFO L175 Difference]: Start difference. First operand has 54 places, 48 transitions, 337 flow. Second operand 21 states and 380 transitions. [2024-01-27 15:31:35,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 217 transitions, 1836 flow [2024-01-27 15:31:35,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 217 transitions, 1783 flow, removed 25 selfloop flow, removed 1 redundant places. [2024-01-27 15:31:35,845 INFO L231 Difference]: Finished difference. Result has 89 places, 94 transitions, 1038 flow [2024-01-27 15:31:35,845 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1038, PETRI_PLACES=89, PETRI_TRANSITIONS=94} [2024-01-27 15:31:35,846 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 60 predicate places. [2024-01-27 15:31:35,846 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 94 transitions, 1038 flow [2024-01-27 15:31:35,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 12.5) internal successors, (150), 12 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-01-27 15:31:35,846 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:31:35,847 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:31:35,868 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-01-27 15:31:36,060 WARN L477 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-01-27 15:31:36,061 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 15:31:36,061 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:31:36,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1862088175, now seen corresponding path program 2 times [2024-01-27 15:31:36,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:31:36,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193697213] [2024-01-27 15:31:36,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:31:36,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:31:36,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:31:36,182 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-01-27 15:31:36,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:31:36,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193697213] [2024-01-27 15:31:36,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193697213] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:31:36,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:31:36,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 15:31:36,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71634062] [2024-01-27 15:31:36,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:31:36,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 15:31:36,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:31:36,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 15:31:36,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 15:31:36,186 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 29 [2024-01-27 15:31:36,187 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 94 transitions, 1038 flow. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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-01-27 15:31:36,187 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:31:36,187 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 29 [2024-01-27 15:31:36,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:31:36,507 INFO L124 PetriNetUnfolderBase]: 1074/2251 cut-off events. [2024-01-27 15:31:36,507 INFO L125 PetriNetUnfolderBase]: For 17916/18008 co-relation queries the response was YES. [2024-01-27 15:31:36,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10660 conditions, 2251 events. 1074/2251 cut-off events. For 17916/18008 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 14192 event pairs, 338 based on Foata normal form. 22/1977 useless extension candidates. Maximal degree in co-relation 8872. Up to 506 conditions per place. [2024-01-27 15:31:36,531 INFO L140 encePairwiseOnDemand]: 26/29 looper letters, 121 selfloop transitions, 36 changer transitions 0/192 dead transitions. [2024-01-27 15:31:36,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 192 transitions, 2492 flow [2024-01-27 15:31:36,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 15:31:36,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 15:31:36,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2024-01-27 15:31:36,533 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7586206896551724 [2024-01-27 15:31:36,533 INFO L175 Difference]: Start difference. First operand has 89 places, 94 transitions, 1038 flow. Second operand 4 states and 88 transitions. [2024-01-27 15:31:36,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 192 transitions, 2492 flow [2024-01-27 15:31:36,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 192 transitions, 2353 flow, removed 63 selfloop flow, removed 3 redundant places. [2024-01-27 15:31:36,585 INFO L231 Difference]: Finished difference. Result has 92 places, 130 transitions, 1567 flow [2024-01-27 15:31:36,585 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=965, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1567, PETRI_PLACES=92, PETRI_TRANSITIONS=130} [2024-01-27 15:31:36,586 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 63 predicate places. [2024-01-27 15:31:36,586 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 130 transitions, 1567 flow [2024-01-27 15:31:36,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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-01-27 15:31:36,587 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:31:36,587 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:31:36,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-01-27 15:31:36,587 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 15:31:36,587 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:31:36,588 INFO L85 PathProgramCache]: Analyzing trace with hash -2130168599, now seen corresponding path program 1 times [2024-01-27 15:31:36,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:31:36,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064852820] [2024-01-27 15:31:36,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:31:36,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:31:36,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:31:36,710 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 15:31:36,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:31:36,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064852820] [2024-01-27 15:31:36,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064852820] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:31:36,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:31:36,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 15:31:36,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335448306] [2024-01-27 15:31:36,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:31:36,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 15:31:36,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:31:36,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 15:31:36,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 15:31:36,715 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 29 [2024-01-27 15:31:36,715 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 130 transitions, 1567 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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-01-27 15:31:36,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:31:36,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 29 [2024-01-27 15:31:36,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:31:37,511 INFO L124 PetriNetUnfolderBase]: 2500/5078 cut-off events. [2024-01-27 15:31:37,512 INFO L125 PetriNetUnfolderBase]: For 42274/42355 co-relation queries the response was YES. [2024-01-27 15:31:37,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24926 conditions, 5078 events. 2500/5078 cut-off events. For 42274/42355 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 37986 event pairs, 742 based on Foata normal form. 6/4768 useless extension candidates. Maximal degree in co-relation 21923. Up to 1555 conditions per place. [2024-01-27 15:31:37,563 INFO L140 encePairwiseOnDemand]: 26/29 looper letters, 218 selfloop transitions, 31 changer transitions 0/285 dead transitions. [2024-01-27 15:31:37,564 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 285 transitions, 4143 flow [2024-01-27 15:31:37,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 15:31:37,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 15:31:37,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2024-01-27 15:31:37,565 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.75 [2024-01-27 15:31:37,565 INFO L175 Difference]: Start difference. First operand has 92 places, 130 transitions, 1567 flow. Second operand 4 states and 87 transitions. [2024-01-27 15:31:37,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 285 transitions, 4143 flow [2024-01-27 15:31:37,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 285 transitions, 4130 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-01-27 15:31:37,663 INFO L231 Difference]: Finished difference. Result has 97 places, 161 transitions, 2101 flow [2024-01-27 15:31:37,663 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=1561, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2101, PETRI_PLACES=97, PETRI_TRANSITIONS=161} [2024-01-27 15:31:37,665 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 68 predicate places. [2024-01-27 15:31:37,665 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 161 transitions, 2101 flow [2024-01-27 15:31:37,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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-01-27 15:31:37,666 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:31:37,666 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:31:37,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-01-27 15:31:37,666 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 15:31:37,667 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:31:37,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1642725919, now seen corresponding path program 1 times [2024-01-27 15:31:37,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:31:37,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540793621] [2024-01-27 15:31:37,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:31:37,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:31:37,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:31:37,818 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-01-27 15:31:37,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:31:37,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540793621] [2024-01-27 15:31:37,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540793621] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:31:37,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:31:37,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 15:31:37,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749210919] [2024-01-27 15:31:37,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:31:37,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 15:31:37,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:31:37,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 15:31:37,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 15:31:37,825 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 29 [2024-01-27 15:31:37,825 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 161 transitions, 2101 flow. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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-01-27 15:31:37,825 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:31:37,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 29 [2024-01-27 15:31:37,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:31:38,389 INFO L124 PetriNetUnfolderBase]: 1555/3276 cut-off events. [2024-01-27 15:31:38,390 INFO L125 PetriNetUnfolderBase]: For 37198/37376 co-relation queries the response was YES. [2024-01-27 15:31:38,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18137 conditions, 3276 events. 1555/3276 cut-off events. For 37198/37376 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 22783 event pairs, 447 based on Foata normal form. 49/3167 useless extension candidates. Maximal degree in co-relation 15939. Up to 1026 conditions per place. [2024-01-27 15:31:38,427 INFO L140 encePairwiseOnDemand]: 27/29 looper letters, 148 selfloop transitions, 36 changer transitions 0/220 dead transitions. [2024-01-27 15:31:38,427 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 220 transitions, 3268 flow [2024-01-27 15:31:38,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 15:31:38,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 15:31:38,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2024-01-27 15:31:38,429 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7068965517241379 [2024-01-27 15:31:38,429 INFO L175 Difference]: Start difference. First operand has 97 places, 161 transitions, 2101 flow. Second operand 4 states and 82 transitions. [2024-01-27 15:31:38,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 220 transitions, 3268 flow [2024-01-27 15:31:38,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 220 transitions, 3268 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-01-27 15:31:38,497 INFO L231 Difference]: Finished difference. Result has 102 places, 147 transitions, 2014 flow [2024-01-27 15:31:38,498 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=1898, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2014, PETRI_PLACES=102, PETRI_TRANSITIONS=147} [2024-01-27 15:31:38,499 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 73 predicate places. [2024-01-27 15:31:38,499 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 147 transitions, 2014 flow [2024-01-27 15:31:38,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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-01-27 15:31:38,500 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:31:38,500 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:31:38,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-01-27 15:31:38,500 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 15:31:38,501 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:31:38,501 INFO L85 PathProgramCache]: Analyzing trace with hash 465846933, now seen corresponding path program 1 times [2024-01-27 15:31:38,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:31:38,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081799806] [2024-01-27 15:31:38,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:31:38,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:31:38,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:31:38,720 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:31:38,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:31:38,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081799806] [2024-01-27 15:31:38,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081799806] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:31:38,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60063906] [2024-01-27 15:31:38,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:31:38,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:31:38,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:31:38,724 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-01-27 15:31:38,744 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-01-27 15:31:38,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:31:38,805 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core [2024-01-27 15:31:38,807 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:31:38,885 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:31:38,886 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:31:38,961 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:31:38,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [60063906] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:31:38,961 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:31:38,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2024-01-27 15:31:38,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551173932] [2024-01-27 15:31:38,962 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:31:38,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-27 15:31:38,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:31:38,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-27 15:31:38,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-01-27 15:31:38,966 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 29 [2024-01-27 15:31:38,966 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 147 transitions, 2014 flow. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 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-01-27 15:31:38,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:31:38,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 29 [2024-01-27 15:31:38,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:31:39,996 INFO L124 PetriNetUnfolderBase]: 2735/5645 cut-off events. [2024-01-27 15:31:39,996 INFO L125 PetriNetUnfolderBase]: For 57208/57466 co-relation queries the response was YES. [2024-01-27 15:31:40,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31405 conditions, 5645 events. 2735/5645 cut-off events. For 57208/57466 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 42160 event pairs, 561 based on Foata normal form. 12/5544 useless extension candidates. Maximal degree in co-relation 26426. Up to 2384 conditions per place. [2024-01-27 15:31:40,208 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 288 selfloop transitions, 18 changer transitions 1/343 dead transitions. [2024-01-27 15:31:40,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 343 transitions, 5533 flow [2024-01-27 15:31:40,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-27 15:31:40,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-27 15:31:40,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 136 transitions. [2024-01-27 15:31:40,210 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7816091954022989 [2024-01-27 15:31:40,210 INFO L175 Difference]: Start difference. First operand has 102 places, 147 transitions, 2014 flow. Second operand 6 states and 136 transitions. [2024-01-27 15:31:40,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 343 transitions, 5533 flow [2024-01-27 15:31:40,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 343 transitions, 5533 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-01-27 15:31:40,331 INFO L231 Difference]: Finished difference. Result has 108 places, 160 transitions, 2123 flow [2024-01-27 15:31:40,332 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=2014, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2123, PETRI_PLACES=108, PETRI_TRANSITIONS=160} [2024-01-27 15:31:40,333 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 79 predicate places. [2024-01-27 15:31:40,333 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 160 transitions, 2123 flow [2024-01-27 15:31:40,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 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-01-27 15:31:40,333 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:31:40,333 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:31:40,348 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-01-27 15:31:40,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-01-27 15:31:40,548 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 15:31:40,548 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:31:40,549 INFO L85 PathProgramCache]: Analyzing trace with hash -48615803, now seen corresponding path program 2 times [2024-01-27 15:31:40,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:31:40,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196678631] [2024-01-27 15:31:40,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:31:40,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:31:40,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:31:40,714 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 15:31:40,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:31:40,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196678631] [2024-01-27 15:31:40,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196678631] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:31:40,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1417194143] [2024-01-27 15:31:40,715 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-01-27 15:31:40,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:31:40,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:31:40,716 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-01-27 15:31:40,738 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-01-27 15:31:40,788 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-01-27 15:31:40,789 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:31:40,790 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core [2024-01-27 15:31:40,791 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:31:40,856 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 15:31:40,856 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:31:40,929 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 15:31:40,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1417194143] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:31:40,929 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:31:40,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2024-01-27 15:31:40,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678891186] [2024-01-27 15:31:40,930 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:31:40,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-27 15:31:40,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:31:40,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-27 15:31:40,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-01-27 15:31:40,934 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 29 [2024-01-27 15:31:40,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 160 transitions, 2123 flow. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 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-01-27 15:31:40,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:31:40,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 29 [2024-01-27 15:31:40,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:31:42,353 INFO L124 PetriNetUnfolderBase]: 3950/8251 cut-off events. [2024-01-27 15:31:42,353 INFO L125 PetriNetUnfolderBase]: For 87849/88412 co-relation queries the response was YES. [2024-01-27 15:31:42,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48113 conditions, 8251 events. 3950/8251 cut-off events. For 87849/88412 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 66051 event pairs, 568 based on Foata normal form. 64/8184 useless extension candidates. Maximal degree in co-relation 39156. Up to 3018 conditions per place. [2024-01-27 15:31:42,421 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 317 selfloop transitions, 29 changer transitions 1/383 dead transitions. [2024-01-27 15:31:42,421 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 383 transitions, 6137 flow [2024-01-27 15:31:42,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-27 15:31:42,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-27 15:31:42,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 138 transitions. [2024-01-27 15:31:42,423 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7931034482758621 [2024-01-27 15:31:42,423 INFO L175 Difference]: Start difference. First operand has 108 places, 160 transitions, 2123 flow. Second operand 6 states and 138 transitions. [2024-01-27 15:31:42,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 383 transitions, 6137 flow [2024-01-27 15:31:42,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 383 transitions, 6077 flow, removed 30 selfloop flow, removed 0 redundant places. [2024-01-27 15:31:42,727 INFO L231 Difference]: Finished difference. Result has 116 places, 179 transitions, 2302 flow [2024-01-27 15:31:42,727 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=2097, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2302, PETRI_PLACES=116, PETRI_TRANSITIONS=179} [2024-01-27 15:31:42,727 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 87 predicate places. [2024-01-27 15:31:42,728 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 179 transitions, 2302 flow [2024-01-27 15:31:42,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 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-01-27 15:31:42,728 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:31:42,728 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:31:42,745 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-01-27 15:31:42,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:31:42,942 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 15:31:42,943 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:31:42,943 INFO L85 PathProgramCache]: Analyzing trace with hash -2077783729, now seen corresponding path program 3 times [2024-01-27 15:31:42,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:31:42,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336711286] [2024-01-27 15:31:42,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:31:42,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:31:42,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:31:43,100 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 15:31:43,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:31:43,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336711286] [2024-01-27 15:31:43,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336711286] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:31:43,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1676438083] [2024-01-27 15:31:43,101 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-01-27 15:31:43,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:31:43,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:31:43,103 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-01-27 15:31:43,126 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-01-27 15:31:43,178 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-01-27 15:31:43,178 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:31:43,179 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core [2024-01-27 15:31:43,181 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:31:43,250 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 15:31:43,250 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:31:43,323 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 15:31:43,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1676438083] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:31:43,323 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:31:43,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2024-01-27 15:31:43,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543365593] [2024-01-27 15:31:43,324 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:31:43,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-27 15:31:43,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:31:43,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-27 15:31:43,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-01-27 15:31:43,333 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 29 [2024-01-27 15:31:43,334 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 179 transitions, 2302 flow. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 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-01-27 15:31:43,334 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:31:43,334 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 29 [2024-01-27 15:31:43,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:31:45,068 INFO L124 PetriNetUnfolderBase]: 5380/11312 cut-off events. [2024-01-27 15:31:45,068 INFO L125 PetriNetUnfolderBase]: For 120517/121189 co-relation queries the response was YES. [2024-01-27 15:31:45,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66498 conditions, 11312 events. 5380/11312 cut-off events. For 120517/121189 co-relation queries the response was YES. Maximal size of possible extension queue 397. Compared 96002 event pairs, 785 based on Foata normal form. 81/11276 useless extension candidates. Maximal degree in co-relation 55534. Up to 5887 conditions per place. [2024-01-27 15:31:45,292 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 343 selfloop transitions, 26 changer transitions 1/406 dead transitions. [2024-01-27 15:31:45,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 406 transitions, 6362 flow [2024-01-27 15:31:45,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-27 15:31:45,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-27 15:31:45,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 139 transitions. [2024-01-27 15:31:45,294 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7988505747126436 [2024-01-27 15:31:45,295 INFO L175 Difference]: Start difference. First operand has 116 places, 179 transitions, 2302 flow. Second operand 6 states and 139 transitions. [2024-01-27 15:31:45,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 406 transitions, 6362 flow [2024-01-27 15:31:45,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 406 transitions, 6344 flow, removed 9 selfloop flow, removed 0 redundant places. [2024-01-27 15:31:45,601 INFO L231 Difference]: Finished difference. Result has 123 places, 200 transitions, 2516 flow [2024-01-27 15:31:45,601 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=2290, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2516, PETRI_PLACES=123, PETRI_TRANSITIONS=200} [2024-01-27 15:31:45,602 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 94 predicate places. [2024-01-27 15:31:45,602 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 200 transitions, 2516 flow [2024-01-27 15:31:45,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 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-01-27 15:31:45,602 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:31:45,602 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:31:45,613 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-01-27 15:31:45,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:31:45,803 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 15:31:45,804 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:31:45,804 INFO L85 PathProgramCache]: Analyzing trace with hash -235922287, now seen corresponding path program 1 times [2024-01-27 15:31:45,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:31:45,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9197110] [2024-01-27 15:31:45,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:31:45,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:31:45,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:31:45,916 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-01-27 15:31:45,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:31:45,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9197110] [2024-01-27 15:31:45,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9197110] provided 1 perfect and 0 imperfect interpolant sequences [2024-01-27 15:31:45,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-01-27 15:31:45,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-01-27 15:31:45,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142599833] [2024-01-27 15:31:45,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-01-27 15:31:45,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-01-27 15:31:45,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:31:45,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-01-27 15:31:45,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-01-27 15:31:45,921 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 29 [2024-01-27 15:31:45,921 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 200 transitions, 2516 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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-01-27 15:31:45,921 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:31:45,922 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 29 [2024-01-27 15:31:45,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:31:47,204 INFO L124 PetriNetUnfolderBase]: 4566/9731 cut-off events. [2024-01-27 15:31:47,205 INFO L125 PetriNetUnfolderBase]: For 113188/113515 co-relation queries the response was YES. [2024-01-27 15:31:47,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57566 conditions, 9731 events. 4566/9731 cut-off events. For 113188/113515 co-relation queries the response was YES. Maximal size of possible extension queue 329. Compared 81196 event pairs, 724 based on Foata normal form. 223/9852 useless extension candidates. Maximal degree in co-relation 47881. Up to 3129 conditions per place. [2024-01-27 15:31:47,279 INFO L140 encePairwiseOnDemand]: 27/29 looper letters, 198 selfloop transitions, 31 changer transitions 0/289 dead transitions. [2024-01-27 15:31:47,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 289 transitions, 4136 flow [2024-01-27 15:31:47,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-01-27 15:31:47,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-01-27 15:31:47,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2024-01-27 15:31:47,280 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7155172413793104 [2024-01-27 15:31:47,280 INFO L175 Difference]: Start difference. First operand has 123 places, 200 transitions, 2516 flow. Second operand 4 states and 83 transitions. [2024-01-27 15:31:47,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 289 transitions, 4136 flow [2024-01-27 15:31:47,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 289 transitions, 4092 flow, removed 22 selfloop flow, removed 0 redundant places. [2024-01-27 15:31:47,604 INFO L231 Difference]: Finished difference. Result has 128 places, 187 transitions, 2417 flow [2024-01-27 15:31:47,604 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=2316, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2417, PETRI_PLACES=128, PETRI_TRANSITIONS=187} [2024-01-27 15:31:47,605 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 99 predicate places. [2024-01-27 15:31:47,605 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 187 transitions, 2417 flow [2024-01-27 15:31:47,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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-01-27 15:31:47,605 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:31:47,605 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:31:47,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-01-27 15:31:47,606 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 15:31:47,606 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:31:47,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1991152879, now seen corresponding path program 4 times [2024-01-27 15:31:47,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:31:47,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735037451] [2024-01-27 15:31:47,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:31:47,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:31:47,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:31:47,773 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:31:47,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:31:47,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735037451] [2024-01-27 15:31:47,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735037451] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:31:47,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1951502570] [2024-01-27 15:31:47,773 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-01-27 15:31:47,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:31:47,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:31:47,776 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-01-27 15:31:47,796 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-01-27 15:31:47,845 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-01-27 15:31:47,845 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:31:47,846 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core [2024-01-27 15:31:47,849 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:31:47,920 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:31:47,920 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:31:47,992 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:31:47,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1951502570] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:31:47,993 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:31:47,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2024-01-27 15:31:47,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875040161] [2024-01-27 15:31:47,993 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:31:47,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-01-27 15:31:47,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:31:47,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-01-27 15:31:47,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-01-27 15:31:47,998 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 29 [2024-01-27 15:31:47,998 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 187 transitions, 2417 flow. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 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-01-27 15:31:47,998 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:31:47,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 29 [2024-01-27 15:31:47,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:31:49,594 INFO L124 PetriNetUnfolderBase]: 4606/9983 cut-off events. [2024-01-27 15:31:49,595 INFO L125 PetriNetUnfolderBase]: For 124302/124990 co-relation queries the response was YES. [2024-01-27 15:31:49,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62067 conditions, 9983 events. 4606/9983 cut-off events. For 124302/124990 co-relation queries the response was YES. Maximal size of possible extension queue 364. Compared 84935 event pairs, 795 based on Foata normal form. 147/10006 useless extension candidates. Maximal degree in co-relation 52200. Up to 6432 conditions per place. [2024-01-27 15:31:49,658 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 242 selfloop transitions, 23 changer transitions 1/303 dead transitions. [2024-01-27 15:31:49,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 303 transitions, 4636 flow [2024-01-27 15:31:49,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-01-27 15:31:49,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-01-27 15:31:49,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 113 transitions. [2024-01-27 15:31:49,659 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7793103448275862 [2024-01-27 15:31:49,660 INFO L175 Difference]: Start difference. First operand has 128 places, 187 transitions, 2417 flow. Second operand 5 states and 113 transitions. [2024-01-27 15:31:49,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 303 transitions, 4636 flow [2024-01-27 15:31:49,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 303 transitions, 4636 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-01-27 15:31:49,882 INFO L231 Difference]: Finished difference. Result has 135 places, 204 transitions, 2665 flow [2024-01-27 15:31:49,883 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=2417, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2665, PETRI_PLACES=135, PETRI_TRANSITIONS=204} [2024-01-27 15:31:49,883 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 106 predicate places. [2024-01-27 15:31:49,883 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 204 transitions, 2665 flow [2024-01-27 15:31:49,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 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-01-27 15:31:49,883 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:31:49,883 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:31:49,894 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-01-27 15:31:50,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-01-27 15:31:50,084 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 15:31:50,085 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:31:50,085 INFO L85 PathProgramCache]: Analyzing trace with hash 825146479, now seen corresponding path program 5 times [2024-01-27 15:31:50,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:31:50,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690594914] [2024-01-27 15:31:50,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:31:50,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:31:50,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:31:50,212 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 15:31:50,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:31:50,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690594914] [2024-01-27 15:31:50,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690594914] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:31:50,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1551295151] [2024-01-27 15:31:50,213 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-01-27 15:31:50,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:31:50,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:31:50,214 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-01-27 15:31:50,229 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-01-27 15:31:50,284 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2024-01-27 15:31:50,284 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:31:50,285 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core [2024-01-27 15:31:50,287 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:31:50,350 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 15:31:50,351 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:31:50,419 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-01-27 15:31:50,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1551295151] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:31:50,419 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:31:50,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2024-01-27 15:31:50,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805001850] [2024-01-27 15:31:50,420 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:31:50,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-01-27 15:31:50,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:31:50,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-01-27 15:31:50,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-01-27 15:31:50,429 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 29 [2024-01-27 15:31:50,430 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 204 transitions, 2665 flow. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 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-01-27 15:31:50,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:31:50,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 29 [2024-01-27 15:31:50,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:31:52,370 INFO L124 PetriNetUnfolderBase]: 5380/11509 cut-off events. [2024-01-27 15:31:52,370 INFO L125 PetriNetUnfolderBase]: For 148310/149376 co-relation queries the response was YES. [2024-01-27 15:31:52,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72936 conditions, 11509 events. 5380/11509 cut-off events. For 148310/149376 co-relation queries the response was YES. Maximal size of possible extension queue 415. Compared 99493 event pairs, 723 based on Foata normal form. 303/11673 useless extension candidates. Maximal degree in co-relation 60019. Up to 4203 conditions per place. [2024-01-27 15:31:52,474 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 329 selfloop transitions, 57 changer transitions 1/424 dead transitions. [2024-01-27 15:31:52,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 424 transitions, 6968 flow [2024-01-27 15:31:52,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-01-27 15:31:52,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-01-27 15:31:52,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 138 transitions. [2024-01-27 15:31:52,475 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7931034482758621 [2024-01-27 15:31:52,476 INFO L175 Difference]: Start difference. First operand has 135 places, 204 transitions, 2665 flow. Second operand 6 states and 138 transitions. [2024-01-27 15:31:52,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 424 transitions, 6968 flow [2024-01-27 15:31:52,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 424 transitions, 6956 flow, removed 6 selfloop flow, removed 0 redundant places. [2024-01-27 15:31:52,804 INFO L231 Difference]: Finished difference. Result has 144 places, 220 transitions, 3035 flow [2024-01-27 15:31:52,804 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=2653, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3035, PETRI_PLACES=144, PETRI_TRANSITIONS=220} [2024-01-27 15:31:52,804 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 115 predicate places. [2024-01-27 15:31:52,805 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 220 transitions, 3035 flow [2024-01-27 15:31:52,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 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-01-27 15:31:52,805 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:31:52,805 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:31:52,819 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-01-27 15:31:53,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-01-27 15:31:53,013 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 15:31:53,013 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:31:53,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1185204833, now seen corresponding path program 6 times [2024-01-27 15:31:53,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:31:53,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552091078] [2024-01-27 15:31:53,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:31:53,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:31:53,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:31:53,416 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:31:53,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:31:53,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552091078] [2024-01-27 15:31:53,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552091078] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:31:53,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1243182705] [2024-01-27 15:31:53,417 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-01-27 15:31:53,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:31:53,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:31:53,418 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-01-27 15:31:53,424 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-01-27 15:31:53,555 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2024-01-27 15:31:53,555 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-01-27 15:31:53,557 INFO L262 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 11 conjunts are in the unsatisfiable core [2024-01-27 15:31:53,559 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:31:53,966 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:31:53,966 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:31:54,589 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:31:54,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1243182705] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:31:54,590 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:31:54,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 19 [2024-01-27 15:31:54,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518139226] [2024-01-27 15:31:54,590 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:31:54,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-01-27 15:31:54,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:31:54,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-01-27 15:31:54,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2024-01-27 15:31:54,619 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 29 [2024-01-27 15:31:54,619 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 220 transitions, 3035 flow. Second operand has 20 states, 20 states have (on average 12.3) internal successors, (246), 20 states have internal predecessors, (246), 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-01-27 15:31:54,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:31:54,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 29 [2024-01-27 15:31:54,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:32:03,695 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:32:06,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:32:31,243 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-01-27 15:32:36,709 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-01-27 15:32:49,800 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-01-27 15:33:20,039 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.76s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:33:31,491 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-01-27 15:34:25,515 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:34:28,812 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.33s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:34:50,627 INFO L124 PetriNetUnfolderBase]: 28401/56333 cut-off events. [2024-01-27 15:34:50,628 INFO L125 PetriNetUnfolderBase]: For 832458/832458 co-relation queries the response was YES. [2024-01-27 15:34:51,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 369252 conditions, 56333 events. 28401/56333 cut-off events. For 832458/832458 co-relation queries the response was YES. Maximal size of possible extension queue 1537. Compared 561005 event pairs, 880 based on Foata normal form. 2510/58841 useless extension candidates. Maximal degree in co-relation 301458. Up to 10639 conditions per place. [2024-01-27 15:34:51,490 INFO L140 encePairwiseOnDemand]: 17/29 looper letters, 1836 selfloop transitions, 505 changer transitions 5/2357 dead transitions. [2024-01-27 15:34:51,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 2357 transitions, 33347 flow [2024-01-27 15:34:51,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2024-01-27 15:34:51,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2024-01-27 15:34:51,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 1075 transitions. [2024-01-27 15:34:51,495 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5792025862068966 [2024-01-27 15:34:51,495 INFO L175 Difference]: Start difference. First operand has 144 places, 220 transitions, 3035 flow. Second operand 64 states and 1075 transitions. [2024-01-27 15:34:51,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 2357 transitions, 33347 flow [2024-01-27 15:34:54,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 2357 transitions, 32793 flow, removed 223 selfloop flow, removed 1 redundant places. [2024-01-27 15:34:54,994 INFO L231 Difference]: Finished difference. Result has 242 places, 694 transitions, 13357 flow [2024-01-27 15:34:54,995 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=3004, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=64, PETRI_FLOW=13357, PETRI_PLACES=242, PETRI_TRANSITIONS=694} [2024-01-27 15:34:54,995 INFO L281 CegarLoopForPetriNet]: 29 programPoint places, 213 predicate places. [2024-01-27 15:34:54,995 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 694 transitions, 13357 flow [2024-01-27 15:34:54,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 12.3) internal successors, (246), 20 states have internal predecessors, (246), 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-01-27 15:34:54,996 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-01-27 15:34:54,996 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-01-27 15:34:55,009 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-01-27 15:34:55,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:34:55,201 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-01-27 15:34:55,201 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-01-27 15:34:55,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1507251913, now seen corresponding path program 7 times [2024-01-27 15:34:55,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-01-27 15:34:55,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884153325] [2024-01-27 15:34:55,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-01-27 15:34:55,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-01-27 15:34:55,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:34:55,800 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:34:55,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-01-27 15:34:55,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884153325] [2024-01-27 15:34:55,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884153325] provided 0 perfect and 1 imperfect interpolant sequences [2024-01-27 15:34:55,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1292019244] [2024-01-27 15:34:55,800 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-01-27 15:34:55,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-01-27 15:34:55,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-01-27 15:34:55,804 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-01-27 15:34:55,806 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-01-27 15:34:55,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-01-27 15:34:55,933 INFO L262 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 12 conjunts are in the unsatisfiable core [2024-01-27 15:34:55,934 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-01-27 15:34:56,565 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:34:56,566 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-01-27 15:35:07,530 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-01-27 15:35:07,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1292019244] provided 0 perfect and 2 imperfect interpolant sequences [2024-01-27 15:35:07,530 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-01-27 15:35:07,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 24 [2024-01-27 15:35:07,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979414396] [2024-01-27 15:35:07,531 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-01-27 15:35:07,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-01-27 15:35:07,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-01-27 15:35:07,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-01-27 15:35:07,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=505, Unknown=2, NotChecked=0, Total=600 [2024-01-27 15:35:07,550 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 29 [2024-01-27 15:35:07,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 694 transitions, 13357 flow. Second operand has 25 states, 25 states have (on average 13.32) internal successors, (333), 25 states have internal predecessors, (333), 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-01-27 15:35:07,551 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-01-27 15:35:07,551 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 29 [2024-01-27 15:35:07,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-01-27 15:35:31,071 WARN L293 SmtUtils]: Spent 22.52s on a formula simplification. DAG size of input: 47 DAG size of output: 32 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-27 15:35:37,997 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:35:49,327 WARN L293 SmtUtils]: Spent 8.55s on a formula simplification. DAG size of input: 50 DAG size of output: 44 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-27 15:35:50,753 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-01-27 15:36:13,371 WARN L293 SmtUtils]: Spent 14.31s on a formula simplification. DAG size of input: 57 DAG size of output: 51 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-27 15:36:16,387 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.01s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:36:46,748 WARN L293 SmtUtils]: Spent 13.29s on a formula simplification. DAG size of input: 53 DAG size of output: 47 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-27 15:36:51,238 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-01-27 15:36:55,241 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-01-27 15:36:59,251 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-01-27 15:37:33,885 WARN L293 SmtUtils]: Spent 24.15s on a formula simplification that was a NOOP. DAG size: 64 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-27 15:37:49,642 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.40s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:37:56,975 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-01-27 15:38:00,978 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-01-27 15:38:05,048 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-01-27 15:38:09,347 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-01-27 15:38:17,184 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:38:25,835 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.19s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:38:29,883 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-01-27 15:38:31,281 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:38:35,537 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-01-27 15:39:02,170 WARN L293 SmtUtils]: Spent 14.24s on a formula simplification. DAG size of input: 66 DAG size of output: 40 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-27 15:39:08,386 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-01-27 15:39:19,723 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-01-27 15:39:24,499 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-01-27 15:39:44,692 WARN L293 SmtUtils]: Spent 10.57s on a formula simplification. DAG size of input: 40 DAG size of output: 27 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-27 15:40:17,065 WARN L293 SmtUtils]: Spent 10.39s on a formula simplification. DAG size of input: 59 DAG size of output: 34 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-27 15:40:20,651 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.38s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:40:24,271 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.62s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:40:25,895 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:41:17,828 WARN L293 SmtUtils]: Spent 17.90s on a formula simplification. DAG size of input: 77 DAG size of output: 55 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-27 15:41:42,025 WARN L293 SmtUtils]: Spent 14.33s on a formula simplification. DAG size of input: 77 DAG size of output: 47 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-27 15:42:52,275 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-01-27 15:43:08,878 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-01-27 15:43:23,397 WARN L293 SmtUtils]: Spent 5.01s on a formula simplification. DAG size of input: 66 DAG size of output: 51 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-01-27 15:43:26,414 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.84s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:43:30,417 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:43:34,419 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-01-27 15:44:58,329 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-01-27 15:45:12,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-27 15:45:16,164 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-01-27 15:45:28,955 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-01-27 15:45:33,797 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-01-27 15:45:37,949 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-01-27 15:45:42,135 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] Killed by 15