./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_70-funloop_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 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/goblint-regression/28-race_reach_70-funloop_racefree.i -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 2a10f98c1a89e2ac521234c9e4f0eca565cc5bc1484e9c7d67d861e216c6f9ba --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 21:57:34,141 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 21:57:34,142 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 21:57:34,162 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 21:57:34,162 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 21:57:34,163 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 21:57:34,167 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 21:57:34,171 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 21:57:34,173 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 21:57:34,177 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 21:57:34,178 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 21:57:34,180 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 21:57:34,180 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 21:57:34,181 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 21:57:34,183 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 21:57:34,185 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 21:57:34,186 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 21:57:34,188 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 21:57:34,191 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 21:57:34,197 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 21:57:34,198 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 21:57:34,199 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 21:57:34,200 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 21:57:34,201 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 21:57:34,201 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 21:57:34,207 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 21:57:34,207 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 21:57:34,208 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 21:57:34,209 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 21:57:34,209 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 21:57:34,210 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 21:57:34,210 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 21:57:34,212 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 21:57:34,212 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 21:57:34,213 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 21:57:34,213 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 21:57:34,213 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 21:57:34,214 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 21:57:34,214 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 21:57:34,214 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 21:57:34,215 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 21:57:34,216 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 21:57:34,217 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 21:57:34,239 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 21:57:34,240 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 21:57:34,240 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 21:57:34,240 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 21:57:34,241 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 21:57:34,241 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 21:57:34,242 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 21:57:34,242 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 21:57:34,242 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 21:57:34,243 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 21:57:34,243 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 21:57:34,243 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 21:57:34,243 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 21:57:34,243 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 21:57:34,243 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 21:57:34,244 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 21:57:34,244 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 21:57:34,244 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 21:57:34,245 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 21:57:34,245 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 21:57:34,246 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 21:57:34,246 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 21:57:34,246 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 21:57:34,246 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 21:57:34,246 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 21:57:34,247 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 21:57:34,247 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 21:57:34,247 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 21:57:34,247 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 21:57:34,247 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 21:57:34,247 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 21:57:34,248 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 21:57:34,248 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 21:57:34,248 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 -> 2a10f98c1a89e2ac521234c9e4f0eca565cc5bc1484e9c7d67d861e216c6f9ba [2022-07-13 21:57:34,481 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 21:57:34,507 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 21:57:34,509 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 21:57:34,510 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 21:57:34,510 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 21:57:34,512 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_70-funloop_racefree.i [2022-07-13 21:57:34,575 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b35d37f4/75acd8208d5d4156b9faa8150ec28fcd/FLAGb608170b5 [2022-07-13 21:57:35,055 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 21:57:35,056 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_70-funloop_racefree.i [2022-07-13 21:57:35,072 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b35d37f4/75acd8208d5d4156b9faa8150ec28fcd/FLAGb608170b5 [2022-07-13 21:57:35,548 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b35d37f4/75acd8208d5d4156b9faa8150ec28fcd [2022-07-13 21:57:35,550 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 21:57:35,552 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 21:57:35,554 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 21:57:35,554 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 21:57:35,556 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 21:57:35,557 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 09:57:35" (1/1) ... [2022-07-13 21:57:35,557 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f4dca1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:57:35, skipping insertion in model container [2022-07-13 21:57:35,558 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 09:57:35" (1/1) ... [2022-07-13 21:57:35,563 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 21:57:35,602 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 21:57:35,917 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/goblint-regression/28-race_reach_70-funloop_racefree.i[41323,41336] [2022-07-13 21:57:35,938 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 21:57:35,954 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 21:57:35,986 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/goblint-regression/28-race_reach_70-funloop_racefree.i[41323,41336] [2022-07-13 21:57:35,995 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 21:57:36,026 INFO L208 MainTranslator]: Completed translation [2022-07-13 21:57:36,027 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:57:36 WrapperNode [2022-07-13 21:57:36,027 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 21:57:36,028 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 21:57:36,028 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 21:57:36,028 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 21:57:36,033 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:57:36" (1/1) ... [2022-07-13 21:57:36,050 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:57:36" (1/1) ... [2022-07-13 21:57:36,069 INFO L137 Inliner]: procedures = 271, calls = 31, calls flagged for inlining = 5, calls inlined = 6, statements flattened = 193 [2022-07-13 21:57:36,069 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 21:57:36,070 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 21:57:36,070 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 21:57:36,070 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 21:57:36,076 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:57:36" (1/1) ... [2022-07-13 21:57:36,076 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:57:36" (1/1) ... [2022-07-13 21:57:36,088 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:57:36" (1/1) ... [2022-07-13 21:57:36,088 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:57:36" (1/1) ... [2022-07-13 21:57:36,106 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:57:36" (1/1) ... [2022-07-13 21:57:36,110 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:57:36" (1/1) ... [2022-07-13 21:57:36,112 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:57:36" (1/1) ... [2022-07-13 21:57:36,115 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 21:57:36,115 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 21:57:36,116 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 21:57:36,116 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 21:57:36,119 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:57:36" (1/1) ... [2022-07-13 21:57:36,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 21:57:36,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 21:57:36,146 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-13 21:57:36,148 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-13 21:57:36,180 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 21:57:36,180 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 21:57:36,181 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 21:57:36,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 21:57:36,181 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-07-13 21:57:36,181 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 21:57:36,185 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-07-13 21:57:36,185 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-07-13 21:57:36,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 21:57:36,185 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 21:57:36,186 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 21:57:36,187 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-13 21:57:36,297 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 21:57:36,299 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 21:57:36,521 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 21:57:36,527 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 21:57:36,527 INFO L299 CfgBuilder]: Removed 25 assume(true) statements. [2022-07-13 21:57:36,529 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 09:57:36 BoogieIcfgContainer [2022-07-13 21:57:36,529 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 21:57:36,531 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 21:57:36,531 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 21:57:36,533 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 21:57:36,533 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 09:57:35" (1/3) ... [2022-07-13 21:57:36,534 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b79407a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 09:57:36, skipping insertion in model container [2022-07-13 21:57:36,534 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 09:57:36" (2/3) ... [2022-07-13 21:57:36,534 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b79407a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 09:57:36, skipping insertion in model container [2022-07-13 21:57:36,534 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 09:57:36" (3/3) ... [2022-07-13 21:57:36,536 INFO L111 eAbstractionObserver]: Analyzing ICFG 28-race_reach_70-funloop_racefree.i [2022-07-13 21:57:36,539 WARN L143 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-07-13 21:57:36,546 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 21:57:36,546 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-13 21:57:36,547 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-07-13 21:57:36,612 INFO L135 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-07-13 21:57:36,648 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 170 places, 200 transitions, 408 flow [2022-07-13 21:57:36,727 INFO L129 PetriNetUnfolder]: 49/284 cut-off events. [2022-07-13 21:57:36,728 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-07-13 21:57:36,736 INFO L84 FinitePrefix]: Finished finitePrefix Result has 290 conditions, 284 events. 49/284 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1028 event pairs, 0 based on Foata normal form. 0/229 useless extension candidates. Maximal degree in co-relation 160. Up to 8 conditions per place. [2022-07-13 21:57:36,736 INFO L82 GeneralOperation]: Start removeDead. Operand has 170 places, 200 transitions, 408 flow [2022-07-13 21:57:36,743 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 166 places, 195 transitions, 395 flow [2022-07-13 21:57:36,756 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 21:57:36,762 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@62bd2bb9, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@318c214d [2022-07-13 21:57:36,762 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-07-13 21:57:36,787 INFO L129 PetriNetUnfolder]: 13/113 cut-off events. [2022-07-13 21:57:36,791 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-13 21:57:36,791 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:57:36,792 INFO L200 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:57:36,793 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-07-13 21:57:36,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:57:36,796 INFO L85 PathProgramCache]: Analyzing trace with hash 322036200, now seen corresponding path program 1 times [2022-07-13 21:57:36,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:57:36,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291852491] [2022-07-13 21:57:36,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:57:36,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:57:36,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:57:36,999 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 21:57:37,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:57:37,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291852491] [2022-07-13 21:57:37,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291852491] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:57:37,000 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:57:37,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 21:57:37,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201671834] [2022-07-13 21:57:37,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:57:37,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 21:57:37,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:57:37,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 21:57:37,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 21:57:37,032 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 200 [2022-07-13 21:57:37,035 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 195 transitions, 395 flow. Second operand has 3 states, 3 states have (on average 163.33333333333334) internal successors, (490), 3 states have internal predecessors, (490), 0 states have call successors, (0), 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-13 21:57:37,036 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:57:37,036 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 200 [2022-07-13 21:57:37,037 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:57:37,078 INFO L129 PetriNetUnfolder]: 7/239 cut-off events. [2022-07-13 21:57:37,079 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-07-13 21:57:37,080 INFO L84 FinitePrefix]: Finished finitePrefix Result has 257 conditions, 239 events. 7/239 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 781 event pairs, 0 based on Foata normal form. 40/265 useless extension candidates. Maximal degree in co-relation 134. Up to 9 conditions per place. [2022-07-13 21:57:37,082 INFO L132 encePairwiseOnDemand]: 170/200 looper letters, 10 selfloop transitions, 2 changer transitions 0/170 dead transitions. [2022-07-13 21:57:37,082 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 170 transitions, 369 flow [2022-07-13 21:57:37,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 21:57:37,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-13 21:57:37,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 527 transitions. [2022-07-13 21:57:37,093 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8783333333333333 [2022-07-13 21:57:37,094 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 527 transitions. [2022-07-13 21:57:37,094 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 527 transitions. [2022-07-13 21:57:37,096 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:57:37,100 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 527 transitions. [2022-07-13 21:57:37,104 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 175.66666666666666) internal successors, (527), 3 states have internal predecessors, (527), 0 states have call successors, (0), 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-13 21:57:37,112 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 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-13 21:57:37,116 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 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-13 21:57:37,117 INFO L186 Difference]: Start difference. First operand has 166 places, 195 transitions, 395 flow. Second operand 3 states and 527 transitions. [2022-07-13 21:57:37,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 170 transitions, 369 flow [2022-07-13 21:57:37,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 170 transitions, 369 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-07-13 21:57:37,126 INFO L242 Difference]: Finished difference. Result has 167 places, 167 transitions, 349 flow [2022-07-13 21:57:37,129 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=337, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=349, PETRI_PLACES=167, PETRI_TRANSITIONS=167} [2022-07-13 21:57:37,139 INFO L279 CegarLoopForPetriNet]: 166 programPoint places, 1 predicate places. [2022-07-13 21:57:37,139 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 167 transitions, 349 flow [2022-07-13 21:57:37,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.33333333333334) internal successors, (490), 3 states have internal predecessors, (490), 0 states have call successors, (0), 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-13 21:57:37,140 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:57:37,140 INFO L200 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:57:37,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 21:57:37,141 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-07-13 21:57:37,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:57:37,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1156168181, now seen corresponding path program 1 times [2022-07-13 21:57:37,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:57:37,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287246228] [2022-07-13 21:57:37,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:57:37,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:57:37,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:57:37,214 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 21:57:37,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:57:37,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287246228] [2022-07-13 21:57:37,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287246228] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 21:57:37,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2111350361] [2022-07-13 21:57:37,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:57:37,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:57:37,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 21:57:37,219 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 21:57:37,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-13 21:57:37,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:57:37,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 21:57:37,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 21:57:37,375 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 21:57:37,381 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 21:57:37,423 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 21:57:37,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2111350361] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 21:57:37,425 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 21:57:37,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-07-13 21:57:37,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116829720] [2022-07-13 21:57:37,427 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 21:57:37,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 21:57:37,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:57:37,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 21:57:37,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-13 21:57:37,433 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 200 [2022-07-13 21:57:37,435 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 167 transitions, 349 flow. Second operand has 10 states, 10 states have (on average 163.1) internal successors, (1631), 10 states have internal predecessors, (1631), 0 states have call successors, (0), 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-13 21:57:37,436 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:57:37,436 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 200 [2022-07-13 21:57:37,436 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:57:37,564 INFO L129 PetriNetUnfolder]: 7/246 cut-off events. [2022-07-13 21:57:37,565 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-13 21:57:37,568 INFO L84 FinitePrefix]: Finished finitePrefix Result has 280 conditions, 246 events. 7/246 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 777 event pairs, 0 based on Foata normal form. 2/235 useless extension candidates. Maximal degree in co-relation 239. Up to 6 conditions per place. [2022-07-13 21:57:37,569 INFO L132 encePairwiseOnDemand]: 194/200 looper letters, 11 selfloop transitions, 9 changer transitions 0/177 dead transitions. [2022-07-13 21:57:37,569 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 177 transitions, 411 flow [2022-07-13 21:57:37,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 21:57:37,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-13 21:57:37,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1471 transitions. [2022-07-13 21:57:37,576 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8172222222222222 [2022-07-13 21:57:37,577 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1471 transitions. [2022-07-13 21:57:37,577 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1471 transitions. [2022-07-13 21:57:37,577 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:57:37,578 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1471 transitions. [2022-07-13 21:57:37,581 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 163.44444444444446) internal successors, (1471), 9 states have internal predecessors, (1471), 0 states have call successors, (0), 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-13 21:57:37,586 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 200.0) internal successors, (2000), 10 states have internal predecessors, (2000), 0 states have call successors, (0), 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-13 21:57:37,587 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 200.0) internal successors, (2000), 10 states have internal predecessors, (2000), 0 states have call successors, (0), 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-13 21:57:37,587 INFO L186 Difference]: Start difference. First operand has 167 places, 167 transitions, 349 flow. Second operand 9 states and 1471 transitions. [2022-07-13 21:57:37,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 177 transitions, 411 flow [2022-07-13 21:57:37,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 177 transitions, 409 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-07-13 21:57:37,594 INFO L242 Difference]: Finished difference. Result has 177 places, 173 transitions, 397 flow [2022-07-13 21:57:37,595 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=347, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=397, PETRI_PLACES=177, PETRI_TRANSITIONS=173} [2022-07-13 21:57:37,596 INFO L279 CegarLoopForPetriNet]: 166 programPoint places, 11 predicate places. [2022-07-13 21:57:37,596 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 173 transitions, 397 flow [2022-07-13 21:57:37,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 163.1) internal successors, (1631), 10 states have internal predecessors, (1631), 0 states have call successors, (0), 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-13 21:57:37,597 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:57:37,597 INFO L200 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:57:37,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-13 21:57:37,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:57:37,808 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-07-13 21:57:37,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:57:37,808 INFO L85 PathProgramCache]: Analyzing trace with hash 235263019, now seen corresponding path program 2 times [2022-07-13 21:57:37,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:57:37,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361144641] [2022-07-13 21:57:37,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:57:37,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:57:37,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:57:37,903 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 21:57:37,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:57:37,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361144641] [2022-07-13 21:57:37,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361144641] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 21:57:37,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2111397508] [2022-07-13 21:57:37,906 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 21:57:37,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:57:37,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 21:57:37,920 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 21:57:37,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-13 21:57:37,985 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 21:57:37,985 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 21:57:37,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 21:57:37,988 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 21:57:38,037 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 21:57:38,037 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 21:57:38,127 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 21:57:38,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2111397508] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 21:57:38,128 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 21:57:38,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-07-13 21:57:38,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71406968] [2022-07-13 21:57:38,129 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 21:57:38,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-13 21:57:38,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:57:38,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-13 21:57:38,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-07-13 21:57:38,140 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 200 [2022-07-13 21:57:38,143 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 173 transitions, 397 flow. Second operand has 18 states, 18 states have (on average 163.27777777777777) internal successors, (2939), 18 states have internal predecessors, (2939), 0 states have call successors, (0), 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-13 21:57:38,143 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:57:38,143 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 200 [2022-07-13 21:57:38,143 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:57:38,304 INFO L129 PetriNetUnfolder]: 7/266 cut-off events. [2022-07-13 21:57:38,304 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2022-07-13 21:57:38,305 INFO L84 FinitePrefix]: Finished finitePrefix Result has 369 conditions, 266 events. 7/266 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 777 event pairs, 0 based on Foata normal form. 4/257 useless extension candidates. Maximal degree in co-relation 224. Up to 11 conditions per place. [2022-07-13 21:57:38,306 INFO L132 encePairwiseOnDemand]: 194/200 looper letters, 19 selfloop transitions, 21 changer transitions 0/197 dead transitions. [2022-07-13 21:57:38,306 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 197 transitions, 585 flow [2022-07-13 21:57:38,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-13 21:57:38,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-07-13 21:57:38,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3425 transitions. [2022-07-13 21:57:38,312 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8154761904761905 [2022-07-13 21:57:38,312 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 3425 transitions. [2022-07-13 21:57:38,312 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 3425 transitions. [2022-07-13 21:57:38,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:57:38,313 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 3425 transitions. [2022-07-13 21:57:38,319 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 163.0952380952381) internal successors, (3425), 21 states have internal predecessors, (3425), 0 states have call successors, (0), 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-13 21:57:38,324 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 200.0) internal successors, (4400), 22 states have internal predecessors, (4400), 0 states have call successors, (0), 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-13 21:57:38,325 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 200.0) internal successors, (4400), 22 states have internal predecessors, (4400), 0 states have call successors, (0), 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-13 21:57:38,325 INFO L186 Difference]: Start difference. First operand has 177 places, 173 transitions, 397 flow. Second operand 21 states and 3425 transitions. [2022-07-13 21:57:38,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 197 transitions, 585 flow [2022-07-13 21:57:38,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 197 transitions, 571 flow, removed 6 selfloop flow, removed 1 redundant places. [2022-07-13 21:57:38,329 INFO L242 Difference]: Finished difference. Result has 201 places, 186 transitions, 521 flow [2022-07-13 21:57:38,330 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=391, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=521, PETRI_PLACES=201, PETRI_TRANSITIONS=186} [2022-07-13 21:57:38,330 INFO L279 CegarLoopForPetriNet]: 166 programPoint places, 35 predicate places. [2022-07-13 21:57:38,330 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 186 transitions, 521 flow [2022-07-13 21:57:38,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 163.27777777777777) internal successors, (2939), 18 states have internal predecessors, (2939), 0 states have call successors, (0), 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-13 21:57:38,332 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:57:38,332 INFO L200 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:57:38,350 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-13 21:57:38,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-07-13 21:57:38,546 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-07-13 21:57:38,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:57:38,546 INFO L85 PathProgramCache]: Analyzing trace with hash 716011627, now seen corresponding path program 3 times [2022-07-13 21:57:38,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:57:38,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209636692] [2022-07-13 21:57:38,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:57:38,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:57:38,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:57:38,730 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 21:57:38,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:57:38,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209636692] [2022-07-13 21:57:38,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209636692] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 21:57:38,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1177559378] [2022-07-13 21:57:38,730 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 21:57:38,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:57:38,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 21:57:38,732 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 21:57:38,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-13 21:57:38,823 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-07-13 21:57:38,823 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 21:57:38,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-13 21:57:38,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 21:57:38,885 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 21:57:38,886 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 21:57:39,002 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-13 21:57:39,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1177559378] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 21:57:39,002 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 21:57:39,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2022-07-13 21:57:39,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990614954] [2022-07-13 21:57:39,002 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 21:57:39,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-13 21:57:39,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:57:39,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-13 21:57:39,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2022-07-13 21:57:39,007 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 200 [2022-07-13 21:57:39,009 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 186 transitions, 521 flow. Second operand has 23 states, 23 states have (on average 163.43478260869566) internal successors, (3759), 23 states have internal predecessors, (3759), 0 states have call successors, (0), 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-13 21:57:39,009 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:57:39,010 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 200 [2022-07-13 21:57:39,010 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:57:39,295 INFO L129 PetriNetUnfolder]: 7/281 cut-off events. [2022-07-13 21:57:39,295 INFO L130 PetriNetUnfolder]: For 110/110 co-relation queries the response was YES. [2022-07-13 21:57:39,296 INFO L84 FinitePrefix]: Finished finitePrefix Result has 470 conditions, 281 events. 7/281 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 777 event pairs, 0 based on Foata normal form. 3/271 useless extension candidates. Maximal degree in co-relation 320. Up to 17 conditions per place. [2022-07-13 21:57:39,297 INFO L132 encePairwiseOnDemand]: 194/200 looper letters, 25 selfloop transitions, 30 changer transitions 0/212 dead transitions. [2022-07-13 21:57:39,297 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 212 transitions, 777 flow [2022-07-13 21:57:39,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-07-13 21:57:39,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-07-13 21:57:39,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 4888 transitions. [2022-07-13 21:57:39,306 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8146666666666667 [2022-07-13 21:57:39,307 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 4888 transitions. [2022-07-13 21:57:39,307 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 4888 transitions. [2022-07-13 21:57:39,309 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:57:39,309 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 4888 transitions. [2022-07-13 21:57:39,315 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 162.93333333333334) internal successors, (4888), 30 states have internal predecessors, (4888), 0 states have call successors, (0), 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-13 21:57:39,323 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 200.0) internal successors, (6200), 31 states have internal predecessors, (6200), 0 states have call successors, (0), 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-13 21:57:39,325 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 200.0) internal successors, (6200), 31 states have internal predecessors, (6200), 0 states have call successors, (0), 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-13 21:57:39,325 INFO L186 Difference]: Start difference. First operand has 201 places, 186 transitions, 521 flow. Second operand 30 states and 4888 transitions. [2022-07-13 21:57:39,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 212 transitions, 777 flow [2022-07-13 21:57:39,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 212 transitions, 747 flow, removed 9 selfloop flow, removed 6 redundant places. [2022-07-13 21:57:39,331 INFO L242 Difference]: Finished difference. Result has 228 places, 196 transitions, 649 flow [2022-07-13 21:57:39,332 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=497, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=649, PETRI_PLACES=228, PETRI_TRANSITIONS=196} [2022-07-13 21:57:39,332 INFO L279 CegarLoopForPetriNet]: 166 programPoint places, 62 predicate places. [2022-07-13 21:57:39,332 INFO L495 AbstractCegarLoop]: Abstraction has has 228 places, 196 transitions, 649 flow [2022-07-13 21:57:39,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 163.43478260869566) internal successors, (3759), 23 states have internal predecessors, (3759), 0 states have call successors, (0), 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-13 21:57:39,334 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:57:39,334 INFO L200 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:57:39,368 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-13 21:57:39,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:57:39,569 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-07-13 21:57:39,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:57:39,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1764751544, now seen corresponding path program 4 times [2022-07-13 21:57:39,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:57:39,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645749971] [2022-07-13 21:57:39,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:57:39,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:57:39,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 21:57:39,596 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 21:57:39,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 21:57:39,630 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 21:57:39,631 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-13 21:57:39,631 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2022-07-13 21:57:39,633 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2022-07-13 21:57:39,633 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2022-07-13 21:57:39,633 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2022-07-13 21:57:39,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-13 21:57:39,634 INFO L356 BasicCegarLoop]: Path program histogram: [4, 1] [2022-07-13 21:57:39,636 WARN L231 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-07-13 21:57:39,636 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-07-13 21:57:39,651 INFO L135 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-07-13 21:57:39,654 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 230 places, 273 transitions, 564 flow [2022-07-13 21:57:39,694 INFO L129 PetriNetUnfolder]: 82/466 cut-off events. [2022-07-13 21:57:39,694 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-07-13 21:57:39,698 INFO L84 FinitePrefix]: Finished finitePrefix Result has 480 conditions, 466 events. 82/466 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2089 event pairs, 0 based on Foata normal form. 0/375 useless extension candidates. Maximal degree in co-relation 286. Up to 12 conditions per place. [2022-07-13 21:57:39,699 INFO L82 GeneralOperation]: Start removeDead. Operand has 230 places, 273 transitions, 564 flow [2022-07-13 21:57:39,703 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 230 places, 273 transitions, 564 flow [2022-07-13 21:57:39,704 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 21:57:39,704 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@62bd2bb9, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@318c214d [2022-07-13 21:57:39,705 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-07-13 21:57:39,714 INFO L129 PetriNetUnfolder]: 26/200 cut-off events. [2022-07-13 21:57:39,714 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-13 21:57:39,714 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:57:39,715 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] [2022-07-13 21:57:39,715 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-07-13 21:57:39,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:57:39,715 INFO L85 PathProgramCache]: Analyzing trace with hash 509040557, now seen corresponding path program 1 times [2022-07-13 21:57:39,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:57:39,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651600945] [2022-07-13 21:57:39,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:57:39,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:57:39,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:57:39,737 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-13 21:57:39,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:57:39,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651600945] [2022-07-13 21:57:39,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651600945] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:57:39,738 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:57:39,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 21:57:39,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141806780] [2022-07-13 21:57:39,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:57:39,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 21:57:39,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:57:39,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 21:57:39,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 21:57:39,740 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 220 out of 273 [2022-07-13 21:57:39,741 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 273 transitions, 564 flow. Second operand has 3 states, 3 states have (on average 221.0) internal successors, (663), 3 states have internal predecessors, (663), 0 states have call successors, (0), 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-13 21:57:39,741 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:57:39,741 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 220 of 273 [2022-07-13 21:57:39,741 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:57:39,788 INFO L129 PetriNetUnfolder]: 14/397 cut-off events. [2022-07-13 21:57:39,788 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2022-07-13 21:57:39,791 INFO L84 FinitePrefix]: Finished finitePrefix Result has 429 conditions, 397 events. 14/397 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1819 event pairs, 0 based on Foata normal form. 83/457 useless extension candidates. Maximal degree in co-relation 259. Up to 14 conditions per place. [2022-07-13 21:57:39,793 INFO L132 encePairwiseOnDemand]: 231/273 looper letters, 13 selfloop transitions, 2 changer transitions 0/235 dead transitions. [2022-07-13 21:57:39,793 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 235 transitions, 518 flow [2022-07-13 21:57:39,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 21:57:39,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-13 21:57:39,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 716 transitions. [2022-07-13 21:57:39,795 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8742368742368742 [2022-07-13 21:57:39,795 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 716 transitions. [2022-07-13 21:57:39,795 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 716 transitions. [2022-07-13 21:57:39,796 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:57:39,796 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 716 transitions. [2022-07-13 21:57:39,797 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 238.66666666666666) internal successors, (716), 3 states have internal predecessors, (716), 0 states have call successors, (0), 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-13 21:57:39,798 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 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-13 21:57:39,798 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 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-13 21:57:39,798 INFO L186 Difference]: Start difference. First operand has 230 places, 273 transitions, 564 flow. Second operand 3 states and 716 transitions. [2022-07-13 21:57:39,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 235 transitions, 518 flow [2022-07-13 21:57:39,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 235 transitions, 518 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-07-13 21:57:39,802 INFO L242 Difference]: Finished difference. Result has 230 places, 232 transitions, 492 flow [2022-07-13 21:57:39,802 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=492, PETRI_PLACES=230, PETRI_TRANSITIONS=232} [2022-07-13 21:57:39,803 INFO L279 CegarLoopForPetriNet]: 230 programPoint places, 0 predicate places. [2022-07-13 21:57:39,803 INFO L495 AbstractCegarLoop]: Abstraction has has 230 places, 232 transitions, 492 flow [2022-07-13 21:57:39,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 221.0) internal successors, (663), 3 states have internal predecessors, (663), 0 states have call successors, (0), 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-13 21:57:39,804 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:57:39,804 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] [2022-07-13 21:57:39,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-13 21:57:39,804 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-07-13 21:57:39,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:57:39,804 INFO L85 PathProgramCache]: Analyzing trace with hash 879811681, now seen corresponding path program 1 times [2022-07-13 21:57:39,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:57:39,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494196827] [2022-07-13 21:57:39,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:57:39,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:57:39,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:57:39,830 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:57:39,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:57:39,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494196827] [2022-07-13 21:57:39,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494196827] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 21:57:39,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [106182040] [2022-07-13 21:57:39,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:57:39,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:57:39,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 21:57:39,832 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 21:57:39,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-13 21:57:39,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:57:39,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 21:57:39,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 21:57:39,897 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-13 21:57:39,897 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 21:57:39,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [106182040] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:57:39,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 21:57:39,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-07-13 21:57:39,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419236868] [2022-07-13 21:57:39,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:57:39,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 21:57:39,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:57:39,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 21:57:39,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-13 21:57:39,899 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 220 out of 273 [2022-07-13 21:57:39,900 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 232 transitions, 492 flow. Second operand has 3 states, 3 states have (on average 221.0) internal successors, (663), 3 states have internal predecessors, (663), 0 states have call successors, (0), 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-13 21:57:39,900 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:57:39,900 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 220 of 273 [2022-07-13 21:57:39,900 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:57:39,947 INFO L129 PetriNetUnfolder]: 11/341 cut-off events. [2022-07-13 21:57:39,948 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2022-07-13 21:57:39,950 INFO L84 FinitePrefix]: Finished finitePrefix Result has 383 conditions, 341 events. 11/341 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1455 event pairs, 0 based on Foata normal form. 0/323 useless extension candidates. Maximal degree in co-relation 346. Up to 16 conditions per place. [2022-07-13 21:57:39,951 INFO L132 encePairwiseOnDemand]: 270/273 looper letters, 13 selfloop transitions, 2 changer transitions 0/236 dead transitions. [2022-07-13 21:57:39,951 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 236 transitions, 530 flow [2022-07-13 21:57:39,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 21:57:39,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-13 21:57:39,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 676 transitions. [2022-07-13 21:57:39,953 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8253968253968254 [2022-07-13 21:57:39,953 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 676 transitions. [2022-07-13 21:57:39,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 676 transitions. [2022-07-13 21:57:39,954 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:57:39,954 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 676 transitions. [2022-07-13 21:57:39,955 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 225.33333333333334) internal successors, (676), 3 states have internal predecessors, (676), 0 states have call successors, (0), 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-13 21:57:39,956 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 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-13 21:57:39,956 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 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-13 21:57:39,956 INFO L186 Difference]: Start difference. First operand has 230 places, 232 transitions, 492 flow. Second operand 3 states and 676 transitions. [2022-07-13 21:57:39,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 236 transitions, 530 flow [2022-07-13 21:57:39,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 236 transitions, 528 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-07-13 21:57:39,960 INFO L242 Difference]: Finished difference. Result has 232 places, 233 transitions, 502 flow [2022-07-13 21:57:39,960 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=502, PETRI_PLACES=232, PETRI_TRANSITIONS=233} [2022-07-13 21:57:39,960 INFO L279 CegarLoopForPetriNet]: 230 programPoint places, 2 predicate places. [2022-07-13 21:57:39,961 INFO L495 AbstractCegarLoop]: Abstraction has has 232 places, 233 transitions, 502 flow [2022-07-13 21:57:39,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 221.0) internal successors, (663), 3 states have internal predecessors, (663), 0 states have call successors, (0), 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-13 21:57:39,961 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:57:39,961 INFO L200 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:57:39,978 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-13 21:57:40,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:57:40,178 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-07-13 21:57:40,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:57:40,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1759427479, now seen corresponding path program 1 times [2022-07-13 21:57:40,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:57:40,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711909575] [2022-07-13 21:57:40,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:57:40,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:57:40,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:57:40,203 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-13 21:57:40,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:57:40,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711909575] [2022-07-13 21:57:40,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711909575] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 21:57:40,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [634179281] [2022-07-13 21:57:40,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:57:40,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:57:40,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 21:57:40,206 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 21:57:40,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-13 21:57:40,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:57:40,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 21:57:40,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 21:57:40,286 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-13 21:57:40,286 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 21:57:40,309 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-13 21:57:40,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [634179281] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 21:57:40,309 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 21:57:40,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-07-13 21:57:40,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886996135] [2022-07-13 21:57:40,309 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 21:57:40,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 21:57:40,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:57:40,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 21:57:40,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-13 21:57:40,312 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 273 [2022-07-13 21:57:40,313 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 233 transitions, 502 flow. Second operand has 10 states, 10 states have (on average 221.2) internal successors, (2212), 10 states have internal predecessors, (2212), 0 states have call successors, (0), 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-13 21:57:40,313 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:57:40,313 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 273 [2022-07-13 21:57:40,314 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:57:40,399 INFO L129 PetriNetUnfolder]: 11/348 cut-off events. [2022-07-13 21:57:40,399 INFO L130 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2022-07-13 21:57:40,403 INFO L84 FinitePrefix]: Finished finitePrefix Result has 402 conditions, 348 events. 11/348 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1450 event pairs, 0 based on Foata normal form. 2/334 useless extension candidates. Maximal degree in co-relation 331. Up to 11 conditions per place. [2022-07-13 21:57:40,404 INFO L132 encePairwiseOnDemand]: 267/273 looper letters, 14 selfloop transitions, 9 changer transitions 0/243 dead transitions. [2022-07-13 21:57:40,404 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 243 transitions, 570 flow [2022-07-13 21:57:40,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 21:57:40,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-13 21:57:40,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1996 transitions. [2022-07-13 21:57:40,408 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8123728123728123 [2022-07-13 21:57:40,408 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1996 transitions. [2022-07-13 21:57:40,408 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1996 transitions. [2022-07-13 21:57:40,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:57:40,409 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1996 transitions. [2022-07-13 21:57:40,412 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 221.77777777777777) internal successors, (1996), 9 states have internal predecessors, (1996), 0 states have call successors, (0), 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-13 21:57:40,414 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 273.0) internal successors, (2730), 10 states have internal predecessors, (2730), 0 states have call successors, (0), 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-13 21:57:40,415 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 273.0) internal successors, (2730), 10 states have internal predecessors, (2730), 0 states have call successors, (0), 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-13 21:57:40,415 INFO L186 Difference]: Start difference. First operand has 232 places, 233 transitions, 502 flow. Second operand 9 states and 1996 transitions. [2022-07-13 21:57:40,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 243 transitions, 570 flow [2022-07-13 21:57:40,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 243 transitions, 568 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-07-13 21:57:40,419 INFO L242 Difference]: Finished difference. Result has 242 places, 239 transitions, 550 flow [2022-07-13 21:57:40,420 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=500, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=550, PETRI_PLACES=242, PETRI_TRANSITIONS=239} [2022-07-13 21:57:40,420 INFO L279 CegarLoopForPetriNet]: 230 programPoint places, 12 predicate places. [2022-07-13 21:57:40,420 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 239 transitions, 550 flow [2022-07-13 21:57:40,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 221.2) internal successors, (2212), 10 states have internal predecessors, (2212), 0 states have call successors, (0), 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-13 21:57:40,421 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:57:40,422 INFO L200 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:57:40,439 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-13 21:57:40,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:57:40,639 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-07-13 21:57:40,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:57:40,639 INFO L85 PathProgramCache]: Analyzing trace with hash 914949097, now seen corresponding path program 2 times [2022-07-13 21:57:40,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:57:40,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051773387] [2022-07-13 21:57:40,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:57:40,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:57:40,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:57:40,689 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-13 21:57:40,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:57:40,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051773387] [2022-07-13 21:57:40,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051773387] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 21:57:40,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1334173058] [2022-07-13 21:57:40,690 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 21:57:40,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:57:40,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 21:57:40,691 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 21:57:40,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-13 21:57:40,771 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 21:57:40,772 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 21:57:40,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 21:57:40,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 21:57:40,821 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-13 21:57:40,821 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 21:57:40,894 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-13 21:57:40,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1334173058] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 21:57:40,895 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 21:57:40,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-07-13 21:57:40,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133835197] [2022-07-13 21:57:40,895 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 21:57:40,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-13 21:57:40,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:57:40,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-13 21:57:40,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-07-13 21:57:40,898 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 273 [2022-07-13 21:57:40,900 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 239 transitions, 550 flow. Second operand has 18 states, 18 states have (on average 221.33333333333334) internal successors, (3984), 18 states have internal predecessors, (3984), 0 states have call successors, (0), 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-13 21:57:40,900 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:57:40,901 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 273 [2022-07-13 21:57:40,901 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:57:41,074 INFO L129 PetriNetUnfolder]: 11/368 cut-off events. [2022-07-13 21:57:41,075 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2022-07-13 21:57:41,078 INFO L84 FinitePrefix]: Finished finitePrefix Result has 491 conditions, 368 events. 11/368 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1450 event pairs, 0 based on Foata normal form. 4/356 useless extension candidates. Maximal degree in co-relation 335. Up to 11 conditions per place. [2022-07-13 21:57:41,080 INFO L132 encePairwiseOnDemand]: 267/273 looper letters, 22 selfloop transitions, 21 changer transitions 0/263 dead transitions. [2022-07-13 21:57:41,080 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 263 transitions, 744 flow [2022-07-13 21:57:41,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-13 21:57:41,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-07-13 21:57:41,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 4646 transitions. [2022-07-13 21:57:41,088 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8103959532530961 [2022-07-13 21:57:41,088 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 4646 transitions. [2022-07-13 21:57:41,088 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 4646 transitions. [2022-07-13 21:57:41,090 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:57:41,090 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 4646 transitions. [2022-07-13 21:57:41,096 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 221.23809523809524) internal successors, (4646), 21 states have internal predecessors, (4646), 0 states have call successors, (0), 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-13 21:57:41,102 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 273.0) internal successors, (6006), 22 states have internal predecessors, (6006), 0 states have call successors, (0), 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-13 21:57:41,103 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 273.0) internal successors, (6006), 22 states have internal predecessors, (6006), 0 states have call successors, (0), 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-13 21:57:41,103 INFO L186 Difference]: Start difference. First operand has 242 places, 239 transitions, 550 flow. Second operand 21 states and 4646 transitions. [2022-07-13 21:57:41,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 263 transitions, 744 flow [2022-07-13 21:57:41,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 263 transitions, 730 flow, removed 6 selfloop flow, removed 1 redundant places. [2022-07-13 21:57:41,107 INFO L242 Difference]: Finished difference. Result has 266 places, 252 transitions, 674 flow [2022-07-13 21:57:41,107 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=544, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=674, PETRI_PLACES=266, PETRI_TRANSITIONS=252} [2022-07-13 21:57:41,108 INFO L279 CegarLoopForPetriNet]: 230 programPoint places, 36 predicate places. [2022-07-13 21:57:41,108 INFO L495 AbstractCegarLoop]: Abstraction has has 266 places, 252 transitions, 674 flow [2022-07-13 21:57:41,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 221.33333333333334) internal successors, (3984), 18 states have internal predecessors, (3984), 0 states have call successors, (0), 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-13 21:57:41,109 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:57:41,109 INFO L200 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:57:41,126 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-13 21:57:41,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:57:41,326 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-07-13 21:57:41,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:57:41,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1718903529, now seen corresponding path program 3 times [2022-07-13 21:57:41,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:57:41,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076258062] [2022-07-13 21:57:41,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:57:41,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:57:41,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:57:41,450 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-13 21:57:41,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:57:41,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076258062] [2022-07-13 21:57:41,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076258062] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 21:57:41,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [643832173] [2022-07-13 21:57:41,450 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 21:57:41,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:57:41,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 21:57:41,452 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 21:57:41,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-13 21:57:41,553 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-07-13 21:57:41,553 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 21:57:41,554 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-13 21:57:41,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 21:57:41,637 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-13 21:57:41,637 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 21:57:41,727 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-13 21:57:41,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [643832173] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 21:57:41,727 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 21:57:41,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2022-07-13 21:57:41,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767449671] [2022-07-13 21:57:41,728 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 21:57:41,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-13 21:57:41,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:57:41,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-13 21:57:41,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2022-07-13 21:57:41,732 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 273 [2022-07-13 21:57:41,736 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 252 transitions, 674 flow. Second operand has 23 states, 23 states have (on average 221.47826086956522) internal successors, (5094), 23 states have internal predecessors, (5094), 0 states have call successors, (0), 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-13 21:57:41,736 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:57:41,736 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 273 [2022-07-13 21:57:41,736 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:57:41,988 INFO L129 PetriNetUnfolder]: 11/383 cut-off events. [2022-07-13 21:57:41,989 INFO L130 PetriNetUnfolder]: For 126/126 co-relation queries the response was YES. [2022-07-13 21:57:41,992 INFO L84 FinitePrefix]: Finished finitePrefix Result has 592 conditions, 383 events. 11/383 cut-off events. For 126/126 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1450 event pairs, 0 based on Foata normal form. 3/370 useless extension candidates. Maximal degree in co-relation 410. Up to 17 conditions per place. [2022-07-13 21:57:41,994 INFO L132 encePairwiseOnDemand]: 267/273 looper letters, 28 selfloop transitions, 30 changer transitions 0/278 dead transitions. [2022-07-13 21:57:41,994 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 278 transitions, 936 flow [2022-07-13 21:57:41,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-07-13 21:57:41,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-07-13 21:57:41,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 6631 transitions. [2022-07-13 21:57:42,002 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8096459096459097 [2022-07-13 21:57:42,002 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 6631 transitions. [2022-07-13 21:57:42,002 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 6631 transitions. [2022-07-13 21:57:42,004 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:57:42,004 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 6631 transitions. [2022-07-13 21:57:42,011 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 221.03333333333333) internal successors, (6631), 30 states have internal predecessors, (6631), 0 states have call successors, (0), 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-13 21:57:42,021 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 273.0) internal successors, (8463), 31 states have internal predecessors, (8463), 0 states have call successors, (0), 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-13 21:57:42,022 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 273.0) internal successors, (8463), 31 states have internal predecessors, (8463), 0 states have call successors, (0), 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-13 21:57:42,022 INFO L186 Difference]: Start difference. First operand has 266 places, 252 transitions, 674 flow. Second operand 30 states and 6631 transitions. [2022-07-13 21:57:42,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 278 transitions, 936 flow [2022-07-13 21:57:42,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 278 transitions, 906 flow, removed 9 selfloop flow, removed 6 redundant places. [2022-07-13 21:57:42,027 INFO L242 Difference]: Finished difference. Result has 293 places, 262 transitions, 802 flow [2022-07-13 21:57:42,028 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=650, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=802, PETRI_PLACES=293, PETRI_TRANSITIONS=262} [2022-07-13 21:57:42,028 INFO L279 CegarLoopForPetriNet]: 230 programPoint places, 63 predicate places. [2022-07-13 21:57:42,028 INFO L495 AbstractCegarLoop]: Abstraction has has 293 places, 262 transitions, 802 flow [2022-07-13 21:57:42,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 221.47826086956522) internal successors, (5094), 23 states have internal predecessors, (5094), 0 states have call successors, (0), 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-13 21:57:42,029 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:57:42,029 INFO L200 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 21:57:42,049 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-13 21:57:42,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:57:42,249 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-07-13 21:57:42,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:57:42,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1050686411, now seen corresponding path program 4 times [2022-07-13 21:57:42,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:57:42,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096113737] [2022-07-13 21:57:42,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:57:42,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:57:42,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 21:57:42,273 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 21:57:42,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 21:57:42,310 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 21:57:42,310 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-13 21:57:42,310 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2022-07-13 21:57:42,311 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-07-13 21:57:42,311 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2022-07-13 21:57:42,311 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2022-07-13 21:57:42,311 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-07-13 21:57:42,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-13 21:57:42,311 INFO L356 BasicCegarLoop]: Path program histogram: [4, 1, 1] [2022-07-13 21:57:42,311 WARN L231 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2022-07-13 21:57:42,311 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2022-07-13 21:57:42,339 INFO L135 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-07-13 21:57:42,342 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 290 places, 346 transitions, 722 flow [2022-07-13 21:57:42,423 INFO L129 PetriNetUnfolder]: 120/681 cut-off events. [2022-07-13 21:57:42,423 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2022-07-13 21:57:42,433 INFO L84 FinitePrefix]: Finished finitePrefix Result has 709 conditions, 681 events. 120/681 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 3308 event pairs, 1 based on Foata normal form. 0/550 useless extension candidates. Maximal degree in co-relation 474. Up to 16 conditions per place. [2022-07-13 21:57:42,433 INFO L82 GeneralOperation]: Start removeDead. Operand has 290 places, 346 transitions, 722 flow [2022-07-13 21:57:42,443 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 290 places, 346 transitions, 722 flow [2022-07-13 21:57:42,443 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 21:57:42,445 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@62bd2bb9, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@318c214d [2022-07-13 21:57:42,445 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-07-13 21:57:42,455 INFO L129 PetriNetUnfolder]: 26/206 cut-off events. [2022-07-13 21:57:42,455 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-13 21:57:42,456 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:57:42,456 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] [2022-07-13 21:57:42,456 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-07-13 21:57:42,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:57:42,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1851205037, now seen corresponding path program 1 times [2022-07-13 21:57:42,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:57:42,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708950999] [2022-07-13 21:57:42,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:57:42,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:57:42,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:57:42,480 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-13 21:57:42,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:57:42,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708950999] [2022-07-13 21:57:42,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708950999] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:57:42,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:57:42,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 21:57:42,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479297324] [2022-07-13 21:57:42,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:57:42,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 21:57:42,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:57:42,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 21:57:42,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 21:57:42,482 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 346 [2022-07-13 21:57:42,483 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 346 transitions, 722 flow. Second operand has 3 states, 3 states have (on average 279.0) internal successors, (837), 3 states have internal predecessors, (837), 0 states have call successors, (0), 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-13 21:57:42,483 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:57:42,483 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 346 [2022-07-13 21:57:42,483 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:57:42,560 INFO L129 PetriNetUnfolder]: 23/581 cut-off events. [2022-07-13 21:57:42,560 INFO L130 PetriNetUnfolder]: For 49/49 co-relation queries the response was YES. [2022-07-13 21:57:42,568 INFO L84 FinitePrefix]: Finished finitePrefix Result has 636 conditions, 581 events. 23/581 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 3044 event pairs, 1 based on Foata normal form. 182/729 useless extension candidates. Maximal degree in co-relation 422. Up to 23 conditions per place. [2022-07-13 21:57:42,591 INFO L132 encePairwiseOnDemand]: 292/346 looper letters, 15 selfloop transitions, 2 changer transitions 0/295 dead transitions. [2022-07-13 21:57:42,591 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 295 transitions, 654 flow [2022-07-13 21:57:42,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 21:57:42,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-13 21:57:42,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 904 transitions. [2022-07-13 21:57:42,592 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8709055876685935 [2022-07-13 21:57:42,592 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 904 transitions. [2022-07-13 21:57:42,592 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 904 transitions. [2022-07-13 21:57:42,593 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:57:42,593 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 904 transitions. [2022-07-13 21:57:42,596 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 301.3333333333333) internal successors, (904), 3 states have internal predecessors, (904), 0 states have call successors, (0), 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-13 21:57:42,597 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 346.0) internal successors, (1384), 4 states have internal predecessors, (1384), 0 states have call successors, (0), 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-13 21:57:42,597 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 346.0) internal successors, (1384), 4 states have internal predecessors, (1384), 0 states have call successors, (0), 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-13 21:57:42,597 INFO L186 Difference]: Start difference. First operand has 290 places, 346 transitions, 722 flow. Second operand 3 states and 904 transitions. [2022-07-13 21:57:42,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 295 transitions, 654 flow [2022-07-13 21:57:42,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 295 transitions, 654 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-07-13 21:57:42,601 INFO L242 Difference]: Finished difference. Result has 289 places, 292 transitions, 624 flow [2022-07-13 21:57:42,602 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=612, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=289, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=624, PETRI_PLACES=289, PETRI_TRANSITIONS=292} [2022-07-13 21:57:42,602 INFO L279 CegarLoopForPetriNet]: 290 programPoint places, -1 predicate places. [2022-07-13 21:57:42,602 INFO L495 AbstractCegarLoop]: Abstraction has has 289 places, 292 transitions, 624 flow [2022-07-13 21:57:42,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 279.0) internal successors, (837), 3 states have internal predecessors, (837), 0 states have call successors, (0), 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-13 21:57:42,603 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:57:42,603 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] [2022-07-13 21:57:42,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-13 21:57:42,603 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-07-13 21:57:42,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:57:42,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1513088709, now seen corresponding path program 1 times [2022-07-13 21:57:42,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:57:42,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253486186] [2022-07-13 21:57:42,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:57:42,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:57:42,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:57:42,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:57:42,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:57:42,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253486186] [2022-07-13 21:57:42,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253486186] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 21:57:42,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [996253380] [2022-07-13 21:57:42,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:57:42,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:57:42,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 21:57:42,630 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 21:57:42,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-13 21:57:42,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:57:42,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 21:57:42,712 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 21:57:42,717 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-13 21:57:42,717 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 21:57:42,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [996253380] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:57:42,717 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 21:57:42,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-07-13 21:57:42,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296552480] [2022-07-13 21:57:42,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:57:42,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 21:57:42,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:57:42,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 21:57:42,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-13 21:57:42,719 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 346 [2022-07-13 21:57:42,719 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 292 transitions, 624 flow. Second operand has 3 states, 3 states have (on average 279.0) internal successors, (837), 3 states have internal predecessors, (837), 0 states have call successors, (0), 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-13 21:57:42,719 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:57:42,720 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 346 [2022-07-13 21:57:42,720 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:57:42,793 INFO L129 PetriNetUnfolder]: 20/525 cut-off events. [2022-07-13 21:57:42,793 INFO L130 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-07-13 21:57:42,801 INFO L84 FinitePrefix]: Finished finitePrefix Result has 595 conditions, 525 events. 20/525 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2681 event pairs, 1 based on Foata normal form. 0/496 useless extension candidates. Maximal degree in co-relation 557. Up to 30 conditions per place. [2022-07-13 21:57:42,803 INFO L132 encePairwiseOnDemand]: 343/346 looper letters, 15 selfloop transitions, 2 changer transitions 0/296 dead transitions. [2022-07-13 21:57:42,803 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 296 transitions, 666 flow [2022-07-13 21:57:42,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 21:57:42,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-13 21:57:42,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 852 transitions. [2022-07-13 21:57:42,804 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8208092485549133 [2022-07-13 21:57:42,804 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 852 transitions. [2022-07-13 21:57:42,804 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 852 transitions. [2022-07-13 21:57:42,804 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:57:42,804 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 852 transitions. [2022-07-13 21:57:42,805 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 284.0) internal successors, (852), 3 states have internal predecessors, (852), 0 states have call successors, (0), 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-13 21:57:42,806 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 346.0) internal successors, (1384), 4 states have internal predecessors, (1384), 0 states have call successors, (0), 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-13 21:57:42,806 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 346.0) internal successors, (1384), 4 states have internal predecessors, (1384), 0 states have call successors, (0), 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-13 21:57:42,806 INFO L186 Difference]: Start difference. First operand has 289 places, 292 transitions, 624 flow. Second operand 3 states and 852 transitions. [2022-07-13 21:57:42,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 296 transitions, 666 flow [2022-07-13 21:57:42,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 296 transitions, 664 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-07-13 21:57:42,810 INFO L242 Difference]: Finished difference. Result has 291 places, 293 transitions, 634 flow [2022-07-13 21:57:42,811 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=622, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=634, PETRI_PLACES=291, PETRI_TRANSITIONS=293} [2022-07-13 21:57:42,811 INFO L279 CegarLoopForPetriNet]: 290 programPoint places, 1 predicate places. [2022-07-13 21:57:42,811 INFO L495 AbstractCegarLoop]: Abstraction has has 291 places, 293 transitions, 634 flow [2022-07-13 21:57:42,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 279.0) internal successors, (837), 3 states have internal predecessors, (837), 0 states have call successors, (0), 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-13 21:57:42,811 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:57:42,811 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] [2022-07-13 21:57:42,831 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-13 21:57:43,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-13 21:57:43,029 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-07-13 21:57:43,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:57:43,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1584273556, now seen corresponding path program 1 times [2022-07-13 21:57:43,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:57:43,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358909127] [2022-07-13 21:57:43,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:57:43,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:57:43,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:57:43,052 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:57:43,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:57:43,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358909127] [2022-07-13 21:57:43,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358909127] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 21:57:43,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1196099085] [2022-07-13 21:57:43,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:57:43,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:57:43,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 21:57:43,053 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 21:57:43,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-13 21:57:43,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:57:43,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 21:57:43,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 21:57:43,140 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:57:43,140 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 21:57:43,158 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:57:43,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1196099085] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 21:57:43,158 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 21:57:43,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-07-13 21:57:43,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867867447] [2022-07-13 21:57:43,158 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 21:57:43,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 21:57:43,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:57:43,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 21:57:43,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-13 21:57:43,160 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 346 [2022-07-13 21:57:43,162 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 293 transitions, 634 flow. Second operand has 10 states, 10 states have (on average 279.1) internal successors, (2791), 10 states have internal predecessors, (2791), 0 states have call successors, (0), 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-13 21:57:43,162 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:57:43,162 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 346 [2022-07-13 21:57:43,162 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:57:43,283 INFO L129 PetriNetUnfolder]: 20/532 cut-off events. [2022-07-13 21:57:43,283 INFO L130 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2022-07-13 21:57:43,291 INFO L84 FinitePrefix]: Finished finitePrefix Result has 611 conditions, 532 events. 20/532 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2678 event pairs, 1 based on Foata normal form. 2/508 useless extension candidates. Maximal degree in co-relation 539. Up to 20 conditions per place. [2022-07-13 21:57:43,293 INFO L132 encePairwiseOnDemand]: 340/346 looper letters, 16 selfloop transitions, 9 changer transitions 0/303 dead transitions. [2022-07-13 21:57:43,293 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 303 transitions, 706 flow [2022-07-13 21:57:43,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 21:57:43,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-13 21:57:43,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2520 transitions. [2022-07-13 21:57:43,296 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8092485549132948 [2022-07-13 21:57:43,296 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2520 transitions. [2022-07-13 21:57:43,296 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2520 transitions. [2022-07-13 21:57:43,297 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:57:43,297 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2520 transitions. [2022-07-13 21:57:43,299 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 280.0) internal successors, (2520), 9 states have internal predecessors, (2520), 0 states have call successors, (0), 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-13 21:57:43,302 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 346.0) internal successors, (3460), 10 states have internal predecessors, (3460), 0 states have call successors, (0), 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-13 21:57:43,302 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 346.0) internal successors, (3460), 10 states have internal predecessors, (3460), 0 states have call successors, (0), 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-13 21:57:43,302 INFO L186 Difference]: Start difference. First operand has 291 places, 293 transitions, 634 flow. Second operand 9 states and 2520 transitions. [2022-07-13 21:57:43,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 303 transitions, 706 flow [2022-07-13 21:57:43,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 303 transitions, 704 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-07-13 21:57:43,306 INFO L242 Difference]: Finished difference. Result has 301 places, 299 transitions, 682 flow [2022-07-13 21:57:43,307 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=632, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=682, PETRI_PLACES=301, PETRI_TRANSITIONS=299} [2022-07-13 21:57:43,307 INFO L279 CegarLoopForPetriNet]: 290 programPoint places, 11 predicate places. [2022-07-13 21:57:43,307 INFO L495 AbstractCegarLoop]: Abstraction has has 301 places, 299 transitions, 682 flow [2022-07-13 21:57:43,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 279.1) internal successors, (2791), 10 states have internal predecessors, (2791), 0 states have call successors, (0), 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-13 21:57:43,308 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:57:43,308 INFO L200 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 21:57:43,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-13 21:57:43,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-13 21:57:43,523 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-07-13 21:57:43,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:57:43,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1224153428, now seen corresponding path program 2 times [2022-07-13 21:57:43,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:57:43,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170077605] [2022-07-13 21:57:43,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:57:43,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:57:43,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:57:43,578 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:57:43,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:57:43,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170077605] [2022-07-13 21:57:43,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170077605] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 21:57:43,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1158749490] [2022-07-13 21:57:43,579 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 21:57:43,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:57:43,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 21:57:43,580 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 21:57:43,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-13 21:57:43,646 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-13 21:57:43,646 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 21:57:43,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-13 21:57:43,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 21:57:43,692 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-07-13 21:57:43,790 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-13 21:57:43,790 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-13 21:57:43,827 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-13 21:57:43,891 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-07-13 21:57:43,934 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-13 21:57:43,935 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 21:57:43,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1158749490] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:57:43,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 21:57:43,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [9] total 19 [2022-07-13 21:57:43,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716706259] [2022-07-13 21:57:43,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:57:43,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-13 21:57:43,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:57:43,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-13 21:57:43,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2022-07-13 21:57:43,938 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 346 [2022-07-13 21:57:43,939 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 299 transitions, 682 flow. Second operand has 12 states, 12 states have (on average 232.33333333333334) internal successors, (2788), 12 states have internal predecessors, (2788), 0 states have call successors, (0), 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-13 21:57:43,939 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:57:43,939 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 346 [2022-07-13 21:57:43,939 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:58:17,586 INFO L129 PetriNetUnfolder]: 112920/268752 cut-off events. [2022-07-13 21:58:17,586 INFO L130 PetriNetUnfolder]: For 9789/10023 co-relation queries the response was YES. [2022-07-13 21:58:20,553 INFO L84 FinitePrefix]: Finished finitePrefix Result has 417000 conditions, 268752 events. 112920/268752 cut-off events. For 9789/10023 co-relation queries the response was YES. Maximal size of possible extension queue 7311. Compared 3849921 event pairs, 6433 based on Foata normal form. 19/253241 useless extension candidates. Maximal degree in co-relation 416911. Up to 49715 conditions per place. [2022-07-13 21:58:22,362 INFO L132 encePairwiseOnDemand]: 328/346 looper letters, 301 selfloop transitions, 48 changer transitions 0/587 dead transitions. [2022-07-13 21:58:22,363 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 587 transitions, 2109 flow [2022-07-13 21:58:22,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-13 21:58:22,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-07-13 21:58:22,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 3800 transitions. [2022-07-13 21:58:22,367 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7321772639691715 [2022-07-13 21:58:22,367 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 3800 transitions. [2022-07-13 21:58:22,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 3800 transitions. [2022-07-13 21:58:22,368 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:58:22,368 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 3800 transitions. [2022-07-13 21:58:22,372 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 253.33333333333334) internal successors, (3800), 15 states have internal predecessors, (3800), 0 states have call successors, (0), 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-13 21:58:22,378 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 346.0) internal successors, (5536), 16 states have internal predecessors, (5536), 0 states have call successors, (0), 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-13 21:58:22,379 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 346.0) internal successors, (5536), 16 states have internal predecessors, (5536), 0 states have call successors, (0), 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-13 21:58:22,379 INFO L186 Difference]: Start difference. First operand has 301 places, 299 transitions, 682 flow. Second operand 15 states and 3800 transitions. [2022-07-13 21:58:22,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 587 transitions, 2109 flow [2022-07-13 21:58:22,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 587 transitions, 2103 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-07-13 21:58:22,391 INFO L242 Difference]: Finished difference. Result has 325 places, 353 transitions, 1031 flow [2022-07-13 21:58:22,392 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=676, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1031, PETRI_PLACES=325, PETRI_TRANSITIONS=353} [2022-07-13 21:58:22,392 INFO L279 CegarLoopForPetriNet]: 290 programPoint places, 35 predicate places. [2022-07-13 21:58:22,392 INFO L495 AbstractCegarLoop]: Abstraction has has 325 places, 353 transitions, 1031 flow [2022-07-13 21:58:22,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 232.33333333333334) internal successors, (2788), 12 states have internal predecessors, (2788), 0 states have call successors, (0), 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-13 21:58:22,393 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:58:22,393 INFO L200 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 21:58:22,412 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-13 21:58:22,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-13 21:58:22,612 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-07-13 21:58:22,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:58:22,613 INFO L85 PathProgramCache]: Analyzing trace with hash 657728224, now seen corresponding path program 1 times [2022-07-13 21:58:22,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:58:22,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688482757] [2022-07-13 21:58:22,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:58:22,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:58:22,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:58:22,655 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-13 21:58:22,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:58:22,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688482757] [2022-07-13 21:58:22,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688482757] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 21:58:22,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1745642160] [2022-07-13 21:58:22,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:58:22,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:58:22,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 21:58:22,658 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 21:58:22,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-13 21:58:22,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:58:22,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 21:58:22,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 21:58:22,784 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 21:58:22,784 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 21:58:22,846 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 21:58:22,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1745642160] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 21:58:22,847 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 21:58:22,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2022-07-13 21:58:22,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847805389] [2022-07-13 21:58:22,847 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 21:58:22,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-13 21:58:22,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:58:22,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-13 21:58:22,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2022-07-13 21:58:22,851 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 270 out of 346 [2022-07-13 21:58:22,854 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 353 transitions, 1031 flow. Second operand has 19 states, 19 states have (on average 273.05263157894734) internal successors, (5188), 19 states have internal predecessors, (5188), 0 states have call successors, (0), 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-13 21:58:22,854 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:58:22,854 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 270 of 346 [2022-07-13 21:58:22,854 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:58:24,923 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1373] t_funEXIT-->L957-4: Formula: (= v_t_funThread3of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem48#1_15| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][245], [t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse, 462#true, 1083#true, Black: 295#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 399#(<= |ULTIMATE.start_main_~i~3#1| 0), Black: 1064#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (exists ((|t_funThread1of3ForFork0_cache_entry_addref_~entry#1.offset| Int)) (= (select ((as const (Array Int Int)) 0) |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.offset|) |t_funThread1of3ForFork0_cache_entry_addref_#t~mem40#1|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 1066#(and (<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1|) (<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1|)), Black: 1044#(<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1|), Black: 1051#(<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1|), Black: 1058#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 1068#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4))), Black: 1062#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4))), Black: 1056#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 1060#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 897#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 736#(< |ULTIMATE.start_main_~i~1#1| 10), 223#L957-4true, Black: 466#(<= |ULTIMATE.start_main_~i~1#1| 1), t_funThread1of3ForFork0NotInUse, 893#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1))]) [2022-07-13 21:58:24,923 INFO L384 tUnfolder$Statistics]: this new event has 203 ancestors and is cut-off event [2022-07-13 21:58:24,923 INFO L387 tUnfolder$Statistics]: existing Event has 203 ancestors and is cut-off event [2022-07-13 21:58:24,923 INFO L387 tUnfolder$Statistics]: existing Event has 167 ancestors and is cut-off event [2022-07-13 21:58:24,923 INFO L387 tUnfolder$Statistics]: existing Event has 167 ancestors and is cut-off event [2022-07-13 21:58:25,262 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1372] t_funEXIT-->L957-4: Formula: (= v_t_funThread2of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem48#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_13|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_13|} AuxVars[] AssignedVars[][146], [t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse, 462#true, 1083#true, Black: 295#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 399#(<= |ULTIMATE.start_main_~i~3#1| 0), Black: 1064#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (exists ((|t_funThread1of3ForFork0_cache_entry_addref_~entry#1.offset| Int)) (= (select ((as const (Array Int Int)) 0) |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.offset|) |t_funThread1of3ForFork0_cache_entry_addref_#t~mem40#1|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 1066#(and (<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1|) (<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1|)), Black: 1044#(<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1|), Black: 1051#(<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1|), Black: 1058#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 1068#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4))), Black: 1062#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4))), Black: 1056#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 1060#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 897#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 736#(< |ULTIMATE.start_main_~i~1#1| 10), 223#L957-4true, Black: 466#(<= |ULTIMATE.start_main_~i~1#1| 1), t_funThread1of3ForFork0NotInUse, 893#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1))]) [2022-07-13 21:58:25,262 INFO L384 tUnfolder$Statistics]: this new event has 216 ancestors and is cut-off event [2022-07-13 21:58:25,262 INFO L387 tUnfolder$Statistics]: existing Event has 144 ancestors and is cut-off event [2022-07-13 21:58:25,262 INFO L387 tUnfolder$Statistics]: existing Event has 144 ancestors and is cut-off event [2022-07-13 21:58:25,262 INFO L387 tUnfolder$Statistics]: existing Event has 180 ancestors and is cut-off event [2022-07-13 21:58:25,315 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1372] t_funEXIT-->L957-4: Formula: (= v_t_funThread2of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem48#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_13|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_13|} AuxVars[] AssignedVars[][146], [t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0InUse, 462#true, 1083#true, Black: 295#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 399#(<= |ULTIMATE.start_main_~i~3#1| 0), 81#t_funENTRYtrue, Black: 1064#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (exists ((|t_funThread1of3ForFork0_cache_entry_addref_~entry#1.offset| Int)) (= (select ((as const (Array Int Int)) 0) |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.offset|) |t_funThread1of3ForFork0_cache_entry_addref_#t~mem40#1|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 1066#(and (<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1|) (<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1|)), Black: 1044#(<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1|), Black: 1051#(<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1|), Black: 1058#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 1068#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4))), Black: 1062#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4))), Black: 1056#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 1060#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 897#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 736#(< |ULTIMATE.start_main_~i~1#1| 10), 223#L957-4true, Black: 466#(<= |ULTIMATE.start_main_~i~1#1| 1), t_funThread1of3ForFork0NotInUse, 893#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1))]) [2022-07-13 21:58:25,315 INFO L384 tUnfolder$Statistics]: this new event has 226 ancestors and is cut-off event [2022-07-13 21:58:25,315 INFO L387 tUnfolder$Statistics]: existing Event has 154 ancestors and is cut-off event [2022-07-13 21:58:25,315 INFO L387 tUnfolder$Statistics]: existing Event has 154 ancestors and is cut-off event [2022-07-13 21:58:25,315 INFO L387 tUnfolder$Statistics]: existing Event has 190 ancestors and is cut-off event [2022-07-13 21:58:25,320 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1372] t_funEXIT-->L957-4: Formula: (= v_t_funThread2of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem48#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_13|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_13|} AuxVars[] AssignedVars[][146], [t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse, 462#true, 1083#true, Black: 295#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 399#(<= |ULTIMATE.start_main_~i~3#1| 0), Black: 1064#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (exists ((|t_funThread1of3ForFork0_cache_entry_addref_~entry#1.offset| Int)) (= (select ((as const (Array Int Int)) 0) |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.offset|) |t_funThread1of3ForFork0_cache_entry_addref_#t~mem40#1|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 1066#(and (<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1|) (<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1|)), Black: 1044#(<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1|), Black: 1051#(<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1|), Black: 1058#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 1068#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4))), Black: 1062#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4))), Black: 1056#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 1060#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 897#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), 46#t_funENTRYtrue, Black: 736#(< |ULTIMATE.start_main_~i~1#1| 10), 223#L957-4true, Black: 466#(<= |ULTIMATE.start_main_~i~1#1| 1), 893#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1)), t_funThread1of3ForFork0InUse]) [2022-07-13 21:58:25,321 INFO L384 tUnfolder$Statistics]: this new event has 226 ancestors and is cut-off event [2022-07-13 21:58:25,321 INFO L387 tUnfolder$Statistics]: existing Event has 131 ancestors and is cut-off event [2022-07-13 21:58:25,321 INFO L387 tUnfolder$Statistics]: existing Event has 131 ancestors and is cut-off event [2022-07-13 21:58:25,321 INFO L387 tUnfolder$Statistics]: existing Event has 167 ancestors and is cut-off event [2022-07-13 21:58:25,345 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1372] t_funEXIT-->L957-4: Formula: (= v_t_funThread2of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem48#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_13|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_13|} AuxVars[] AssignedVars[][146], [t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse, 462#true, 1083#true, Black: 295#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 399#(<= |ULTIMATE.start_main_~i~3#1| 0), Black: 1064#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (exists ((|t_funThread1of3ForFork0_cache_entry_addref_~entry#1.offset| Int)) (= (select ((as const (Array Int Int)) 0) |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.offset|) |t_funThread1of3ForFork0_cache_entry_addref_#t~mem40#1|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 1066#(and (<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1|) (<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1|)), Black: 1044#(<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1|), Black: 1051#(<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1|), Black: 1058#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 1068#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4))), Black: 1062#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4))), Black: 1056#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), 250#L947-2true, Black: 1060#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 897#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 736#(< |ULTIMATE.start_main_~i~1#1| 10), 223#L957-4true, Black: 466#(<= |ULTIMATE.start_main_~i~1#1| 1), 893#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1)), t_funThread1of3ForFork0InUse]) [2022-07-13 21:58:25,345 INFO L384 tUnfolder$Statistics]: this new event has 232 ancestors and is cut-off event [2022-07-13 21:58:25,345 INFO L387 tUnfolder$Statistics]: existing Event has 173 ancestors and is cut-off event [2022-07-13 21:58:25,345 INFO L387 tUnfolder$Statistics]: existing Event has 137 ancestors and is cut-off event [2022-07-13 21:58:25,345 INFO L387 tUnfolder$Statistics]: existing Event has 137 ancestors and is cut-off event [2022-07-13 21:58:25,351 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1373] t_funEXIT-->L957-4: Formula: (= v_t_funThread3of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem48#1_15| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][245], [t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse, 462#true, 1083#true, Black: 295#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 399#(<= |ULTIMATE.start_main_~i~3#1| 0), Black: 1064#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (exists ((|t_funThread1of3ForFork0_cache_entry_addref_~entry#1.offset| Int)) (= (select ((as const (Array Int Int)) 0) |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.offset|) |t_funThread1of3ForFork0_cache_entry_addref_#t~mem40#1|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 1066#(and (<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1|) (<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1|)), Black: 1044#(<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1|), Black: 1051#(<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1|), Black: 1058#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 1068#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4))), Black: 1062#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4))), Black: 1056#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 1060#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 897#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), 238#L940true, 223#L957-4true, Black: 736#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 466#(<= |ULTIMATE.start_main_~i~1#1| 1), 893#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1)), t_funThread1of3ForFork0InUse]) [2022-07-13 21:58:25,351 INFO L384 tUnfolder$Statistics]: this new event has 234 ancestors and is cut-off event [2022-07-13 21:58:25,351 INFO L387 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-07-13 21:58:25,351 INFO L387 tUnfolder$Statistics]: existing Event has 162 ancestors and is cut-off event [2022-07-13 21:58:25,351 INFO L387 tUnfolder$Statistics]: existing Event has 162 ancestors and is cut-off event [2022-07-13 21:58:25,370 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1372] t_funEXIT-->L957-4: Formula: (= v_t_funThread2of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem48#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_13|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_13|} AuxVars[] AssignedVars[][146], [t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse, 462#true, 1083#true, 41#L941-30true, Black: 295#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 399#(<= |ULTIMATE.start_main_~i~3#1| 0), Black: 1064#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (exists ((|t_funThread1of3ForFork0_cache_entry_addref_~entry#1.offset| Int)) (= (select ((as const (Array Int Int)) 0) |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.offset|) |t_funThread1of3ForFork0_cache_entry_addref_#t~mem40#1|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 1066#(and (<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1|) (<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1|)), Black: 1044#(<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1|), Black: 1051#(<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1|), Black: 1058#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 1068#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4))), Black: 1062#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4))), Black: 1056#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 1060#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 897#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 736#(< |ULTIMATE.start_main_~i~1#1| 10), 223#L957-4true, Black: 466#(<= |ULTIMATE.start_main_~i~1#1| 1), 893#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1)), t_funThread1of3ForFork0InUse]) [2022-07-13 21:58:25,370 INFO L384 tUnfolder$Statistics]: this new event has 242 ancestors and is cut-off event [2022-07-13 21:58:25,370 INFO L387 tUnfolder$Statistics]: existing Event has 147 ancestors and is cut-off event [2022-07-13 21:58:25,371 INFO L387 tUnfolder$Statistics]: existing Event has 147 ancestors and is cut-off event [2022-07-13 21:58:25,371 INFO L387 tUnfolder$Statistics]: existing Event has 183 ancestors and is cut-off event [2022-07-13 21:58:25,378 INFO L129 PetriNetUnfolder]: 1166/11881 cut-off events. [2022-07-13 21:58:25,378 INFO L130 PetriNetUnfolder]: For 3249/4549 co-relation queries the response was YES. [2022-07-13 21:58:25,549 INFO L84 FinitePrefix]: Finished finitePrefix Result has 15848 conditions, 11881 events. 1166/11881 cut-off events. For 3249/4549 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 146589 event pairs, 115 based on Foata normal form. 33/11072 useless extension candidates. Maximal degree in co-relation 15682. Up to 557 conditions per place. [2022-07-13 21:58:25,611 INFO L132 encePairwiseOnDemand]: 335/346 looper letters, 37 selfloop transitions, 26 changer transitions 0/386 dead transitions. [2022-07-13 21:58:25,612 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 349 places, 386 transitions, 1285 flow [2022-07-13 21:58:25,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-13 21:58:25,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-07-13 21:58:25,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 6816 transitions. [2022-07-13 21:58:25,617 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7879768786127168 [2022-07-13 21:58:25,617 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 6816 transitions. [2022-07-13 21:58:25,617 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 6816 transitions. [2022-07-13 21:58:25,619 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:58:25,619 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 6816 transitions. [2022-07-13 21:58:25,626 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 272.64) internal successors, (6816), 25 states have internal predecessors, (6816), 0 states have call successors, (0), 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-13 21:58:25,635 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 346.0) internal successors, (8996), 26 states have internal predecessors, (8996), 0 states have call successors, (0), 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-13 21:58:25,637 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 346.0) internal successors, (8996), 26 states have internal predecessors, (8996), 0 states have call successors, (0), 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-13 21:58:25,638 INFO L186 Difference]: Start difference. First operand has 325 places, 353 transitions, 1031 flow. Second operand 25 states and 6816 transitions. [2022-07-13 21:58:25,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 349 places, 386 transitions, 1285 flow [2022-07-13 21:58:25,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 349 places, 386 transitions, 1285 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-07-13 21:58:25,653 INFO L242 Difference]: Finished difference. Result has 357 places, 369 transitions, 1195 flow [2022-07-13 21:58:25,654 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=1031, PETRI_DIFFERENCE_MINUEND_PLACES=325, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=337, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=1195, PETRI_PLACES=357, PETRI_TRANSITIONS=369} [2022-07-13 21:58:25,655 INFO L279 CegarLoopForPetriNet]: 290 programPoint places, 67 predicate places. [2022-07-13 21:58:25,655 INFO L495 AbstractCegarLoop]: Abstraction has has 357 places, 369 transitions, 1195 flow [2022-07-13 21:58:25,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 273.05263157894734) internal successors, (5188), 19 states have internal predecessors, (5188), 0 states have call successors, (0), 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-13 21:58:25,656 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:58:25,656 INFO L200 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 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-13 21:58:25,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-13 21:58:25,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-07-13 21:58:25,871 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-07-13 21:58:25,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:58:25,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1799201985, now seen corresponding path program 1 times [2022-07-13 21:58:25,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:58:25,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868406587] [2022-07-13 21:58:25,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:58:25,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:58:25,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:58:26,005 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-07-13 21:58:26,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:58:26,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868406587] [2022-07-13 21:58:26,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868406587] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 21:58:26,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [156876564] [2022-07-13 21:58:26,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:58:26,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:58:26,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 21:58:26,007 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 21:58:26,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-13 21:58:26,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:58:26,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-13 21:58:26,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 21:58:26,145 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-07-13 21:58:26,145 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 21:58:26,246 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-07-13 21:58:26,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [156876564] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 21:58:26,247 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 21:58:26,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2022-07-13 21:58:26,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470569544] [2022-07-13 21:58:26,247 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 21:58:26,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-13 21:58:26,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:58:26,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-13 21:58:26,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2022-07-13 21:58:26,251 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 346 [2022-07-13 21:58:26,254 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 357 places, 369 transitions, 1195 flow. Second operand has 23 states, 23 states have (on average 279.5217391304348) internal successors, (6429), 23 states have internal predecessors, (6429), 0 states have call successors, (0), 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-13 21:58:26,254 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:58:26,254 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 346 [2022-07-13 21:58:26,254 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:58:28,648 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1373] t_funEXIT-->L957-4: Formula: (= v_t_funThread3of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem48#1_15| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][254], [1083#true, Black: 399#(<= |ULTIMATE.start_main_~i~3#1| 0), 1571#true, Black: 1205#(<= |ULTIMATE.start_main_~i~1#1| 3), Black: 1416#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 1561#(and (= 0 |ULTIMATE.start_main_#t~post43#1|) (<= |ULTIMATE.start_main_~i~3#1| 1)), 223#L957-4true, 893#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1)), t_funThread1of3ForFork0NotInUse, Black: 1085#(= |ULTIMATE.start_main_~i~3#1| 0), t_funThread2of3ForFork0NotInUse, Black: 1444#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 1427#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 1087#(<= |ULTIMATE.start_main_~i~3#1| 1), t_funThread3of3ForFork0NotInUse, 462#true, Black: 295#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 1064#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (exists ((|t_funThread1of3ForFork0_cache_entry_addref_~entry#1.offset| Int)) (= (select ((as const (Array Int Int)) 0) |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.offset|) |t_funThread1of3ForFork0_cache_entry_addref_#t~mem40#1|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 1066#(and (<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1|) (<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1|)), Black: 1044#(<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1|), Black: 1051#(<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1|), Black: 1058#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 1068#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4))), Black: 1062#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4))), Black: 1056#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 1060#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 897#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 736#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 466#(<= |ULTIMATE.start_main_~i~1#1| 1)]) [2022-07-13 21:58:28,648 INFO L384 tUnfolder$Statistics]: this new event has 218 ancestors and is cut-off event [2022-07-13 21:58:28,648 INFO L387 tUnfolder$Statistics]: existing Event has 182 ancestors and is cut-off event [2022-07-13 21:58:28,648 INFO L387 tUnfolder$Statistics]: existing Event has 182 ancestors and is cut-off event [2022-07-13 21:58:28,649 INFO L387 tUnfolder$Statistics]: existing Event has 218 ancestors and is cut-off event [2022-07-13 21:58:28,869 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1372] t_funEXIT-->L957-4: Formula: (= v_t_funThread2of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem48#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_13|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_13|} AuxVars[] AssignedVars[][157], [1083#true, Black: 399#(<= |ULTIMATE.start_main_~i~3#1| 0), 1571#true, Black: 1205#(<= |ULTIMATE.start_main_~i~1#1| 3), Black: 1416#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 1561#(and (= 0 |ULTIMATE.start_main_#t~post43#1|) (<= |ULTIMATE.start_main_~i~3#1| 1)), 223#L957-4true, t_funThread1of3ForFork0NotInUse, 893#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1)), Black: 1085#(= |ULTIMATE.start_main_~i~3#1| 0), Black: 1444#(< |ULTIMATE.start_main_~i~1#1| 8), t_funThread2of3ForFork0NotInUse, Black: 1427#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 1087#(<= |ULTIMATE.start_main_~i~3#1| 1), t_funThread3of3ForFork0NotInUse, 462#true, Black: 295#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 1064#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (exists ((|t_funThread1of3ForFork0_cache_entry_addref_~entry#1.offset| Int)) (= (select ((as const (Array Int Int)) 0) |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.offset|) |t_funThread1of3ForFork0_cache_entry_addref_#t~mem40#1|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 1066#(and (<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1|) (<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1|)), Black: 1044#(<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1|), Black: 1051#(<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1|), Black: 1058#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 1068#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4))), Black: 1062#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4))), Black: 1056#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 1060#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 897#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 736#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 466#(<= |ULTIMATE.start_main_~i~1#1| 1)]) [2022-07-13 21:58:28,869 INFO L384 tUnfolder$Statistics]: this new event has 231 ancestors and is cut-off event [2022-07-13 21:58:28,869 INFO L387 tUnfolder$Statistics]: existing Event has 159 ancestors and is cut-off event [2022-07-13 21:58:28,869 INFO L387 tUnfolder$Statistics]: existing Event has 195 ancestors and is cut-off event [2022-07-13 21:58:28,869 INFO L387 tUnfolder$Statistics]: existing Event has 159 ancestors and is cut-off event [2022-07-13 21:58:28,926 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1372] t_funEXIT-->L957-4: Formula: (= v_t_funThread2of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem48#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_13|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_13|} AuxVars[] AssignedVars[][157], [1083#true, Black: 399#(<= |ULTIMATE.start_main_~i~3#1| 0), 81#t_funENTRYtrue, 1571#true, Black: 1205#(<= |ULTIMATE.start_main_~i~1#1| 3), Black: 1416#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 1561#(and (= 0 |ULTIMATE.start_main_#t~post43#1|) (<= |ULTIMATE.start_main_~i~3#1| 1)), 223#L957-4true, t_funThread1of3ForFork0NotInUse, 893#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1)), Black: 1085#(= |ULTIMATE.start_main_~i~3#1| 0), t_funThread2of3ForFork0NotInUse, Black: 1444#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 1427#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 1087#(<= |ULTIMATE.start_main_~i~3#1| 1), t_funThread3of3ForFork0InUse, 462#true, Black: 295#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 1064#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (exists ((|t_funThread1of3ForFork0_cache_entry_addref_~entry#1.offset| Int)) (= (select ((as const (Array Int Int)) 0) |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.offset|) |t_funThread1of3ForFork0_cache_entry_addref_#t~mem40#1|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 1066#(and (<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1|) (<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1|)), Black: 1044#(<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1|), Black: 1051#(<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1|), Black: 1058#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 1068#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4))), Black: 1062#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4))), Black: 1056#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 1060#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 897#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 736#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 466#(<= |ULTIMATE.start_main_~i~1#1| 1)]) [2022-07-13 21:58:28,927 INFO L384 tUnfolder$Statistics]: this new event has 241 ancestors and is cut-off event [2022-07-13 21:58:28,927 INFO L387 tUnfolder$Statistics]: existing Event has 169 ancestors and is cut-off event [2022-07-13 21:58:28,927 INFO L387 tUnfolder$Statistics]: existing Event has 205 ancestors and is cut-off event [2022-07-13 21:58:28,927 INFO L387 tUnfolder$Statistics]: existing Event has 169 ancestors and is cut-off event [2022-07-13 21:58:28,932 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1372] t_funEXIT-->L957-4: Formula: (= v_t_funThread2of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem48#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_13|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_13|} AuxVars[] AssignedVars[][157], [1083#true, Black: 399#(<= |ULTIMATE.start_main_~i~3#1| 0), 1571#true, 46#t_funENTRYtrue, Black: 1205#(<= |ULTIMATE.start_main_~i~1#1| 3), Black: 1416#(< |ULTIMATE.start_main_~i~1#1| 10), 223#L957-4true, Black: 1561#(and (= 0 |ULTIMATE.start_main_#t~post43#1|) (<= |ULTIMATE.start_main_~i~3#1| 1)), 893#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1)), Black: 1085#(= |ULTIMATE.start_main_~i~3#1| 0), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0NotInUse, Black: 1444#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 1427#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 1087#(<= |ULTIMATE.start_main_~i~3#1| 1), t_funThread3of3ForFork0NotInUse, 462#true, Black: 295#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 1064#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (exists ((|t_funThread1of3ForFork0_cache_entry_addref_~entry#1.offset| Int)) (= (select ((as const (Array Int Int)) 0) |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.offset|) |t_funThread1of3ForFork0_cache_entry_addref_#t~mem40#1|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 1066#(and (<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1|) (<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1|)), Black: 1044#(<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1|), Black: 1051#(<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1|), Black: 1058#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 1068#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4))), Black: 1062#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4))), Black: 1056#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 1060#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 897#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 736#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 466#(<= |ULTIMATE.start_main_~i~1#1| 1)]) [2022-07-13 21:58:28,932 INFO L384 tUnfolder$Statistics]: this new event has 241 ancestors and is cut-off event [2022-07-13 21:58:28,932 INFO L387 tUnfolder$Statistics]: existing Event has 146 ancestors and is cut-off event [2022-07-13 21:58:28,932 INFO L387 tUnfolder$Statistics]: existing Event has 182 ancestors and is cut-off event [2022-07-13 21:58:28,933 INFO L387 tUnfolder$Statistics]: existing Event has 146 ancestors and is cut-off event [2022-07-13 21:58:28,957 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1372] t_funEXIT-->L957-4: Formula: (= v_t_funThread2of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem48#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_13|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_13|} AuxVars[] AssignedVars[][157], [1083#true, Black: 399#(<= |ULTIMATE.start_main_~i~3#1| 0), 1571#true, 250#L947-2true, Black: 1205#(<= |ULTIMATE.start_main_~i~1#1| 3), Black: 1416#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 1561#(and (= 0 |ULTIMATE.start_main_#t~post43#1|) (<= |ULTIMATE.start_main_~i~3#1| 1)), 223#L957-4true, 893#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1)), Black: 1085#(= |ULTIMATE.start_main_~i~3#1| 0), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0NotInUse, Black: 1444#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 1427#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 1087#(<= |ULTIMATE.start_main_~i~3#1| 1), t_funThread3of3ForFork0NotInUse, 462#true, Black: 295#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 1064#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (exists ((|t_funThread1of3ForFork0_cache_entry_addref_~entry#1.offset| Int)) (= (select ((as const (Array Int Int)) 0) |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.offset|) |t_funThread1of3ForFork0_cache_entry_addref_#t~mem40#1|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 1066#(and (<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1|) (<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1|)), Black: 1044#(<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1|), Black: 1051#(<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1|), Black: 1058#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 1068#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4))), Black: 1062#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4))), Black: 1056#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 1060#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 897#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 736#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 466#(<= |ULTIMATE.start_main_~i~1#1| 1)]) [2022-07-13 21:58:28,957 INFO L384 tUnfolder$Statistics]: this new event has 247 ancestors and is cut-off event [2022-07-13 21:58:28,957 INFO L387 tUnfolder$Statistics]: existing Event has 152 ancestors and is cut-off event [2022-07-13 21:58:28,957 INFO L387 tUnfolder$Statistics]: existing Event has 188 ancestors and is cut-off event [2022-07-13 21:58:28,958 INFO L387 tUnfolder$Statistics]: existing Event has 152 ancestors and is cut-off event [2022-07-13 21:58:28,963 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1373] t_funEXIT-->L957-4: Formula: (= v_t_funThread3of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem48#1_15| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][254], [1083#true, Black: 399#(<= |ULTIMATE.start_main_~i~3#1| 0), 1571#true, Black: 1205#(<= |ULTIMATE.start_main_~i~1#1| 3), Black: 1416#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 1561#(and (= 0 |ULTIMATE.start_main_#t~post43#1|) (<= |ULTIMATE.start_main_~i~3#1| 1)), 223#L957-4true, 893#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1)), t_funThread1of3ForFork0InUse, Black: 1085#(= |ULTIMATE.start_main_~i~3#1| 0), Black: 1444#(< |ULTIMATE.start_main_~i~1#1| 8), t_funThread2of3ForFork0NotInUse, Black: 1427#(< |ULTIMATE.start_main_~i~1#1| 9), t_funThread3of3ForFork0NotInUse, Black: 1087#(<= |ULTIMATE.start_main_~i~3#1| 1), 462#true, Black: 295#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 1064#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (exists ((|t_funThread1of3ForFork0_cache_entry_addref_~entry#1.offset| Int)) (= (select ((as const (Array Int Int)) 0) |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.offset|) |t_funThread1of3ForFork0_cache_entry_addref_#t~mem40#1|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 1066#(and (<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1|) (<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1|)), Black: 1044#(<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1|), Black: 1051#(<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1|), Black: 1058#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 1068#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4))), Black: 1062#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4))), Black: 1056#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 1060#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 897#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), 238#L940true, Black: 736#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 466#(<= |ULTIMATE.start_main_~i~1#1| 1)]) [2022-07-13 21:58:28,964 INFO L384 tUnfolder$Statistics]: this new event has 249 ancestors and is cut-off event [2022-07-13 21:58:28,964 INFO L387 tUnfolder$Statistics]: existing Event has 177 ancestors and is cut-off event [2022-07-13 21:58:28,964 INFO L387 tUnfolder$Statistics]: existing Event has 177 ancestors and is cut-off event [2022-07-13 21:58:28,964 INFO L387 tUnfolder$Statistics]: existing Event has 213 ancestors and is cut-off event [2022-07-13 21:58:28,984 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1372] t_funEXIT-->L957-4: Formula: (= v_t_funThread2of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem48#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_13|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_13|} AuxVars[] AssignedVars[][157], [1083#true, Black: 399#(<= |ULTIMATE.start_main_~i~3#1| 0), 1571#true, Black: 1205#(<= |ULTIMATE.start_main_~i~1#1| 3), Black: 1416#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 1561#(and (= 0 |ULTIMATE.start_main_#t~post43#1|) (<= |ULTIMATE.start_main_~i~3#1| 1)), 223#L957-4true, 893#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1)), t_funThread1of3ForFork0InUse, Black: 1085#(= |ULTIMATE.start_main_~i~3#1| 0), t_funThread2of3ForFork0NotInUse, Black: 1444#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 1427#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 1087#(<= |ULTIMATE.start_main_~i~3#1| 1), t_funThread3of3ForFork0NotInUse, 462#true, 41#L941-30true, Black: 295#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 1064#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (exists ((|t_funThread1of3ForFork0_cache_entry_addref_~entry#1.offset| Int)) (= (select ((as const (Array Int Int)) 0) |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.offset|) |t_funThread1of3ForFork0_cache_entry_addref_#t~mem40#1|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 1066#(and (<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1|) (<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1|)), Black: 1044#(<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1|), Black: 1051#(<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1|), Black: 1058#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 1068#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4))), Black: 1062#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4))), Black: 1056#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 1060#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 897#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 736#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 466#(<= |ULTIMATE.start_main_~i~1#1| 1)]) [2022-07-13 21:58:28,984 INFO L384 tUnfolder$Statistics]: this new event has 257 ancestors and is cut-off event [2022-07-13 21:58:28,985 INFO L387 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-07-13 21:58:28,985 INFO L387 tUnfolder$Statistics]: existing Event has 162 ancestors and is cut-off event [2022-07-13 21:58:28,985 INFO L387 tUnfolder$Statistics]: existing Event has 162 ancestors and is cut-off event [2022-07-13 21:58:28,993 INFO L129 PetriNetUnfolder]: 1156/11778 cut-off events. [2022-07-13 21:58:28,993 INFO L130 PetriNetUnfolder]: For 3304/3926 co-relation queries the response was YES. [2022-07-13 21:58:29,212 INFO L84 FinitePrefix]: Finished finitePrefix Result has 15787 conditions, 11778 events. 1156/11778 cut-off events. For 3304/3926 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 144746 event pairs, 116 based on Foata normal form. 7/10945 useless extension candidates. Maximal degree in co-relation 15514. Up to 548 conditions per place. [2022-07-13 21:58:29,274 INFO L132 encePairwiseOnDemand]: 340/346 looper letters, 30 selfloop transitions, 30 changer transitions 0/395 dead transitions. [2022-07-13 21:58:29,274 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 395 transitions, 1461 flow [2022-07-13 21:58:29,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-07-13 21:58:29,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-07-13 21:58:29,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 8373 transitions. [2022-07-13 21:58:29,280 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8066473988439307 [2022-07-13 21:58:29,280 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 8373 transitions. [2022-07-13 21:58:29,281 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 8373 transitions. [2022-07-13 21:58:29,283 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:58:29,283 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 8373 transitions. [2022-07-13 21:58:29,291 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 279.1) internal successors, (8373), 30 states have internal predecessors, (8373), 0 states have call successors, (0), 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-13 21:58:29,301 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 346.0) internal successors, (10726), 31 states have internal predecessors, (10726), 0 states have call successors, (0), 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-13 21:58:29,303 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 346.0) internal successors, (10726), 31 states have internal predecessors, (10726), 0 states have call successors, (0), 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-13 21:58:29,303 INFO L186 Difference]: Start difference. First operand has 357 places, 369 transitions, 1195 flow. Second operand 30 states and 8373 transitions. [2022-07-13 21:58:29,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 386 places, 395 transitions, 1461 flow [2022-07-13 21:58:29,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 379 places, 395 transitions, 1427 flow, removed 10 selfloop flow, removed 7 redundant places. [2022-07-13 21:58:29,317 INFO L242 Difference]: Finished difference. Result has 383 places, 379 transitions, 1319 flow [2022-07-13 21:58:29,317 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=1167, PETRI_DIFFERENCE_MINUEND_PLACES=350, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=346, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=1319, PETRI_PLACES=383, PETRI_TRANSITIONS=379} [2022-07-13 21:58:29,318 INFO L279 CegarLoopForPetriNet]: 290 programPoint places, 93 predicate places. [2022-07-13 21:58:29,318 INFO L495 AbstractCegarLoop]: Abstraction has has 383 places, 379 transitions, 1319 flow [2022-07-13 21:58:29,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 279.5217391304348) internal successors, (6429), 23 states have internal predecessors, (6429), 0 states have call successors, (0), 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-13 21:58:29,319 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:58:29,319 INFO L200 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 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-13 21:58:29,337 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-13 21:58:29,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-13 21:58:29,535 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-07-13 21:58:29,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:58:29,536 INFO L85 PathProgramCache]: Analyzing trace with hash -974264783, now seen corresponding path program 2 times [2022-07-13 21:58:29,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:58:29,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683816532] [2022-07-13 21:58:29,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:58:29,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:58:29,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 21:58:29,556 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 21:58:29,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 21:58:29,585 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 21:58:29,585 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-13 21:58:29,585 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2022-07-13 21:58:29,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-07-13 21:58:29,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2022-07-13 21:58:29,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2022-07-13 21:58:29,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2022-07-13 21:58:29,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-07-13 21:58:29,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-13 21:58:29,586 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1] [2022-07-13 21:58:29,587 WARN L231 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2022-07-13 21:58:29,587 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2022-07-13 21:58:29,614 INFO L135 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-07-13 21:58:29,617 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 350 places, 419 transitions, 882 flow [2022-07-13 21:58:29,723 INFO L129 PetriNetUnfolder]: 170/964 cut-off events. [2022-07-13 21:58:29,723 INFO L130 PetriNetUnfolder]: For 48/48 co-relation queries the response was YES. [2022-07-13 21:58:29,743 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1019 conditions, 964 events. 170/964 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 4977 event pairs, 6 based on Foata normal form. 0/785 useless extension candidates. Maximal degree in co-relation 701. Up to 32 conditions per place. [2022-07-13 21:58:29,743 INFO L82 GeneralOperation]: Start removeDead. Operand has 350 places, 419 transitions, 882 flow [2022-07-13 21:58:29,754 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 350 places, 419 transitions, 882 flow [2022-07-13 21:58:29,755 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 21:58:29,755 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@62bd2bb9, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@318c214d [2022-07-13 21:58:29,755 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-07-13 21:58:29,762 INFO L129 PetriNetUnfolder]: 25/198 cut-off events. [2022-07-13 21:58:29,762 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-13 21:58:29,762 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:58:29,762 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] [2022-07-13 21:58:29,762 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-07-13 21:58:29,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:58:29,763 INFO L85 PathProgramCache]: Analyzing trace with hash 99825964, now seen corresponding path program 1 times [2022-07-13 21:58:29,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:58:29,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17808031] [2022-07-13 21:58:29,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:58:29,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:58:29,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:58:29,772 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-13 21:58:29,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:58:29,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17808031] [2022-07-13 21:58:29,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17808031] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:58:29,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:58:29,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 21:58:29,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202960303] [2022-07-13 21:58:29,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:58:29,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 21:58:29,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:58:29,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 21:58:29,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 21:58:29,774 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 343 out of 419 [2022-07-13 21:58:29,774 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 350 places, 419 transitions, 882 flow. Second operand has 2 states, 2 states have (on average 343.5) internal successors, (687), 2 states have internal predecessors, (687), 0 states have call successors, (0), 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-13 21:58:29,774 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:58:29,774 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 343 of 419 [2022-07-13 21:58:29,774 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:58:29,886 INFO L129 PetriNetUnfolder]: 40/825 cut-off events. [2022-07-13 21:58:29,886 INFO L130 PetriNetUnfolder]: For 122/122 co-relation queries the response was YES. [2022-07-13 21:58:29,900 INFO L84 FinitePrefix]: Finished finitePrefix Result has 917 conditions, 825 events. 40/825 cut-off events. For 122/122 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4698 event pairs, 6 based on Foata normal form. 427/1203 useless extension candidates. Maximal degree in co-relation 612. Up to 37 conditions per place. [2022-07-13 21:58:29,904 INFO L132 encePairwiseOnDemand]: 356/419 looper letters, 8 selfloop transitions, 0 changer transitions 0/351 dead transitions. [2022-07-13 21:58:29,904 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 351 transitions, 762 flow [2022-07-13 21:58:29,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 21:58:29,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-07-13 21:58:29,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 757 transitions. [2022-07-13 21:58:29,906 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9033412887828163 [2022-07-13 21:58:29,906 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 757 transitions. [2022-07-13 21:58:29,907 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 757 transitions. [2022-07-13 21:58:29,907 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:58:29,907 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 757 transitions. [2022-07-13 21:58:29,908 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 378.5) internal successors, (757), 2 states have internal predecessors, (757), 0 states have call successors, (0), 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-13 21:58:29,908 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 419.0) internal successors, (1257), 3 states have internal predecessors, (1257), 0 states have call successors, (0), 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-13 21:58:29,909 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 419.0) internal successors, (1257), 3 states have internal predecessors, (1257), 0 states have call successors, (0), 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-13 21:58:29,909 INFO L186 Difference]: Start difference. First operand has 350 places, 419 transitions, 882 flow. Second operand 2 states and 757 transitions. [2022-07-13 21:58:29,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 346 places, 351 transitions, 762 flow [2022-07-13 21:58:29,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 351 transitions, 762 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-07-13 21:58:29,913 INFO L242 Difference]: Finished difference. Result has 346 places, 351 transitions, 746 flow [2022-07-13 21:58:29,914 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=419, PETRI_DIFFERENCE_MINUEND_FLOW=746, PETRI_DIFFERENCE_MINUEND_PLACES=345, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=351, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=746, PETRI_PLACES=346, PETRI_TRANSITIONS=351} [2022-07-13 21:58:29,915 INFO L279 CegarLoopForPetriNet]: 350 programPoint places, -4 predicate places. [2022-07-13 21:58:29,915 INFO L495 AbstractCegarLoop]: Abstraction has has 346 places, 351 transitions, 746 flow [2022-07-13 21:58:29,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 343.5) internal successors, (687), 2 states have internal predecessors, (687), 0 states have call successors, (0), 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-13 21:58:29,915 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:58:29,915 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] [2022-07-13 21:58:29,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-13 21:58:29,916 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-07-13 21:58:29,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:58:29,916 INFO L85 PathProgramCache]: Analyzing trace with hash 311176877, now seen corresponding path program 1 times [2022-07-13 21:58:29,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:58:29,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917124101] [2022-07-13 21:58:29,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:58:29,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:58:29,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:58:29,928 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-13 21:58:29,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:58:29,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917124101] [2022-07-13 21:58:29,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917124101] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:58:29,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 21:58:29,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 21:58:29,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892494955] [2022-07-13 21:58:29,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:58:29,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 21:58:29,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:58:29,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 21:58:29,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 21:58:29,932 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 336 out of 419 [2022-07-13 21:58:29,932 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 346 places, 351 transitions, 746 flow. Second operand has 3 states, 3 states have (on average 337.0) internal successors, (1011), 3 states have internal predecessors, (1011), 0 states have call successors, (0), 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-13 21:58:29,932 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:58:29,932 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 336 of 419 [2022-07-13 21:58:29,932 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:58:30,178 INFO L129 PetriNetUnfolder]: 40/829 cut-off events. [2022-07-13 21:58:30,179 INFO L130 PetriNetUnfolder]: For 122/122 co-relation queries the response was YES. [2022-07-13 21:58:30,192 INFO L84 FinitePrefix]: Finished finitePrefix Result has 933 conditions, 829 events. 40/829 cut-off events. For 122/122 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4695 event pairs, 6 based on Foata normal form. 0/780 useless extension candidates. Maximal degree in co-relation 926. Up to 44 conditions per place. [2022-07-13 21:58:30,194 INFO L132 encePairwiseOnDemand]: 416/419 looper letters, 17 selfloop transitions, 2 changer transitions 0/355 dead transitions. [2022-07-13 21:58:30,195 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 355 transitions, 792 flow [2022-07-13 21:58:30,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 21:58:30,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-13 21:58:30,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1028 transitions. [2022-07-13 21:58:30,197 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8178202068416865 [2022-07-13 21:58:30,197 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1028 transitions. [2022-07-13 21:58:30,197 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1028 transitions. [2022-07-13 21:58:30,198 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:58:30,198 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1028 transitions. [2022-07-13 21:58:30,199 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 342.6666666666667) internal successors, (1028), 3 states have internal predecessors, (1028), 0 states have call successors, (0), 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-13 21:58:30,200 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 419.0) internal successors, (1676), 4 states have internal predecessors, (1676), 0 states have call successors, (0), 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-13 21:58:30,200 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 419.0) internal successors, (1676), 4 states have internal predecessors, (1676), 0 states have call successors, (0), 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-13 21:58:30,200 INFO L186 Difference]: Start difference. First operand has 346 places, 351 transitions, 746 flow. Second operand 3 states and 1028 transitions. [2022-07-13 21:58:30,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 355 transitions, 792 flow [2022-07-13 21:58:30,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 348 places, 355 transitions, 792 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-07-13 21:58:30,205 INFO L242 Difference]: Finished difference. Result has 349 places, 352 transitions, 758 flow [2022-07-13 21:58:30,205 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=419, PETRI_DIFFERENCE_MINUEND_FLOW=746, PETRI_DIFFERENCE_MINUEND_PLACES=346, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=349, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=758, PETRI_PLACES=349, PETRI_TRANSITIONS=352} [2022-07-13 21:58:30,205 INFO L279 CegarLoopForPetriNet]: 350 programPoint places, -1 predicate places. [2022-07-13 21:58:30,206 INFO L495 AbstractCegarLoop]: Abstraction has has 349 places, 352 transitions, 758 flow [2022-07-13 21:58:30,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 337.0) internal successors, (1011), 3 states have internal predecessors, (1011), 0 states have call successors, (0), 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-13 21:58:30,206 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:58:30,206 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] [2022-07-13 21:58:30,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-13 21:58:30,206 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-07-13 21:58:30,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:58:30,207 INFO L85 PathProgramCache]: Analyzing trace with hash -835847906, now seen corresponding path program 1 times [2022-07-13 21:58:30,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:58:30,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004420341] [2022-07-13 21:58:30,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:58:30,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:58:30,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:58:30,232 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:58:30,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:58:30,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004420341] [2022-07-13 21:58:30,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004420341] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 21:58:30,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [334070410] [2022-07-13 21:58:30,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:58:30,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:58:30,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 21:58:30,235 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 21:58:30,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-13 21:58:30,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:58:30,326 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 21:58:30,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 21:58:30,331 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-13 21:58:30,331 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 21:58:30,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [334070410] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:58:30,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 21:58:30,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-07-13 21:58:30,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602835692] [2022-07-13 21:58:30,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:58:30,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 21:58:30,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:58:30,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 21:58:30,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-13 21:58:30,333 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 336 out of 419 [2022-07-13 21:58:30,334 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 349 places, 352 transitions, 758 flow. Second operand has 3 states, 3 states have (on average 337.0) internal successors, (1011), 3 states have internal predecessors, (1011), 0 states have call successors, (0), 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-13 21:58:30,334 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:58:30,334 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 336 of 419 [2022-07-13 21:58:30,334 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:58:30,450 INFO L129 PetriNetUnfolder]: 37/773 cut-off events. [2022-07-13 21:58:30,451 INFO L130 PetriNetUnfolder]: For 113/113 co-relation queries the response was YES. [2022-07-13 21:58:30,467 INFO L84 FinitePrefix]: Finished finitePrefix Result has 897 conditions, 773 events. 37/773 cut-off events. For 113/113 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4322 event pairs, 6 based on Foata normal form. 0/729 useless extension candidates. Maximal degree in co-relation 888. Up to 56 conditions per place. [2022-07-13 21:58:30,470 INFO L132 encePairwiseOnDemand]: 416/419 looper letters, 17 selfloop transitions, 2 changer transitions 0/356 dead transitions. [2022-07-13 21:58:30,470 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 351 places, 356 transitions, 804 flow [2022-07-13 21:58:30,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 21:58:30,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-13 21:58:30,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1028 transitions. [2022-07-13 21:58:30,472 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8178202068416865 [2022-07-13 21:58:30,472 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1028 transitions. [2022-07-13 21:58:30,472 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1028 transitions. [2022-07-13 21:58:30,473 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:58:30,473 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1028 transitions. [2022-07-13 21:58:30,474 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 342.6666666666667) internal successors, (1028), 3 states have internal predecessors, (1028), 0 states have call successors, (0), 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-13 21:58:30,475 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 419.0) internal successors, (1676), 4 states have internal predecessors, (1676), 0 states have call successors, (0), 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-13 21:58:30,475 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 419.0) internal successors, (1676), 4 states have internal predecessors, (1676), 0 states have call successors, (0), 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-13 21:58:30,475 INFO L186 Difference]: Start difference. First operand has 349 places, 352 transitions, 758 flow. Second operand 3 states and 1028 transitions. [2022-07-13 21:58:30,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 351 places, 356 transitions, 804 flow [2022-07-13 21:58:30,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 350 places, 356 transitions, 802 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-07-13 21:58:30,480 INFO L242 Difference]: Finished difference. Result has 351 places, 353 transitions, 768 flow [2022-07-13 21:58:30,481 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=419, PETRI_DIFFERENCE_MINUEND_FLOW=756, PETRI_DIFFERENCE_MINUEND_PLACES=348, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=352, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=350, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=768, PETRI_PLACES=351, PETRI_TRANSITIONS=353} [2022-07-13 21:58:30,481 INFO L279 CegarLoopForPetriNet]: 350 programPoint places, 1 predicate places. [2022-07-13 21:58:30,482 INFO L495 AbstractCegarLoop]: Abstraction has has 351 places, 353 transitions, 768 flow [2022-07-13 21:58:30,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 337.0) internal successors, (1011), 3 states have internal predecessors, (1011), 0 states have call successors, (0), 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-13 21:58:30,482 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:58:30,482 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] [2022-07-13 21:58:30,501 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-13 21:58:30,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-07-13 21:58:30,701 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-07-13 21:58:30,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:58:30,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1049280298, now seen corresponding path program 1 times [2022-07-13 21:58:30,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:58:30,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243036909] [2022-07-13 21:58:30,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:58:30,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:58:30,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:58:30,737 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:58:30,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:58:30,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243036909] [2022-07-13 21:58:30,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243036909] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 21:58:30,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [110328584] [2022-07-13 21:58:30,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:58:30,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:58:30,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 21:58:30,739 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 21:58:30,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-13 21:58:30,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:58:30,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 21:58:30,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 21:58:30,839 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:58:30,839 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 21:58:30,856 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:58:30,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [110328584] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 21:58:30,856 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 21:58:30,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-07-13 21:58:30,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234164015] [2022-07-13 21:58:30,857 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 21:58:30,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 21:58:30,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:58:30,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 21:58:30,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-13 21:58:30,859 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 335 out of 419 [2022-07-13 21:58:30,860 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 351 places, 353 transitions, 768 flow. Second operand has 10 states, 10 states have (on average 337.1) internal successors, (3371), 10 states have internal predecessors, (3371), 0 states have call successors, (0), 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-13 21:58:30,860 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:58:30,860 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 335 of 419 [2022-07-13 21:58:30,860 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-13 21:58:31,011 INFO L129 PetriNetUnfolder]: 37/780 cut-off events. [2022-07-13 21:58:31,011 INFO L130 PetriNetUnfolder]: For 123/123 co-relation queries the response was YES. [2022-07-13 21:58:31,025 INFO L84 FinitePrefix]: Finished finitePrefix Result has 910 conditions, 780 events. 37/780 cut-off events. For 123/123 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4326 event pairs, 6 based on Foata normal form. 2/742 useless extension candidates. Maximal degree in co-relation 900. Up to 41 conditions per place. [2022-07-13 21:58:31,028 INFO L132 encePairwiseOnDemand]: 413/419 looper letters, 18 selfloop transitions, 9 changer transitions 0/363 dead transitions. [2022-07-13 21:58:31,029 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 359 places, 363 transitions, 844 flow [2022-07-13 21:58:31,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 21:58:31,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-13 21:58:31,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 3044 transitions. [2022-07-13 21:58:31,031 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8072129408644921 [2022-07-13 21:58:31,031 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 3044 transitions. [2022-07-13 21:58:31,031 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 3044 transitions. [2022-07-13 21:58:31,032 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 21:58:31,032 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 3044 transitions. [2022-07-13 21:58:31,034 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 338.22222222222223) internal successors, (3044), 9 states have internal predecessors, (3044), 0 states have call successors, (0), 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-13 21:58:31,036 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 419.0) internal successors, (4190), 10 states have internal predecessors, (4190), 0 states have call successors, (0), 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-13 21:58:31,037 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 419.0) internal successors, (4190), 10 states have internal predecessors, (4190), 0 states have call successors, (0), 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-13 21:58:31,037 INFO L186 Difference]: Start difference. First operand has 351 places, 353 transitions, 768 flow. Second operand 9 states and 3044 transitions. [2022-07-13 21:58:31,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 359 places, 363 transitions, 844 flow [2022-07-13 21:58:31,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 363 transitions, 842 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-07-13 21:58:31,043 INFO L242 Difference]: Finished difference. Result has 361 places, 359 transitions, 816 flow [2022-07-13 21:58:31,044 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=419, PETRI_DIFFERENCE_MINUEND_FLOW=766, PETRI_DIFFERENCE_MINUEND_PLACES=350, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=347, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=816, PETRI_PLACES=361, PETRI_TRANSITIONS=359} [2022-07-13 21:58:31,044 INFO L279 CegarLoopForPetriNet]: 350 programPoint places, 11 predicate places. [2022-07-13 21:58:31,044 INFO L495 AbstractCegarLoop]: Abstraction has has 361 places, 359 transitions, 816 flow [2022-07-13 21:58:31,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 337.1) internal successors, (3371), 10 states have internal predecessors, (3371), 0 states have call successors, (0), 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-13 21:58:31,045 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-13 21:58:31,045 INFO L200 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 21:58:31,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-13 21:58:31,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:58:31,259 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-07-13 21:58:31,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 21:58:31,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1226572234, now seen corresponding path program 2 times [2022-07-13 21:58:31,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 21:58:31,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995181261] [2022-07-13 21:58:31,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 21:58:31,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 21:58:31,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 21:58:31,311 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 21:58:31,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 21:58:31,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995181261] [2022-07-13 21:58:31,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995181261] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 21:58:31,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [16758967] [2022-07-13 21:58:31,312 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 21:58:31,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 21:58:31,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 21:58:31,313 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 21:58:31,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-13 21:58:31,400 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-13 21:58:31,401 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 21:58:31,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-13 21:58:31,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 21:58:31,420 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-07-13 21:58:31,518 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-13 21:58:31,518 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-13 21:58:31,551 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-13 21:58:31,623 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-07-13 21:58:31,665 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-13 21:58:31,665 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 21:58:31,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [16758967] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 21:58:31,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 21:58:31,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [9] total 19 [2022-07-13 21:58:31,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619741971] [2022-07-13 21:58:31,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 21:58:31,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-13 21:58:31,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 21:58:31,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-13 21:58:31,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2022-07-13 21:58:31,670 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 282 out of 419 [2022-07-13 21:58:31,671 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 361 places, 359 transitions, 816 flow. Second operand has 12 states, 12 states have (on average 284.3333333333333) internal successors, (3412), 12 states have internal predecessors, (3412), 0 states have call successors, (0), 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-13 21:58:31,671 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-13 21:58:31,671 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 282 of 419 [2022-07-13 21:58:31,671 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand