./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/chl-word-trans.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 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-word-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 73462fb8dbdc39f07edabdd79150cbad579fbba379eb033cd2e89802bbb8b9a6 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 09:00:18,051 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 09:00:18,053 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 09:00:18,092 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 09:00:18,093 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 09:00:18,094 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 09:00:18,098 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 09:00:18,100 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 09:00:18,111 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 09:00:18,115 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 09:00:18,117 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 09:00:18,121 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 09:00:18,121 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 09:00:18,123 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 09:00:18,124 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 09:00:18,126 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 09:00:18,127 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 09:00:18,128 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 09:00:18,130 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 09:00:18,135 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 09:00:18,136 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 09:00:18,137 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 09:00:18,138 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 09:00:18,139 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 09:00:18,141 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 09:00:18,145 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 09:00:18,147 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 09:00:18,147 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 09:00:18,148 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 09:00:18,148 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 09:00:18,149 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 09:00:18,150 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 09:00:18,151 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 09:00:18,152 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 09:00:18,153 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 09:00:18,154 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 09:00:18,154 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 09:00:18,155 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 09:00:18,155 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 09:00:18,155 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 09:00:18,156 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 09:00:18,157 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 09:00:18,162 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-21 09:00:18,194 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 09:00:18,194 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 09:00:18,194 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 09:00:18,195 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 09:00:18,195 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 09:00:18,196 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 09:00:18,196 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 09:00:18,196 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 09:00:18,197 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 09:00:18,197 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 09:00:18,198 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 09:00:18,198 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 09:00:18,198 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 09:00:18,198 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 09:00:18,198 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 09:00:18,199 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 09:00:18,199 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 09:00:18,199 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 09:00:18,199 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 09:00:18,200 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 09:00:18,200 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 09:00:18,200 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 09:00:18,200 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 09:00:18,200 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 09:00:18,201 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 09:00:18,201 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 09:00:18,201 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 09:00:18,201 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 09:00:18,201 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 09:00:18,202 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 09:00:18,202 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 09:00:18,202 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 09:00:18,202 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 09:00:18,203 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 -> 73462fb8dbdc39f07edabdd79150cbad579fbba379eb033cd2e89802bbb8b9a6 [2022-07-21 09:00:18,510 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 09:00:18,525 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 09:00:18,528 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 09:00:18,529 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 09:00:18,529 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 09:00:18,531 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-word-trans.wvr.c [2022-07-21 09:00:18,590 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/025539020/347df1e9fbfa469da8528d9bf610ebec/FLAG532465a53 [2022-07-21 09:00:19,066 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 09:00:19,067 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-word-trans.wvr.c [2022-07-21 09:00:19,074 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/025539020/347df1e9fbfa469da8528d9bf610ebec/FLAG532465a53 [2022-07-21 09:00:19,557 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/025539020/347df1e9fbfa469da8528d9bf610ebec [2022-07-21 09:00:19,561 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 09:00:19,563 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 09:00:19,565 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 09:00:19,565 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 09:00:19,568 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 09:00:19,569 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 09:00:19" (1/1) ... [2022-07-21 09:00:19,570 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1498e664 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:00:19, skipping insertion in model container [2022-07-21 09:00:19,571 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 09:00:19" (1/1) ... [2022-07-21 09:00:19,577 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 09:00:19,606 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 09:00:19,738 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-word-trans.wvr.c[3292,3305] [2022-07-21 09:00:19,787 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 09:00:19,794 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 09:00:19,844 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-word-trans.wvr.c[3292,3305] [2022-07-21 09:00:19,852 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 09:00:19,870 INFO L208 MainTranslator]: Completed translation [2022-07-21 09:00:19,872 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:00:19 WrapperNode [2022-07-21 09:00:19,872 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 09:00:19,873 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 09:00:19,874 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 09:00:19,874 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 09:00:19,879 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:00:19" (1/1) ... [2022-07-21 09:00:19,902 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:00:19" (1/1) ... [2022-07-21 09:00:19,932 INFO L137 Inliner]: procedures = 25, calls = 44, calls flagged for inlining = 8, calls inlined = 12, statements flattened = 172 [2022-07-21 09:00:19,933 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 09:00:19,934 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 09:00:19,934 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 09:00:19,934 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 09:00:19,941 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:00:19" (1/1) ... [2022-07-21 09:00:19,941 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:00:19" (1/1) ... [2022-07-21 09:00:19,954 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:00:19" (1/1) ... [2022-07-21 09:00:19,955 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:00:19" (1/1) ... [2022-07-21 09:00:19,963 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:00:19" (1/1) ... [2022-07-21 09:00:19,972 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:00:19" (1/1) ... [2022-07-21 09:00:19,974 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:00:19" (1/1) ... [2022-07-21 09:00:19,977 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 09:00:19,984 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 09:00:19,985 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 09:00:19,985 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 09:00:19,986 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:00:19" (1/1) ... [2022-07-21 09:00:19,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 09:00:20,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 09:00:20,015 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-21 09:00:20,030 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-21 09:00:20,059 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 09:00:20,059 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-21 09:00:20,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-21 09:00:20,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-21 09:00:20,060 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-21 09:00:20,060 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-21 09:00:20,060 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-21 09:00:20,060 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-21 09:00:20,060 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-07-21 09:00:20,060 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-07-21 09:00:20,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 09:00:20,061 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-21 09:00:20,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 09:00:20,061 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 09:00:20,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 09:00:20,063 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-21 09:00:20,223 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 09:00:20,225 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 09:00:20,630 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 09:00:20,643 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 09:00:20,644 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-07-21 09:00:20,647 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 09:00:20 BoogieIcfgContainer [2022-07-21 09:00:20,648 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 09:00:20,650 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 09:00:20,650 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 09:00:20,653 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 09:00:20,653 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 09:00:19" (1/3) ... [2022-07-21 09:00:20,654 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7720985d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 09:00:20, skipping insertion in model container [2022-07-21 09:00:20,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 09:00:19" (2/3) ... [2022-07-21 09:00:20,654 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7720985d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 09:00:20, skipping insertion in model container [2022-07-21 09:00:20,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 09:00:20" (3/3) ... [2022-07-21 09:00:20,656 INFO L111 eAbstractionObserver]: Analyzing ICFG chl-word-trans.wvr.c [2022-07-21 09:00:20,660 WARN L143 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-07-21 09:00:20,668 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 09:00:20,669 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 09:00:20,669 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-07-21 09:00:20,772 INFO L135 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-07-21 09:00:20,814 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 308 places, 332 transitions, 688 flow [2022-07-21 09:00:20,988 INFO L129 PetriNetUnfolder]: 34/329 cut-off events. [2022-07-21 09:00:20,989 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-07-21 09:00:20,994 INFO L84 FinitePrefix]: Finished finitePrefix Result has 342 conditions, 329 events. 34/329 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 507 event pairs, 0 based on Foata normal form. 0/294 useless extension candidates. Maximal degree in co-relation 261. Up to 3 conditions per place. [2022-07-21 09:00:20,999 INFO L82 GeneralOperation]: Start removeDead. Operand has 308 places, 332 transitions, 688 flow [2022-07-21 09:00:21,005 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 294 places, 318 transitions, 654 flow [2022-07-21 09:00:21,044 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 09:00:21,050 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@193c4f4c, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7d75ea25 [2022-07-21 09:00:21,050 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-07-21 09:00:21,119 INFO L129 PetriNetUnfolder]: 34/317 cut-off events. [2022-07-21 09:00:21,119 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-07-21 09:00:21,120 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 09:00:21,121 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, 1, 1, 1, 1, 1, 1] [2022-07-21 09:00:21,121 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-21 09:00:21,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:00:21,126 INFO L85 PathProgramCache]: Analyzing trace with hash -486084204, now seen corresponding path program 1 times [2022-07-21 09:00:21,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:00:21,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971964527] [2022-07-21 09:00:21,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:00:21,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:00:21,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:00:21,472 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-21 09:00:21,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:00:21,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971964527] [2022-07-21 09:00:21,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971964527] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:00:21,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:00:21,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 09:00:21,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453161823] [2022-07-21 09:00:21,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:00:21,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-21 09:00:21,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:00:21,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-21 09:00:21,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-21 09:00:21,516 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 312 out of 332 [2022-07-21 09:00:21,519 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 318 transitions, 654 flow. Second operand has 2 states, 2 states have (on average 316.5) internal successors, (633), 2 states have internal predecessors, (633), 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-21 09:00:21,520 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 09:00:21,520 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 312 of 332 [2022-07-21 09:00:21,521 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 09:00:21,615 INFO L129 PetriNetUnfolder]: 21/305 cut-off events. [2022-07-21 09:00:21,615 INFO L130 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2022-07-21 09:00:21,619 INFO L84 FinitePrefix]: Finished finitePrefix Result has 325 conditions, 305 events. 21/305 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 499 event pairs, 0 based on Foata normal form. 19/296 useless extension candidates. Maximal degree in co-relation 252. Up to 7 conditions per place. [2022-07-21 09:00:21,622 INFO L132 encePairwiseOnDemand]: 319/332 looper letters, 6 selfloop transitions, 0 changer transitions 7/305 dead transitions. [2022-07-21 09:00:21,622 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 305 transitions, 640 flow [2022-07-21 09:00:21,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-21 09:00:21,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-07-21 09:00:21,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 643 transitions. [2022-07-21 09:00:21,641 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9683734939759037 [2022-07-21 09:00:21,642 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 643 transitions. [2022-07-21 09:00:21,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 643 transitions. [2022-07-21 09:00:21,654 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 09:00:21,656 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 643 transitions. [2022-07-21 09:00:21,661 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 321.5) internal successors, (643), 2 states have internal predecessors, (643), 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-21 09:00:21,669 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 332.0) internal successors, (996), 3 states have internal predecessors, (996), 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-21 09:00:21,671 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 332.0) internal successors, (996), 3 states have internal predecessors, (996), 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-21 09:00:21,672 INFO L186 Difference]: Start difference. First operand has 294 places, 318 transitions, 654 flow. Second operand 2 states and 643 transitions. [2022-07-21 09:00:21,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 305 transitions, 640 flow [2022-07-21 09:00:21,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 305 transitions, 628 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-07-21 09:00:21,685 INFO L242 Difference]: Finished difference. Result has 289 places, 298 transitions, 602 flow [2022-07-21 09:00:21,688 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=616, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=602, PETRI_PLACES=289, PETRI_TRANSITIONS=298} [2022-07-21 09:00:21,692 INFO L279 CegarLoopForPetriNet]: 294 programPoint places, -5 predicate places. [2022-07-21 09:00:21,693 INFO L495 AbstractCegarLoop]: Abstraction has has 289 places, 298 transitions, 602 flow [2022-07-21 09:00:21,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 316.5) internal successors, (633), 2 states have internal predecessors, (633), 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-21 09:00:21,694 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 09:00:21,694 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, 1, 1, 1, 1, 1, 1] [2022-07-21 09:00:21,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 09:00:21,695 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-21 09:00:21,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:00:21,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1734824051, now seen corresponding path program 1 times [2022-07-21 09:00:21,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:00:21,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162445730] [2022-07-21 09:00:21,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:00:21,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:00:21,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:00:21,927 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-21 09:00:21,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:00:21,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162445730] [2022-07-21 09:00:21,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162445730] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:00:21,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:00:21,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 09:00:21,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405497828] [2022-07-21 09:00:21,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:00:21,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 09:00:21,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:00:21,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 09:00:21,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 09:00:21,939 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 308 out of 332 [2022-07-21 09:00:21,940 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 298 transitions, 602 flow. Second operand has 3 states, 3 states have (on average 310.6666666666667) internal successors, (932), 3 states have internal predecessors, (932), 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-21 09:00:21,941 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 09:00:21,944 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 308 of 332 [2022-07-21 09:00:21,945 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 09:00:22,051 INFO L129 PetriNetUnfolder]: 40/410 cut-off events. [2022-07-21 09:00:22,051 INFO L130 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-07-21 09:00:22,055 INFO L84 FinitePrefix]: Finished finitePrefix Result has 454 conditions, 410 events. 40/410 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1086 event pairs, 6 based on Foata normal form. 0/377 useless extension candidates. Maximal degree in co-relation 451. Up to 22 conditions per place. [2022-07-21 09:00:22,057 INFO L132 encePairwiseOnDemand]: 329/332 looper letters, 13 selfloop transitions, 2 changer transitions 0/303 dead transitions. [2022-07-21 09:00:22,057 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 303 transitions, 646 flow [2022-07-21 09:00:22,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 09:00:22,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-21 09:00:22,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 940 transitions. [2022-07-21 09:00:22,060 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9437751004016064 [2022-07-21 09:00:22,060 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 940 transitions. [2022-07-21 09:00:22,060 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 940 transitions. [2022-07-21 09:00:22,061 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 09:00:22,061 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 940 transitions. [2022-07-21 09:00:22,064 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 313.3333333333333) internal successors, (940), 3 states have internal predecessors, (940), 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-21 09:00:22,066 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 332.0) internal successors, (1328), 4 states have internal predecessors, (1328), 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-21 09:00:22,067 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 332.0) internal successors, (1328), 4 states have internal predecessors, (1328), 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-21 09:00:22,067 INFO L186 Difference]: Start difference. First operand has 289 places, 298 transitions, 602 flow. Second operand 3 states and 940 transitions. [2022-07-21 09:00:22,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 303 transitions, 646 flow [2022-07-21 09:00:22,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 303 transitions, 646 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-07-21 09:00:22,075 INFO L242 Difference]: Finished difference. Result has 285 places, 298 transitions, 610 flow [2022-07-21 09:00:22,076 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=602, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=296, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=610, PETRI_PLACES=285, PETRI_TRANSITIONS=298} [2022-07-21 09:00:22,077 INFO L279 CegarLoopForPetriNet]: 294 programPoint places, -9 predicate places. [2022-07-21 09:00:22,077 INFO L495 AbstractCegarLoop]: Abstraction has has 285 places, 298 transitions, 610 flow [2022-07-21 09:00:22,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 310.6666666666667) internal successors, (932), 3 states have internal predecessors, (932), 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-21 09:00:22,078 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 09:00:22,078 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:00:22,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 09:00:22,079 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-21 09:00:22,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:00:22,079 INFO L85 PathProgramCache]: Analyzing trace with hash -255056521, now seen corresponding path program 1 times [2022-07-21 09:00:22,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:00:22,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997633051] [2022-07-21 09:00:22,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:00:22,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:00:22,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:00:22,239 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-21 09:00:22,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:00:22,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997633051] [2022-07-21 09:00:22,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997633051] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:00:22,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:00:22,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 09:00:22,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490051393] [2022-07-21 09:00:22,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:00:22,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 09:00:22,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:00:22,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 09:00:22,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 09:00:22,244 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 308 out of 332 [2022-07-21 09:00:22,247 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 298 transitions, 610 flow. Second operand has 3 states, 3 states have (on average 310.6666666666667) internal successors, (932), 3 states have internal predecessors, (932), 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-21 09:00:22,247 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 09:00:22,247 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 308 of 332 [2022-07-21 09:00:22,247 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 09:00:22,328 INFO L129 PetriNetUnfolder]: 49/480 cut-off events. [2022-07-21 09:00:22,328 INFO L130 PetriNetUnfolder]: For 23/27 co-relation queries the response was YES. [2022-07-21 09:00:22,330 INFO L84 FinitePrefix]: Finished finitePrefix Result has 537 conditions, 480 events. 49/480 cut-off events. For 23/27 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1436 event pairs, 9 based on Foata normal form. 0/438 useless extension candidates. Maximal degree in co-relation 532. Up to 30 conditions per place. [2022-07-21 09:00:22,333 INFO L132 encePairwiseOnDemand]: 329/332 looper letters, 12 selfloop transitions, 2 changer transitions 0/302 dead transitions. [2022-07-21 09:00:22,333 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 302 transitions, 649 flow [2022-07-21 09:00:22,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 09:00:22,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-21 09:00:22,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 939 transitions. [2022-07-21 09:00:22,336 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9427710843373494 [2022-07-21 09:00:22,337 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 939 transitions. [2022-07-21 09:00:22,337 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 939 transitions. [2022-07-21 09:00:22,343 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 09:00:22,344 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 939 transitions. [2022-07-21 09:00:22,346 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 313.0) internal successors, (939), 3 states have internal predecessors, (939), 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-21 09:00:22,348 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 332.0) internal successors, (1328), 4 states have internal predecessors, (1328), 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-21 09:00:22,349 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 332.0) internal successors, (1328), 4 states have internal predecessors, (1328), 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-21 09:00:22,349 INFO L186 Difference]: Start difference. First operand has 285 places, 298 transitions, 610 flow. Second operand 3 states and 939 transitions. [2022-07-21 09:00:22,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 302 transitions, 649 flow [2022-07-21 09:00:22,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 302 transitions, 645 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-07-21 09:00:22,354 INFO L242 Difference]: Finished difference. Result has 286 places, 298 transitions, 614 flow [2022-07-21 09:00:22,355 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=606, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=296, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=614, PETRI_PLACES=286, PETRI_TRANSITIONS=298} [2022-07-21 09:00:22,357 INFO L279 CegarLoopForPetriNet]: 294 programPoint places, -8 predicate places. [2022-07-21 09:00:22,357 INFO L495 AbstractCegarLoop]: Abstraction has has 286 places, 298 transitions, 614 flow [2022-07-21 09:00:22,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 310.6666666666667) internal successors, (932), 3 states have internal predecessors, (932), 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-21 09:00:22,358 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 09:00:22,358 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:00:22,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-21 09:00:22,359 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-21 09:00:22,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:00:22,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1328800531, now seen corresponding path program 1 times [2022-07-21 09:00:22,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:00:22,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690706558] [2022-07-21 09:00:22,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:00:22,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:00:22,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:00:22,449 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-21 09:00:22,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:00:22,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690706558] [2022-07-21 09:00:22,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690706558] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:00:22,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:00:22,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 09:00:22,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418201115] [2022-07-21 09:00:22,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:00:22,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 09:00:22,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:00:22,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 09:00:22,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 09:00:22,458 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 308 out of 332 [2022-07-21 09:00:22,459 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 298 transitions, 614 flow. Second operand has 3 states, 3 states have (on average 310.6666666666667) internal successors, (932), 3 states have internal predecessors, (932), 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-21 09:00:22,459 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 09:00:22,459 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 308 of 332 [2022-07-21 09:00:22,460 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 09:00:22,568 INFO L129 PetriNetUnfolder]: 45/557 cut-off events. [2022-07-21 09:00:22,570 INFO L130 PetriNetUnfolder]: For 17/30 co-relation queries the response was YES. [2022-07-21 09:00:22,574 INFO L84 FinitePrefix]: Finished finitePrefix Result has 634 conditions, 557 events. 45/557 cut-off events. For 17/30 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1958 event pairs, 4 based on Foata normal form. 1/515 useless extension candidates. Maximal degree in co-relation 628. Up to 26 conditions per place. [2022-07-21 09:00:22,576 INFO L132 encePairwiseOnDemand]: 329/332 looper letters, 14 selfloop transitions, 2 changer transitions 0/304 dead transitions. [2022-07-21 09:00:22,577 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 304 transitions, 663 flow [2022-07-21 09:00:22,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 09:00:22,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-21 09:00:22,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 941 transitions. [2022-07-21 09:00:22,580 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9447791164658634 [2022-07-21 09:00:22,580 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 941 transitions. [2022-07-21 09:00:22,580 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 941 transitions. [2022-07-21 09:00:22,582 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 09:00:22,583 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 941 transitions. [2022-07-21 09:00:22,587 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 313.6666666666667) internal successors, (941), 3 states have internal predecessors, (941), 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-21 09:00:22,589 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 332.0) internal successors, (1328), 4 states have internal predecessors, (1328), 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-21 09:00:22,589 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 332.0) internal successors, (1328), 4 states have internal predecessors, (1328), 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-21 09:00:22,590 INFO L186 Difference]: Start difference. First operand has 286 places, 298 transitions, 614 flow. Second operand 3 states and 941 transitions. [2022-07-21 09:00:22,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 304 transitions, 663 flow [2022-07-21 09:00:22,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 304 transitions, 659 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-07-21 09:00:22,597 INFO L242 Difference]: Finished difference. Result has 287 places, 298 transitions, 618 flow [2022-07-21 09:00:22,597 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=610, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=296, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=618, PETRI_PLACES=287, PETRI_TRANSITIONS=298} [2022-07-21 09:00:22,599 INFO L279 CegarLoopForPetriNet]: 294 programPoint places, -7 predicate places. [2022-07-21 09:00:22,601 INFO L495 AbstractCegarLoop]: Abstraction has has 287 places, 298 transitions, 618 flow [2022-07-21 09:00:22,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 310.6666666666667) internal successors, (932), 3 states have internal predecessors, (932), 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-21 09:00:22,602 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 09:00:22,602 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:00:22,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-21 09:00:22,603 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-21 09:00:22,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:00:22,604 INFO L85 PathProgramCache]: Analyzing trace with hash -172403159, now seen corresponding path program 1 times [2022-07-21 09:00:22,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:00:22,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863785457] [2022-07-21 09:00:22,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:00:22,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:00:22,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:00:22,789 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-21 09:00:22,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:00:22,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863785457] [2022-07-21 09:00:22,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863785457] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:00:22,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:00:22,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 09:00:22,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750022980] [2022-07-21 09:00:22,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:00:22,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 09:00:22,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:00:22,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 09:00:22,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-21 09:00:22,796 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 250 out of 332 [2022-07-21 09:00:22,798 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 298 transitions, 618 flow. Second operand has 7 states, 7 states have (on average 257.42857142857144) internal successors, (1802), 7 states have internal predecessors, (1802), 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-21 09:00:22,798 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 09:00:22,798 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 250 of 332 [2022-07-21 09:00:22,798 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 09:00:23,697 INFO L129 PetriNetUnfolder]: 1133/4068 cut-off events. [2022-07-21 09:00:23,698 INFO L130 PetriNetUnfolder]: For 227/227 co-relation queries the response was YES. [2022-07-21 09:00:23,714 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5976 conditions, 4068 events. 1133/4068 cut-off events. For 227/227 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 35229 event pairs, 481 based on Foata normal form. 8/3531 useless extension candidates. Maximal degree in co-relation 5969. Up to 1148 conditions per place. [2022-07-21 09:00:23,736 INFO L132 encePairwiseOnDemand]: 326/332 looper letters, 86 selfloop transitions, 2 changer transitions 8/333 dead transitions. [2022-07-21 09:00:23,736 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 333 transitions, 889 flow [2022-07-21 09:00:23,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 09:00:23,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-07-21 09:00:23,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1847 transitions. [2022-07-21 09:00:23,741 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.794750430292599 [2022-07-21 09:00:23,741 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1847 transitions. [2022-07-21 09:00:23,741 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1847 transitions. [2022-07-21 09:00:23,742 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 09:00:23,742 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1847 transitions. [2022-07-21 09:00:23,746 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 263.85714285714283) internal successors, (1847), 7 states have internal predecessors, (1847), 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-21 09:00:23,750 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 332.0) internal successors, (2656), 8 states have internal predecessors, (2656), 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-21 09:00:23,751 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 332.0) internal successors, (2656), 8 states have internal predecessors, (2656), 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-21 09:00:23,752 INFO L186 Difference]: Start difference. First operand has 287 places, 298 transitions, 618 flow. Second operand 7 states and 1847 transitions. [2022-07-21 09:00:23,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 333 transitions, 889 flow [2022-07-21 09:00:23,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 333 transitions, 885 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-07-21 09:00:23,759 INFO L242 Difference]: Finished difference. Result has 296 places, 299 transitions, 633 flow [2022-07-21 09:00:23,759 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=614, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=296, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=633, PETRI_PLACES=296, PETRI_TRANSITIONS=299} [2022-07-21 09:00:23,761 INFO L279 CegarLoopForPetriNet]: 294 programPoint places, 2 predicate places. [2022-07-21 09:00:23,762 INFO L495 AbstractCegarLoop]: Abstraction has has 296 places, 299 transitions, 633 flow [2022-07-21 09:00:23,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 257.42857142857144) internal successors, (1802), 7 states have internal predecessors, (1802), 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-21 09:00:23,763 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 09:00:23,763 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:00:23,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-21 09:00:23,764 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-21 09:00:23,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:00:23,765 INFO L85 PathProgramCache]: Analyzing trace with hash 662437569, now seen corresponding path program 2 times [2022-07-21 09:00:23,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:00:23,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366169118] [2022-07-21 09:00:23,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:00:23,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:00:23,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:00:24,009 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-21 09:00:24,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:00:24,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366169118] [2022-07-21 09:00:24,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366169118] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:00:24,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:00:24,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-21 09:00:24,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119187001] [2022-07-21 09:00:24,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:00:24,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-21 09:00:24,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:00:24,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-21 09:00:24,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-07-21 09:00:24,017 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 332 [2022-07-21 09:00:24,022 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 299 transitions, 633 flow. Second operand has 14 states, 14 states have (on average 235.5) internal successors, (3297), 14 states have internal predecessors, (3297), 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-21 09:00:24,022 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 09:00:24,022 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 332 [2022-07-21 09:00:24,023 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 09:00:25,628 INFO L129 PetriNetUnfolder]: 1374/7294 cut-off events. [2022-07-21 09:00:25,628 INFO L130 PetriNetUnfolder]: For 1469/1575 co-relation queries the response was YES. [2022-07-21 09:00:25,707 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10751 conditions, 7294 events. 1374/7294 cut-off events. For 1469/1575 co-relation queries the response was YES. Maximal size of possible extension queue 256. Compared 78527 event pairs, 495 based on Foata normal form. 24/6463 useless extension candidates. Maximal degree in co-relation 10739. Up to 701 conditions per place. [2022-07-21 09:00:25,738 INFO L132 encePairwiseOnDemand]: 309/332 looper letters, 141 selfloop transitions, 25 changer transitions 4/388 dead transitions. [2022-07-21 09:00:25,739 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 388 transitions, 1207 flow [2022-07-21 09:00:25,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-21 09:00:25,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-07-21 09:00:25,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 4787 transitions. [2022-07-21 09:00:25,750 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.720933734939759 [2022-07-21 09:00:25,751 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 4787 transitions. [2022-07-21 09:00:25,751 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 4787 transitions. [2022-07-21 09:00:25,753 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 09:00:25,754 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 4787 transitions. [2022-07-21 09:00:25,764 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 239.35) internal successors, (4787), 20 states have internal predecessors, (4787), 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-21 09:00:25,775 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 332.0) internal successors, (6972), 21 states have internal predecessors, (6972), 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-21 09:00:25,777 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 332.0) internal successors, (6972), 21 states have internal predecessors, (6972), 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-21 09:00:25,778 INFO L186 Difference]: Start difference. First operand has 296 places, 299 transitions, 633 flow. Second operand 20 states and 4787 transitions. [2022-07-21 09:00:25,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 388 transitions, 1207 flow [2022-07-21 09:00:25,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 388 transitions, 1187 flow, removed 8 selfloop flow, removed 4 redundant places. [2022-07-21 09:00:25,808 INFO L242 Difference]: Finished difference. Result has 320 places, 313 transitions, 766 flow [2022-07-21 09:00:25,808 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=626, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=766, PETRI_PLACES=320, PETRI_TRANSITIONS=313} [2022-07-21 09:00:25,811 INFO L279 CegarLoopForPetriNet]: 294 programPoint places, 26 predicate places. [2022-07-21 09:00:25,811 INFO L495 AbstractCegarLoop]: Abstraction has has 320 places, 313 transitions, 766 flow [2022-07-21 09:00:25,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 235.5) internal successors, (3297), 14 states have internal predecessors, (3297), 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-21 09:00:25,812 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 09:00:25,813 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:00:25,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-21 09:00:25,813 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-21 09:00:25,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:00:25,814 INFO L85 PathProgramCache]: Analyzing trace with hash 154251013, now seen corresponding path program 1 times [2022-07-21 09:00:25,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:00:25,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685833916] [2022-07-21 09:00:25,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:00:25,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:00:25,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:00:25,877 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-21 09:00:25,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:00:25,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685833916] [2022-07-21 09:00:25,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685833916] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:00:25,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:00:25,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 09:00:25,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709131991] [2022-07-21 09:00:25,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:00:25,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 09:00:25,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:00:25,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 09:00:25,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 09:00:25,887 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 332 [2022-07-21 09:00:25,889 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 313 transitions, 766 flow. Second operand has 4 states, 4 states have (on average 298.0) internal successors, (1192), 4 states have internal predecessors, (1192), 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-21 09:00:25,889 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 09:00:25,889 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 332 [2022-07-21 09:00:25,889 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 09:00:27,115 INFO L129 PetriNetUnfolder]: 1169/7999 cut-off events. [2022-07-21 09:00:27,116 INFO L130 PetriNetUnfolder]: For 669/723 co-relation queries the response was YES. [2022-07-21 09:00:27,150 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10758 conditions, 7999 events. 1169/7999 cut-off events. For 669/723 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 92341 event pairs, 320 based on Foata normal form. 16/6960 useless extension candidates. Maximal degree in co-relation 10737. Up to 607 conditions per place. [2022-07-21 09:00:27,171 INFO L132 encePairwiseOnDemand]: 324/332 looper letters, 52 selfloop transitions, 9 changer transitions 0/350 dead transitions. [2022-07-21 09:00:27,172 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 350 transitions, 973 flow [2022-07-21 09:00:27,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 09:00:27,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-07-21 09:00:27,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1533 transitions. [2022-07-21 09:00:27,175 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9234939759036145 [2022-07-21 09:00:27,175 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1533 transitions. [2022-07-21 09:00:27,176 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1533 transitions. [2022-07-21 09:00:27,176 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 09:00:27,177 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1533 transitions. [2022-07-21 09:00:27,179 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 306.6) internal successors, (1533), 5 states have internal predecessors, (1533), 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-21 09:00:27,182 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 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-21 09:00:27,183 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 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-21 09:00:27,183 INFO L186 Difference]: Start difference. First operand has 320 places, 313 transitions, 766 flow. Second operand 5 states and 1533 transitions. [2022-07-21 09:00:27,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 322 places, 350 transitions, 973 flow [2022-07-21 09:00:27,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 350 transitions, 961 flow, removed 2 selfloop flow, removed 5 redundant places. [2022-07-21 09:00:27,197 INFO L242 Difference]: Finished difference. Result has 320 places, 322 transitions, 821 flow [2022-07-21 09:00:27,197 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=754, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=307, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=821, PETRI_PLACES=320, PETRI_TRANSITIONS=322} [2022-07-21 09:00:27,198 INFO L279 CegarLoopForPetriNet]: 294 programPoint places, 26 predicate places. [2022-07-21 09:00:27,198 INFO L495 AbstractCegarLoop]: Abstraction has has 320 places, 322 transitions, 821 flow [2022-07-21 09:00:27,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 298.0) internal successors, (1192), 4 states have internal predecessors, (1192), 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-21 09:00:27,199 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 09:00:27,199 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:00:27,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-21 09:00:27,200 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-21 09:00:27,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:00:27,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1371883607, now seen corresponding path program 2 times [2022-07-21 09:00:27,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:00:27,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047645901] [2022-07-21 09:00:27,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:00:27,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:00:27,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:00:27,253 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-21 09:00:27,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:00:27,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047645901] [2022-07-21 09:00:27,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047645901] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:00:27,254 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:00:27,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 09:00:27,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494126650] [2022-07-21 09:00:27,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:00:27,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 09:00:27,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:00:27,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 09:00:27,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 09:00:27,257 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 332 [2022-07-21 09:00:27,258 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 322 transitions, 821 flow. Second operand has 4 states, 4 states have (on average 298.0) internal successors, (1192), 4 states have internal predecessors, (1192), 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-21 09:00:27,259 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 09:00:27,259 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 332 [2022-07-21 09:00:27,259 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 09:00:28,714 INFO L129 PetriNetUnfolder]: 1207/10397 cut-off events. [2022-07-21 09:00:28,714 INFO L130 PetriNetUnfolder]: For 1711/1784 co-relation queries the response was YES. [2022-07-21 09:00:28,763 INFO L84 FinitePrefix]: Finished finitePrefix Result has 14020 conditions, 10397 events. 1207/10397 cut-off events. For 1711/1784 co-relation queries the response was YES. Maximal size of possible extension queue 350. Compared 128901 event pairs, 428 based on Foata normal form. 30/9712 useless extension candidates. Maximal degree in co-relation 13998. Up to 935 conditions per place. [2022-07-21 09:00:28,794 INFO L132 encePairwiseOnDemand]: 327/332 looper letters, 46 selfloop transitions, 4 changer transitions 0/339 dead transitions. [2022-07-21 09:00:28,794 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 339 transitions, 977 flow [2022-07-21 09:00:28,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 09:00:28,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-07-21 09:00:28,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1218 transitions. [2022-07-21 09:00:28,797 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9171686746987951 [2022-07-21 09:00:28,798 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1218 transitions. [2022-07-21 09:00:28,798 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1218 transitions. [2022-07-21 09:00:28,798 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 09:00:28,798 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1218 transitions. [2022-07-21 09:00:28,806 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 304.5) internal successors, (1218), 4 states have internal predecessors, (1218), 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-21 09:00:28,809 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 332.0) internal successors, (1660), 5 states have internal predecessors, (1660), 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-21 09:00:28,810 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 332.0) internal successors, (1660), 5 states have internal predecessors, (1660), 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-21 09:00:28,810 INFO L186 Difference]: Start difference. First operand has 320 places, 322 transitions, 821 flow. Second operand 4 states and 1218 transitions. [2022-07-21 09:00:28,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 339 transitions, 977 flow [2022-07-21 09:00:28,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 323 places, 339 transitions, 977 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-07-21 09:00:28,826 INFO L242 Difference]: Finished difference. Result has 325 places, 324 transitions, 853 flow [2022-07-21 09:00:28,826 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=821, PETRI_DIFFERENCE_MINUEND_PLACES=320, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=322, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=318, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=853, PETRI_PLACES=325, PETRI_TRANSITIONS=324} [2022-07-21 09:00:28,827 INFO L279 CegarLoopForPetriNet]: 294 programPoint places, 31 predicate places. [2022-07-21 09:00:28,827 INFO L495 AbstractCegarLoop]: Abstraction has has 325 places, 324 transitions, 853 flow [2022-07-21 09:00:28,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 298.0) internal successors, (1192), 4 states have internal predecessors, (1192), 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-21 09:00:28,828 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 09:00:28,829 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:00:28,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-21 09:00:28,829 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-21 09:00:28,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:00:28,830 INFO L85 PathProgramCache]: Analyzing trace with hash 674576607, now seen corresponding path program 1 times [2022-07-21 09:00:28,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:00:28,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096394943] [2022-07-21 09:00:28,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:00:28,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:00:28,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:00:28,900 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-21 09:00:28,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:00:28,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096394943] [2022-07-21 09:00:28,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096394943] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:00:28,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:00:28,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 09:00:28,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065556333] [2022-07-21 09:00:28,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:00:28,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 09:00:28,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:00:28,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 09:00:28,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-21 09:00:28,904 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 332 [2022-07-21 09:00:28,905 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 324 transitions, 853 flow. Second operand has 5 states, 5 states have (on average 297.2) internal successors, (1486), 5 states have internal predecessors, (1486), 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-21 09:00:28,905 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 09:00:28,905 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 332 [2022-07-21 09:00:28,906 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 09:00:30,341 INFO L129 PetriNetUnfolder]: 1360/11666 cut-off events. [2022-07-21 09:00:30,342 INFO L130 PetriNetUnfolder]: For 4082/4186 co-relation queries the response was YES. [2022-07-21 09:00:30,394 INFO L84 FinitePrefix]: Finished finitePrefix Result has 16522 conditions, 11666 events. 1360/11666 cut-off events. For 4082/4186 co-relation queries the response was YES. Maximal size of possible extension queue 414. Compared 152189 event pairs, 722 based on Foata normal form. 30/10864 useless extension candidates. Maximal degree in co-relation 16497. Up to 894 conditions per place. [2022-07-21 09:00:30,424 INFO L132 encePairwiseOnDemand]: 326/332 looper letters, 68 selfloop transitions, 7 changer transitions 0/364 dead transitions. [2022-07-21 09:00:30,424 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 364 transitions, 1176 flow [2022-07-21 09:00:30,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 09:00:30,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-07-21 09:00:30,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1528 transitions. [2022-07-21 09:00:30,429 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9204819277108434 [2022-07-21 09:00:30,429 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1528 transitions. [2022-07-21 09:00:30,429 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1528 transitions. [2022-07-21 09:00:30,430 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 09:00:30,430 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1528 transitions. [2022-07-21 09:00:30,433 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 305.6) internal successors, (1528), 5 states have internal predecessors, (1528), 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-21 09:00:30,435 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 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-21 09:00:30,436 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 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-21 09:00:30,436 INFO L186 Difference]: Start difference. First operand has 325 places, 324 transitions, 853 flow. Second operand 5 states and 1528 transitions. [2022-07-21 09:00:30,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 329 places, 364 transitions, 1176 flow [2022-07-21 09:00:30,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 328 places, 364 transitions, 1169 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-07-21 09:00:30,466 INFO L242 Difference]: Finished difference. Result has 330 places, 328 transitions, 908 flow [2022-07-21 09:00:30,467 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=851, PETRI_DIFFERENCE_MINUEND_PLACES=324, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=324, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=908, PETRI_PLACES=330, PETRI_TRANSITIONS=328} [2022-07-21 09:00:30,468 INFO L279 CegarLoopForPetriNet]: 294 programPoint places, 36 predicate places. [2022-07-21 09:00:30,468 INFO L495 AbstractCegarLoop]: Abstraction has has 330 places, 328 transitions, 908 flow [2022-07-21 09:00:30,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 297.2) internal successors, (1486), 5 states have internal predecessors, (1486), 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-21 09:00:30,469 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 09:00:30,469 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:00:30,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-21 09:00:30,469 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-21 09:00:30,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:00:30,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1582113963, now seen corresponding path program 2 times [2022-07-21 09:00:30,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:00:30,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394546264] [2022-07-21 09:00:30,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:00:30,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:00:30,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:00:30,535 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-21 09:00:30,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:00:30,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394546264] [2022-07-21 09:00:30,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394546264] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:00:30,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:00:30,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 09:00:30,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114716013] [2022-07-21 09:00:30,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:00:30,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 09:00:30,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:00:30,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 09:00:30,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-21 09:00:30,541 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 332 [2022-07-21 09:00:30,542 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 328 transitions, 908 flow. Second operand has 5 states, 5 states have (on average 297.2) internal successors, (1486), 5 states have internal predecessors, (1486), 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-21 09:00:30,542 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 09:00:30,543 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 332 [2022-07-21 09:00:30,543 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 09:00:32,165 INFO L129 PetriNetUnfolder]: 1337/12893 cut-off events. [2022-07-21 09:00:32,165 INFO L130 PetriNetUnfolder]: For 5218/5447 co-relation queries the response was YES. [2022-07-21 09:00:32,210 INFO L84 FinitePrefix]: Finished finitePrefix Result has 18823 conditions, 12893 events. 1337/12893 cut-off events. For 5218/5447 co-relation queries the response was YES. Maximal size of possible extension queue 447. Compared 175124 event pairs, 650 based on Foata normal form. 35/12057 useless extension candidates. Maximal degree in co-relation 18796. Up to 761 conditions per place. [2022-07-21 09:00:32,243 INFO L132 encePairwiseOnDemand]: 322/332 looper letters, 84 selfloop transitions, 19 changer transitions 0/392 dead transitions. [2022-07-21 09:00:32,243 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 336 places, 392 transitions, 1422 flow [2022-07-21 09:00:32,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 09:00:32,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-07-21 09:00:32,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2144 transitions. [2022-07-21 09:00:32,248 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9225473321858864 [2022-07-21 09:00:32,248 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 2144 transitions. [2022-07-21 09:00:32,248 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 2144 transitions. [2022-07-21 09:00:32,249 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 09:00:32,249 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 2144 transitions. [2022-07-21 09:00:32,253 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 306.2857142857143) internal successors, (2144), 7 states have internal predecessors, (2144), 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-21 09:00:32,256 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 332.0) internal successors, (2656), 8 states have internal predecessors, (2656), 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-21 09:00:32,256 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 332.0) internal successors, (2656), 8 states have internal predecessors, (2656), 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-21 09:00:32,257 INFO L186 Difference]: Start difference. First operand has 330 places, 328 transitions, 908 flow. Second operand 7 states and 2144 transitions. [2022-07-21 09:00:32,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 336 places, 392 transitions, 1422 flow [2022-07-21 09:00:32,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 334 places, 392 transitions, 1412 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-07-21 09:00:32,285 INFO L242 Difference]: Finished difference. Result has 338 places, 344 transitions, 1095 flow [2022-07-21 09:00:32,286 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=894, PETRI_DIFFERENCE_MINUEND_PLACES=328, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1095, PETRI_PLACES=338, PETRI_TRANSITIONS=344} [2022-07-21 09:00:32,286 INFO L279 CegarLoopForPetriNet]: 294 programPoint places, 44 predicate places. [2022-07-21 09:00:32,286 INFO L495 AbstractCegarLoop]: Abstraction has has 338 places, 344 transitions, 1095 flow [2022-07-21 09:00:32,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 297.2) internal successors, (1486), 5 states have internal predecessors, (1486), 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-21 09:00:32,287 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 09:00:32,287 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:00:32,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-21 09:00:32,288 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-21 09:00:32,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:00:32,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1986999437, now seen corresponding path program 1 times [2022-07-21 09:00:32,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:00:32,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013241110] [2022-07-21 09:00:32,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:00:32,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:00:32,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:00:32,355 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-21 09:00:32,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:00:32,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013241110] [2022-07-21 09:00:32,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013241110] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:00:32,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:00:32,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 09:00:32,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999519026] [2022-07-21 09:00:32,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:00:32,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 09:00:32,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:00:32,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 09:00:32,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 09:00:32,360 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 270 out of 332 [2022-07-21 09:00:32,361 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 338 places, 344 transitions, 1095 flow. Second operand has 6 states, 6 states have (on average 276.3333333333333) internal successors, (1658), 6 states have internal predecessors, (1658), 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-21 09:00:32,361 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 09:00:32,361 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 270 of 332 [2022-07-21 09:00:32,361 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 09:00:33,313 INFO L129 PetriNetUnfolder]: 247/6202 cut-off events. [2022-07-21 09:00:33,313 INFO L130 PetriNetUnfolder]: For 2650/3539 co-relation queries the response was YES. [2022-07-21 09:00:33,346 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9749 conditions, 6202 events. 247/6202 cut-off events. For 2650/3539 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 77752 event pairs, 41 based on Foata normal form. 224/5974 useless extension candidates. Maximal degree in co-relation 9718. Up to 1296 conditions per place. [2022-07-21 09:00:33,359 INFO L132 encePairwiseOnDemand]: 326/332 looper letters, 55 selfloop transitions, 4 changer transitions 9/359 dead transitions. [2022-07-21 09:00:33,359 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 359 transitions, 1268 flow [2022-07-21 09:00:33,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 09:00:33,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-07-21 09:00:33,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1946 transitions. [2022-07-21 09:00:33,363 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8373493975903614 [2022-07-21 09:00:33,364 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1946 transitions. [2022-07-21 09:00:33,364 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1946 transitions. [2022-07-21 09:00:33,365 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 09:00:33,365 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1946 transitions. [2022-07-21 09:00:33,368 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 278.0) internal successors, (1946), 7 states have internal predecessors, (1946), 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-21 09:00:33,371 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 332.0) internal successors, (2656), 8 states have internal predecessors, (2656), 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-21 09:00:33,372 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 332.0) internal successors, (2656), 8 states have internal predecessors, (2656), 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-21 09:00:33,372 INFO L186 Difference]: Start difference. First operand has 338 places, 344 transitions, 1095 flow. Second operand 7 states and 1946 transitions. [2022-07-21 09:00:33,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 359 transitions, 1268 flow [2022-07-21 09:00:33,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 359 transitions, 1264 flow, removed 2 selfloop flow, removed 0 redundant places. [2022-07-21 09:00:33,388 INFO L242 Difference]: Finished difference. Result has 349 places, 342 transitions, 1084 flow [2022-07-21 09:00:33,388 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=1091, PETRI_DIFFERENCE_MINUEND_PLACES=338, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=344, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=340, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1084, PETRI_PLACES=349, PETRI_TRANSITIONS=342} [2022-07-21 09:00:33,389 INFO L279 CegarLoopForPetriNet]: 294 programPoint places, 55 predicate places. [2022-07-21 09:00:33,389 INFO L495 AbstractCegarLoop]: Abstraction has has 349 places, 342 transitions, 1084 flow [2022-07-21 09:00:33,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 276.3333333333333) internal successors, (1658), 6 states have internal predecessors, (1658), 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-21 09:00:33,390 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 09:00:33,390 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:00:33,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-21 09:00:33,390 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-21 09:00:33,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:00:33,391 INFO L85 PathProgramCache]: Analyzing trace with hash 116317659, now seen corresponding path program 3 times [2022-07-21 09:00:33,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:00:33,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660843145] [2022-07-21 09:00:33,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:00:33,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:00:33,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:00:33,437 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-21 09:00:33,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:00:33,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660843145] [2022-07-21 09:00:33,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660843145] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:00:33,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:00:33,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 09:00:33,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643520024] [2022-07-21 09:00:33,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:00:33,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 09:00:33,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:00:33,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 09:00:33,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 09:00:33,442 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 332 [2022-07-21 09:00:33,444 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 349 places, 342 transitions, 1084 flow. Second operand has 4 states, 4 states have (on average 298.0) internal successors, (1192), 4 states have internal predecessors, (1192), 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-21 09:00:33,444 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 09:00:33,444 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 332 [2022-07-21 09:00:33,444 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 09:00:34,895 INFO L129 PetriNetUnfolder]: 1309/12730 cut-off events. [2022-07-21 09:00:34,895 INFO L130 PetriNetUnfolder]: For 9253/9450 co-relation queries the response was YES. [2022-07-21 09:00:34,987 INFO L84 FinitePrefix]: Finished finitePrefix Result has 20163 conditions, 12730 events. 1309/12730 cut-off events. For 9253/9450 co-relation queries the response was YES. Maximal size of possible extension queue 432. Compared 173461 event pairs, 625 based on Foata normal form. 41/11883 useless extension candidates. Maximal degree in co-relation 20126. Up to 1424 conditions per place. [2022-07-21 09:00:35,017 INFO L132 encePairwiseOnDemand]: 323/332 looper letters, 69 selfloop transitions, 15 changer transitions 2/378 dead transitions. [2022-07-21 09:00:35,018 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 351 places, 378 transitions, 1442 flow [2022-07-21 09:00:35,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 09:00:35,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-07-21 09:00:35,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1534 transitions. [2022-07-21 09:00:35,022 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9240963855421687 [2022-07-21 09:00:35,022 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1534 transitions. [2022-07-21 09:00:35,022 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1534 transitions. [2022-07-21 09:00:35,023 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 09:00:35,023 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1534 transitions. [2022-07-21 09:00:35,030 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 306.8) internal successors, (1534), 5 states have internal predecessors, (1534), 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-21 09:00:35,035 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 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-21 09:00:35,036 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 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-21 09:00:35,036 INFO L186 Difference]: Start difference. First operand has 349 places, 342 transitions, 1084 flow. Second operand 5 states and 1534 transitions. [2022-07-21 09:00:35,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 351 places, 378 transitions, 1442 flow [2022-07-21 09:00:35,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 348 places, 378 transitions, 1435 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-07-21 09:00:35,104 INFO L242 Difference]: Finished difference. Result has 352 places, 349 transitions, 1213 flow [2022-07-21 09:00:35,105 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=1077, PETRI_DIFFERENCE_MINUEND_PLACES=344, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=342, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=329, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1213, PETRI_PLACES=352, PETRI_TRANSITIONS=349} [2022-07-21 09:00:35,105 INFO L279 CegarLoopForPetriNet]: 294 programPoint places, 58 predicate places. [2022-07-21 09:00:35,105 INFO L495 AbstractCegarLoop]: Abstraction has has 352 places, 349 transitions, 1213 flow [2022-07-21 09:00:35,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 298.0) internal successors, (1192), 4 states have internal predecessors, (1192), 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-21 09:00:35,106 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 09:00:35,106 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:00:35,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-21 09:00:35,107 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-21 09:00:35,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:00:35,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1840381927, now seen corresponding path program 4 times [2022-07-21 09:00:35,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:00:35,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388939695] [2022-07-21 09:00:35,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:00:35,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:00:35,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:00:35,155 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-21 09:00:35,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:00:35,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388939695] [2022-07-21 09:00:35,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388939695] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:00:35,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:00:35,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 09:00:35,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512758313] [2022-07-21 09:00:35,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:00:35,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 09:00:35,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:00:35,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 09:00:35,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 09:00:35,159 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 332 [2022-07-21 09:00:35,160 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 352 places, 349 transitions, 1213 flow. Second operand has 4 states, 4 states have (on average 298.0) internal successors, (1192), 4 states have internal predecessors, (1192), 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-21 09:00:35,160 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 09:00:35,160 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 332 [2022-07-21 09:00:35,160 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 09:00:36,768 INFO L129 PetriNetUnfolder]: 1303/12374 cut-off events. [2022-07-21 09:00:36,768 INFO L130 PetriNetUnfolder]: For 12352/12589 co-relation queries the response was YES. [2022-07-21 09:00:36,857 INFO L84 FinitePrefix]: Finished finitePrefix Result has 20233 conditions, 12374 events. 1303/12374 cut-off events. For 12352/12589 co-relation queries the response was YES. Maximal size of possible extension queue 407. Compared 166694 event pairs, 681 based on Foata normal form. 17/11480 useless extension candidates. Maximal degree in co-relation 20195. Up to 1765 conditions per place. [2022-07-21 09:00:36,882 INFO L132 encePairwiseOnDemand]: 327/332 looper letters, 65 selfloop transitions, 8 changer transitions 0/365 dead transitions. [2022-07-21 09:00:36,882 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 355 places, 365 transitions, 1438 flow [2022-07-21 09:00:36,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 09:00:36,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-07-21 09:00:36,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1220 transitions. [2022-07-21 09:00:36,885 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9186746987951807 [2022-07-21 09:00:36,885 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1220 transitions. [2022-07-21 09:00:36,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1220 transitions. [2022-07-21 09:00:36,886 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 09:00:36,886 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1220 transitions. [2022-07-21 09:00:36,889 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 305.0) internal successors, (1220), 4 states have internal predecessors, (1220), 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-21 09:00:36,891 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 332.0) internal successors, (1660), 5 states have internal predecessors, (1660), 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-21 09:00:36,892 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 332.0) internal successors, (1660), 5 states have internal predecessors, (1660), 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-21 09:00:36,892 INFO L186 Difference]: Start difference. First operand has 352 places, 349 transitions, 1213 flow. Second operand 4 states and 1220 transitions. [2022-07-21 09:00:36,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 355 places, 365 transitions, 1438 flow [2022-07-21 09:00:36,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 365 transitions, 1432 flow, removed 3 selfloop flow, removed 0 redundant places. [2022-07-21 09:00:36,974 INFO L242 Difference]: Finished difference. Result has 357 places, 351 transitions, 1269 flow [2022-07-21 09:00:36,974 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=1207, PETRI_DIFFERENCE_MINUEND_PLACES=352, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=349, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=341, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1269, PETRI_PLACES=357, PETRI_TRANSITIONS=351} [2022-07-21 09:00:36,975 INFO L279 CegarLoopForPetriNet]: 294 programPoint places, 63 predicate places. [2022-07-21 09:00:36,975 INFO L495 AbstractCegarLoop]: Abstraction has has 357 places, 351 transitions, 1269 flow [2022-07-21 09:00:36,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 298.0) internal successors, (1192), 4 states have internal predecessors, (1192), 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-21 09:00:36,976 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 09:00:36,976 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:00:36,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-21 09:00:36,976 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-21 09:00:36,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:00:36,977 INFO L85 PathProgramCache]: Analyzing trace with hash -2029576223, now seen corresponding path program 1 times [2022-07-21 09:00:36,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:00:36,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612509118] [2022-07-21 09:00:36,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:00:36,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:00:37,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:00:37,074 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-21 09:00:37,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:00:37,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612509118] [2022-07-21 09:00:37,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612509118] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:00:37,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:00:37,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 09:00:37,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674812299] [2022-07-21 09:00:37,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:00:37,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 09:00:37,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:00:37,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 09:00:37,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 09:00:37,078 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 332 [2022-07-21 09:00:37,080 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 357 places, 351 transitions, 1269 flow. Second operand has 6 states, 6 states have (on average 269.0) internal successors, (1614), 6 states have internal predecessors, (1614), 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-21 09:00:37,080 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 09:00:37,080 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 332 [2022-07-21 09:00:37,080 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 09:00:40,359 INFO L129 PetriNetUnfolder]: 5882/23611 cut-off events. [2022-07-21 09:00:40,359 INFO L130 PetriNetUnfolder]: For 19071/20069 co-relation queries the response was YES. [2022-07-21 09:00:40,570 INFO L84 FinitePrefix]: Finished finitePrefix Result has 44401 conditions, 23611 events. 5882/23611 cut-off events. For 19071/20069 co-relation queries the response was YES. Maximal size of possible extension queue 1311. Compared 327754 event pairs, 3180 based on Foata normal form. 253/22300 useless extension candidates. Maximal degree in co-relation 44360. Up to 8090 conditions per place. [2022-07-21 09:00:40,623 INFO L132 encePairwiseOnDemand]: 318/332 looper letters, 72 selfloop transitions, 30 changer transitions 6/400 dead transitions. [2022-07-21 09:00:40,623 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 400 transitions, 1738 flow [2022-07-21 09:00:40,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 09:00:40,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-07-21 09:00:40,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1915 transitions. [2022-07-21 09:00:40,627 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8240103270223752 [2022-07-21 09:00:40,627 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1915 transitions. [2022-07-21 09:00:40,627 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1915 transitions. [2022-07-21 09:00:40,628 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 09:00:40,628 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1915 transitions. [2022-07-21 09:00:40,632 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 273.57142857142856) internal successors, (1915), 7 states have internal predecessors, (1915), 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-21 09:00:40,636 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 332.0) internal successors, (2656), 8 states have internal predecessors, (2656), 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-21 09:00:40,636 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 332.0) internal successors, (2656), 8 states have internal predecessors, (2656), 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-21 09:00:40,636 INFO L186 Difference]: Start difference. First operand has 357 places, 351 transitions, 1269 flow. Second operand 7 states and 1915 transitions. [2022-07-21 09:00:40,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 400 transitions, 1738 flow [2022-07-21 09:00:40,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 362 places, 400 transitions, 1728 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-07-21 09:00:40,747 INFO L242 Difference]: Finished difference. Result has 367 places, 378 transitions, 1571 flow [2022-07-21 09:00:40,748 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=1259, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=334, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1571, PETRI_PLACES=367, PETRI_TRANSITIONS=378} [2022-07-21 09:00:40,748 INFO L279 CegarLoopForPetriNet]: 294 programPoint places, 73 predicate places. [2022-07-21 09:00:40,749 INFO L495 AbstractCegarLoop]: Abstraction has has 367 places, 378 transitions, 1571 flow [2022-07-21 09:00:40,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 269.0) internal successors, (1614), 6 states have internal predecessors, (1614), 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-21 09:00:40,749 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 09:00:40,750 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:00:40,750 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-21 09:00:40,750 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-21 09:00:40,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:00:40,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1458383197, now seen corresponding path program 1 times [2022-07-21 09:00:40,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:00:40,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378360887] [2022-07-21 09:00:40,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:00:40,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:00:40,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:00:40,862 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-21 09:00:40,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:00:40,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378360887] [2022-07-21 09:00:40,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378360887] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:00:40,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:00:40,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 09:00:40,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252991894] [2022-07-21 09:00:40,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:00:40,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 09:00:40,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:00:40,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 09:00:40,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-21 09:00:40,866 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 332 [2022-07-21 09:00:40,867 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 378 transitions, 1571 flow. Second operand has 7 states, 7 states have (on average 268.0) internal successors, (1876), 7 states have internal predecessors, (1876), 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-21 09:00:40,867 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 09:00:40,868 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 332 [2022-07-21 09:00:40,868 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 09:00:44,445 INFO L129 PetriNetUnfolder]: 5880/23513 cut-off events. [2022-07-21 09:00:44,445 INFO L130 PetriNetUnfolder]: For 37370/41765 co-relation queries the response was YES. [2022-07-21 09:00:44,753 INFO L84 FinitePrefix]: Finished finitePrefix Result has 55970 conditions, 23513 events. 5880/23513 cut-off events. For 37370/41765 co-relation queries the response was YES. Maximal size of possible extension queue 1311. Compared 326177 event pairs, 3039 based on Foata normal form. 674/22660 useless extension candidates. Maximal degree in co-relation 55924. Up to 6779 conditions per place. [2022-07-21 09:00:44,801 INFO L132 encePairwiseOnDemand]: 324/332 looper letters, 109 selfloop transitions, 6 changer transitions 17/424 dead transitions. [2022-07-21 09:00:44,801 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 424 transitions, 2230 flow [2022-07-21 09:00:44,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 09:00:44,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-07-21 09:00:44,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 2176 transitions. [2022-07-21 09:00:44,805 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8192771084337349 [2022-07-21 09:00:44,805 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 2176 transitions. [2022-07-21 09:00:44,806 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 2176 transitions. [2022-07-21 09:00:44,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 09:00:44,807 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 2176 transitions. [2022-07-21 09:00:44,810 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 272.0) internal successors, (2176), 8 states have internal predecessors, (2176), 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-21 09:00:44,814 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 332.0) internal successors, (2988), 9 states have internal predecessors, (2988), 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-21 09:00:44,814 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 332.0) internal successors, (2988), 9 states have internal predecessors, (2988), 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-21 09:00:44,815 INFO L186 Difference]: Start difference. First operand has 367 places, 378 transitions, 1571 flow. Second operand 8 states and 2176 transitions. [2022-07-21 09:00:44,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 424 transitions, 2230 flow [2022-07-21 09:00:45,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 370 places, 424 transitions, 2208 flow, removed 11 selfloop flow, removed 2 redundant places. [2022-07-21 09:00:45,218 INFO L242 Difference]: Finished difference. Result has 373 places, 378 transitions, 1571 flow [2022-07-21 09:00:45,218 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=1551, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=372, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1571, PETRI_PLACES=373, PETRI_TRANSITIONS=378} [2022-07-21 09:00:45,219 INFO L279 CegarLoopForPetriNet]: 294 programPoint places, 79 predicate places. [2022-07-21 09:00:45,219 INFO L495 AbstractCegarLoop]: Abstraction has has 373 places, 378 transitions, 1571 flow [2022-07-21 09:00:45,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 268.0) internal successors, (1876), 7 states have internal predecessors, (1876), 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-21 09:00:45,220 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 09:00:45,220 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:00:45,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-21 09:00:45,220 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-21 09:00:45,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:00:45,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1799972975, now seen corresponding path program 1 times [2022-07-21 09:00:45,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:00:45,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093548630] [2022-07-21 09:00:45,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:00:45,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:00:45,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:00:45,328 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-21 09:00:45,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:00:45,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093548630] [2022-07-21 09:00:45,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093548630] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:00:45,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:00:45,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 09:00:45,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050132785] [2022-07-21 09:00:45,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:00:45,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 09:00:45,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:00:45,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 09:00:45,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 09:00:45,334 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 270 out of 332 [2022-07-21 09:00:45,335 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 378 transitions, 1571 flow. Second operand has 6 states, 6 states have (on average 276.3333333333333) internal successors, (1658), 6 states have internal predecessors, (1658), 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-21 09:00:45,335 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 09:00:45,335 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 270 of 332 [2022-07-21 09:00:45,335 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 09:00:47,212 INFO L129 PetriNetUnfolder]: 2421/14869 cut-off events. [2022-07-21 09:00:47,212 INFO L130 PetriNetUnfolder]: For 18064/20869 co-relation queries the response was YES. [2022-07-21 09:00:47,317 INFO L84 FinitePrefix]: Finished finitePrefix Result has 31345 conditions, 14869 events. 2421/14869 cut-off events. For 18064/20869 co-relation queries the response was YES. Maximal size of possible extension queue 783. Compared 210130 event pairs, 860 based on Foata normal form. 320/14213 useless extension candidates. Maximal degree in co-relation 31297. Up to 3086 conditions per place. [2022-07-21 09:00:47,338 INFO L132 encePairwiseOnDemand]: 326/332 looper letters, 57 selfloop transitions, 5 changer transitions 12/393 dead transitions. [2022-07-21 09:00:47,339 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 393 transitions, 1762 flow [2022-07-21 09:00:47,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 09:00:47,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-07-21 09:00:47,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1945 transitions. [2022-07-21 09:00:47,343 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8369191049913941 [2022-07-21 09:00:47,343 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1945 transitions. [2022-07-21 09:00:47,343 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1945 transitions. [2022-07-21 09:00:47,344 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 09:00:47,344 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1945 transitions. [2022-07-21 09:00:47,347 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 277.85714285714283) internal successors, (1945), 7 states have internal predecessors, (1945), 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-21 09:00:47,350 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 332.0) internal successors, (2656), 8 states have internal predecessors, (2656), 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-21 09:00:47,350 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 332.0) internal successors, (2656), 8 states have internal predecessors, (2656), 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-21 09:00:47,350 INFO L186 Difference]: Start difference. First operand has 373 places, 378 transitions, 1571 flow. Second operand 7 states and 1945 transitions. [2022-07-21 09:00:47,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 393 transitions, 1762 flow [2022-07-21 09:00:47,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 393 transitions, 1751 flow, removed 3 selfloop flow, removed 4 redundant places. [2022-07-21 09:00:47,469 INFO L242 Difference]: Finished difference. Result has 378 places, 374 transitions, 1519 flow [2022-07-21 09:00:47,470 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=1562, PETRI_DIFFERENCE_MINUEND_PLACES=367, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=373, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1519, PETRI_PLACES=378, PETRI_TRANSITIONS=374} [2022-07-21 09:00:47,470 INFO L279 CegarLoopForPetriNet]: 294 programPoint places, 84 predicate places. [2022-07-21 09:00:47,472 INFO L495 AbstractCegarLoop]: Abstraction has has 378 places, 374 transitions, 1519 flow [2022-07-21 09:00:47,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 276.3333333333333) internal successors, (1658), 6 states have internal predecessors, (1658), 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-21 09:00:47,473 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 09:00:47,473 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:00:47,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-21 09:00:47,474 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-21 09:00:47,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:00:47,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1137660929, now seen corresponding path program 5 times [2022-07-21 09:00:47,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:00:47,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996820138] [2022-07-21 09:00:47,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:00:47,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:00:47,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:00:47,515 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-21 09:00:47,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:00:47,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996820138] [2022-07-21 09:00:47,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996820138] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:00:47,516 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:00:47,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 09:00:47,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485458542] [2022-07-21 09:00:47,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:00:47,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 09:00:47,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:00:47,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 09:00:47,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 09:00:47,519 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 332 [2022-07-21 09:00:47,520 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 374 transitions, 1519 flow. Second operand has 4 states, 4 states have (on average 298.0) internal successors, (1192), 4 states have internal predecessors, (1192), 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-21 09:00:47,520 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 09:00:47,520 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 332 [2022-07-21 09:00:47,520 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 09:00:49,929 INFO L129 PetriNetUnfolder]: 2686/19729 cut-off events. [2022-07-21 09:00:49,930 INFO L130 PetriNetUnfolder]: For 24754/26327 co-relation queries the response was YES. [2022-07-21 09:00:50,118 INFO L84 FinitePrefix]: Finished finitePrefix Result has 39721 conditions, 19729 events. 2686/19729 cut-off events. For 24754/26327 co-relation queries the response was YES. Maximal size of possible extension queue 917. Compared 293003 event pairs, 963 based on Foata normal form. 218/18488 useless extension candidates. Maximal degree in co-relation 39670. Up to 1799 conditions per place. [2022-07-21 09:00:50,155 INFO L132 encePairwiseOnDemand]: 324/332 looper letters, 64 selfloop transitions, 21 changer transitions 17/421 dead transitions. [2022-07-21 09:00:50,155 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 380 places, 421 transitions, 2082 flow [2022-07-21 09:00:50,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 09:00:50,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-07-21 09:00:50,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1535 transitions. [2022-07-21 09:00:50,158 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9246987951807228 [2022-07-21 09:00:50,158 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1535 transitions. [2022-07-21 09:00:50,158 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1535 transitions. [2022-07-21 09:00:50,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 09:00:50,159 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1535 transitions. [2022-07-21 09:00:50,162 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 307.0) internal successors, (1535), 5 states have internal predecessors, (1535), 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-21 09:00:50,164 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 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-21 09:00:50,164 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 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-21 09:00:50,164 INFO L186 Difference]: Start difference. First operand has 378 places, 374 transitions, 1519 flow. Second operand 5 states and 1535 transitions. [2022-07-21 09:00:50,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 380 places, 421 transitions, 2082 flow [2022-07-21 09:00:50,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 376 places, 421 transitions, 2071 flow, removed 4 selfloop flow, removed 4 redundant places. [2022-07-21 09:00:50,485 INFO L242 Difference]: Finished difference. Result has 380 places, 379 transitions, 1691 flow [2022-07-21 09:00:50,485 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=1510, PETRI_DIFFERENCE_MINUEND_PLACES=372, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=374, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=358, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1691, PETRI_PLACES=380, PETRI_TRANSITIONS=379} [2022-07-21 09:00:50,485 INFO L279 CegarLoopForPetriNet]: 294 programPoint places, 86 predicate places. [2022-07-21 09:00:50,485 INFO L495 AbstractCegarLoop]: Abstraction has has 380 places, 379 transitions, 1691 flow [2022-07-21 09:00:50,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 298.0) internal successors, (1192), 4 states have internal predecessors, (1192), 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-21 09:00:50,486 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 09:00:50,486 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:00:50,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-21 09:00:50,486 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-21 09:00:50,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:00:50,487 INFO L85 PathProgramCache]: Analyzing trace with hash 604689565, now seen corresponding path program 6 times [2022-07-21 09:00:50,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:00:50,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964314386] [2022-07-21 09:00:50,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:00:50,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:00:50,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:00:50,527 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-21 09:00:50,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:00:50,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964314386] [2022-07-21 09:00:50,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964314386] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:00:50,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:00:50,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 09:00:50,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036812186] [2022-07-21 09:00:50,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:00:50,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 09:00:50,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:00:50,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 09:00:50,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 09:00:50,531 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 332 [2022-07-21 09:00:50,531 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 379 transitions, 1691 flow. Second operand has 4 states, 4 states have (on average 298.0) internal successors, (1192), 4 states have internal predecessors, (1192), 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-21 09:00:50,531 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 09:00:50,532 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 332 [2022-07-21 09:00:50,532 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 09:00:53,069 INFO L129 PetriNetUnfolder]: 2499/17853 cut-off events. [2022-07-21 09:00:53,070 INFO L130 PetriNetUnfolder]: For 33042/35138 co-relation queries the response was YES. [2022-07-21 09:00:53,163 INFO L84 FinitePrefix]: Finished finitePrefix Result has 37976 conditions, 17853 events. 2499/17853 cut-off events. For 33042/35138 co-relation queries the response was YES. Maximal size of possible extension queue 749. Compared 256521 event pairs, 648 based on Foata normal form. 267/16800 useless extension candidates. Maximal degree in co-relation 37925. Up to 1934 conditions per place. [2022-07-21 09:00:53,183 INFO L132 encePairwiseOnDemand]: 323/332 looper letters, 50 selfloop transitions, 22 changer transitions 34/421 dead transitions. [2022-07-21 09:00:53,183 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 421 transitions, 2253 flow [2022-07-21 09:00:53,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 09:00:53,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-07-21 09:00:53,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1534 transitions. [2022-07-21 09:00:53,187 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9240963855421687 [2022-07-21 09:00:53,187 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1534 transitions. [2022-07-21 09:00:53,187 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1534 transitions. [2022-07-21 09:00:53,188 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 09:00:53,189 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1534 transitions. [2022-07-21 09:00:53,192 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 306.8) internal successors, (1534), 5 states have internal predecessors, (1534), 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-21 09:00:53,194 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 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-21 09:00:53,194 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 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-21 09:00:53,194 INFO L186 Difference]: Start difference. First operand has 380 places, 379 transitions, 1691 flow. Second operand 5 states and 1534 transitions. [2022-07-21 09:00:53,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 383 places, 421 transitions, 2253 flow [2022-07-21 09:00:53,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 382 places, 421 transitions, 2188 flow, removed 22 selfloop flow, removed 1 redundant places. [2022-07-21 09:00:53,392 INFO L242 Difference]: Finished difference. Result has 386 places, 371 transitions, 1678 flow [2022-07-21 09:00:53,392 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=1632, PETRI_DIFFERENCE_MINUEND_PLACES=378, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=378, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1678, PETRI_PLACES=386, PETRI_TRANSITIONS=371} [2022-07-21 09:00:53,392 INFO L279 CegarLoopForPetriNet]: 294 programPoint places, 92 predicate places. [2022-07-21 09:00:53,392 INFO L495 AbstractCegarLoop]: Abstraction has has 386 places, 371 transitions, 1678 flow [2022-07-21 09:00:53,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 298.0) internal successors, (1192), 4 states have internal predecessors, (1192), 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-21 09:00:53,393 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 09:00:53,393 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:00:53,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-21 09:00:53,393 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-21 09:00:53,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:00:53,393 INFO L85 PathProgramCache]: Analyzing trace with hash -521518423, now seen corresponding path program 1 times [2022-07-21 09:00:53,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:00:53,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015461077] [2022-07-21 09:00:53,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:00:53,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:00:53,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:00:53,446 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 09:00:53,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:00:53,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015461077] [2022-07-21 09:00:53,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015461077] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:00:53,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:00:53,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 09:00:53,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582500017] [2022-07-21 09:00:53,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:00:53,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 09:00:53,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:00:53,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 09:00:53,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 09:00:53,450 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 332 [2022-07-21 09:00:53,450 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 386 places, 371 transitions, 1678 flow. Second operand has 4 states, 4 states have (on average 298.25) internal successors, (1193), 4 states have internal predecessors, (1193), 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-21 09:00:53,450 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 09:00:53,450 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 332 [2022-07-21 09:00:53,451 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 09:00:55,416 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([929] thread2EXIT-->L124-2: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem38#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem38#1=|v_ULTIMATE.start_main_#t~mem38#1_5|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem38#1=|v_ULTIMATE.start_main_#t~mem38#1_5|} AuxVars[] AssignedVars[][371], [Black: 496#(= |thread3Thread1of1ForFork0_#t~ite21| 1), 79#L124-2true, 473#true, Black: 516#(= (+ (- 1) ~res3~0) 0), Black: 365#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 381#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0)), Black: 361#(<= ~res1~0 0), Black: 391#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0)), Black: 389#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= ~n1~0 ~n2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0)), Black: 385#(and (or (<= ~n1~0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (or (<= ~n1~0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0)), Black: 373#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~res1~0 0)), Black: 383#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (or (<= ~n1~0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0)), Black: 367#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0) (<= ~res1~0 0)), Black: 379#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= ~res1~0 0)), Black: 537#(and (<= (+ ~res2~0 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite14| 1) 0)), Black: 533#(<= (+ ~res2~0 1) 0), Black: 414#(<= (+ ~count3~0 1) ~count1~0), Black: 532#(<= (+ |thread2Thread1of1ForFork2_#t~ite14| 1) 0), Black: 416#(and (<= ~count3~0 ~count2~0) (<= (+ ~count3~0 1) ~count1~0)), Black: 551#(<= ~count3~0 ~count2~0), Black: 426#(and (<= ~count1~0 ~count3~0) (<= (+ ~count2~0 1) ~count3~0)), Black: 552#(<= ~count1~0 ~count2~0), Black: 549#true, Black: 433#(<= (+ ~count1~0 1) ~count2~0), Black: 560#true, Black: 436#(and (<= (+ ~count1~0 1) ~count2~0) (<= (+ ~count1~0 1) ~count3~0)), Black: 562#(<= ~count1~0 ~count3~0), Black: 563#(<= ~count1~0 ~count2~0), Black: 316#(= thread2Thread1of1ForFork2_~stop~1 0), 89#L89true, 441#true, Black: 449#(and (<= (+ ~count1~0 1) ~count2~0) (<= (+ ~count3~0 1) ~count2~0)), Black: 445#(<= (+ ~count3~0 1) ~count2~0), Black: 444#(<= (+ ~count1~0 1) ~count2~0), Black: 447#(and (not (= ~count2~0 ~count1~0)) (<= (+ ~count3~0 1) ~count2~0)), Black: 326#(= thread1Thread1of1ForFork1_~stop~0 0), 494#true, 574#(<= ~count2~0 ~count1~0), Black: 458#(<= (+ ~res1~0 1) 0), Black: 462#(and (<= (+ ~res1~0 1) 0) (<= (+ |thread1Thread1of1ForFork1_#t~ite7| 1) 0)), Black: 457#(<= (+ |thread1Thread1of1ForFork1_#t~ite7| 1) 0), Black: 337#(and (<= (+ ~res2~0 ~n1~0) (+ ~res3~0 ~n2~0)) (<= ~n1~0 (+ ~res3~0 ~n3~0))), 423#(<= ~count1~0 ~count3~0), Black: 331#(<= ~n1~0 (+ ~res3~0 ~n3~0)), Black: 475#(<= (+ ~count2~0 1) ~count1~0), Black: 478#(and (<= (+ ~count2~0 1) ~count1~0) (<= (+ ~count3~0 1) ~count1~0)), Black: 476#(<= (+ ~count3~0 1) ~count1~0), 565#(and (<= ~count1~0 ~count3~0) (<= ~count1~0 ~count2~0)), 554#(and (<= ~count3~0 ~count2~0) (<= ~count1~0 ~count2~0)), Black: 487#(<= (+ ~count2~0 1) ~count1~0), 311#true, 413#(<= ~count3~0 ~count2~0), Black: 497#(or (< 0 ~res3~0) (<= ~res2~0 0) (<= ~res1~0 0)), Black: 501#(and (or (< 0 ~res3~0) (<= ~res2~0 0) (<= ~res1~0 0)) (= |thread3Thread1of1ForFork0_#t~ite21| 1))]) [2022-07-21 09:00:55,416 INFO L384 tUnfolder$Statistics]: this new event has 202 ancestors and is cut-off event [2022-07-21 09:00:55,416 INFO L387 tUnfolder$Statistics]: existing Event has 200 ancestors and is cut-off event [2022-07-21 09:00:55,416 INFO L387 tUnfolder$Statistics]: existing Event has 200 ancestors and is cut-off event [2022-07-21 09:00:55,416 INFO L387 tUnfolder$Statistics]: existing Event has 201 ancestors and is cut-off event [2022-07-21 09:00:55,428 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([929] thread2EXIT-->L124-2: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem38#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem38#1=|v_ULTIMATE.start_main_#t~mem38#1_5|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem38#1=|v_ULTIMATE.start_main_#t~mem38#1_5|} AuxVars[] AssignedVars[][371], [Black: 496#(= |thread3Thread1of1ForFork0_#t~ite21| 1), 79#L124-2true, 473#true, Black: 516#(= (+ (- 1) ~res3~0) 0), Black: 365#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 381#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0)), Black: 361#(<= ~res1~0 0), Black: 391#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0)), Black: 389#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= ~n1~0 ~n2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0)), Black: 385#(and (or (<= ~n1~0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (or (<= ~n1~0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0)), Black: 373#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~res1~0 0)), Black: 383#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (or (<= ~n1~0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0)), Black: 367#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0) (<= ~res1~0 0)), Black: 379#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= ~res1~0 0)), Black: 537#(and (<= (+ ~res2~0 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite14| 1) 0)), Black: 533#(<= (+ ~res2~0 1) 0), Black: 414#(<= (+ ~count3~0 1) ~count1~0), Black: 532#(<= (+ |thread2Thread1of1ForFork2_#t~ite14| 1) 0), Black: 416#(and (<= ~count3~0 ~count2~0) (<= (+ ~count3~0 1) ~count1~0)), Black: 551#(<= ~count3~0 ~count2~0), Black: 426#(and (<= ~count1~0 ~count3~0) (<= (+ ~count2~0 1) ~count3~0)), Black: 552#(<= ~count1~0 ~count2~0), Black: 549#true, Black: 433#(<= (+ ~count1~0 1) ~count2~0), Black: 436#(and (<= (+ ~count1~0 1) ~count2~0) (<= (+ ~count1~0 1) ~count3~0)), Black: 560#true, Black: 562#(<= ~count1~0 ~count3~0), Black: 563#(<= ~count1~0 ~count2~0), Black: 316#(= thread2Thread1of1ForFork2_~stop~1 0), 441#true, Black: 449#(and (<= (+ ~count1~0 1) ~count2~0) (<= (+ ~count3~0 1) ~count2~0)), Black: 445#(<= (+ ~count3~0 1) ~count2~0), Black: 444#(<= (+ ~count1~0 1) ~count2~0), Black: 447#(and (not (= ~count2~0 ~count1~0)) (<= (+ ~count3~0 1) ~count2~0)), Black: 326#(= thread1Thread1of1ForFork1_~stop~0 0), 494#true, 87#L100-3true, 574#(<= ~count2~0 ~count1~0), Black: 458#(<= (+ ~res1~0 1) 0), Black: 462#(and (<= (+ ~res1~0 1) 0) (<= (+ |thread1Thread1of1ForFork1_#t~ite7| 1) 0)), Black: 457#(<= (+ |thread1Thread1of1ForFork1_#t~ite7| 1) 0), Black: 337#(and (<= (+ ~res2~0 ~n1~0) (+ ~res3~0 ~n2~0)) (<= ~n1~0 (+ ~res3~0 ~n3~0))), 423#(<= ~count1~0 ~count3~0), Black: 331#(<= ~n1~0 (+ ~res3~0 ~n3~0)), Black: 475#(<= (+ ~count2~0 1) ~count1~0), Black: 478#(and (<= (+ ~count2~0 1) ~count1~0) (<= (+ ~count3~0 1) ~count1~0)), 565#(and (<= ~count1~0 ~count3~0) (<= ~count1~0 ~count2~0)), Black: 476#(<= (+ ~count3~0 1) ~count1~0), Black: 487#(<= (+ ~count2~0 1) ~count1~0), 554#(and (<= ~count3~0 ~count2~0) (<= ~count1~0 ~count2~0)), 311#true, 413#(<= ~count3~0 ~count2~0), Black: 497#(or (< 0 ~res3~0) (<= ~res2~0 0) (<= ~res1~0 0)), Black: 501#(and (or (< 0 ~res3~0) (<= ~res2~0 0) (<= ~res1~0 0)) (= |thread3Thread1of1ForFork0_#t~ite21| 1))]) [2022-07-21 09:00:55,428 INFO L384 tUnfolder$Statistics]: this new event has 201 ancestors and is cut-off event [2022-07-21 09:00:55,428 INFO L387 tUnfolder$Statistics]: existing Event has 203 ancestors and is cut-off event [2022-07-21 09:00:55,428 INFO L387 tUnfolder$Statistics]: existing Event has 202 ancestors and is cut-off event [2022-07-21 09:00:55,429 INFO L387 tUnfolder$Statistics]: existing Event has 201 ancestors and is cut-off event [2022-07-21 09:00:55,523 INFO L129 PetriNetUnfolder]: 2222/16157 cut-off events. [2022-07-21 09:00:55,523 INFO L130 PetriNetUnfolder]: For 29115/30712 co-relation queries the response was YES. [2022-07-21 09:00:55,694 INFO L84 FinitePrefix]: Finished finitePrefix Result has 33489 conditions, 16157 events. 2222/16157 cut-off events. For 29115/30712 co-relation queries the response was YES. Maximal size of possible extension queue 628. Compared 224018 event pairs, 644 based on Foata normal form. 188/15121 useless extension candidates. Maximal degree in co-relation 33435. Up to 1732 conditions per place. [2022-07-21 09:00:55,727 INFO L132 encePairwiseOnDemand]: 326/332 looper letters, 59 selfloop transitions, 14 changer transitions 8/396 dead transitions. [2022-07-21 09:00:55,727 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 388 places, 396 transitions, 1983 flow [2022-07-21 09:00:55,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 09:00:55,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-07-21 09:00:55,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1527 transitions. [2022-07-21 09:00:55,729 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9198795180722892 [2022-07-21 09:00:55,730 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1527 transitions. [2022-07-21 09:00:55,730 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1527 transitions. [2022-07-21 09:00:55,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 09:00:55,730 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1527 transitions. [2022-07-21 09:00:55,731 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 305.4) internal successors, (1527), 5 states have internal predecessors, (1527), 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-21 09:00:55,733 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 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-21 09:00:55,733 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 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-21 09:00:55,733 INFO L186 Difference]: Start difference. First operand has 386 places, 371 transitions, 1678 flow. Second operand 5 states and 1527 transitions. [2022-07-21 09:00:55,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 388 places, 396 transitions, 1983 flow [2022-07-21 09:00:55,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 380 places, 396 transitions, 1816 flow, removed 71 selfloop flow, removed 8 redundant places. [2022-07-21 09:00:55,912 INFO L242 Difference]: Finished difference. Result has 381 places, 374 transitions, 1607 flow [2022-07-21 09:00:55,912 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=1534, PETRI_DIFFERENCE_MINUEND_PLACES=376, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=371, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=359, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1607, PETRI_PLACES=381, PETRI_TRANSITIONS=374} [2022-07-21 09:00:55,912 INFO L279 CegarLoopForPetriNet]: 294 programPoint places, 87 predicate places. [2022-07-21 09:00:55,912 INFO L495 AbstractCegarLoop]: Abstraction has has 381 places, 374 transitions, 1607 flow [2022-07-21 09:00:55,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 298.25) internal successors, (1193), 4 states have internal predecessors, (1193), 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-21 09:00:55,913 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 09:00:55,913 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:00:55,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-21 09:00:55,913 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-21 09:00:55,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:00:55,913 INFO L85 PathProgramCache]: Analyzing trace with hash -119223153, now seen corresponding path program 2 times [2022-07-21 09:00:55,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:00:55,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325133501] [2022-07-21 09:00:55,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:00:55,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:00:55,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:00:55,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 09:00:55,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:00:55,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325133501] [2022-07-21 09:00:55,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325133501] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:00:55,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:00:55,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 09:00:55,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538891159] [2022-07-21 09:00:55,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:00:55,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 09:00:55,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:00:55,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 09:00:55,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 09:00:55,973 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 332 [2022-07-21 09:00:55,974 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 381 places, 374 transitions, 1607 flow. Second operand has 4 states, 4 states have (on average 298.25) internal successors, (1193), 4 states have internal predecessors, (1193), 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-21 09:00:55,974 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 09:00:55,974 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 332 [2022-07-21 09:00:55,974 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 09:00:57,686 INFO L129 PetriNetUnfolder]: 1906/13298 cut-off events. [2022-07-21 09:00:57,686 INFO L130 PetriNetUnfolder]: For 19732/20775 co-relation queries the response was YES. [2022-07-21 09:00:57,822 INFO L84 FinitePrefix]: Finished finitePrefix Result has 27668 conditions, 13298 events. 1906/13298 cut-off events. For 19732/20775 co-relation queries the response was YES. Maximal size of possible extension queue 629. Compared 181396 event pairs, 620 based on Foata normal form. 153/12440 useless extension candidates. Maximal degree in co-relation 27620. Up to 1488 conditions per place. [2022-07-21 09:00:57,852 INFO L132 encePairwiseOnDemand]: 324/332 looper letters, 58 selfloop transitions, 27 changer transitions 20/412 dead transitions. [2022-07-21 09:00:57,853 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 385 places, 412 transitions, 2114 flow [2022-07-21 09:00:57,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 09:00:57,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-07-21 09:00:57,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1530 transitions. [2022-07-21 09:00:57,854 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9216867469879518 [2022-07-21 09:00:57,854 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1530 transitions. [2022-07-21 09:00:57,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1530 transitions. [2022-07-21 09:00:57,855 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 09:00:57,855 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1530 transitions. [2022-07-21 09:00:57,856 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 306.0) internal successors, (1530), 5 states have internal predecessors, (1530), 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-21 09:00:57,857 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 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-21 09:00:57,858 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 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-21 09:00:57,858 INFO L186 Difference]: Start difference. First operand has 381 places, 374 transitions, 1607 flow. Second operand 5 states and 1530 transitions. [2022-07-21 09:00:57,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 385 places, 412 transitions, 2114 flow [2022-07-21 09:00:57,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 383 places, 412 transitions, 2090 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-07-21 09:00:57,988 INFO L242 Difference]: Finished difference. Result has 387 places, 375 transitions, 1743 flow [2022-07-21 09:00:57,989 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=1576, PETRI_DIFFERENCE_MINUEND_PLACES=379, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=373, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=351, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1743, PETRI_PLACES=387, PETRI_TRANSITIONS=375} [2022-07-21 09:00:57,989 INFO L279 CegarLoopForPetriNet]: 294 programPoint places, 93 predicate places. [2022-07-21 09:00:57,989 INFO L495 AbstractCegarLoop]: Abstraction has has 387 places, 375 transitions, 1743 flow [2022-07-21 09:00:57,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 298.25) internal successors, (1193), 4 states have internal predecessors, (1193), 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-21 09:00:57,990 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 09:00:57,990 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:00:57,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-21 09:00:57,990 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-21 09:00:57,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:00:57,990 INFO L85 PathProgramCache]: Analyzing trace with hash 610845763, now seen corresponding path program 1 times [2022-07-21 09:00:57,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:00:57,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567050771] [2022-07-21 09:00:57,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:00:57,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:00:58,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:00:58,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 09:00:58,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:00:58,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567050771] [2022-07-21 09:00:58,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567050771] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:00:58,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:00:58,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-21 09:00:58,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572718822] [2022-07-21 09:00:58,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:00:58,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-21 09:00:58,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:00:58,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-21 09:00:58,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2022-07-21 09:00:58,187 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 332 [2022-07-21 09:00:58,189 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 387 places, 375 transitions, 1743 flow. Second operand has 14 states, 14 states have (on average 235.78571428571428) internal successors, (3301), 14 states have internal predecessors, (3301), 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-21 09:00:58,189 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 09:00:58,189 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 332 [2022-07-21 09:00:58,189 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 09:01:05,601 INFO L129 PetriNetUnfolder]: 9612/46620 cut-off events. [2022-07-21 09:01:05,601 INFO L130 PetriNetUnfolder]: For 58728/64156 co-relation queries the response was YES. [2022-07-21 09:01:06,116 INFO L84 FinitePrefix]: Finished finitePrefix Result has 93197 conditions, 46620 events. 9612/46620 cut-off events. For 58728/64156 co-relation queries the response was YES. Maximal size of possible extension queue 1793. Compared 722965 event pairs, 2650 based on Foata normal form. 739/42245 useless extension candidates. Maximal degree in co-relation 93147. Up to 4928 conditions per place. [2022-07-21 09:01:06,203 INFO L132 encePairwiseOnDemand]: 311/332 looper letters, 158 selfloop transitions, 49 changer transitions 10/484 dead transitions. [2022-07-21 09:01:06,204 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 395 places, 484 transitions, 2754 flow [2022-07-21 09:01:06,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-21 09:01:06,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-07-21 09:01:06,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 4768 transitions. [2022-07-21 09:01:06,209 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7180722891566265 [2022-07-21 09:01:06,209 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 4768 transitions. [2022-07-21 09:01:06,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 4768 transitions. [2022-07-21 09:01:06,211 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 09:01:06,211 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 4768 transitions. [2022-07-21 09:01:06,216 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 238.4) internal successors, (4768), 20 states have internal predecessors, (4768), 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-21 09:01:06,222 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 332.0) internal successors, (6972), 21 states have internal predecessors, (6972), 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-21 09:01:06,223 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 332.0) internal successors, (6972), 21 states have internal predecessors, (6972), 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-21 09:01:06,223 INFO L186 Difference]: Start difference. First operand has 387 places, 375 transitions, 1743 flow. Second operand 20 states and 4768 transitions. [2022-07-21 09:01:06,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 395 places, 484 transitions, 2754 flow [2022-07-21 09:01:06,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 391 places, 484 transitions, 2680 flow, removed 26 selfloop flow, removed 4 redundant places. [2022-07-21 09:01:06,637 INFO L242 Difference]: Finished difference. Result has 401 places, 402 transitions, 2013 flow [2022-07-21 09:01:06,638 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=1673, PETRI_DIFFERENCE_MINUEND_PLACES=372, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=375, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=343, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=2013, PETRI_PLACES=401, PETRI_TRANSITIONS=402} [2022-07-21 09:01:06,638 INFO L279 CegarLoopForPetriNet]: 294 programPoint places, 107 predicate places. [2022-07-21 09:01:06,638 INFO L495 AbstractCegarLoop]: Abstraction has has 401 places, 402 transitions, 2013 flow [2022-07-21 09:01:06,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 235.78571428571428) internal successors, (3301), 14 states have internal predecessors, (3301), 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-21 09:01:06,639 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 09:01:06,639 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:01:06,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-21 09:01:06,639 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-21 09:01:06,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:01:06,640 INFO L85 PathProgramCache]: Analyzing trace with hash -566396359, now seen corresponding path program 1 times [2022-07-21 09:01:06,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:01:06,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183288364] [2022-07-21 09:01:06,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:01:06,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:01:06,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:01:06,680 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 09:01:06,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:01:06,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183288364] [2022-07-21 09:01:06,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183288364] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:01:06,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:01:06,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 09:01:06,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266792454] [2022-07-21 09:01:06,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:01:06,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 09:01:06,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:01:06,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 09:01:06,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 09:01:06,683 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 332 [2022-07-21 09:01:06,684 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 401 places, 402 transitions, 2013 flow. Second operand has 4 states, 4 states have (on average 298.0) internal successors, (1192), 4 states have internal predecessors, (1192), 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-21 09:01:06,684 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 09:01:06,684 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 332 [2022-07-21 09:01:06,684 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 09:01:11,091 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([929] thread2EXIT-->L124-2: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem38#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem38#1=|v_ULTIMATE.start_main_#t~mem38#1_5|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem38#1=|v_ULTIMATE.start_main_#t~mem38#1_5|} AuxVars[] AssignedVars[][384], [Black: 496#(= |thread3Thread1of1ForFork0_#t~ite21| 1), Black: 632#(and (<= ~n2~0 ~n3~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), Black: 630#(and (or (<= ~n2~0 ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0) (or (<= ~n2~0 ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 638#(and (<= ~n2~0 ~n3~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 634#(and (<= ~n2~0 ~n3~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), Black: 626#(and (or (<= ~n2~0 ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), Black: 604#(<= ~res2~0 0), Black: 616#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~res2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 622#(and (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), 79#L124-2true, Black: 624#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), Black: 636#(and (<= ~n2~0 ~n3~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 365#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 516#(= (+ (- 1) ~res3~0) 0), Black: 381#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0)), Black: 361#(<= ~res1~0 0), Black: 391#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0)), Black: 389#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= ~n1~0 ~n2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0)), 593#true, Black: 385#(and (or (<= ~n1~0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (or (<= ~n1~0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0)), Black: 373#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~res1~0 0)), Black: 383#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (or (<= ~n1~0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0)), Black: 367#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0) (<= ~res1~0 0)), Black: 379#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= ~res1~0 0)), Black: 537#(and (<= (+ ~res2~0 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite14| 1) 0)), Black: 533#(<= (+ ~res2~0 1) 0), Black: 532#(<= (+ |thread2Thread1of1ForFork2_#t~ite14| 1) 0), Black: 551#(<= ~count3~0 ~count2~0), Black: 552#(<= ~count1~0 ~count2~0), Black: 549#true, 586#(and (<= ~count2~0 ~count3~0) (<= ~count2~0 ~count1~0)), Black: 560#true, Black: 562#(<= ~count1~0 ~count3~0), Black: 563#(<= ~count1~0 ~count2~0), 89#L89true, Black: 316#(= thread2Thread1of1ForFork2_~stop~1 0), 441#true, Black: 445#(<= (+ ~count3~0 1) ~count2~0), Black: 577#(and (<= (+ ~count3~0 1) ~count1~0) (<= ~count2~0 ~count1~0)), Black: 447#(and (not (= ~count2~0 ~count1~0)) (<= (+ ~count3~0 1) ~count2~0)), Black: 326#(= thread1Thread1of1ForFork1_~stop~0 0), 494#true, Black: 583#(<= ~count2~0 ~count1~0), Black: 581#true, Black: 584#(<= ~count2~0 ~count3~0), 574#(<= ~count2~0 ~count1~0), Black: 462#(and (<= (+ ~res1~0 1) 0) (<= (+ |thread1Thread1of1ForFork1_#t~ite7| 1) 0)), Black: 457#(<= (+ |thread1Thread1of1ForFork1_#t~ite7| 1) 0), Black: 337#(and (<= (+ ~res2~0 ~n1~0) (+ ~res3~0 ~n2~0)) (<= ~n1~0 (+ ~res3~0 ~n3~0))), 423#(<= ~count1~0 ~count3~0), Black: 331#(<= ~n1~0 (+ ~res3~0 ~n3~0)), 565#(and (<= ~count1~0 ~count3~0) (<= ~count1~0 ~count2~0)), Black: 476#(<= (+ ~count3~0 1) ~count1~0), 650#true, 554#(and (<= ~count3~0 ~count2~0) (<= ~count1~0 ~count2~0)), 311#true, 413#(<= ~count3~0 ~count2~0), Black: 497#(or (< 0 ~res3~0) (<= ~res2~0 0) (<= ~res1~0 0)), Black: 501#(and (or (< 0 ~res3~0) (<= ~res2~0 0) (<= ~res1~0 0)) (= |thread3Thread1of1ForFork0_#t~ite21| 1))]) [2022-07-21 09:01:11,091 INFO L384 tUnfolder$Statistics]: this new event has 209 ancestors and is cut-off event [2022-07-21 09:01:11,092 INFO L387 tUnfolder$Statistics]: existing Event has 207 ancestors and is cut-off event [2022-07-21 09:01:11,092 INFO L387 tUnfolder$Statistics]: existing Event has 207 ancestors and is cut-off event [2022-07-21 09:01:11,092 INFO L387 tUnfolder$Statistics]: existing Event has 208 ancestors and is cut-off event [2022-07-21 09:01:11,110 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([929] thread2EXIT-->L124-2: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem38#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem38#1=|v_ULTIMATE.start_main_#t~mem38#1_5|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem38#1=|v_ULTIMATE.start_main_#t~mem38#1_5|} AuxVars[] AssignedVars[][384], [Black: 496#(= |thread3Thread1of1ForFork0_#t~ite21| 1), Black: 632#(and (<= ~n2~0 ~n3~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), Black: 630#(and (or (<= ~n2~0 ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0) (or (<= ~n2~0 ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 638#(and (<= ~n2~0 ~n3~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 634#(and (<= ~n2~0 ~n3~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), Black: 626#(and (or (<= ~n2~0 ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), Black: 604#(<= ~res2~0 0), Black: 616#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~res2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 622#(and (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), Black: 624#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), 79#L124-2true, Black: 636#(and (<= ~n2~0 ~n3~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 516#(= (+ (- 1) ~res3~0) 0), Black: 365#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 381#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0)), Black: 361#(<= ~res1~0 0), Black: 391#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0)), Black: 389#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= ~n1~0 ~n2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0)), 593#true, Black: 385#(and (or (<= ~n1~0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (or (<= ~n1~0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0)), Black: 373#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~res1~0 0)), Black: 383#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (or (<= ~n1~0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0)), Black: 367#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0) (<= ~res1~0 0)), Black: 379#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= ~res1~0 0)), Black: 537#(and (<= (+ ~res2~0 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite14| 1) 0)), Black: 533#(<= (+ ~res2~0 1) 0), Black: 532#(<= (+ |thread2Thread1of1ForFork2_#t~ite14| 1) 0), Black: 551#(<= ~count3~0 ~count2~0), Black: 552#(<= ~count1~0 ~count2~0), Black: 549#true, 586#(and (<= ~count2~0 ~count3~0) (<= ~count2~0 ~count1~0)), Black: 560#true, Black: 562#(<= ~count1~0 ~count3~0), Black: 563#(<= ~count1~0 ~count2~0), Black: 316#(= thread2Thread1of1ForFork2_~stop~1 0), 441#true, Black: 445#(<= (+ ~count3~0 1) ~count2~0), Black: 577#(and (<= (+ ~count3~0 1) ~count1~0) (<= ~count2~0 ~count1~0)), Black: 447#(and (not (= ~count2~0 ~count1~0)) (<= (+ ~count3~0 1) ~count2~0)), Black: 326#(= thread1Thread1of1ForFork1_~stop~0 0), 494#true, 87#L100-3true, Black: 583#(<= ~count2~0 ~count1~0), Black: 581#true, Black: 584#(<= ~count2~0 ~count3~0), 574#(<= ~count2~0 ~count1~0), Black: 462#(and (<= (+ ~res1~0 1) 0) (<= (+ |thread1Thread1of1ForFork1_#t~ite7| 1) 0)), Black: 457#(<= (+ |thread1Thread1of1ForFork1_#t~ite7| 1) 0), Black: 337#(and (<= (+ ~res2~0 ~n1~0) (+ ~res3~0 ~n2~0)) (<= ~n1~0 (+ ~res3~0 ~n3~0))), 423#(<= ~count1~0 ~count3~0), Black: 331#(<= ~n1~0 (+ ~res3~0 ~n3~0)), 565#(and (<= ~count1~0 ~count3~0) (<= ~count1~0 ~count2~0)), Black: 476#(<= (+ ~count3~0 1) ~count1~0), 650#true, 554#(and (<= ~count3~0 ~count2~0) (<= ~count1~0 ~count2~0)), 311#true, 413#(<= ~count3~0 ~count2~0), Black: 497#(or (< 0 ~res3~0) (<= ~res2~0 0) (<= ~res1~0 0)), Black: 501#(and (or (< 0 ~res3~0) (<= ~res2~0 0) (<= ~res1~0 0)) (= |thread3Thread1of1ForFork0_#t~ite21| 1))]) [2022-07-21 09:01:11,110 INFO L384 tUnfolder$Statistics]: this new event has 208 ancestors and is cut-off event [2022-07-21 09:01:11,110 INFO L387 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2022-07-21 09:01:11,110 INFO L387 tUnfolder$Statistics]: existing Event has 208 ancestors and is cut-off event [2022-07-21 09:01:11,110 INFO L387 tUnfolder$Statistics]: existing Event has 209 ancestors and is cut-off event [2022-07-21 09:01:11,259 INFO L129 PetriNetUnfolder]: 4117/29610 cut-off events. [2022-07-21 09:01:11,260 INFO L130 PetriNetUnfolder]: For 44380/47014 co-relation queries the response was YES. [2022-07-21 09:01:11,519 INFO L84 FinitePrefix]: Finished finitePrefix Result has 63121 conditions, 29610 events. 4117/29610 cut-off events. For 44380/47014 co-relation queries the response was YES. Maximal size of possible extension queue 1157. Compared 455660 event pairs, 1409 based on Foata normal form. 318/27819 useless extension candidates. Maximal degree in co-relation 63064. Up to 3208 conditions per place. [2022-07-21 09:01:11,578 INFO L132 encePairwiseOnDemand]: 325/332 looper letters, 67 selfloop transitions, 15 changer transitions 1/417 dead transitions. [2022-07-21 09:01:11,579 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 402 places, 417 transitions, 2192 flow [2022-07-21 09:01:11,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 09:01:11,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-07-21 09:01:11,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1523 transitions. [2022-07-21 09:01:11,580 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9174698795180722 [2022-07-21 09:01:11,581 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1523 transitions. [2022-07-21 09:01:11,581 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1523 transitions. [2022-07-21 09:01:11,581 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 09:01:11,581 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1523 transitions. [2022-07-21 09:01:11,582 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 304.6) internal successors, (1523), 5 states have internal predecessors, (1523), 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-21 09:01:11,584 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 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-21 09:01:11,584 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 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-21 09:01:11,584 INFO L186 Difference]: Start difference. First operand has 401 places, 402 transitions, 2013 flow. Second operand 5 states and 1523 transitions. [2022-07-21 09:01:11,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 402 places, 417 transitions, 2192 flow [2022-07-21 09:01:12,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 394 places, 417 transitions, 2157 flow, removed 2 selfloop flow, removed 8 redundant places. [2022-07-21 09:01:12,033 INFO L242 Difference]: Finished difference. Result has 396 places, 400 transitions, 1989 flow [2022-07-21 09:01:12,034 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=1929, PETRI_DIFFERENCE_MINUEND_PLACES=390, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=399, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=384, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1989, PETRI_PLACES=396, PETRI_TRANSITIONS=400} [2022-07-21 09:01:12,034 INFO L279 CegarLoopForPetriNet]: 294 programPoint places, 102 predicate places. [2022-07-21 09:01:12,034 INFO L495 AbstractCegarLoop]: Abstraction has has 396 places, 400 transitions, 1989 flow [2022-07-21 09:01:12,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 298.0) internal successors, (1192), 4 states have internal predecessors, (1192), 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-21 09:01:12,034 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 09:01:12,035 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:01:12,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-21 09:01:12,035 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-21 09:01:12,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:01:12,035 INFO L85 PathProgramCache]: Analyzing trace with hash 405257245, now seen corresponding path program 2 times [2022-07-21 09:01:12,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:01:12,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966567209] [2022-07-21 09:01:12,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:01:12,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:01:12,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:01:12,198 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 09:01:12,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:01:12,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966567209] [2022-07-21 09:01:12,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966567209] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:01:12,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:01:12,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 09:01:12,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77940355] [2022-07-21 09:01:12,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:01:12,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 09:01:12,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:01:12,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 09:01:12,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 09:01:12,204 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 332 [2022-07-21 09:01:12,205 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 396 places, 400 transitions, 1989 flow. Second operand has 4 states, 4 states have (on average 298.0) internal successors, (1192), 4 states have internal predecessors, (1192), 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-21 09:01:12,205 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 09:01:12,205 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 332 [2022-07-21 09:01:12,205 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-21 09:01:15,858 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([929] thread2EXIT-->L124-2: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem38#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem38#1=|v_ULTIMATE.start_main_#t~mem38#1_5|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem38#1=|v_ULTIMATE.start_main_#t~mem38#1_5|} AuxVars[] AssignedVars[][387], [Black: 496#(= |thread3Thread1of1ForFork0_#t~ite21| 1), Black: 632#(and (<= ~n2~0 ~n3~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), Black: 630#(and (or (<= ~n2~0 ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0) (or (<= ~n2~0 ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 634#(and (<= ~n2~0 ~n3~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), Black: 626#(and (or (<= ~n2~0 ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), Black: 604#(<= ~res2~0 0), Black: 616#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~res2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 622#(and (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), Black: 624#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), 79#L124-2true, Black: 516#(= (+ (- 1) ~res3~0) 0), Black: 365#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 381#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0)), Black: 361#(<= ~res1~0 0), Black: 655#(and (<= (+ ~count3~0 1) ~count2~0) (<= (+ ~count3~0 1) ~count1~0)), Black: 391#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0)), Black: 389#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= ~n1~0 ~n2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0)), Black: 385#(and (or (<= ~n1~0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (or (<= ~n1~0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0)), Black: 373#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~res1~0 0)), Black: 383#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (or (<= ~n1~0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0)), Black: 367#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0) (<= ~res1~0 0)), Black: 379#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= ~res1~0 0)), Black: 537#(and (<= (+ ~res2~0 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite14| 1) 0)), Black: 533#(<= (+ ~res2~0 1) 0), Black: 532#(<= (+ |thread2Thread1of1ForFork2_#t~ite14| 1) 0), Black: 551#(<= ~count3~0 ~count2~0), Black: 552#(<= ~count1~0 ~count2~0), Black: 549#true, 586#(and (<= ~count2~0 ~count3~0) (<= ~count2~0 ~count1~0)), Black: 560#true, Black: 562#(<= ~count1~0 ~count3~0), Black: 563#(<= ~count1~0 ~count2~0), 89#L89true, Black: 316#(= thread2Thread1of1ForFork2_~stop~1 0), 441#true, Black: 445#(<= (+ ~count3~0 1) ~count2~0), Black: 447#(and (not (= ~count2~0 ~count1~0)) (<= (+ ~count3~0 1) ~count2~0)), Black: 326#(= thread1Thread1of1ForFork1_~stop~0 0), 494#true, 665#(and (<= ~count1~0 ~count3~0) (<= ~count2~0 ~count3~0)), Black: 583#(<= ~count2~0 ~count1~0), Black: 581#true, Black: 584#(<= ~count2~0 ~count3~0), 574#(<= ~count2~0 ~count1~0), Black: 462#(and (<= (+ ~res1~0 1) 0) (<= (+ |thread1Thread1of1ForFork1_#t~ite7| 1) 0)), Black: 457#(<= (+ |thread1Thread1of1ForFork1_#t~ite7| 1) 0), Black: 337#(and (<= (+ ~res2~0 ~n1~0) (+ ~res3~0 ~n2~0)) (<= ~n1~0 (+ ~res3~0 ~n3~0))), 423#(<= ~count1~0 ~count3~0), Black: 331#(<= ~n1~0 (+ ~res3~0 ~n3~0)), 565#(and (<= ~count1~0 ~count3~0) (<= ~count1~0 ~count2~0)), Black: 476#(<= (+ ~count3~0 1) ~count1~0), 650#true, 554#(and (<= ~count3~0 ~count2~0) (<= ~count1~0 ~count2~0)), 311#true, 413#(<= ~count3~0 ~count2~0), Black: 497#(or (< 0 ~res3~0) (<= ~res2~0 0) (<= ~res1~0 0)), Black: 501#(and (or (< 0 ~res3~0) (<= ~res2~0 0) (<= ~res1~0 0)) (= |thread3Thread1of1ForFork0_#t~ite21| 1))]) [2022-07-21 09:01:15,858 INFO L384 tUnfolder$Statistics]: this new event has 207 ancestors and is not cut-off event [2022-07-21 09:01:15,858 INFO L387 tUnfolder$Statistics]: existing Event has 207 ancestors and is not cut-off event [2022-07-21 09:01:15,859 INFO L387 tUnfolder$Statistics]: existing Event has 208 ancestors and is not cut-off event [2022-07-21 09:01:15,859 INFO L387 tUnfolder$Statistics]: existing Event has 209 ancestors and is not cut-off event [2022-07-21 09:01:15,863 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([929] thread2EXIT-->L124-2: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem38#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem38#1=|v_ULTIMATE.start_main_#t~mem38#1_5|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_#t~mem38#1=|v_ULTIMATE.start_main_#t~mem38#1_5|} AuxVars[] AssignedVars[][387], [Black: 496#(= |thread3Thread1of1ForFork0_#t~ite21| 1), Black: 632#(and (<= ~n2~0 ~n3~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), Black: 630#(and (or (<= ~n2~0 ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0) (or (<= ~n2~0 ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))), Black: 634#(and (<= ~n2~0 ~n3~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), Black: 626#(and (or (<= ~n2~0 ~n3~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), Black: 604#(<= ~res2~0 0), Black: 616#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~res2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 622#(and (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), Black: 624#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0) ~n3~0) (<= ~res2~0 0) (<= ~n2~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n2~0) ~n3~0)), 79#L124-2true, Black: 516#(= (+ (- 1) ~res3~0) 0), Black: 365#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0)), Black: 381#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0)), Black: 655#(and (<= (+ ~count3~0 1) ~count2~0) (<= (+ ~count3~0 1) ~count1~0)), Black: 361#(<= ~res1~0 0), Black: 391#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0)), Black: 389#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= ~n1~0 ~n2~0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0)), Black: 385#(and (or (<= ~n1~0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (or (<= ~n1~0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0)), Black: 373#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~res1~0 0)), Black: 383#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (or (<= ~n1~0 ~n2~0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~size#1| ~n1~0) ~n2~0) (<= ~res1~0 0)), Black: 367#(and (<= ~n1~0 0) (<= ~n1~0 ~n2~0) (<= ~res1~0 0)), Black: 379#(and (<= (+ |ULTIMATE.start_create_fresh_int_array_#in~size#1| ~n1~0) ~n2~0) (<= ~n1~0 0) (<= ~res1~0 0)), Black: 537#(and (<= (+ ~res2~0 1) 0) (<= (+ |thread2Thread1of1ForFork2_#t~ite14| 1) 0)), Black: 533#(<= (+ ~res2~0 1) 0), Black: 532#(<= (+ |thread2Thread1of1ForFork2_#t~ite14| 1) 0), Black: 551#(<= ~count3~0 ~count2~0), Black: 552#(<= ~count1~0 ~count2~0), Black: 549#true, 586#(and (<= ~count2~0 ~count3~0) (<= ~count2~0 ~count1~0)), Black: 560#true, Black: 562#(<= ~count1~0 ~count3~0), Black: 563#(<= ~count1~0 ~count2~0), Black: 316#(= thread2Thread1of1ForFork2_~stop~1 0), 441#true, Black: 445#(<= (+ ~count3~0 1) ~count2~0), Black: 447#(and (not (= ~count2~0 ~count1~0)) (<= (+ ~count3~0 1) ~count2~0)), Black: 326#(= thread1Thread1of1ForFork1_~stop~0 0), 494#true, 87#L100-3true, Black: 583#(<= ~count2~0 ~count1~0), 665#(and (<= ~count1~0 ~count3~0) (<= ~count2~0 ~count3~0)), Black: 581#true, Black: 584#(<= ~count2~0 ~count3~0), 574#(<= ~count2~0 ~count1~0), Black: 462#(and (<= (+ ~res1~0 1) 0) (<= (+ |thread1Thread1of1ForFork1_#t~ite7| 1) 0)), Black: 457#(<= (+ |thread1Thread1of1ForFork1_#t~ite7| 1) 0), Black: 337#(and (<= (+ ~res2~0 ~n1~0) (+ ~res3~0 ~n2~0)) (<= ~n1~0 (+ ~res3~0 ~n3~0))), 423#(<= ~count1~0 ~count3~0), Black: 331#(<= ~n1~0 (+ ~res3~0 ~n3~0)), 565#(and (<= ~count1~0 ~count3~0) (<= ~count1~0 ~count2~0)), Black: 476#(<= (+ ~count3~0 1) ~count1~0), 650#true, 554#(and (<= ~count3~0 ~count2~0) (<= ~count1~0 ~count2~0)), 311#true, 413#(<= ~count3~0 ~count2~0), Black: 497#(or (< 0 ~res3~0) (<= ~res2~0 0) (<= ~res1~0 0)), Black: 501#(and (or (< 0 ~res3~0) (<= ~res2~0 0) (<= ~res1~0 0)) (= |thread3Thread1of1ForFork0_#t~ite21| 1))]) [2022-07-21 09:01:15,863 INFO L384 tUnfolder$Statistics]: this new event has 208 ancestors and is not cut-off event [2022-07-21 09:01:15,863 INFO L387 tUnfolder$Statistics]: existing Event has 208 ancestors and is not cut-off event [2022-07-21 09:01:15,863 INFO L387 tUnfolder$Statistics]: existing Event has 210 ancestors and is not cut-off event [2022-07-21 09:01:15,863 INFO L387 tUnfolder$Statistics]: existing Event has 209 ancestors and is not cut-off event [2022-07-21 09:01:15,932 INFO L129 PetriNetUnfolder]: 3476/24635 cut-off events. [2022-07-21 09:01:15,932 INFO L130 PetriNetUnfolder]: For 38742/41223 co-relation queries the response was YES. [2022-07-21 09:01:16,139 INFO L84 FinitePrefix]: Finished finitePrefix Result has 52305 conditions, 24635 events. 3476/24635 cut-off events. For 38742/41223 co-relation queries the response was YES. Maximal size of possible extension queue 989. Compared 368610 event pairs, 863 based on Foata normal form. 220/23147 useless extension candidates. Maximal degree in co-relation 52250. Up to 2678 conditions per place. [2022-07-21 09:01:16,185 INFO L132 encePairwiseOnDemand]: 325/332 looper letters, 54 selfloop transitions, 26 changer transitions 4/418 dead transitions. [2022-07-21 09:01:16,185 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 400 places, 418 transitions, 2217 flow [2022-07-21 09:01:16,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 09:01:16,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-07-21 09:01:16,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1523 transitions. [2022-07-21 09:01:16,187 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9174698795180722 [2022-07-21 09:01:16,187 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1523 transitions. [2022-07-21 09:01:16,187 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1523 transitions. [2022-07-21 09:01:16,187 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-21 09:01:16,187 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1523 transitions. [2022-07-21 09:01:16,189 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 304.6) internal successors, (1523), 5 states have internal predecessors, (1523), 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-21 09:01:16,190 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 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-21 09:01:16,190 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 332.0) internal successors, (1992), 6 states have internal predecessors, (1992), 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-21 09:01:16,190 INFO L186 Difference]: Start difference. First operand has 396 places, 400 transitions, 1989 flow. Second operand 5 states and 1523 transitions. [2022-07-21 09:01:16,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 400 places, 418 transitions, 2217 flow [2022-07-21 09:01:16,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 399 places, 418 transitions, 2209 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-07-21 09:01:16,475 INFO L242 Difference]: Finished difference. Result has 400 places, 401 transitions, 2060 flow [2022-07-21 09:01:16,476 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=332, PETRI_DIFFERENCE_MINUEND_FLOW=1967, PETRI_DIFFERENCE_MINUEND_PLACES=395, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=399, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=375, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2060, PETRI_PLACES=400, PETRI_TRANSITIONS=401} [2022-07-21 09:01:16,476 INFO L279 CegarLoopForPetriNet]: 294 programPoint places, 106 predicate places. [2022-07-21 09:01:16,476 INFO L495 AbstractCegarLoop]: Abstraction has has 400 places, 401 transitions, 2060 flow [2022-07-21 09:01:16,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 298.0) internal successors, (1192), 4 states have internal predecessors, (1192), 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-21 09:01:16,477 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-21 09:01:16,477 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 09:01:16,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-21 09:01:16,477 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-07-21 09:01:16,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 09:01:16,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1475065839, now seen corresponding path program 3 times [2022-07-21 09:01:16,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 09:01:16,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860341426] [2022-07-21 09:01:16,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 09:01:16,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 09:01:16,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 09:01:16,518 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-21 09:01:16,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 09:01:16,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860341426] [2022-07-21 09:01:16,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860341426] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 09:01:16,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 09:01:16,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 09:01:16,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793389837] [2022-07-21 09:01:16,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 09:01:16,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 09:01:16,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 09:01:16,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 09:01:16,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 09:01:16,522 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 332 [2022-07-21 09:01:16,523 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 400 places, 401 transitions, 2060 flow. Second operand has 4 states, 4 states have (on average 298.0) internal successors, (1192), 4 states have internal predecessors, (1192), 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-21 09:01:16,523 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-21 09:01:16,523 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 332 [2022-07-21 09:01:16,523 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand