./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/chl-simpl-str-trans.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c Calling Ultimate with: /usr/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 ../sv-benchmarks/c/weaver/chl-simpl-str-trans.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.graphml --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 0b48bde914fb7ebeda4cbd6fd329f7fd1281e3c3e233b6f5149c7b66a2f709ab --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 10:25:10,162 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 10:25:10,164 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 10:25:10,200 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 10:25:10,200 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 10:25:10,201 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 10:25:10,203 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 10:25:10,205 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 10:25:10,207 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 10:25:10,210 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 10:25:10,210 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 10:25:10,211 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 10:25:10,212 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 10:25:10,213 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 10:25:10,214 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 10:25:10,216 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 10:25:10,216 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 10:25:10,217 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 10:25:10,219 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 10:25:10,220 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 10:25:10,222 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 10:25:10,223 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 10:25:10,223 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 10:25:10,224 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 10:25:10,225 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 10:25:10,230 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 10:25:10,231 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 10:25:10,231 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 10:25:10,231 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 10:25:10,232 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 10:25:10,232 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 10:25:10,233 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 10:25:10,233 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 10:25:10,234 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 10:25:10,235 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 10:25:10,235 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 10:25:10,236 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 10:25:10,236 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 10:25:10,236 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 10:25:10,237 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 10:25:10,237 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 10:25:10,238 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 10:25:10,239 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-12 10:25:10,257 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 10:25:10,258 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 10:25:10,259 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 10:25:10,260 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 10:25:10,260 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 10:25:10,261 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 10:25:10,261 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 10:25:10,261 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 10:25:10,261 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 10:25:10,262 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 10:25:10,262 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 10:25:10,262 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 10:25:10,262 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 10:25:10,262 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 10:25:10,263 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 10:25:10,263 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 10:25:10,263 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 10:25:10,263 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 10:25:10,263 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 10:25:10,263 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 10:25:10,264 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 10:25:10,264 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 10:25:10,265 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 10:25:10,265 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 10:25:10,265 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 10:25:10,265 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 10:25:10,265 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 10:25:10,265 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 10:25:10,266 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 10:25:10,266 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 10:25:10,266 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 10:25:10,266 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 10:25:10,266 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 10:25:10,266 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.graphml 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 -> 0b48bde914fb7ebeda4cbd6fd329f7fd1281e3c3e233b6f5149c7b66a2f709ab [2022-07-12 10:25:10,413 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 10:25:10,428 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 10:25:10,432 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 10:25:10,433 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 10:25:10,433 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 10:25:10,434 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-simpl-str-trans.wvr.c [2022-07-12 10:25:10,479 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acb6aa84c/2a56a97c004848b9a1460bfaa4690e6b/FLAG9ef44cdfa [2022-07-12 10:25:10,763 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 10:25:10,767 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-simpl-str-trans.wvr.c [2022-07-12 10:25:10,773 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acb6aa84c/2a56a97c004848b9a1460bfaa4690e6b/FLAG9ef44cdfa [2022-07-12 10:25:11,198 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acb6aa84c/2a56a97c004848b9a1460bfaa4690e6b [2022-07-12 10:25:11,200 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 10:25:11,201 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 10:25:11,204 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 10:25:11,204 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 10:25:11,206 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 10:25:11,207 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 10:25:11" (1/1) ... [2022-07-12 10:25:11,208 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@454fc37c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:25:11, skipping insertion in model container [2022-07-12 10:25:11,208 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 10:25:11" (1/1) ... [2022-07-12 10:25:11,212 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 10:25:11,227 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 10:25:11,342 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-simpl-str-trans.wvr.c[2514,2527] [2022-07-12 10:25:11,346 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 10:25:11,351 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 10:25:11,364 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-simpl-str-trans.wvr.c[2514,2527] [2022-07-12 10:25:11,368 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 10:25:11,380 INFO L208 MainTranslator]: Completed translation [2022-07-12 10:25:11,381 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:25:11 WrapperNode [2022-07-12 10:25:11,381 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 10:25:11,382 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 10:25:11,382 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 10:25:11,382 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 10:25:11,387 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:25:11" (1/1) ... [2022-07-12 10:25:11,399 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:25:11" (1/1) ... [2022-07-12 10:25:11,418 INFO L137 Inliner]: procedures = 23, calls = 30, calls flagged for inlining = 8, calls inlined = 12, statements flattened = 175 [2022-07-12 10:25:11,418 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 10:25:11,419 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 10:25:11,419 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 10:25:11,419 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 10:25:11,424 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:25:11" (1/1) ... [2022-07-12 10:25:11,424 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:25:11" (1/1) ... [2022-07-12 10:25:11,431 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:25:11" (1/1) ... [2022-07-12 10:25:11,431 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:25:11" (1/1) ... [2022-07-12 10:25:11,435 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:25:11" (1/1) ... [2022-07-12 10:25:11,436 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:25:11" (1/1) ... [2022-07-12 10:25:11,437 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:25:11" (1/1) ... [2022-07-12 10:25:11,439 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 10:25:11,440 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 10:25:11,440 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 10:25:11,440 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 10:25:11,441 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:25:11" (1/1) ... [2022-07-12 10:25:11,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 10:25:11,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:25:11,463 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 10:25:11,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 10:25:11,486 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 10:25:11,486 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-12 10:25:11,486 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-12 10:25:11,487 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-12 10:25:11,487 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-12 10:25:11,487 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-07-12 10:25:11,487 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-07-12 10:25:11,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 10:25:11,487 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 10:25:11,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 10:25:11,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 10:25:11,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 10:25:11,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 10:25:11,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 10:25:11,494 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-12 10:25:11,552 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 10:25:11,553 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 10:25:11,813 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 10:25:11,821 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 10:25:11,821 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-12 10:25:11,824 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 10:25:11 BoogieIcfgContainer [2022-07-12 10:25:11,824 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 10:25:11,826 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 10:25:11,826 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 10:25:11,841 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 10:25:11,841 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 10:25:11" (1/3) ... [2022-07-12 10:25:11,842 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55ff7686 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 10:25:11, skipping insertion in model container [2022-07-12 10:25:11,842 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:25:11" (2/3) ... [2022-07-12 10:25:11,842 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55ff7686 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 10:25:11, skipping insertion in model container [2022-07-12 10:25:11,842 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 10:25:11" (3/3) ... [2022-07-12 10:25:11,843 INFO L111 eAbstractionObserver]: Analyzing ICFG chl-simpl-str-trans.wvr.c [2022-07-12 10:25:11,847 WARN L143 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-07-12 10:25:11,853 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 10:25:11,853 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 10:25:11,854 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-07-12 10:25:11,922 INFO L135 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-07-12 10:25:11,948 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 221 places, 227 transitions, 478 flow [2022-07-12 10:25:12,014 INFO L129 PetriNetUnfolder]: 16/224 cut-off events. [2022-07-12 10:25:12,014 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-07-12 10:25:12,024 INFO L84 FinitePrefix]: Finished finitePrefix Result has 237 conditions, 224 events. 16/224 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 503 event pairs, 0 based on Foata normal form. 0/207 useless extension candidates. Maximal degree in co-relation 154. Up to 2 conditions per place. [2022-07-12 10:25:12,025 INFO L82 GeneralOperation]: Start removeDead. Operand has 221 places, 227 transitions, 478 flow [2022-07-12 10:25:12,030 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 207 places, 213 transitions, 444 flow [2022-07-12 10:25:12,041 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 10:25:12,047 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=LoopsAndPotentialCycles, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3ea2a017, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4ef2d11 [2022-07-12 10:25:12,066 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-07-12 10:25:12,095 INFO L129 PetriNetUnfolder]: 16/212 cut-off events. [2022-07-12 10:25:12,096 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-07-12 10:25:12,097 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:25:12,097 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:25:12,098 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-12 10:25:12,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:25:12,103 INFO L85 PathProgramCache]: Analyzing trace with hash -483569212, now seen corresponding path program 1 times [2022-07-12 10:25:12,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:25:12,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171039102] [2022-07-12 10:25:12,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:25:12,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:25:12,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:25:12,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:25:12,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:25:12,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171039102] [2022-07-12 10:25:12,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171039102] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:25:12,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:25:12,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 10:25:12,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14513809] [2022-07-12 10:25:12,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:25:12,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 10:25:12,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:25:12,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 10:25:12,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 10:25:12,461 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 227 [2022-07-12 10:25:12,467 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 213 transitions, 444 flow. Second operand has 7 states, 7 states have (on average 202.28571428571428) internal successors, (1416), 7 states have internal predecessors, (1416), 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) [2022-07-12 10:25:12,467 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:25:12,467 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 227 [2022-07-12 10:25:12,468 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:25:12,670 INFO L129 PetriNetUnfolder]: 30/279 cut-off events. [2022-07-12 10:25:12,670 INFO L130 PetriNetUnfolder]: For 75/75 co-relation queries the response was YES. [2022-07-12 10:25:12,672 INFO L84 FinitePrefix]: Finished finitePrefix Result has 384 conditions, 279 events. 30/279 cut-off events. For 75/75 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1076 event pairs, 10 based on Foata normal form. 60/323 useless extension candidates. Maximal degree in co-relation 281. Up to 40 conditions per place. [2022-07-12 10:25:12,674 INFO L132 encePairwiseOnDemand]: 211/227 looper letters, 22 selfloop transitions, 5 changer transitions 11/225 dead transitions. [2022-07-12 10:25:12,674 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 225 transitions, 577 flow [2022-07-12 10:25:12,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 10:25:12,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-12 10:25:12,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2067 transitions. [2022-07-12 10:25:12,688 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9105726872246696 [2022-07-12 10:25:12,689 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2067 transitions. [2022-07-12 10:25:12,689 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2067 transitions. [2022-07-12 10:25:12,692 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:25:12,694 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2067 transitions. [2022-07-12 10:25:12,699 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 206.7) internal successors, (2067), 10 states have internal predecessors, (2067), 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) [2022-07-12 10:25:12,707 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 227.0) internal successors, (2497), 11 states have internal predecessors, (2497), 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) [2022-07-12 10:25:12,708 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 227.0) internal successors, (2497), 11 states have internal predecessors, (2497), 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) [2022-07-12 10:25:12,709 INFO L186 Difference]: Start difference. First operand has 207 places, 213 transitions, 444 flow. Second operand 10 states and 2067 transitions. [2022-07-12 10:25:12,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 225 transitions, 577 flow [2022-07-12 10:25:12,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 225 transitions, 543 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-07-12 10:25:12,716 INFO L242 Difference]: Finished difference. Result has 217 places, 209 transitions, 457 flow [2022-07-12 10:25:12,718 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=418, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=457, PETRI_PLACES=217, PETRI_TRANSITIONS=209} [2022-07-12 10:25:12,720 INFO L279 CegarLoopForPetriNet]: 207 programPoint places, 10 predicate places. [2022-07-12 10:25:12,720 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 209 transitions, 457 flow [2022-07-12 10:25:12,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 202.28571428571428) internal successors, (1416), 7 states have internal predecessors, (1416), 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) [2022-07-12 10:25:12,722 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:25:12,722 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:25:12,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 10:25:12,722 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-12 10:25:12,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:25:12,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1802203198, now seen corresponding path program 1 times [2022-07-12 10:25:12,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:25:12,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962176792] [2022-07-12 10:25:12,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:25:12,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:25:12,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:25:12,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:25:12,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:25:12,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962176792] [2022-07-12 10:25:12,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962176792] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:25:12,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:25:12,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 10:25:12,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757506407] [2022-07-12 10:25:12,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:25:12,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 10:25:12,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:25:12,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 10:25:12,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 10:25:12,822 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 227 [2022-07-12 10:25:12,823 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 209 transitions, 457 flow. Second operand has 3 states, 3 states have (on average 206.33333333333334) internal successors, (619), 3 states have internal predecessors, (619), 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) [2022-07-12 10:25:12,823 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:25:12,823 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 227 [2022-07-12 10:25:12,823 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:25:12,950 INFO L129 PetriNetUnfolder]: 71/789 cut-off events. [2022-07-12 10:25:12,950 INFO L130 PetriNetUnfolder]: For 45/52 co-relation queries the response was YES. [2022-07-12 10:25:12,955 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1023 conditions, 789 events. 71/789 cut-off events. For 45/52 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 4972 event pairs, 24 based on Foata normal form. 1/717 useless extension candidates. Maximal degree in co-relation 1005. Up to 75 conditions per place. [2022-07-12 10:25:12,958 INFO L132 encePairwiseOnDemand]: 217/227 looper letters, 18 selfloop transitions, 6 changer transitions 0/217 dead transitions. [2022-07-12 10:25:12,958 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 217 transitions, 525 flow [2022-07-12 10:25:12,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 10:25:12,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-12 10:25:12,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 637 transitions. [2022-07-12 10:25:12,960 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9353891336270191 [2022-07-12 10:25:12,960 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 637 transitions. [2022-07-12 10:25:12,960 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 637 transitions. [2022-07-12 10:25:12,961 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:25:12,961 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 637 transitions. [2022-07-12 10:25:12,962 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 212.33333333333334) internal successors, (637), 3 states have internal predecessors, (637), 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) [2022-07-12 10:25:12,963 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 227.0) internal successors, (908), 4 states have internal predecessors, (908), 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) [2022-07-12 10:25:12,964 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 227.0) internal successors, (908), 4 states have internal predecessors, (908), 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) [2022-07-12 10:25:12,964 INFO L186 Difference]: Start difference. First operand has 217 places, 209 transitions, 457 flow. Second operand 3 states and 637 transitions. [2022-07-12 10:25:12,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 217 transitions, 525 flow [2022-07-12 10:25:12,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 217 transitions, 520 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-07-12 10:25:12,974 INFO L242 Difference]: Finished difference. Result has 214 places, 213 transitions, 500 flow [2022-07-12 10:25:12,975 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=452, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=500, PETRI_PLACES=214, PETRI_TRANSITIONS=213} [2022-07-12 10:25:12,976 INFO L279 CegarLoopForPetriNet]: 207 programPoint places, 7 predicate places. [2022-07-12 10:25:12,976 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 213 transitions, 500 flow [2022-07-12 10:25:12,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 206.33333333333334) internal successors, (619), 3 states have internal predecessors, (619), 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) [2022-07-12 10:25:12,977 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:25:12,977 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:25:12,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 10:25:12,978 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-12 10:25:12,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:25:12,979 INFO L85 PathProgramCache]: Analyzing trace with hash 623842676, now seen corresponding path program 2 times [2022-07-12 10:25:12,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:25:12,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843314525] [2022-07-12 10:25:12,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:25:12,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:25:13,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:25:13,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:25:13,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:25:13,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843314525] [2022-07-12 10:25:13,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843314525] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:25:13,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:25:13,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 10:25:13,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165936120] [2022-07-12 10:25:13,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:25:13,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 10:25:13,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:25:13,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 10:25:13,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 10:25:13,047 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 227 [2022-07-12 10:25:13,049 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 213 transitions, 500 flow. Second operand has 3 states, 3 states have (on average 206.33333333333334) internal successors, (619), 3 states have internal predecessors, (619), 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) [2022-07-12 10:25:13,049 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:25:13,049 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 227 [2022-07-12 10:25:13,049 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:25:13,148 INFO L129 PetriNetUnfolder]: 54/633 cut-off events. [2022-07-12 10:25:13,149 INFO L130 PetriNetUnfolder]: For 134/134 co-relation queries the response was YES. [2022-07-12 10:25:13,164 INFO L84 FinitePrefix]: Finished finitePrefix Result has 912 conditions, 633 events. 54/633 cut-off events. For 134/134 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3376 event pairs, 18 based on Foata normal form. 18/612 useless extension candidates. Maximal degree in co-relation 843. Up to 49 conditions per place. [2022-07-12 10:25:13,166 INFO L132 encePairwiseOnDemand]: 219/227 looper letters, 24 selfloop transitions, 4 changer transitions 0/221 dead transitions. [2022-07-12 10:25:13,166 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 221 transitions, 584 flow [2022-07-12 10:25:13,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 10:25:13,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-12 10:25:13,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 637 transitions. [2022-07-12 10:25:13,169 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9353891336270191 [2022-07-12 10:25:13,169 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 637 transitions. [2022-07-12 10:25:13,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 637 transitions. [2022-07-12 10:25:13,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:25:13,170 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 637 transitions. [2022-07-12 10:25:13,171 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 212.33333333333334) internal successors, (637), 3 states have internal predecessors, (637), 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) [2022-07-12 10:25:13,172 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 227.0) internal successors, (908), 4 states have internal predecessors, (908), 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) [2022-07-12 10:25:13,173 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 227.0) internal successors, (908), 4 states have internal predecessors, (908), 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) [2022-07-12 10:25:13,173 INFO L186 Difference]: Start difference. First operand has 214 places, 213 transitions, 500 flow. Second operand 3 states and 637 transitions. [2022-07-12 10:25:13,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 221 transitions, 584 flow [2022-07-12 10:25:13,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 221 transitions, 572 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-07-12 10:25:13,179 INFO L242 Difference]: Finished difference. Result has 216 places, 217 transitions, 536 flow [2022-07-12 10:25:13,179 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=488, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=536, PETRI_PLACES=216, PETRI_TRANSITIONS=217} [2022-07-12 10:25:13,181 INFO L279 CegarLoopForPetriNet]: 207 programPoint places, 9 predicate places. [2022-07-12 10:25:13,181 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 217 transitions, 536 flow [2022-07-12 10:25:13,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 206.33333333333334) internal successors, (619), 3 states have internal predecessors, (619), 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) [2022-07-12 10:25:13,181 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:25:13,181 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:25:13,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 10:25:13,182 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-12 10:25:13,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:25:13,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1893473444, now seen corresponding path program 1 times [2022-07-12 10:25:13,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:25:13,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99711351] [2022-07-12 10:25:13,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:25:13,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:25:13,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:25:13,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:25:13,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:25:13,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99711351] [2022-07-12 10:25:13,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99711351] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:25:13,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:25:13,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 10:25:13,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431191361] [2022-07-12 10:25:13,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:25:13,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 10:25:13,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:25:13,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 10:25:13,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 10:25:13,267 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 227 [2022-07-12 10:25:13,267 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 217 transitions, 536 flow. Second operand has 3 states, 3 states have (on average 208.33333333333334) internal successors, (625), 3 states have internal predecessors, (625), 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) [2022-07-12 10:25:13,267 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:25:13,268 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 227 [2022-07-12 10:25:13,268 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:25:13,487 INFO L129 PetriNetUnfolder]: 105/2022 cut-off events. [2022-07-12 10:25:13,487 INFO L130 PetriNetUnfolder]: For 196/349 co-relation queries the response was YES. [2022-07-12 10:25:13,495 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2762 conditions, 2022 events. 105/2022 cut-off events. For 196/349 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 19108 event pairs, 15 based on Foata normal form. 0/1911 useless extension candidates. Maximal degree in co-relation 2576. Up to 81 conditions per place. [2022-07-12 10:25:13,501 INFO L132 encePairwiseOnDemand]: 221/227 looper letters, 19 selfloop transitions, 3 changer transitions 0/225 dead transitions. [2022-07-12 10:25:13,502 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 225 transitions, 601 flow [2022-07-12 10:25:13,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 10:25:13,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-12 10:25:13,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 640 transitions. [2022-07-12 10:25:13,503 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9397944199706314 [2022-07-12 10:25:13,503 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 640 transitions. [2022-07-12 10:25:13,504 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 640 transitions. [2022-07-12 10:25:13,504 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:25:13,505 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 640 transitions. [2022-07-12 10:25:13,506 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 213.33333333333334) internal successors, (640), 3 states have internal predecessors, (640), 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) [2022-07-12 10:25:13,509 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 227.0) internal successors, (908), 4 states have internal predecessors, (908), 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) [2022-07-12 10:25:13,510 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 227.0) internal successors, (908), 4 states have internal predecessors, (908), 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) [2022-07-12 10:25:13,510 INFO L186 Difference]: Start difference. First operand has 216 places, 217 transitions, 536 flow. Second operand 3 states and 640 transitions. [2022-07-12 10:25:13,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 225 transitions, 601 flow [2022-07-12 10:25:13,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 225 transitions, 589 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-07-12 10:25:13,520 INFO L242 Difference]: Finished difference. Result has 219 places, 220 transitions, 554 flow [2022-07-12 10:25:13,520 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=524, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=554, PETRI_PLACES=219, PETRI_TRANSITIONS=220} [2022-07-12 10:25:13,521 INFO L279 CegarLoopForPetriNet]: 207 programPoint places, 12 predicate places. [2022-07-12 10:25:13,522 INFO L495 AbstractCegarLoop]: Abstraction has has 219 places, 220 transitions, 554 flow [2022-07-12 10:25:13,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 208.33333333333334) internal successors, (625), 3 states have internal predecessors, (625), 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) [2022-07-12 10:25:13,526 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:25:13,526 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:25:13,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 10:25:13,526 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-12 10:25:13,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:25:13,527 INFO L85 PathProgramCache]: Analyzing trace with hash -574075276, now seen corresponding path program 1 times [2022-07-12 10:25:13,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:25:13,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843038961] [2022-07-12 10:25:13,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:25:13,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:25:13,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:25:13,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:25:13,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:25:13,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843038961] [2022-07-12 10:25:13,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843038961] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:25:13,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:25:13,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 10:25:13,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051930434] [2022-07-12 10:25:13,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:25:13,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 10:25:13,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:25:13,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 10:25:13,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 10:25:13,590 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 227 [2022-07-12 10:25:13,591 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 220 transitions, 554 flow. Second operand has 3 states, 3 states have (on average 210.33333333333334) internal successors, (631), 3 states have internal predecessors, (631), 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) [2022-07-12 10:25:13,591 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:25:13,592 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 227 [2022-07-12 10:25:13,592 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:25:13,860 INFO L129 PetriNetUnfolder]: 124/2513 cut-off events. [2022-07-12 10:25:13,860 INFO L130 PetriNetUnfolder]: For 113/222 co-relation queries the response was YES. [2022-07-12 10:25:13,870 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3382 conditions, 2513 events. 124/2513 cut-off events. For 113/222 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 24116 event pairs, 22 based on Foata normal form. 2/2332 useless extension candidates. Maximal degree in co-relation 3146. Up to 90 conditions per place. [2022-07-12 10:25:13,875 INFO L132 encePairwiseOnDemand]: 221/227 looper letters, 15 selfloop transitions, 4 changer transitions 0/227 dead transitions. [2022-07-12 10:25:13,876 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 227 transitions, 611 flow [2022-07-12 10:25:13,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 10:25:13,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-12 10:25:13,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 642 transitions. [2022-07-12 10:25:13,877 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9427312775330396 [2022-07-12 10:25:13,878 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 642 transitions. [2022-07-12 10:25:13,878 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 642 transitions. [2022-07-12 10:25:13,878 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:25:13,878 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 642 transitions. [2022-07-12 10:25:13,879 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 214.0) internal successors, (642), 3 states have internal predecessors, (642), 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) [2022-07-12 10:25:13,880 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 227.0) internal successors, (908), 4 states have internal predecessors, (908), 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) [2022-07-12 10:25:13,881 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 227.0) internal successors, (908), 4 states have internal predecessors, (908), 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) [2022-07-12 10:25:13,881 INFO L186 Difference]: Start difference. First operand has 219 places, 220 transitions, 554 flow. Second operand 3 states and 642 transitions. [2022-07-12 10:25:13,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 227 transitions, 611 flow [2022-07-12 10:25:13,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 227 transitions, 608 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-07-12 10:25:13,890 INFO L242 Difference]: Finished difference. Result has 222 places, 222 transitions, 579 flow [2022-07-12 10:25:13,890 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=551, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=579, PETRI_PLACES=222, PETRI_TRANSITIONS=222} [2022-07-12 10:25:13,892 INFO L279 CegarLoopForPetriNet]: 207 programPoint places, 15 predicate places. [2022-07-12 10:25:13,892 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 222 transitions, 579 flow [2022-07-12 10:25:13,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 210.33333333333334) internal successors, (631), 3 states have internal predecessors, (631), 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) [2022-07-12 10:25:13,893 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:25:13,893 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:25:13,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 10:25:13,894 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-12 10:25:13,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:25:13,895 INFO L85 PathProgramCache]: Analyzing trace with hash -720449500, now seen corresponding path program 1 times [2022-07-12 10:25:13,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:25:13,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776140365] [2022-07-12 10:25:13,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:25:13,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:25:13,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:25:14,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:25:14,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:25:14,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776140365] [2022-07-12 10:25:14,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776140365] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:25:14,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:25:14,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 10:25:14,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337339432] [2022-07-12 10:25:14,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:25:14,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 10:25:14,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:25:14,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 10:25:14,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-12 10:25:14,006 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 227 [2022-07-12 10:25:14,008 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 222 transitions, 579 flow. Second operand has 8 states, 8 states have (on average 198.5) internal successors, (1588), 8 states have internal predecessors, (1588), 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) [2022-07-12 10:25:14,008 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:25:14,008 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 227 [2022-07-12 10:25:14,008 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:25:14,216 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([530] L43-17-->L43-18: Formula: (= v_~result_6~0_1 |v_thread1Thread1of1ForFork1_#t~ite4#1_5|) InVars {thread1Thread1of1ForFork1_#t~ite4#1=|v_thread1Thread1of1ForFork1_#t~ite4#1_5|} OutVars{~result_6~0=v_~result_6~0_1, thread1Thread1of1ForFork1_#t~ite4#1=|v_thread1Thread1of1ForFork1_#t~ite4#1_5|} AuxVars[] AssignedVars[~result_6~0][112], [Black: 252#true, Black: 260#(not (= ~length_4~0 0)), 276#true, 56#L74-4true, 117#L43-18true, 266#(not (= ~length_2~0 0)), Black: 264#true, 177#L49-20true, Black: 270#true, Black: 238#(and (= |thread3Thread1of1ForFork0_#t~ite9#1| 1) (= (+ (- 1) ~result_8~0) 0)), Black: 234#(and (= 1 |thread3Thread1of1ForFork0_#t~ite12#1|) (= |thread3Thread1of1ForFork0_#t~ite9#1| 1) (= (+ (- 1) ~result_8~0) 0)), 175#L55-18true, Black: 226#(= |thread3Thread1of1ForFork0_#t~ite9#1| 1), Black: 228#(= (+ (- 1) ~result_8~0) 0), Black: 232#(and (= 1 |thread3Thread1of1ForFork0_#t~ite12#1|) (= |thread3Thread1of1ForFork0_#t~ite9#1| 1)), 272#(= ~length_0~0 0)]) [2022-07-12 10:25:14,216 INFO L384 tUnfolder$Statistics]: this new event has 97 ancestors and is cut-off event [2022-07-12 10:25:14,216 INFO L387 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-07-12 10:25:14,217 INFO L387 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-07-12 10:25:14,217 INFO L387 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-07-12 10:25:14,217 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([530] L43-17-->L43-18: Formula: (= v_~result_6~0_1 |v_thread1Thread1of1ForFork1_#t~ite4#1_5|) InVars {thread1Thread1of1ForFork1_#t~ite4#1=|v_thread1Thread1of1ForFork1_#t~ite4#1_5|} OutVars{~result_6~0=v_~result_6~0_1, thread1Thread1of1ForFork1_#t~ite4#1=|v_thread1Thread1of1ForFork1_#t~ite4#1_5|} AuxVars[] AssignedVars[~result_6~0][112], [Black: 252#true, Black: 260#(not (= ~length_4~0 0)), 276#true, 56#L74-4true, 117#L43-18true, 266#(not (= ~length_2~0 0)), Black: 264#true, 95#L49-18true, Black: 270#true, Black: 238#(and (= |thread3Thread1of1ForFork0_#t~ite9#1| 1) (= (+ (- 1) ~result_8~0) 0)), Black: 234#(and (= 1 |thread3Thread1of1ForFork0_#t~ite12#1|) (= |thread3Thread1of1ForFork0_#t~ite9#1| 1) (= (+ (- 1) ~result_8~0) 0)), 175#L55-18true, Black: 226#(= |thread3Thread1of1ForFork0_#t~ite9#1| 1), Black: 228#(= (+ (- 1) ~result_8~0) 0), Black: 232#(and (= 1 |thread3Thread1of1ForFork0_#t~ite12#1|) (= |thread3Thread1of1ForFork0_#t~ite9#1| 1)), 272#(= ~length_0~0 0)]) [2022-07-12 10:25:14,217 INFO L384 tUnfolder$Statistics]: this new event has 95 ancestors and is cut-off event [2022-07-12 10:25:14,217 INFO L387 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-07-12 10:25:14,217 INFO L387 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-07-12 10:25:14,217 INFO L387 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-07-12 10:25:14,218 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([530] L43-17-->L43-18: Formula: (= v_~result_6~0_1 |v_thread1Thread1of1ForFork1_#t~ite4#1_5|) InVars {thread1Thread1of1ForFork1_#t~ite4#1=|v_thread1Thread1of1ForFork1_#t~ite4#1_5|} OutVars{~result_6~0=v_~result_6~0_1, thread1Thread1of1ForFork1_#t~ite4#1=|v_thread1Thread1of1ForFork1_#t~ite4#1_5|} AuxVars[] AssignedVars[~result_6~0][112], [Black: 252#true, Black: 260#(not (= ~length_4~0 0)), 276#true, 56#L74-4true, 117#L43-18true, 266#(not (= ~length_2~0 0)), 118#L49-19true, Black: 264#true, Black: 270#true, Black: 238#(and (= |thread3Thread1of1ForFork0_#t~ite9#1| 1) (= (+ (- 1) ~result_8~0) 0)), Black: 234#(and (= 1 |thread3Thread1of1ForFork0_#t~ite12#1|) (= |thread3Thread1of1ForFork0_#t~ite9#1| 1) (= (+ (- 1) ~result_8~0) 0)), 175#L55-18true, Black: 226#(= |thread3Thread1of1ForFork0_#t~ite9#1| 1), Black: 228#(= (+ (- 1) ~result_8~0) 0), Black: 232#(and (= 1 |thread3Thread1of1ForFork0_#t~ite12#1|) (= |thread3Thread1of1ForFork0_#t~ite9#1| 1)), 272#(= ~length_0~0 0)]) [2022-07-12 10:25:14,218 INFO L384 tUnfolder$Statistics]: this new event has 96 ancestors and is cut-off event [2022-07-12 10:25:14,218 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-07-12 10:25:14,218 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-07-12 10:25:14,218 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-07-12 10:25:14,218 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([530] L43-17-->L43-18: Formula: (= v_~result_6~0_1 |v_thread1Thread1of1ForFork1_#t~ite4#1_5|) InVars {thread1Thread1of1ForFork1_#t~ite4#1=|v_thread1Thread1of1ForFork1_#t~ite4#1_5|} OutVars{~result_6~0=v_~result_6~0_1, thread1Thread1of1ForFork1_#t~ite4#1=|v_thread1Thread1of1ForFork1_#t~ite4#1_5|} AuxVars[] AssignedVars[~result_6~0][63], [Black: 254#(= ~length_4~0 0), Black: 258#true, 56#L74-4true, 234#(and (= 1 |thread3Thread1of1ForFork0_#t~ite12#1|) (= |thread3Thread1of1ForFork0_#t~ite9#1| 1) (= (+ (- 1) ~result_8~0) 0)), 117#L43-18true, 266#(not (= ~length_2~0 0)), Black: 264#true, 260#(not (= ~length_4~0 0)), Black: 270#true, Black: 238#(and (= |thread3Thread1of1ForFork0_#t~ite9#1| 1) (= (+ (- 1) ~result_8~0) 0)), 175#L55-18true, Black: 226#(= |thread3Thread1of1ForFork0_#t~ite9#1| 1), Black: 228#(= (+ (- 1) ~result_8~0) 0), Black: 232#(and (= 1 |thread3Thread1of1ForFork0_#t~ite12#1|) (= |thread3Thread1of1ForFork0_#t~ite9#1| 1)), 280#(= ~result_7~0 0), 176#L49-9true, 272#(= ~length_0~0 0)]) [2022-07-12 10:25:14,219 INFO L384 tUnfolder$Statistics]: this new event has 92 ancestors and is cut-off event [2022-07-12 10:25:14,219 INFO L387 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-07-12 10:25:14,219 INFO L387 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-07-12 10:25:14,219 INFO L387 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-07-12 10:25:14,219 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([530] L43-17-->L43-18: Formula: (= v_~result_6~0_1 |v_thread1Thread1of1ForFork1_#t~ite4#1_5|) InVars {thread1Thread1of1ForFork1_#t~ite4#1=|v_thread1Thread1of1ForFork1_#t~ite4#1_5|} OutVars{~result_6~0=v_~result_6~0_1, thread1Thread1of1ForFork1_#t~ite4#1=|v_thread1Thread1of1ForFork1_#t~ite4#1_5|} AuxVars[] AssignedVars[~result_6~0][63], [Black: 252#true, Black: 260#(not (= ~length_4~0 0)), 56#L74-4true, 266#(not (= ~length_2~0 0)), 117#L43-18true, Black: 264#true, 150#L49-17true, Black: 270#true, Black: 238#(and (= |thread3Thread1of1ForFork0_#t~ite9#1| 1) (= (+ (- 1) ~result_8~0) 0)), Black: 234#(and (= 1 |thread3Thread1of1ForFork0_#t~ite12#1|) (= |thread3Thread1of1ForFork0_#t~ite9#1| 1) (= (+ (- 1) ~result_8~0) 0)), 175#L55-18true, Black: 226#(= |thread3Thread1of1ForFork0_#t~ite9#1| 1), Black: 228#(= (+ (- 1) ~result_8~0) 0), Black: 232#(and (= 1 |thread3Thread1of1ForFork0_#t~ite12#1|) (= |thread3Thread1of1ForFork0_#t~ite9#1| 1)), 280#(= ~result_7~0 0), 272#(= ~length_0~0 0)]) [2022-07-12 10:25:14,219 INFO L384 tUnfolder$Statistics]: this new event has 94 ancestors and is cut-off event [2022-07-12 10:25:14,219 INFO L387 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-07-12 10:25:14,220 INFO L387 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-07-12 10:25:14,220 INFO L387 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-07-12 10:25:14,220 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([530] L43-17-->L43-18: Formula: (= v_~result_6~0_1 |v_thread1Thread1of1ForFork1_#t~ite4#1_5|) InVars {thread1Thread1of1ForFork1_#t~ite4#1=|v_thread1Thread1of1ForFork1_#t~ite4#1_5|} OutVars{~result_6~0=v_~result_6~0_1, thread1Thread1of1ForFork1_#t~ite4#1=|v_thread1Thread1of1ForFork1_#t~ite4#1_5|} AuxVars[] AssignedVars[~result_6~0][63], [Black: 252#true, Black: 260#(not (= ~length_4~0 0)), 56#L74-4true, 266#(not (= ~length_2~0 0)), 117#L43-18true, Black: 264#true, Black: 270#true, Black: 238#(and (= |thread3Thread1of1ForFork0_#t~ite9#1| 1) (= (+ (- 1) ~result_8~0) 0)), Black: 234#(and (= 1 |thread3Thread1of1ForFork0_#t~ite12#1|) (= |thread3Thread1of1ForFork0_#t~ite9#1| 1) (= (+ (- 1) ~result_8~0) 0)), 175#L55-18true, 76#L49-7true, Black: 226#(= |thread3Thread1of1ForFork0_#t~ite9#1| 1), Black: 228#(= (+ (- 1) ~result_8~0) 0), Black: 232#(and (= 1 |thread3Thread1of1ForFork0_#t~ite12#1|) (= |thread3Thread1of1ForFork0_#t~ite9#1| 1)), 280#(= ~result_7~0 0), 272#(= ~length_0~0 0)]) [2022-07-12 10:25:14,220 INFO L384 tUnfolder$Statistics]: this new event has 92 ancestors and is cut-off event [2022-07-12 10:25:14,220 INFO L387 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-07-12 10:25:14,220 INFO L387 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-07-12 10:25:14,220 INFO L387 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-07-12 10:25:14,382 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([530] L43-17-->L43-18: Formula: (= v_~result_6~0_1 |v_thread1Thread1of1ForFork1_#t~ite4#1_5|) InVars {thread1Thread1of1ForFork1_#t~ite4#1=|v_thread1Thread1of1ForFork1_#t~ite4#1_5|} OutVars{~result_6~0=v_~result_6~0_1, thread1Thread1of1ForFork1_#t~ite4#1=|v_thread1Thread1of1ForFork1_#t~ite4#1_5|} AuxVars[] AssignedVars[~result_6~0][63], [Black: 254#(= ~length_4~0 0), Black: 258#true, 56#L74-4true, 234#(and (= 1 |thread3Thread1of1ForFork0_#t~ite12#1|) (= |thread3Thread1of1ForFork0_#t~ite9#1| 1) (= (+ (- 1) ~result_8~0) 0)), 117#L43-18true, 266#(not (= ~length_2~0 0)), Black: 264#true, 150#L49-17true, 260#(not (= ~length_4~0 0)), Black: 270#true, Black: 238#(and (= |thread3Thread1of1ForFork0_#t~ite9#1| 1) (= (+ (- 1) ~result_8~0) 0)), 175#L55-18true, Black: 226#(= |thread3Thread1of1ForFork0_#t~ite9#1| 1), Black: 228#(= (+ (- 1) ~result_8~0) 0), Black: 232#(and (= 1 |thread3Thread1of1ForFork0_#t~ite12#1|) (= |thread3Thread1of1ForFork0_#t~ite9#1| 1)), 280#(= ~result_7~0 0), 272#(= ~length_0~0 0)]) [2022-07-12 10:25:14,383 INFO L384 tUnfolder$Statistics]: this new event has 94 ancestors and is cut-off event [2022-07-12 10:25:14,383 INFO L387 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-07-12 10:25:14,383 INFO L387 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-07-12 10:25:14,383 INFO L387 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-07-12 10:25:14,385 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([620] L55-17-->L55-18: Formula: (= v_~result_8~0_1 |v_thread3Thread1of1ForFork0_#t~ite12#1_5|) InVars {thread3Thread1of1ForFork0_#t~ite12#1=|v_thread3Thread1of1ForFork0_#t~ite12#1_5|} OutVars{~result_8~0=v_~result_8~0_1, thread3Thread1of1ForFork0_#t~ite12#1=|v_thread3Thread1of1ForFork0_#t~ite12#1_5|} AuxVars[] AssignedVars[~result_8~0][157], [Black: 254#(= ~length_4~0 0), Black: 258#true, 56#L74-4true, 117#L43-18true, 266#(not (= ~length_2~0 0)), 234#(and (= 1 |thread3Thread1of1ForFork0_#t~ite12#1|) (= |thread3Thread1of1ForFork0_#t~ite9#1| 1) (= (+ (- 1) ~result_8~0) 0)), Black: 264#true, 260#(not (= ~length_4~0 0)), Black: 270#true, Black: 238#(and (= |thread3Thread1of1ForFork0_#t~ite9#1| 1) (= (+ (- 1) ~result_8~0) 0)), 175#L55-18true, Black: 226#(= |thread3Thread1of1ForFork0_#t~ite9#1| 1), Black: 228#(= (+ (- 1) ~result_8~0) 0), Black: 232#(and (= 1 |thread3Thread1of1ForFork0_#t~ite12#1|) (= |thread3Thread1of1ForFork0_#t~ite9#1| 1)), 280#(= ~result_7~0 0), 176#L49-9true, 272#(= ~length_0~0 0)]) [2022-07-12 10:25:14,385 INFO L384 tUnfolder$Statistics]: this new event has 92 ancestors and is cut-off event [2022-07-12 10:25:14,385 INFO L387 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-07-12 10:25:14,385 INFO L387 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-07-12 10:25:14,386 INFO L387 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-07-12 10:25:14,386 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([620] L55-17-->L55-18: Formula: (= v_~result_8~0_1 |v_thread3Thread1of1ForFork0_#t~ite12#1_5|) InVars {thread3Thread1of1ForFork0_#t~ite12#1=|v_thread3Thread1of1ForFork0_#t~ite12#1_5|} OutVars{~result_8~0=v_~result_8~0_1, thread3Thread1of1ForFork0_#t~ite12#1=|v_thread3Thread1of1ForFork0_#t~ite12#1_5|} AuxVars[] AssignedVars[~result_8~0][156], [Black: 252#true, Black: 260#(not (= ~length_4~0 0)), 56#L74-4true, 117#L43-18true, 266#(not (= ~length_2~0 0)), Black: 264#true, Black: 270#true, Black: 238#(and (= |thread3Thread1of1ForFork0_#t~ite9#1| 1) (= (+ (- 1) ~result_8~0) 0)), Black: 234#(and (= 1 |thread3Thread1of1ForFork0_#t~ite12#1|) (= |thread3Thread1of1ForFork0_#t~ite9#1| 1) (= (+ (- 1) ~result_8~0) 0)), 175#L55-18true, 76#L49-7true, Black: 226#(= |thread3Thread1of1ForFork0_#t~ite9#1| 1), Black: 228#(= (+ (- 1) ~result_8~0) 0), Black: 232#(and (= 1 |thread3Thread1of1ForFork0_#t~ite12#1|) (= |thread3Thread1of1ForFork0_#t~ite9#1| 1)), 280#(= ~result_7~0 0), 272#(= ~length_0~0 0)]) [2022-07-12 10:25:14,386 INFO L384 tUnfolder$Statistics]: this new event has 92 ancestors and is cut-off event [2022-07-12 10:25:14,386 INFO L387 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-07-12 10:25:14,386 INFO L387 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-07-12 10:25:14,386 INFO L387 tUnfolder$Statistics]: existing Event has 70 ancestors and is cut-off event [2022-07-12 10:25:14,389 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([530] L43-17-->L43-18: Formula: (= v_~result_6~0_1 |v_thread1Thread1of1ForFork1_#t~ite4#1_5|) InVars {thread1Thread1of1ForFork1_#t~ite4#1=|v_thread1Thread1of1ForFork1_#t~ite4#1_5|} OutVars{~result_6~0=v_~result_6~0_1, thread1Thread1of1ForFork1_#t~ite4#1=|v_thread1Thread1of1ForFork1_#t~ite4#1_5|} AuxVars[] AssignedVars[~result_6~0][63], [Black: 254#(= ~length_4~0 0), Black: 258#true, 56#L74-4true, 234#(and (= 1 |thread3Thread1of1ForFork0_#t~ite12#1|) (= |thread3Thread1of1ForFork0_#t~ite9#1| 1) (= (+ (- 1) ~result_8~0) 0)), 266#(not (= ~length_2~0 0)), 117#L43-18true, Black: 264#true, 150#L49-17true, 260#(not (= ~length_4~0 0)), Black: 270#true, Black: 238#(and (= |thread3Thread1of1ForFork0_#t~ite9#1| 1) (= (+ (- 1) ~result_8~0) 0)), 175#L55-18true, Black: 226#(= |thread3Thread1of1ForFork0_#t~ite9#1| 1), Black: 228#(= (+ (- 1) ~result_8~0) 0), Black: 232#(and (= 1 |thread3Thread1of1ForFork0_#t~ite12#1|) (= |thread3Thread1of1ForFork0_#t~ite9#1| 1)), 280#(= ~result_7~0 0), 272#(= ~length_0~0 0)]) [2022-07-12 10:25:14,389 INFO L384 tUnfolder$Statistics]: this new event has 116 ancestors and is cut-off event [2022-07-12 10:25:14,389 INFO L387 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-07-12 10:25:14,389 INFO L387 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-07-12 10:25:14,389 INFO L387 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-07-12 10:25:14,389 INFO L387 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-07-12 10:25:14,390 INFO L382 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([530] L43-17-->L43-18: Formula: (= v_~result_6~0_1 |v_thread1Thread1of1ForFork1_#t~ite4#1_5|) InVars {thread1Thread1of1ForFork1_#t~ite4#1=|v_thread1Thread1of1ForFork1_#t~ite4#1_5|} OutVars{~result_6~0=v_~result_6~0_1, thread1Thread1of1ForFork1_#t~ite4#1=|v_thread1Thread1of1ForFork1_#t~ite4#1_5|} AuxVars[] AssignedVars[~result_6~0][63], [Black: 254#(= ~length_4~0 0), Black: 258#true, 56#L74-4true, 266#(not (= ~length_2~0 0)), 234#(and (= 1 |thread3Thread1of1ForFork0_#t~ite12#1|) (= |thread3Thread1of1ForFork0_#t~ite9#1| 1) (= (+ (- 1) ~result_8~0) 0)), 117#L43-18true, Black: 264#true, 150#L49-17true, 260#(not (= ~length_4~0 0)), Black: 270#true, Black: 238#(and (= |thread3Thread1of1ForFork0_#t~ite9#1| 1) (= (+ (- 1) ~result_8~0) 0)), 175#L55-18true, Black: 226#(= |thread3Thread1of1ForFork0_#t~ite9#1| 1), Black: 228#(= (+ (- 1) ~result_8~0) 0), Black: 232#(and (= 1 |thread3Thread1of1ForFork0_#t~ite12#1|) (= |thread3Thread1of1ForFork0_#t~ite9#1| 1)), 280#(= ~result_7~0 0), 272#(= ~length_0~0 0)]) [2022-07-12 10:25:14,390 INFO L384 tUnfolder$Statistics]: this new event has 94 ancestors and is cut-off event [2022-07-12 10:25:14,390 INFO L387 tUnfolder$Statistics]: existing Event has 116 ancestors and is cut-off event [2022-07-12 10:25:14,391 INFO L387 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-07-12 10:25:14,391 INFO L387 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-07-12 10:25:14,391 INFO L387 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-07-12 10:25:14,391 INFO L387 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-07-12 10:25:14,395 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([530] L43-17-->L43-18: Formula: (= v_~result_6~0_1 |v_thread1Thread1of1ForFork1_#t~ite4#1_5|) InVars {thread1Thread1of1ForFork1_#t~ite4#1=|v_thread1Thread1of1ForFork1_#t~ite4#1_5|} OutVars{~result_6~0=v_~result_6~0_1, thread1Thread1of1ForFork1_#t~ite4#1=|v_thread1Thread1of1ForFork1_#t~ite4#1_5|} AuxVars[] AssignedVars[~result_6~0][112], [Black: 254#(= ~length_4~0 0), Black: 258#true, 276#true, 56#L74-4true, 234#(and (= 1 |thread3Thread1of1ForFork0_#t~ite12#1|) (= |thread3Thread1of1ForFork0_#t~ite9#1| 1) (= (+ (- 1) ~result_8~0) 0)), 266#(not (= ~length_2~0 0)), 117#L43-18true, 95#L49-18true, Black: 264#true, 260#(not (= ~length_4~0 0)), Black: 270#true, Black: 238#(and (= |thread3Thread1of1ForFork0_#t~ite9#1| 1) (= (+ (- 1) ~result_8~0) 0)), 175#L55-18true, Black: 226#(= |thread3Thread1of1ForFork0_#t~ite9#1| 1), Black: 228#(= (+ (- 1) ~result_8~0) 0), Black: 232#(and (= 1 |thread3Thread1of1ForFork0_#t~ite12#1|) (= |thread3Thread1of1ForFork0_#t~ite9#1| 1)), 272#(= ~length_0~0 0)]) [2022-07-12 10:25:14,395 INFO L384 tUnfolder$Statistics]: this new event has 95 ancestors and is cut-off event [2022-07-12 10:25:14,395 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-07-12 10:25:14,395 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-07-12 10:25:14,395 INFO L387 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-07-12 10:25:14,398 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([530] L43-17-->L43-18: Formula: (= v_~result_6~0_1 |v_thread1Thread1of1ForFork1_#t~ite4#1_5|) InVars {thread1Thread1of1ForFork1_#t~ite4#1=|v_thread1Thread1of1ForFork1_#t~ite4#1_5|} OutVars{~result_6~0=v_~result_6~0_1, thread1Thread1of1ForFork1_#t~ite4#1=|v_thread1Thread1of1ForFork1_#t~ite4#1_5|} AuxVars[] AssignedVars[~result_6~0][112], [Black: 254#(= ~length_4~0 0), Black: 258#true, 276#true, 56#L74-4true, 234#(and (= 1 |thread3Thread1of1ForFork0_#t~ite12#1|) (= |thread3Thread1of1ForFork0_#t~ite9#1| 1) (= (+ (- 1) ~result_8~0) 0)), 266#(not (= ~length_2~0 0)), 117#L43-18true, Black: 264#true, 95#L49-18true, 260#(not (= ~length_4~0 0)), Black: 270#true, Black: 238#(and (= |thread3Thread1of1ForFork0_#t~ite9#1| 1) (= (+ (- 1) ~result_8~0) 0)), 175#L55-18true, Black: 226#(= |thread3Thread1of1ForFork0_#t~ite9#1| 1), Black: 228#(= (+ (- 1) ~result_8~0) 0), Black: 232#(and (= 1 |thread3Thread1of1ForFork0_#t~ite12#1|) (= |thread3Thread1of1ForFork0_#t~ite9#1| 1)), 272#(= ~length_0~0 0)]) [2022-07-12 10:25:14,399 INFO L384 tUnfolder$Statistics]: this new event has 117 ancestors and is cut-off event [2022-07-12 10:25:14,399 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-07-12 10:25:14,399 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-07-12 10:25:14,399 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-07-12 10:25:14,399 INFO L387 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-07-12 10:25:14,401 INFO L382 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([530] L43-17-->L43-18: Formula: (= v_~result_6~0_1 |v_thread1Thread1of1ForFork1_#t~ite4#1_5|) InVars {thread1Thread1of1ForFork1_#t~ite4#1=|v_thread1Thread1of1ForFork1_#t~ite4#1_5|} OutVars{~result_6~0=v_~result_6~0_1, thread1Thread1of1ForFork1_#t~ite4#1=|v_thread1Thread1of1ForFork1_#t~ite4#1_5|} AuxVars[] AssignedVars[~result_6~0][112], [Black: 254#(= ~length_4~0 0), Black: 258#true, 276#true, 56#L74-4true, 117#L43-18true, 266#(not (= ~length_2~0 0)), 234#(and (= 1 |thread3Thread1of1ForFork0_#t~ite12#1|) (= |thread3Thread1of1ForFork0_#t~ite9#1| 1) (= (+ (- 1) ~result_8~0) 0)), 95#L49-18true, Black: 264#true, 260#(not (= ~length_4~0 0)), Black: 270#true, Black: 238#(and (= |thread3Thread1of1ForFork0_#t~ite9#1| 1) (= (+ (- 1) ~result_8~0) 0)), 175#L55-18true, Black: 226#(= |thread3Thread1of1ForFork0_#t~ite9#1| 1), Black: 228#(= (+ (- 1) ~result_8~0) 0), Black: 232#(and (= 1 |thread3Thread1of1ForFork0_#t~ite12#1|) (= |thread3Thread1of1ForFork0_#t~ite9#1| 1)), 272#(= ~length_0~0 0)]) [2022-07-12 10:25:14,401 INFO L384 tUnfolder$Statistics]: this new event has 95 ancestors and is cut-off event [2022-07-12 10:25:14,401 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-07-12 10:25:14,401 INFO L387 tUnfolder$Statistics]: existing Event has 117 ancestors and is cut-off event [2022-07-12 10:25:14,401 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-07-12 10:25:14,401 INFO L387 tUnfolder$Statistics]: existing Event has 95 ancestors and is cut-off event [2022-07-12 10:25:14,401 INFO L387 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-07-12 10:25:14,404 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([530] L43-17-->L43-18: Formula: (= v_~result_6~0_1 |v_thread1Thread1of1ForFork1_#t~ite4#1_5|) InVars {thread1Thread1of1ForFork1_#t~ite4#1=|v_thread1Thread1of1ForFork1_#t~ite4#1_5|} OutVars{~result_6~0=v_~result_6~0_1, thread1Thread1of1ForFork1_#t~ite4#1=|v_thread1Thread1of1ForFork1_#t~ite4#1_5|} AuxVars[] AssignedVars[~result_6~0][112], [Black: 254#(= ~length_4~0 0), Black: 258#true, 276#true, 56#L74-4true, 234#(and (= 1 |thread3Thread1of1ForFork0_#t~ite12#1|) (= |thread3Thread1of1ForFork0_#t~ite9#1| 1) (= (+ (- 1) ~result_8~0) 0)), 266#(not (= ~length_2~0 0)), 117#L43-18true, 118#L49-19true, Black: 264#true, 260#(not (= ~length_4~0 0)), Black: 270#true, Black: 238#(and (= |thread3Thread1of1ForFork0_#t~ite9#1| 1) (= (+ (- 1) ~result_8~0) 0)), 175#L55-18true, Black: 226#(= |thread3Thread1of1ForFork0_#t~ite9#1| 1), Black: 228#(= (+ (- 1) ~result_8~0) 0), Black: 232#(and (= 1 |thread3Thread1of1ForFork0_#t~ite12#1|) (= |thread3Thread1of1ForFork0_#t~ite9#1| 1)), 272#(= ~length_0~0 0)]) [2022-07-12 10:25:14,404 INFO L384 tUnfolder$Statistics]: this new event has 96 ancestors and is cut-off event [2022-07-12 10:25:14,405 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-07-12 10:25:14,405 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2022-07-12 10:25:14,405 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2022-07-12 10:25:14,408 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([530] L43-17-->L43-18: Formula: (= v_~result_6~0_1 |v_thread1Thread1of1ForFork1_#t~ite4#1_5|) InVars {thread1Thread1of1ForFork1_#t~ite4#1=|v_thread1Thread1of1ForFork1_#t~ite4#1_5|} OutVars{~result_6~0=v_~result_6~0_1, thread1Thread1of1ForFork1_#t~ite4#1=|v_thread1Thread1of1ForFork1_#t~ite4#1_5|} AuxVars[] AssignedVars[~result_6~0][112], [Black: 254#(= ~length_4~0 0), Black: 258#true, 276#true, 56#L74-4true, 117#L43-18true, 234#(and (= 1 |thread3Thread1of1ForFork0_#t~ite12#1|) (= |thread3Thread1of1ForFork0_#t~ite9#1| 1) (= (+ (- 1) ~result_8~0) 0)), 266#(not (= ~length_2~0 0)), 118#L49-19true, Black: 264#true, 260#(not (= ~length_4~0 0)), Black: 270#true, Black: 238#(and (= |thread3Thread1of1ForFork0_#t~ite9#1| 1) (= (+ (- 1) ~result_8~0) 0)), 175#L55-18true, Black: 226#(= |thread3Thread1of1ForFork0_#t~ite9#1| 1), Black: 228#(= (+ (- 1) ~result_8~0) 0), Black: 232#(and (= 1 |thread3Thread1of1ForFork0_#t~ite12#1|) (= |thread3Thread1of1ForFork0_#t~ite9#1| 1)), 272#(= ~length_0~0 0)]) [2022-07-12 10:25:14,408 INFO L384 tUnfolder$Statistics]: this new event has 118 ancestors and is cut-off event [2022-07-12 10:25:14,408 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2022-07-12 10:25:14,408 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-07-12 10:25:14,408 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2022-07-12 10:25:14,409 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2022-07-12 10:25:14,410 INFO L382 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([530] L43-17-->L43-18: Formula: (= v_~result_6~0_1 |v_thread1Thread1of1ForFork1_#t~ite4#1_5|) InVars {thread1Thread1of1ForFork1_#t~ite4#1=|v_thread1Thread1of1ForFork1_#t~ite4#1_5|} OutVars{~result_6~0=v_~result_6~0_1, thread1Thread1of1ForFork1_#t~ite4#1=|v_thread1Thread1of1ForFork1_#t~ite4#1_5|} AuxVars[] AssignedVars[~result_6~0][112], [Black: 254#(= ~length_4~0 0), Black: 258#true, 276#true, 56#L74-4true, 117#L43-18true, 266#(not (= ~length_2~0 0)), 234#(and (= 1 |thread3Thread1of1ForFork0_#t~ite12#1|) (= |thread3Thread1of1ForFork0_#t~ite9#1| 1) (= (+ (- 1) ~result_8~0) 0)), 118#L49-19true, Black: 264#true, 260#(not (= ~length_4~0 0)), Black: 270#true, Black: 238#(and (= |thread3Thread1of1ForFork0_#t~ite9#1| 1) (= (+ (- 1) ~result_8~0) 0)), 175#L55-18true, Black: 226#(= |thread3Thread1of1ForFork0_#t~ite9#1| 1), Black: 228#(= (+ (- 1) ~result_8~0) 0), Black: 232#(and (= 1 |thread3Thread1of1ForFork0_#t~ite12#1|) (= |thread3Thread1of1ForFork0_#t~ite9#1| 1)), 272#(= ~length_0~0 0)]) [2022-07-12 10:25:14,410 INFO L384 tUnfolder$Statistics]: this new event has 96 ancestors and is cut-off event [2022-07-12 10:25:14,410 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2022-07-12 10:25:14,410 INFO L387 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-07-12 10:25:14,410 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2022-07-12 10:25:14,411 INFO L387 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2022-07-12 10:25:14,411 INFO L387 tUnfolder$Statistics]: existing Event has 118 ancestors and is cut-off event [2022-07-12 10:25:14,418 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([530] L43-17-->L43-18: Formula: (= v_~result_6~0_1 |v_thread1Thread1of1ForFork1_#t~ite4#1_5|) InVars {thread1Thread1of1ForFork1_#t~ite4#1=|v_thread1Thread1of1ForFork1_#t~ite4#1_5|} OutVars{~result_6~0=v_~result_6~0_1, thread1Thread1of1ForFork1_#t~ite4#1=|v_thread1Thread1of1ForFork1_#t~ite4#1_5|} AuxVars[] AssignedVars[~result_6~0][112], [Black: 254#(= ~length_4~0 0), Black: 258#true, 276#true, 56#L74-4true, 117#L43-18true, 234#(and (= 1 |thread3Thread1of1ForFork0_#t~ite12#1|) (= |thread3Thread1of1ForFork0_#t~ite9#1| 1) (= (+ (- 1) ~result_8~0) 0)), 266#(not (= ~length_2~0 0)), Black: 264#true, 260#(not (= ~length_4~0 0)), 177#L49-20true, Black: 270#true, Black: 238#(and (= |thread3Thread1of1ForFork0_#t~ite9#1| 1) (= (+ (- 1) ~result_8~0) 0)), 175#L55-18true, Black: 226#(= |thread3Thread1of1ForFork0_#t~ite9#1| 1), Black: 228#(= (+ (- 1) ~result_8~0) 0), Black: 232#(and (= 1 |thread3Thread1of1ForFork0_#t~ite12#1|) (= |thread3Thread1of1ForFork0_#t~ite9#1| 1)), 272#(= ~length_0~0 0)]) [2022-07-12 10:25:14,419 INFO L384 tUnfolder$Statistics]: this new event has 97 ancestors and is cut-off event [2022-07-12 10:25:14,419 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-07-12 10:25:14,419 INFO L387 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-07-12 10:25:14,419 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-07-12 10:25:14,421 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([530] L43-17-->L43-18: Formula: (= v_~result_6~0_1 |v_thread1Thread1of1ForFork1_#t~ite4#1_5|) InVars {thread1Thread1of1ForFork1_#t~ite4#1=|v_thread1Thread1of1ForFork1_#t~ite4#1_5|} OutVars{~result_6~0=v_~result_6~0_1, thread1Thread1of1ForFork1_#t~ite4#1=|v_thread1Thread1of1ForFork1_#t~ite4#1_5|} AuxVars[] AssignedVars[~result_6~0][112], [Black: 254#(= ~length_4~0 0), Black: 258#true, 276#true, 56#L74-4true, 117#L43-18true, 234#(and (= 1 |thread3Thread1of1ForFork0_#t~ite12#1|) (= |thread3Thread1of1ForFork0_#t~ite9#1| 1) (= (+ (- 1) ~result_8~0) 0)), 266#(not (= ~length_2~0 0)), Black: 264#true, 260#(not (= ~length_4~0 0)), 177#L49-20true, Black: 270#true, Black: 238#(and (= |thread3Thread1of1ForFork0_#t~ite9#1| 1) (= (+ (- 1) ~result_8~0) 0)), 175#L55-18true, Black: 226#(= |thread3Thread1of1ForFork0_#t~ite9#1| 1), Black: 228#(= (+ (- 1) ~result_8~0) 0), Black: 232#(and (= 1 |thread3Thread1of1ForFork0_#t~ite12#1|) (= |thread3Thread1of1ForFork0_#t~ite9#1| 1)), 272#(= ~length_0~0 0)]) [2022-07-12 10:25:14,421 INFO L384 tUnfolder$Statistics]: this new event has 119 ancestors and is cut-off event [2022-07-12 10:25:14,421 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-07-12 10:25:14,421 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-07-12 10:25:14,421 INFO L387 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-07-12 10:25:14,421 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-07-12 10:25:14,423 INFO L382 tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([530] L43-17-->L43-18: Formula: (= v_~result_6~0_1 |v_thread1Thread1of1ForFork1_#t~ite4#1_5|) InVars {thread1Thread1of1ForFork1_#t~ite4#1=|v_thread1Thread1of1ForFork1_#t~ite4#1_5|} OutVars{~result_6~0=v_~result_6~0_1, thread1Thread1of1ForFork1_#t~ite4#1=|v_thread1Thread1of1ForFork1_#t~ite4#1_5|} AuxVars[] AssignedVars[~result_6~0][112], [Black: 254#(= ~length_4~0 0), Black: 258#true, 276#true, 56#L74-4true, 266#(not (= ~length_2~0 0)), 117#L43-18true, 234#(and (= 1 |thread3Thread1of1ForFork0_#t~ite12#1|) (= |thread3Thread1of1ForFork0_#t~ite9#1| 1) (= (+ (- 1) ~result_8~0) 0)), Black: 264#true, 260#(not (= ~length_4~0 0)), 177#L49-20true, Black: 270#true, Black: 238#(and (= |thread3Thread1of1ForFork0_#t~ite9#1| 1) (= (+ (- 1) ~result_8~0) 0)), 175#L55-18true, Black: 226#(= |thread3Thread1of1ForFork0_#t~ite9#1| 1), Black: 228#(= (+ (- 1) ~result_8~0) 0), Black: 232#(and (= 1 |thread3Thread1of1ForFork0_#t~ite12#1|) (= |thread3Thread1of1ForFork0_#t~ite9#1| 1)), 272#(= ~length_0~0 0)]) [2022-07-12 10:25:14,423 INFO L384 tUnfolder$Statistics]: this new event has 97 ancestors and is cut-off event [2022-07-12 10:25:14,423 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-07-12 10:25:14,423 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-07-12 10:25:14,423 INFO L387 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-07-12 10:25:14,423 INFO L387 tUnfolder$Statistics]: existing Event has 119 ancestors and is cut-off event [2022-07-12 10:25:14,423 INFO L387 tUnfolder$Statistics]: existing Event has 97 ancestors and is cut-off event [2022-07-12 10:25:14,426 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([620] L55-17-->L55-18: Formula: (= v_~result_8~0_1 |v_thread3Thread1of1ForFork0_#t~ite12#1_5|) InVars {thread3Thread1of1ForFork0_#t~ite12#1=|v_thread3Thread1of1ForFork0_#t~ite12#1_5|} OutVars{~result_8~0=v_~result_8~0_1, thread3Thread1of1ForFork0_#t~ite12#1=|v_thread3Thread1of1ForFork0_#t~ite12#1_5|} AuxVars[] AssignedVars[~result_8~0][157], [Black: 254#(= ~length_4~0 0), Black: 258#true, 88#L75-2true, 234#(and (= 1 |thread3Thread1of1ForFork0_#t~ite12#1|) (= |thread3Thread1of1ForFork0_#t~ite9#1| 1) (= (+ (- 1) ~result_8~0) 0)), 266#(not (= ~length_2~0 0)), Black: 264#true, 260#(not (= ~length_4~0 0)), Black: 270#true, Black: 238#(and (= |thread3Thread1of1ForFork0_#t~ite9#1| 1) (= (+ (- 1) ~result_8~0) 0)), 175#L55-18true, Black: 226#(= |thread3Thread1of1ForFork0_#t~ite9#1| 1), Black: 228#(= (+ (- 1) ~result_8~0) 0), Black: 232#(and (= 1 |thread3Thread1of1ForFork0_#t~ite12#1|) (= |thread3Thread1of1ForFork0_#t~ite9#1| 1)), 280#(= ~result_7~0 0), 176#L49-9true, 272#(= ~length_0~0 0)]) [2022-07-12 10:25:14,426 INFO L384 tUnfolder$Statistics]: this new event has 102 ancestors and is cut-off event [2022-07-12 10:25:14,426 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-07-12 10:25:14,426 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-07-12 10:25:14,427 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-07-12 10:25:14,427 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([620] L55-17-->L55-18: Formula: (= v_~result_8~0_1 |v_thread3Thread1of1ForFork0_#t~ite12#1_5|) InVars {thread3Thread1of1ForFork0_#t~ite12#1=|v_thread3Thread1of1ForFork0_#t~ite12#1_5|} OutVars{~result_8~0=v_~result_8~0_1, thread3Thread1of1ForFork0_#t~ite12#1=|v_thread3Thread1of1ForFork0_#t~ite12#1_5|} AuxVars[] AssignedVars[~result_8~0][156], [Black: 252#true, Black: 260#(not (= ~length_4~0 0)), 88#L75-2true, 266#(not (= ~length_2~0 0)), Black: 264#true, Black: 270#true, Black: 238#(and (= |thread3Thread1of1ForFork0_#t~ite9#1| 1) (= (+ (- 1) ~result_8~0) 0)), 175#L55-18true, Black: 234#(and (= 1 |thread3Thread1of1ForFork0_#t~ite12#1|) (= |thread3Thread1of1ForFork0_#t~ite9#1| 1) (= (+ (- 1) ~result_8~0) 0)), 76#L49-7true, Black: 226#(= |thread3Thread1of1ForFork0_#t~ite9#1| 1), Black: 228#(= (+ (- 1) ~result_8~0) 0), Black: 232#(and (= 1 |thread3Thread1of1ForFork0_#t~ite12#1|) (= |thread3Thread1of1ForFork0_#t~ite9#1| 1)), 280#(= ~result_7~0 0), 272#(= ~length_0~0 0)]) [2022-07-12 10:25:14,427 INFO L384 tUnfolder$Statistics]: this new event has 102 ancestors and is cut-off event [2022-07-12 10:25:14,427 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-07-12 10:25:14,427 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-07-12 10:25:14,427 INFO L387 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-07-12 10:25:14,494 INFO L129 PetriNetUnfolder]: 1208/4597 cut-off events. [2022-07-12 10:25:14,494 INFO L130 PetriNetUnfolder]: For 920/1126 co-relation queries the response was YES. [2022-07-12 10:25:14,511 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7974 conditions, 4597 events. 1208/4597 cut-off events. For 920/1126 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 46221 event pairs, 342 based on Foata normal form. 44/4054 useless extension candidates. Maximal degree in co-relation 7720. Up to 817 conditions per place. [2022-07-12 10:25:14,524 INFO L132 encePairwiseOnDemand]: 217/227 looper letters, 34 selfloop transitions, 7 changer transitions 4/244 dead transitions. [2022-07-12 10:25:14,524 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 244 transitions, 733 flow [2022-07-12 10:25:14,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 10:25:14,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-07-12 10:25:14,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1612 transitions. [2022-07-12 10:25:14,528 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8876651982378855 [2022-07-12 10:25:14,528 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1612 transitions. [2022-07-12 10:25:14,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1612 transitions. [2022-07-12 10:25:14,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:25:14,529 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1612 transitions. [2022-07-12 10:25:14,531 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 201.5) internal successors, (1612), 8 states have internal predecessors, (1612), 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) [2022-07-12 10:25:14,533 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 227.0) internal successors, (2043), 9 states have internal predecessors, (2043), 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) [2022-07-12 10:25:14,534 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 227.0) internal successors, (2043), 9 states have internal predecessors, (2043), 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) [2022-07-12 10:25:14,534 INFO L186 Difference]: Start difference. First operand has 222 places, 222 transitions, 579 flow. Second operand 8 states and 1612 transitions. [2022-07-12 10:25:14,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 244 transitions, 733 flow [2022-07-12 10:25:14,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 244 transitions, 725 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-07-12 10:25:14,589 INFO L242 Difference]: Finished difference. Result has 232 places, 226 transitions, 617 flow [2022-07-12 10:25:14,590 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=571, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=617, PETRI_PLACES=232, PETRI_TRANSITIONS=226} [2022-07-12 10:25:14,592 INFO L279 CegarLoopForPetriNet]: 207 programPoint places, 25 predicate places. [2022-07-12 10:25:14,592 INFO L495 AbstractCegarLoop]: Abstraction has has 232 places, 226 transitions, 617 flow [2022-07-12 10:25:14,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 198.5) internal successors, (1588), 8 states have internal predecessors, (1588), 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) [2022-07-12 10:25:14,594 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:25:14,594 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:25:14,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 10:25:14,594 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-12 10:25:14,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:25:14,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1306237264, now seen corresponding path program 1 times [2022-07-12 10:25:14,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:25:14,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708003044] [2022-07-12 10:25:14,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:25:14,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:25:14,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:25:14,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:25:14,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:25:14,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708003044] [2022-07-12 10:25:14,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708003044] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:25:14,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:25:14,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 10:25:14,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600822003] [2022-07-12 10:25:14,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:25:14,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 10:25:14,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:25:14,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 10:25:14,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 10:25:14,673 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 227 [2022-07-12 10:25:14,674 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 226 transitions, 617 flow. Second operand has 7 states, 7 states have (on average 202.28571428571428) internal successors, (1416), 7 states have internal predecessors, (1416), 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) [2022-07-12 10:25:14,674 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:25:14,674 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 227 [2022-07-12 10:25:14,674 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:25:15,025 INFO L129 PetriNetUnfolder]: 276/2516 cut-off events. [2022-07-12 10:25:15,026 INFO L130 PetriNetUnfolder]: For 289/491 co-relation queries the response was YES. [2022-07-12 10:25:15,042 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4070 conditions, 2516 events. 276/2516 cut-off events. For 289/491 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 26020 event pairs, 111 based on Foata normal form. 2/2290 useless extension candidates. Maximal degree in co-relation 4033. Up to 382 conditions per place. [2022-07-12 10:25:15,048 INFO L132 encePairwiseOnDemand]: 219/227 looper letters, 25 selfloop transitions, 5 changer transitions 10/245 dead transitions. [2022-07-12 10:25:15,048 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 245 transitions, 758 flow [2022-07-12 10:25:15,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 10:25:15,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-12 10:25:15,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1838 transitions. [2022-07-12 10:25:15,051 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.899657366617719 [2022-07-12 10:25:15,052 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1838 transitions. [2022-07-12 10:25:15,052 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1838 transitions. [2022-07-12 10:25:15,053 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:25:15,053 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1838 transitions. [2022-07-12 10:25:15,055 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 204.22222222222223) internal successors, (1838), 9 states have internal predecessors, (1838), 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) [2022-07-12 10:25:15,058 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 227.0) internal successors, (2270), 10 states have internal predecessors, (2270), 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) [2022-07-12 10:25:15,058 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 227.0) internal successors, (2270), 10 states have internal predecessors, (2270), 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) [2022-07-12 10:25:15,058 INFO L186 Difference]: Start difference. First operand has 232 places, 226 transitions, 617 flow. Second operand 9 states and 1838 transitions. [2022-07-12 10:25:15,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 245 transitions, 758 flow [2022-07-12 10:25:15,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 245 transitions, 747 flow, removed 3 selfloop flow, removed 4 redundant places. [2022-07-12 10:25:15,067 INFO L242 Difference]: Finished difference. Result has 241 places, 230 transitions, 654 flow [2022-07-12 10:25:15,067 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=609, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=654, PETRI_PLACES=241, PETRI_TRANSITIONS=230} [2022-07-12 10:25:15,068 INFO L279 CegarLoopForPetriNet]: 207 programPoint places, 34 predicate places. [2022-07-12 10:25:15,068 INFO L495 AbstractCegarLoop]: Abstraction has has 241 places, 230 transitions, 654 flow [2022-07-12 10:25:15,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 202.28571428571428) internal successors, (1416), 7 states have internal predecessors, (1416), 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) [2022-07-12 10:25:15,069 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:25:15,069 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:25:15,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 10:25:15,069 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-12 10:25:15,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:25:15,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1315973783, now seen corresponding path program 1 times [2022-07-12 10:25:15,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:25:15,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121135939] [2022-07-12 10:25:15,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:25:15,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:25:15,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:25:15,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:25:15,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:25:15,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121135939] [2022-07-12 10:25:15,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121135939] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:25:15,150 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:25:15,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 10:25:15,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995043310] [2022-07-12 10:25:15,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:25:15,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 10:25:15,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:25:15,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 10:25:15,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-12 10:25:15,152 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 227 [2022-07-12 10:25:15,154 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 230 transitions, 654 flow. Second operand has 8 states, 8 states have (on average 198.5) internal successors, (1588), 8 states have internal predecessors, (1588), 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) [2022-07-12 10:25:15,154 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:25:15,154 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 227 [2022-07-12 10:25:15,154 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:25:15,814 INFO L129 PetriNetUnfolder]: 1123/5216 cut-off events. [2022-07-12 10:25:15,815 INFO L130 PetriNetUnfolder]: For 2494/3022 co-relation queries the response was YES. [2022-07-12 10:25:15,837 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10290 conditions, 5216 events. 1123/5216 cut-off events. For 2494/3022 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 56776 event pairs, 543 based on Foata normal form. 119/4760 useless extension candidates. Maximal degree in co-relation 10253. Up to 1341 conditions per place. [2022-07-12 10:25:15,846 INFO L132 encePairwiseOnDemand]: 217/227 looper letters, 46 selfloop transitions, 7 changer transitions 17/275 dead transitions. [2022-07-12 10:25:15,846 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 275 transitions, 995 flow [2022-07-12 10:25:15,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 10:25:15,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-07-12 10:25:15,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2013 transitions. [2022-07-12 10:25:15,850 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.886784140969163 [2022-07-12 10:25:15,850 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2013 transitions. [2022-07-12 10:25:15,850 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2013 transitions. [2022-07-12 10:25:15,851 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:25:15,851 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2013 transitions. [2022-07-12 10:25:15,854 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 201.3) internal successors, (2013), 10 states have internal predecessors, (2013), 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) [2022-07-12 10:25:15,857 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 227.0) internal successors, (2497), 11 states have internal predecessors, (2497), 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) [2022-07-12 10:25:15,857 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 227.0) internal successors, (2497), 11 states have internal predecessors, (2497), 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) [2022-07-12 10:25:15,858 INFO L186 Difference]: Start difference. First operand has 241 places, 230 transitions, 654 flow. Second operand 10 states and 2013 transitions. [2022-07-12 10:25:15,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 275 transitions, 995 flow [2022-07-12 10:25:15,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 275 transitions, 986 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-07-12 10:25:15,878 INFO L242 Difference]: Finished difference. Result has 252 places, 234 transitions, 692 flow [2022-07-12 10:25:15,879 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=647, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=692, PETRI_PLACES=252, PETRI_TRANSITIONS=234} [2022-07-12 10:25:15,879 INFO L279 CegarLoopForPetriNet]: 207 programPoint places, 45 predicate places. [2022-07-12 10:25:15,879 INFO L495 AbstractCegarLoop]: Abstraction has has 252 places, 234 transitions, 692 flow [2022-07-12 10:25:15,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 198.5) internal successors, (1588), 8 states have internal predecessors, (1588), 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) [2022-07-12 10:25:15,880 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:25:15,880 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:25:15,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 10:25:15,881 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-12 10:25:15,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:25:15,881 INFO L85 PathProgramCache]: Analyzing trace with hash 339156639, now seen corresponding path program 1 times [2022-07-12 10:25:15,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:25:15,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825678547] [2022-07-12 10:25:15,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:25:15,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:25:15,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:25:15,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:25:15,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:25:15,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825678547] [2022-07-12 10:25:15,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825678547] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:25:15,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:25:15,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 10:25:15,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106272885] [2022-07-12 10:25:15,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:25:15,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 10:25:15,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:25:15,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 10:25:15,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 10:25:15,906 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 227 [2022-07-12 10:25:15,906 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 234 transitions, 692 flow. Second operand has 3 states, 3 states have (on average 210.33333333333334) internal successors, (631), 3 states have internal predecessors, (631), 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) [2022-07-12 10:25:15,906 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:25:15,906 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 227 [2022-07-12 10:25:15,907 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:25:16,148 INFO L129 PetriNetUnfolder]: 83/2088 cut-off events. [2022-07-12 10:25:16,148 INFO L130 PetriNetUnfolder]: For 162/247 co-relation queries the response was YES. [2022-07-12 10:25:16,160 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3121 conditions, 2088 events. 83/2088 cut-off events. For 162/247 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 18234 event pairs, 24 based on Foata normal form. 0/1934 useless extension candidates. Maximal degree in co-relation 3090. Up to 75 conditions per place. [2022-07-12 10:25:16,163 INFO L132 encePairwiseOnDemand]: 223/227 looper letters, 12 selfloop transitions, 2 changer transitions 24/241 dead transitions. [2022-07-12 10:25:16,163 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 241 transitions, 757 flow [2022-07-12 10:25:16,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 10:25:16,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-12 10:25:16,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 642 transitions. [2022-07-12 10:25:16,165 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9427312775330396 [2022-07-12 10:25:16,165 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 642 transitions. [2022-07-12 10:25:16,165 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 642 transitions. [2022-07-12 10:25:16,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:25:16,166 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 642 transitions. [2022-07-12 10:25:16,167 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 214.0) internal successors, (642), 3 states have internal predecessors, (642), 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) [2022-07-12 10:25:16,168 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 227.0) internal successors, (908), 4 states have internal predecessors, (908), 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) [2022-07-12 10:25:16,168 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 227.0) internal successors, (908), 4 states have internal predecessors, (908), 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) [2022-07-12 10:25:16,169 INFO L186 Difference]: Start difference. First operand has 252 places, 234 transitions, 692 flow. Second operand 3 states and 642 transitions. [2022-07-12 10:25:16,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 241 transitions, 757 flow [2022-07-12 10:25:16,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 241 transitions, 748 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-07-12 10:25:16,176 INFO L242 Difference]: Finished difference. Result has 249 places, 215 transitions, 611 flow [2022-07-12 10:25:16,177 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=683, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=611, PETRI_PLACES=249, PETRI_TRANSITIONS=215} [2022-07-12 10:25:16,177 INFO L279 CegarLoopForPetriNet]: 207 programPoint places, 42 predicate places. [2022-07-12 10:25:16,177 INFO L495 AbstractCegarLoop]: Abstraction has has 249 places, 215 transitions, 611 flow [2022-07-12 10:25:16,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 210.33333333333334) internal successors, (631), 3 states have internal predecessors, (631), 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) [2022-07-12 10:25:16,178 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:25:16,178 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:25:16,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 10:25:16,178 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-12 10:25:16,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:25:16,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1101089880, now seen corresponding path program 1 times [2022-07-12 10:25:16,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:25:16,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794890346] [2022-07-12 10:25:16,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:25:16,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:25:16,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:25:16,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:25:16,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:25:16,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794890346] [2022-07-12 10:25:16,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794890346] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:25:16,204 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:25:16,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 10:25:16,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629444078] [2022-07-12 10:25:16,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:25:16,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 10:25:16,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:25:16,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 10:25:16,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 10:25:16,206 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 227 [2022-07-12 10:25:16,207 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 215 transitions, 611 flow. Second operand has 3 states, 3 states have (on average 208.33333333333334) internal successors, (625), 3 states have internal predecessors, (625), 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) [2022-07-12 10:25:16,207 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:25:16,207 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 227 [2022-07-12 10:25:16,207 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:25:16,317 INFO L129 PetriNetUnfolder]: 31/1033 cut-off events. [2022-07-12 10:25:16,317 INFO L130 PetriNetUnfolder]: For 82/91 co-relation queries the response was YES. [2022-07-12 10:25:16,323 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1524 conditions, 1033 events. 31/1033 cut-off events. For 82/91 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 7074 event pairs, 6 based on Foata normal form. 0/964 useless extension candidates. Maximal degree in co-relation 1499. Up to 31 conditions per place. [2022-07-12 10:25:16,325 INFO L132 encePairwiseOnDemand]: 221/227 looper letters, 11 selfloop transitions, 3 changer transitions 12/222 dead transitions. [2022-07-12 10:25:16,325 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 222 transitions, 676 flow [2022-07-12 10:25:16,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 10:25:16,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-12 10:25:16,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 636 transitions. [2022-07-12 10:25:16,327 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.933920704845815 [2022-07-12 10:25:16,327 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 636 transitions. [2022-07-12 10:25:16,327 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 636 transitions. [2022-07-12 10:25:16,328 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:25:16,328 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 636 transitions. [2022-07-12 10:25:16,329 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 212.0) internal successors, (636), 3 states have internal predecessors, (636), 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) [2022-07-12 10:25:16,330 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 227.0) internal successors, (908), 4 states have internal predecessors, (908), 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) [2022-07-12 10:25:16,330 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 227.0) internal successors, (908), 4 states have internal predecessors, (908), 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) [2022-07-12 10:25:16,331 INFO L186 Difference]: Start difference. First operand has 249 places, 215 transitions, 611 flow. Second operand 3 states and 636 transitions. [2022-07-12 10:25:16,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 222 transitions, 676 flow [2022-07-12 10:25:16,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 222 transitions, 662 flow, removed 6 selfloop flow, removed 5 redundant places. [2022-07-12 10:25:16,336 INFO L242 Difference]: Finished difference. Result has 234 places, 209 transitions, 578 flow [2022-07-12 10:25:16,336 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=597, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=578, PETRI_PLACES=234, PETRI_TRANSITIONS=209} [2022-07-12 10:25:16,337 INFO L279 CegarLoopForPetriNet]: 207 programPoint places, 27 predicate places. [2022-07-12 10:25:16,337 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 209 transitions, 578 flow [2022-07-12 10:25:16,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 208.33333333333334) internal successors, (625), 3 states have internal predecessors, (625), 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) [2022-07-12 10:25:16,337 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:25:16,337 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:25:16,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-12 10:25:16,338 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-12 10:25:16,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:25:16,338 INFO L85 PathProgramCache]: Analyzing trace with hash -141531245, now seen corresponding path program 1 times [2022-07-12 10:25:16,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:25:16,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192633377] [2022-07-12 10:25:16,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:25:16,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:25:16,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:25:16,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:25:16,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:25:16,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192633377] [2022-07-12 10:25:16,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192633377] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:25:16,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:25:16,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-07-12 10:25:16,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384572376] [2022-07-12 10:25:16,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:25:16,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-12 10:25:16,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:25:16,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-12 10:25:16,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2022-07-12 10:25:16,757 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 227 [2022-07-12 10:25:16,770 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 209 transitions, 578 flow. Second operand has 28 states, 28 states have (on average 147.39285714285714) internal successors, (4127), 28 states have internal predecessors, (4127), 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) [2022-07-12 10:25:16,770 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:25:16,770 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 227 [2022-07-12 10:25:16,770 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:25:33,021 INFO L129 PetriNetUnfolder]: 15870/36360 cut-off events. [2022-07-12 10:25:33,021 INFO L130 PetriNetUnfolder]: For 7726/7769 co-relation queries the response was YES. [2022-07-12 10:25:33,240 INFO L84 FinitePrefix]: Finished finitePrefix Result has 69705 conditions, 36360 events. 15870/36360 cut-off events. For 7726/7769 co-relation queries the response was YES. Maximal size of possible extension queue 647. Compared 371610 event pairs, 2856 based on Foata normal form. 13/34966 useless extension candidates. Maximal degree in co-relation 69682. Up to 3237 conditions per place. [2022-07-12 10:25:33,334 INFO L132 encePairwiseOnDemand]: 191/227 looper letters, 1189 selfloop transitions, 88 changer transitions 661/2070 dead transitions. [2022-07-12 10:25:33,334 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 462 places, 2070 transitions, 9207 flow [2022-07-12 10:25:33,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 235 states. [2022-07-12 10:25:33,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2022-07-12 10:25:33,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 35963 transitions. [2022-07-12 10:25:33,372 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.6741587777673634 [2022-07-12 10:25:33,372 INFO L72 ComplementDD]: Start complementDD. Operand 235 states and 35963 transitions. [2022-07-12 10:25:33,372 INFO L73 IsDeterministic]: Start isDeterministic. Operand 235 states and 35963 transitions. [2022-07-12 10:25:33,387 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:25:33,387 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 235 states and 35963 transitions. [2022-07-12 10:25:33,435 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 236 states, 235 states have (on average 153.03404255319148) internal successors, (35963), 235 states have internal predecessors, (35963), 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) [2022-07-12 10:25:33,506 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 236 states, 236 states have (on average 227.0) internal successors, (53572), 236 states have internal predecessors, (53572), 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) [2022-07-12 10:25:33,523 INFO L81 ComplementDD]: Finished complementDD. Result has 236 states, 236 states have (on average 227.0) internal successors, (53572), 236 states have internal predecessors, (53572), 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) [2022-07-12 10:25:33,523 INFO L186 Difference]: Start difference. First operand has 234 places, 209 transitions, 578 flow. Second operand 235 states and 35963 transitions. [2022-07-12 10:25:33,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 462 places, 2070 transitions, 9207 flow [2022-07-12 10:25:33,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 455 places, 2070 transitions, 8961 flow, removed 120 selfloop flow, removed 7 redundant places. [2022-07-12 10:25:33,723 INFO L242 Difference]: Finished difference. Result has 678 places, 286 transitions, 1809 flow [2022-07-12 10:25:33,724 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=560, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=235, PETRI_FLOW=1809, PETRI_PLACES=678, PETRI_TRANSITIONS=286} [2022-07-12 10:25:33,724 INFO L279 CegarLoopForPetriNet]: 207 programPoint places, 471 predicate places. [2022-07-12 10:25:33,724 INFO L495 AbstractCegarLoop]: Abstraction has has 678 places, 286 transitions, 1809 flow [2022-07-12 10:25:33,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 147.39285714285714) internal successors, (4127), 28 states have internal predecessors, (4127), 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) [2022-07-12 10:25:33,726 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:25:33,726 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:25:33,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 10:25:33,726 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-12 10:25:33,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:25:33,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1967864813, now seen corresponding path program 2 times [2022-07-12 10:25:33,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:25:33,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964868040] [2022-07-12 10:25:33,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:25:33,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:25:33,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:25:34,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:25:34,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:25:34,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964868040] [2022-07-12 10:25:34,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964868040] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:25:34,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:25:34,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-07-12 10:25:34,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286706387] [2022-07-12 10:25:34,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:25:34,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-12 10:25:34,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:25:34,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-12 10:25:34,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2022-07-12 10:25:34,076 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 227 [2022-07-12 10:25:34,078 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 678 places, 286 transitions, 1809 flow. Second operand has 28 states, 28 states have (on average 147.39285714285714) internal successors, (4127), 28 states have internal predecessors, (4127), 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) [2022-07-12 10:25:34,078 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:25:34,078 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 227 [2022-07-12 10:25:34,078 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand