./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-commit-1.wvr.c --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b8dbc81d 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 ../../../trunk/examples/svcomp/weaver/popl20-commit-1.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4b2db95108d1ec3739bf941ab9d238fd5c3dd7467faa747c6c0552ae2048ee95 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 20:10:39,335 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 20:10:39,337 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 20:10:39,363 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 20:10:39,364 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 20:10:39,364 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 20:10:39,365 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 20:10:39,366 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 20:10:39,368 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 20:10:39,368 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 20:10:39,369 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 20:10:39,370 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 20:10:39,370 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 20:10:39,370 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 20:10:39,371 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 20:10:39,372 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 20:10:39,372 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 20:10:39,373 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 20:10:39,374 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 20:10:39,375 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 20:10:39,385 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 20:10:39,389 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 20:10:39,391 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 20:10:39,392 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 20:10:39,395 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 20:10:39,398 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 20:10:39,399 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 20:10:39,399 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 20:10:39,400 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 20:10:39,401 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 20:10:39,401 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 20:10:39,402 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 20:10:39,404 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 20:10:39,404 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 20:10:39,405 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 20:10:39,405 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 20:10:39,406 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 20:10:39,406 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 20:10:39,407 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 20:10:39,407 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 20:10:39,408 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 20:10:39,409 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-30 20:10:39,436 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 20:10:39,436 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 20:10:39,437 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 20:10:39,437 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 20:10:39,438 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 20:10:39,438 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 20:10:39,438 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 20:10:39,439 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 20:10:39,439 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 20:10:39,439 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 20:10:39,440 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 20:10:39,440 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 20:10:39,440 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 20:10:39,440 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 20:10:39,440 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-30 20:10:39,440 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 20:10:39,440 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-30 20:10:39,441 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 20:10:39,441 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-08-30 20:10:39,441 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 20:10:39,441 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-30 20:10:39,441 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 20:10:39,441 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 20:10:39,441 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 20:10:39,442 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 20:10:39,442 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 20:10:39,442 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 20:10:39,442 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-30 20:10:39,442 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 20:10:39,442 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 20:10:39,442 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 20:10:39,443 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-30 20:10:39,443 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 20:10:39,443 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 20:10:39,443 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 20:10:39,443 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.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 -> 4b2db95108d1ec3739bf941ab9d238fd5c3dd7467faa747c6c0552ae2048ee95 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-08-30 20:10:39,651 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 20:10:39,666 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 20:10:39,667 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 20:10:39,668 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 20:10:39,668 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 20:10:39,669 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-commit-1.wvr.c [2023-08-30 20:10:40,560 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 20:10:40,739 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 20:10:40,739 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-commit-1.wvr.c [2023-08-30 20:10:40,743 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8ae2f250/2f5a093b11294b9582764eadfac2f497/FLAGb717f08b9 [2023-08-30 20:10:40,754 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8ae2f250/2f5a093b11294b9582764eadfac2f497 [2023-08-30 20:10:40,756 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 20:10:40,756 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 20:10:40,757 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 20:10:40,757 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 20:10:40,759 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 20:10:40,759 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 08:10:40" (1/1) ... [2023-08-30 20:10:40,760 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49a52872 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:10:40, skipping insertion in model container [2023-08-30 20:10:40,762 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 08:10:40" (1/1) ... [2023-08-30 20:10:40,766 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 20:10:40,780 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 20:10:40,913 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-commit-1.wvr.c[4604,4617] [2023-08-30 20:10:40,920 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 20:10:40,932 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 20:10:40,962 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-commit-1.wvr.c[4604,4617] [2023-08-30 20:10:40,974 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 20:10:40,981 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 20:10:40,982 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 20:10:40,986 INFO L208 MainTranslator]: Completed translation [2023-08-30 20:10:40,987 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:10:40 WrapperNode [2023-08-30 20:10:40,987 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 20:10:40,988 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 20:10:40,988 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 20:10:40,988 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 20:10:40,993 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:10:40" (1/1) ... [2023-08-30 20:10:41,008 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:10:40" (1/1) ... [2023-08-30 20:10:41,046 INFO L138 Inliner]: procedures = 25, calls = 68, calls flagged for inlining = 20, calls inlined = 24, statements flattened = 347 [2023-08-30 20:10:41,046 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 20:10:41,047 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 20:10:41,047 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 20:10:41,048 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 20:10:41,054 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:10:40" (1/1) ... [2023-08-30 20:10:41,054 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:10:40" (1/1) ... [2023-08-30 20:10:41,061 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:10:40" (1/1) ... [2023-08-30 20:10:41,064 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:10:40" (1/1) ... [2023-08-30 20:10:41,070 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:10:40" (1/1) ... [2023-08-30 20:10:41,082 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:10:40" (1/1) ... [2023-08-30 20:10:41,085 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:10:40" (1/1) ... [2023-08-30 20:10:41,089 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:10:40" (1/1) ... [2023-08-30 20:10:41,091 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 20:10:41,092 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 20:10:41,093 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 20:10:41,093 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 20:10:41,093 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:10:40" (1/1) ... [2023-08-30 20:10:41,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 20:10:41,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 20:10:41,118 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) [2023-08-30 20:10:41,120 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 [2023-08-30 20:10:41,142 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 20:10:41,143 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 20:10:41,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 20:10:41,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-30 20:10:41,147 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-30 20:10:41,165 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-30 20:10:41,165 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-30 20:10:41,165 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-30 20:10:41,165 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-30 20:10:41,165 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-30 20:10:41,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 20:10:41,165 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 20:10:41,165 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 20:10:41,166 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-30 20:10:41,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 20:10:41,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 20:10:41,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 20:10:41,167 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 20:10:41,279 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 20:10:41,281 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 20:10:41,616 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 20:10:41,781 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 20:10:41,781 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2023-08-30 20:10:41,783 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 08:10:41 BoogieIcfgContainer [2023-08-30 20:10:41,783 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 20:10:41,785 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 20:10:41,785 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 20:10:41,787 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 20:10:41,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 08:10:40" (1/3) ... [2023-08-30 20:10:41,788 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c18bc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 08:10:41, skipping insertion in model container [2023-08-30 20:10:41,788 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 08:10:40" (2/3) ... [2023-08-30 20:10:41,788 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c18bc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 08:10:41, skipping insertion in model container [2023-08-30 20:10:41,788 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 08:10:41" (3/3) ... [2023-08-30 20:10:41,789 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-commit-1.wvr.c [2023-08-30 20:10:41,794 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-30 20:10:41,799 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 20:10:41,800 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-30 20:10:41,800 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 20:10:41,860 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-08-30 20:10:41,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 239 places, 248 transitions, 520 flow [2023-08-30 20:10:41,977 INFO L130 PetriNetUnfolder]: 19/245 cut-off events. [2023-08-30 20:10:41,977 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-30 20:10:41,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 258 conditions, 245 events. 19/245 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 142 event pairs, 0 based on Foata normal form. 0/225 useless extension candidates. Maximal degree in co-relation 209. Up to 2 conditions per place. [2023-08-30 20:10:41,982 INFO L82 GeneralOperation]: Start removeDead. Operand has 239 places, 248 transitions, 520 flow [2023-08-30 20:10:41,988 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 226 places, 235 transitions, 488 flow [2023-08-30 20:10:41,991 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 20:10:42,008 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 226 places, 235 transitions, 488 flow [2023-08-30 20:10:42,011 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 226 places, 235 transitions, 488 flow [2023-08-30 20:10:42,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 226 places, 235 transitions, 488 flow [2023-08-30 20:10:42,060 INFO L130 PetriNetUnfolder]: 19/235 cut-off events. [2023-08-30 20:10:42,061 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-30 20:10:42,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 248 conditions, 235 events. 19/235 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 140 event pairs, 0 based on Foata normal form. 0/216 useless extension candidates. Maximal degree in co-relation 209. Up to 2 conditions per place. [2023-08-30 20:10:42,064 INFO L119 LiptonReduction]: Number of co-enabled transitions 1460 [2023-08-30 20:10:48,749 INFO L134 LiptonReduction]: Checked pairs total: 3005 [2023-08-30 20:10:48,749 INFO L136 LiptonReduction]: Total number of compositions: 247 [2023-08-30 20:10:48,758 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 20:10:48,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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1eb0cd5d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 20:10:48,762 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-30 20:10:48,766 INFO L130 PetriNetUnfolder]: 6/29 cut-off events. [2023-08-30 20:10:48,767 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2023-08-30 20:10:48,767 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:10:48,767 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 20:10:48,767 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-30 20:10:48,770 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:10:48,770 INFO L85 PathProgramCache]: Analyzing trace with hash 169519787, now seen corresponding path program 1 times [2023-08-30 20:10:48,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:10:48,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984791277] [2023-08-30 20:10:48,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:10:48,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:10:48,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:10:49,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:10:49,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:10:49,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984791277] [2023-08-30 20:10:49,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984791277] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 20:10:49,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 20:10:49,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 20:10:49,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489608133] [2023-08-30 20:10:49,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 20:10:49,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 20:10:49,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:10:49,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 20:10:49,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-30 20:10:49,518 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 495 [2023-08-30 20:10:49,521 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 30 transitions, 78 flow. Second operand has 5 states, 5 states have (on average 206.8) internal successors, (1034), 5 states have internal predecessors, (1034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:10:49,521 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:10:49,521 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 495 [2023-08-30 20:10:49,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:10:49,670 INFO L130 PetriNetUnfolder]: 564/838 cut-off events. [2023-08-30 20:10:49,671 INFO L131 PetriNetUnfolder]: For 93/93 co-relation queries the response was YES. [2023-08-30 20:10:49,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1782 conditions, 838 events. 564/838 cut-off events. For 93/93 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3025 event pairs, 130 based on Foata normal form. 2/616 useless extension candidates. Maximal degree in co-relation 1134. Up to 602 conditions per place. [2023-08-30 20:10:49,677 INFO L137 encePairwiseOnDemand]: 485/495 looper letters, 57 selfloop transitions, 12 changer transitions 2/71 dead transitions. [2023-08-30 20:10:49,677 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 71 transitions, 335 flow [2023-08-30 20:10:49,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 20:10:49,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 20:10:49,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 885 transitions. [2023-08-30 20:10:49,688 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44696969696969696 [2023-08-30 20:10:49,688 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 885 transitions. [2023-08-30 20:10:49,689 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 885 transitions. [2023-08-30 20:10:49,690 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:10:49,692 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 885 transitions. [2023-08-30 20:10:49,695 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 221.25) internal successors, (885), 4 states have internal predecessors, (885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:10:49,699 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 495.0) internal successors, (2475), 5 states have internal predecessors, (2475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:10:49,700 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 495.0) internal successors, (2475), 5 states have internal predecessors, (2475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:10:49,701 INFO L175 Difference]: Start difference. First operand has 34 places, 30 transitions, 78 flow. Second operand 4 states and 885 transitions. [2023-08-30 20:10:49,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 71 transitions, 335 flow [2023-08-30 20:10:49,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 71 transitions, 301 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-08-30 20:10:49,705 INFO L231 Difference]: Finished difference. Result has 33 places, 41 transitions, 149 flow [2023-08-30 20:10:49,706 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=149, PETRI_PLACES=33, PETRI_TRANSITIONS=41} [2023-08-30 20:10:49,708 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, -1 predicate places. [2023-08-30 20:10:49,709 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 41 transitions, 149 flow [2023-08-30 20:10:49,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 206.8) internal successors, (1034), 5 states have internal predecessors, (1034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:10:49,709 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:10:49,709 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 20:10:49,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 20:10:49,710 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-30 20:10:49,710 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:10:49,710 INFO L85 PathProgramCache]: Analyzing trace with hash 790486479, now seen corresponding path program 1 times [2023-08-30 20:10:49,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:10:49,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127537686] [2023-08-30 20:10:49,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:10:49,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:10:49,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:10:49,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:10:49,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:10:49,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127537686] [2023-08-30 20:10:49,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127537686] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 20:10:49,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 20:10:49,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 20:10:49,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472474092] [2023-08-30 20:10:49,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 20:10:49,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 20:10:49,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:10:49,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 20:10:49,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 20:10:49,863 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 495 [2023-08-30 20:10:49,864 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 41 transitions, 149 flow. Second operand has 4 states, 4 states have (on average 211.25) internal successors, (845), 4 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:10:49,865 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:10:49,865 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 495 [2023-08-30 20:10:49,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:10:50,030 INFO L130 PetriNetUnfolder]: 680/1058 cut-off events. [2023-08-30 20:10:50,030 INFO L131 PetriNetUnfolder]: For 236/236 co-relation queries the response was YES. [2023-08-30 20:10:50,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2588 conditions, 1058 events. 680/1058 cut-off events. For 236/236 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 3978 event pairs, 453 based on Foata normal form. 50/1042 useless extension candidates. Maximal degree in co-relation 1563. Up to 837 conditions per place. [2023-08-30 20:10:50,035 INFO L137 encePairwiseOnDemand]: 489/495 looper letters, 38 selfloop transitions, 2 changer transitions 24/64 dead transitions. [2023-08-30 20:10:50,035 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 64 transitions, 353 flow [2023-08-30 20:10:50,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 20:10:50,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 20:10:50,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 878 transitions. [2023-08-30 20:10:50,037 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44343434343434346 [2023-08-30 20:10:50,037 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 878 transitions. [2023-08-30 20:10:50,038 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 878 transitions. [2023-08-30 20:10:50,038 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:10:50,038 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 878 transitions. [2023-08-30 20:10:50,040 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 219.5) internal successors, (878), 4 states have internal predecessors, (878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:10:50,042 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 495.0) internal successors, (2475), 5 states have internal predecessors, (2475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:10:50,043 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 495.0) internal successors, (2475), 5 states have internal predecessors, (2475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:10:50,043 INFO L175 Difference]: Start difference. First operand has 33 places, 41 transitions, 149 flow. Second operand 4 states and 878 transitions. [2023-08-30 20:10:50,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 64 transitions, 353 flow [2023-08-30 20:10:50,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 64 transitions, 353 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 20:10:50,046 INFO L231 Difference]: Finished difference. Result has 37 places, 40 transitions, 159 flow [2023-08-30 20:10:50,046 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=159, PETRI_PLACES=37, PETRI_TRANSITIONS=40} [2023-08-30 20:10:50,047 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 3 predicate places. [2023-08-30 20:10:50,047 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 40 transitions, 159 flow [2023-08-30 20:10:50,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 211.25) internal successors, (845), 4 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:10:50,048 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:10:50,048 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 20:10:50,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 20:10:50,048 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-30 20:10:50,050 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:10:50,050 INFO L85 PathProgramCache]: Analyzing trace with hash 611376253, now seen corresponding path program 1 times [2023-08-30 20:10:50,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:10:50,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169107348] [2023-08-30 20:10:50,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:10:50,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:10:50,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:10:50,196 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 20:10:50,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:10:50,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169107348] [2023-08-30 20:10:50,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169107348] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 20:10:50,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 20:10:50,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 20:10:50,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622672103] [2023-08-30 20:10:50,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 20:10:50,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 20:10:50,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:10:50,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 20:10:50,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 20:10:50,206 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 495 [2023-08-30 20:10:50,207 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 40 transitions, 159 flow. Second operand has 3 states, 3 states have (on average 221.33333333333334) internal successors, (664), 3 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:10:50,207 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:10:50,208 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 495 [2023-08-30 20:10:50,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:10:50,332 INFO L130 PetriNetUnfolder]: 623/959 cut-off events. [2023-08-30 20:10:50,332 INFO L131 PetriNetUnfolder]: For 367/367 co-relation queries the response was YES. [2023-08-30 20:10:50,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2455 conditions, 959 events. 623/959 cut-off events. For 367/367 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3602 event pairs, 240 based on Foata normal form. 70/1029 useless extension candidates. Maximal degree in co-relation 2439. Up to 512 conditions per place. [2023-08-30 20:10:50,336 INFO L137 encePairwiseOnDemand]: 492/495 looper letters, 54 selfloop transitions, 2 changer transitions 0/56 dead transitions. [2023-08-30 20:10:50,336 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 56 transitions, 314 flow [2023-08-30 20:10:50,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 20:10:50,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 20:10:50,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 691 transitions. [2023-08-30 20:10:50,337 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4653198653198653 [2023-08-30 20:10:50,338 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 691 transitions. [2023-08-30 20:10:50,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 691 transitions. [2023-08-30 20:10:50,338 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:10:50,338 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 691 transitions. [2023-08-30 20:10:50,339 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 230.33333333333334) internal successors, (691), 3 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:10:50,341 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 495.0) internal successors, (1980), 4 states have internal predecessors, (1980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:10:50,342 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 495.0) internal successors, (1980), 4 states have internal predecessors, (1980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:10:50,342 INFO L175 Difference]: Start difference. First operand has 37 places, 40 transitions, 159 flow. Second operand 3 states and 691 transitions. [2023-08-30 20:10:50,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 56 transitions, 314 flow [2023-08-30 20:10:50,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 56 transitions, 310 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-30 20:10:50,345 INFO L231 Difference]: Finished difference. Result has 38 places, 39 transitions, 157 flow [2023-08-30 20:10:50,345 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=157, PETRI_PLACES=38, PETRI_TRANSITIONS=39} [2023-08-30 20:10:50,346 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 4 predicate places. [2023-08-30 20:10:50,348 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 39 transitions, 157 flow [2023-08-30 20:10:50,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 221.33333333333334) internal successors, (664), 3 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:10:50,349 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:10:50,349 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 20:10:50,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 20:10:50,349 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-30 20:10:50,350 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:10:50,350 INFO L85 PathProgramCache]: Analyzing trace with hash 654922567, now seen corresponding path program 1 times [2023-08-30 20:10:50,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:10:50,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303252531] [2023-08-30 20:10:50,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:10:50,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:10:50,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:10:50,483 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 20:10:50,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:10:50,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303252531] [2023-08-30 20:10:50,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303252531] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 20:10:50,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 20:10:50,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 20:10:50,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727570990] [2023-08-30 20:10:50,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 20:10:50,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 20:10:50,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:10:50,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 20:10:50,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 20:10:50,490 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 495 [2023-08-30 20:10:50,492 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 39 transitions, 157 flow. Second operand has 3 states, 3 states have (on average 223.33333333333334) internal successors, (670), 3 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:10:50,492 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:10:50,493 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 495 [2023-08-30 20:10:50,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:10:50,602 INFO L130 PetriNetUnfolder]: 625/969 cut-off events. [2023-08-30 20:10:50,603 INFO L131 PetriNetUnfolder]: For 442/442 co-relation queries the response was YES. [2023-08-30 20:10:50,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2537 conditions, 969 events. 625/969 cut-off events. For 442/442 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3620 event pairs, 224 based on Foata normal form. 44/1013 useless extension candidates. Maximal degree in co-relation 2152. Up to 520 conditions per place. [2023-08-30 20:10:50,606 INFO L137 encePairwiseOnDemand]: 492/495 looper letters, 47 selfloop transitions, 2 changer transitions 6/55 dead transitions. [2023-08-30 20:10:50,606 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 55 transitions, 306 flow [2023-08-30 20:10:50,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 20:10:50,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 20:10:50,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 699 transitions. [2023-08-30 20:10:50,608 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4707070707070707 [2023-08-30 20:10:50,608 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 699 transitions. [2023-08-30 20:10:50,608 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 699 transitions. [2023-08-30 20:10:50,609 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:10:50,609 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 699 transitions. [2023-08-30 20:10:50,610 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 233.0) internal successors, (699), 3 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:10:50,612 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 495.0) internal successors, (1980), 4 states have internal predecessors, (1980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:10:50,613 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 495.0) internal successors, (1980), 4 states have internal predecessors, (1980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:10:50,613 INFO L175 Difference]: Start difference. First operand has 38 places, 39 transitions, 157 flow. Second operand 3 states and 699 transitions. [2023-08-30 20:10:50,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 55 transitions, 306 flow [2023-08-30 20:10:50,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 55 transitions, 304 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 20:10:50,614 INFO L231 Difference]: Finished difference. Result has 40 places, 38 transitions, 157 flow [2023-08-30 20:10:50,614 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=157, PETRI_PLACES=40, PETRI_TRANSITIONS=38} [2023-08-30 20:10:50,615 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 6 predicate places. [2023-08-30 20:10:50,615 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 38 transitions, 157 flow [2023-08-30 20:10:50,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 223.33333333333334) internal successors, (670), 3 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:10:50,616 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:10:50,616 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 20:10:50,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 20:10:50,616 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-30 20:10:50,616 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:10:50,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1525535317, now seen corresponding path program 1 times [2023-08-30 20:10:50,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:10:50,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676293961] [2023-08-30 20:10:50,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:10:50,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:10:50,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:10:50,699 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 20:10:50,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:10:50,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676293961] [2023-08-30 20:10:50,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676293961] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 20:10:50,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 20:10:50,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 20:10:50,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901181871] [2023-08-30 20:10:50,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 20:10:50,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 20:10:50,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:10:50,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 20:10:50,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 20:10:50,748 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 495 [2023-08-30 20:10:50,749 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 38 transitions, 157 flow. Second operand has 4 states, 4 states have (on average 212.0) internal successors, (848), 4 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:10:50,749 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:10:50,749 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 495 [2023-08-30 20:10:50,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:10:50,915 INFO L130 PetriNetUnfolder]: 883/1411 cut-off events. [2023-08-30 20:10:50,915 INFO L131 PetriNetUnfolder]: For 762/762 co-relation queries the response was YES. [2023-08-30 20:10:50,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3767 conditions, 1411 events. 883/1411 cut-off events. For 762/762 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 5924 event pairs, 701 based on Foata normal form. 26/1437 useless extension candidates. Maximal degree in co-relation 2284. Up to 965 conditions per place. [2023-08-30 20:10:50,920 INFO L137 encePairwiseOnDemand]: 490/495 looper letters, 34 selfloop transitions, 3 changer transitions 25/62 dead transitions. [2023-08-30 20:10:50,920 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 62 transitions, 361 flow [2023-08-30 20:10:50,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 20:10:50,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 20:10:50,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 879 transitions. [2023-08-30 20:10:50,922 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44393939393939397 [2023-08-30 20:10:50,922 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 879 transitions. [2023-08-30 20:10:50,922 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 879 transitions. [2023-08-30 20:10:50,923 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:10:50,923 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 879 transitions. [2023-08-30 20:10:50,925 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 219.75) internal successors, (879), 4 states have internal predecessors, (879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:10:50,928 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 495.0) internal successors, (2475), 5 states have internal predecessors, (2475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:10:50,929 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 495.0) internal successors, (2475), 5 states have internal predecessors, (2475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:10:50,929 INFO L175 Difference]: Start difference. First operand has 40 places, 38 transitions, 157 flow. Second operand 4 states and 879 transitions. [2023-08-30 20:10:50,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 62 transitions, 361 flow [2023-08-30 20:10:50,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 62 transitions, 359 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 20:10:50,931 INFO L231 Difference]: Finished difference. Result has 43 places, 37 transitions, 161 flow [2023-08-30 20:10:50,931 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=161, PETRI_PLACES=43, PETRI_TRANSITIONS=37} [2023-08-30 20:10:50,932 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 9 predicate places. [2023-08-30 20:10:50,932 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 37 transitions, 161 flow [2023-08-30 20:10:50,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 212.0) internal successors, (848), 4 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:10:50,933 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:10:50,933 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 20:10:50,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 20:10:50,933 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-30 20:10:50,933 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:10:50,934 INFO L85 PathProgramCache]: Analyzing trace with hash -424741139, now seen corresponding path program 1 times [2023-08-30 20:10:50,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:10:50,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612510123] [2023-08-30 20:10:50,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:10:50,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:10:50,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:10:51,010 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-30 20:10:51,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:10:51,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612510123] [2023-08-30 20:10:51,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612510123] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 20:10:51,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 20:10:51,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 20:10:51,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755803888] [2023-08-30 20:10:51,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 20:10:51,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 20:10:51,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:10:51,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 20:10:51,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 20:10:51,047 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 495 [2023-08-30 20:10:51,048 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 37 transitions, 161 flow. Second operand has 4 states, 4 states have (on average 212.25) internal successors, (849), 4 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:10:51,048 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:10:51,048 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 495 [2023-08-30 20:10:51,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:10:51,175 INFO L130 PetriNetUnfolder]: 634/996 cut-off events. [2023-08-30 20:10:51,175 INFO L131 PetriNetUnfolder]: For 575/575 co-relation queries the response was YES. [2023-08-30 20:10:51,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2702 conditions, 996 events. 634/996 cut-off events. For 575/575 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3749 event pairs, 505 based on Foata normal form. 18/1014 useless extension candidates. Maximal degree in co-relation 2668. Up to 831 conditions per place. [2023-08-30 20:10:51,178 INFO L137 encePairwiseOnDemand]: 487/495 looper letters, 30 selfloop transitions, 6 changer transitions 17/53 dead transitions. [2023-08-30 20:10:51,178 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 53 transitions, 307 flow [2023-08-30 20:10:51,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 20:10:51,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 20:10:51,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1081 transitions. [2023-08-30 20:10:51,181 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43676767676767675 [2023-08-30 20:10:51,181 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1081 transitions. [2023-08-30 20:10:51,181 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1081 transitions. [2023-08-30 20:10:51,181 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:10:51,181 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1081 transitions. [2023-08-30 20:10:51,183 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 216.2) internal successors, (1081), 5 states have internal predecessors, (1081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:10:51,186 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 495.0) internal successors, (2970), 6 states have internal predecessors, (2970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:10:51,186 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 495.0) internal successors, (2970), 6 states have internal predecessors, (2970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:10:51,186 INFO L175 Difference]: Start difference. First operand has 43 places, 37 transitions, 161 flow. Second operand 5 states and 1081 transitions. [2023-08-30 20:10:51,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 53 transitions, 307 flow [2023-08-30 20:10:51,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 53 transitions, 297 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-30 20:10:51,190 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 166 flow [2023-08-30 20:10:51,190 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=166, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2023-08-30 20:10:51,192 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 12 predicate places. [2023-08-30 20:10:51,193 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 166 flow [2023-08-30 20:10:51,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 212.25) internal successors, (849), 4 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:10:51,193 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:10:51,193 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 20:10:51,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 20:10:51,193 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-30 20:10:51,194 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:10:51,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1608617032, now seen corresponding path program 1 times [2023-08-30 20:10:51,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:10:51,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430101763] [2023-08-30 20:10:51,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:10:51,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:10:51,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:10:51,338 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-30 20:10:51,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:10:51,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430101763] [2023-08-30 20:10:51,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430101763] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 20:10:51,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 20:10:51,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 20:10:51,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454064307] [2023-08-30 20:10:51,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 20:10:51,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 20:10:51,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:10:51,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 20:10:51,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 20:10:51,344 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 495 [2023-08-30 20:10:51,345 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 166 flow. Second operand has 3 states, 3 states have (on average 224.66666666666666) internal successors, (674), 3 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:10:51,345 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:10:51,345 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 495 [2023-08-30 20:10:51,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:10:51,425 INFO L130 PetriNetUnfolder]: 353/547 cut-off events. [2023-08-30 20:10:51,425 INFO L131 PetriNetUnfolder]: For 349/349 co-relation queries the response was YES. [2023-08-30 20:10:51,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1486 conditions, 547 events. 353/547 cut-off events. For 349/349 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1604 event pairs, 139 based on Foata normal form. 14/561 useless extension candidates. Maximal degree in co-relation 1435. Up to 460 conditions per place. [2023-08-30 20:10:51,428 INFO L137 encePairwiseOnDemand]: 492/495 looper letters, 37 selfloop transitions, 2 changer transitions 7/46 dead transitions. [2023-08-30 20:10:51,428 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 46 transitions, 283 flow [2023-08-30 20:10:51,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 20:10:51,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 20:10:51,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 689 transitions. [2023-08-30 20:10:51,430 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.463973063973064 [2023-08-30 20:10:51,430 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 689 transitions. [2023-08-30 20:10:51,430 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 689 transitions. [2023-08-30 20:10:51,430 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:10:51,430 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 689 transitions. [2023-08-30 20:10:51,431 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 229.66666666666666) internal successors, (689), 3 states have internal predecessors, (689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:10:51,433 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 495.0) internal successors, (1980), 4 states have internal predecessors, (1980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:10:51,433 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 495.0) internal successors, (1980), 4 states have internal predecessors, (1980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:10:51,434 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 166 flow. Second operand 3 states and 689 transitions. [2023-08-30 20:10:51,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 46 transitions, 283 flow [2023-08-30 20:10:51,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 46 transitions, 261 flow, removed 3 selfloop flow, removed 4 redundant places. [2023-08-30 20:10:51,435 INFO L231 Difference]: Finished difference. Result has 45 places, 37 transitions, 158 flow [2023-08-30 20:10:51,436 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=158, PETRI_PLACES=45, PETRI_TRANSITIONS=37} [2023-08-30 20:10:51,436 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 11 predicate places. [2023-08-30 20:10:51,436 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 37 transitions, 158 flow [2023-08-30 20:10:51,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 224.66666666666666) internal successors, (674), 3 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:10:51,438 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:10:51,438 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 20:10:51,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 20:10:51,438 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-30 20:10:51,438 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:10:51,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1743219548, now seen corresponding path program 1 times [2023-08-30 20:10:51,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:10:51,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944467533] [2023-08-30 20:10:51,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:10:51,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:10:51,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:10:51,698 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-30 20:10:51,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:10:51,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944467533] [2023-08-30 20:10:51,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944467533] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 20:10:51,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [825060248] [2023-08-30 20:10:51,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:10:51,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 20:10:51,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 20:10:51,701 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) [2023-08-30 20:10:51,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-30 20:10:51,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:10:51,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 12 conjunts are in the unsatisfiable core [2023-08-30 20:10:51,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 20:10:51,978 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-30 20:10:51,978 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 20:10:52,067 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-30 20:10:52,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [825060248] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 20:10:52,068 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 20:10:52,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2023-08-30 20:10:52,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656807800] [2023-08-30 20:10:52,069 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 20:10:52,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-30 20:10:52,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:10:52,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-30 20:10:52,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2023-08-30 20:10:52,395 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 495 [2023-08-30 20:10:52,397 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 37 transitions, 158 flow. Second operand has 14 states, 14 states have (on average 196.21428571428572) internal successors, (2747), 14 states have internal predecessors, (2747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:10:52,397 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:10:52,397 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 495 [2023-08-30 20:10:52,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:10:53,031 INFO L130 PetriNetUnfolder]: 1251/2042 cut-off events. [2023-08-30 20:10:53,031 INFO L131 PetriNetUnfolder]: For 1609/1609 co-relation queries the response was YES. [2023-08-30 20:10:53,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5636 conditions, 2042 events. 1251/2042 cut-off events. For 1609/1609 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 9046 event pairs, 364 based on Foata normal form. 192/2234 useless extension candidates. Maximal degree in co-relation 2554. Up to 483 conditions per place. [2023-08-30 20:10:53,038 INFO L137 encePairwiseOnDemand]: 484/495 looper letters, 78 selfloop transitions, 16 changer transitions 118/212 dead transitions. [2023-08-30 20:10:53,038 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 212 transitions, 1170 flow [2023-08-30 20:10:53,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-08-30 20:10:53,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-08-30 20:10:53,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 4052 transitions. [2023-08-30 20:10:53,046 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4092929292929293 [2023-08-30 20:10:53,046 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 4052 transitions. [2023-08-30 20:10:53,046 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 4052 transitions. [2023-08-30 20:10:53,047 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:10:53,047 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 4052 transitions. [2023-08-30 20:10:53,053 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 202.6) internal successors, (4052), 20 states have internal predecessors, (4052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:10:53,061 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 495.0) internal successors, (10395), 21 states have internal predecessors, (10395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:10:53,062 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 495.0) internal successors, (10395), 21 states have internal predecessors, (10395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:10:53,062 INFO L175 Difference]: Start difference. First operand has 45 places, 37 transitions, 158 flow. Second operand 20 states and 4052 transitions. [2023-08-30 20:10:53,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 212 transitions, 1170 flow [2023-08-30 20:10:53,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 212 transitions, 1157 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-08-30 20:10:53,066 INFO L231 Difference]: Finished difference. Result has 74 places, 48 transitions, 319 flow [2023-08-30 20:10:53,066 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=319, PETRI_PLACES=74, PETRI_TRANSITIONS=48} [2023-08-30 20:10:53,068 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 40 predicate places. [2023-08-30 20:10:53,068 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 48 transitions, 319 flow [2023-08-30 20:10:53,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 196.21428571428572) internal successors, (2747), 14 states have internal predecessors, (2747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:10:53,069 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:10:53,069 INFO L208 CegarLoopForPetriNet]: trace histogram [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] [2023-08-30 20:10:53,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-30 20:10:53,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 20:10:53,275 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-30 20:10:53,275 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:10:53,275 INFO L85 PathProgramCache]: Analyzing trace with hash -2011379154, now seen corresponding path program 2 times [2023-08-30 20:10:53,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:10:53,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425287984] [2023-08-30 20:10:53,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:10:53,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:10:53,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:10:53,424 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-08-30 20:10:53,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:10:53,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425287984] [2023-08-30 20:10:53,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425287984] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 20:10:53,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 20:10:53,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 20:10:53,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695674678] [2023-08-30 20:10:53,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 20:10:53,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 20:10:53,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:10:53,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 20:10:53,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-30 20:10:53,435 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 495 [2023-08-30 20:10:53,436 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 48 transitions, 319 flow. Second operand has 5 states, 5 states have (on average 219.6) internal successors, (1098), 5 states have internal predecessors, (1098), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:10:53,436 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:10:53,436 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 495 [2023-08-30 20:10:53,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:10:53,789 INFO L130 PetriNetUnfolder]: 2001/3024 cut-off events. [2023-08-30 20:10:53,789 INFO L131 PetriNetUnfolder]: For 9982/9982 co-relation queries the response was YES. [2023-08-30 20:10:53,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11593 conditions, 3024 events. 2001/3024 cut-off events. For 9982/9982 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 13309 event pairs, 650 based on Foata normal form. 42/3066 useless extension candidates. Maximal degree in co-relation 6322. Up to 1345 conditions per place. [2023-08-30 20:10:53,805 INFO L137 encePairwiseOnDemand]: 490/495 looper letters, 73 selfloop transitions, 15 changer transitions 0/88 dead transitions. [2023-08-30 20:10:53,806 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 88 transitions, 727 flow [2023-08-30 20:10:53,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 20:10:53,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 20:10:53,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 922 transitions. [2023-08-30 20:10:53,808 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46565656565656566 [2023-08-30 20:10:53,808 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 922 transitions. [2023-08-30 20:10:53,808 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 922 transitions. [2023-08-30 20:10:53,809 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:10:53,809 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 922 transitions. [2023-08-30 20:10:53,810 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 230.5) internal successors, (922), 4 states have internal predecessors, (922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:10:53,812 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 495.0) internal successors, (2475), 5 states have internal predecessors, (2475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:10:53,813 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 495.0) internal successors, (2475), 5 states have internal predecessors, (2475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:10:53,813 INFO L175 Difference]: Start difference. First operand has 74 places, 48 transitions, 319 flow. Second operand 4 states and 922 transitions. [2023-08-30 20:10:53,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 88 transitions, 727 flow [2023-08-30 20:10:53,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 88 transitions, 638 flow, removed 39 selfloop flow, removed 8 redundant places. [2023-08-30 20:10:53,821 INFO L231 Difference]: Finished difference. Result has 64 places, 58 transitions, 429 flow [2023-08-30 20:10:53,821 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=429, PETRI_PLACES=64, PETRI_TRANSITIONS=58} [2023-08-30 20:10:53,822 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 30 predicate places. [2023-08-30 20:10:53,822 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 58 transitions, 429 flow [2023-08-30 20:10:53,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 219.6) internal successors, (1098), 5 states have internal predecessors, (1098), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:10:53,823 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:10:53,823 INFO L208 CegarLoopForPetriNet]: trace histogram [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] [2023-08-30 20:10:53,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 20:10:53,823 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-30 20:10:53,823 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:10:53,824 INFO L85 PathProgramCache]: Analyzing trace with hash -23841826, now seen corresponding path program 1 times [2023-08-30 20:10:53,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:10:53,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334578318] [2023-08-30 20:10:53,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:10:53,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:10:53,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:10:53,991 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-30 20:10:53,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:10:53,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334578318] [2023-08-30 20:10:53,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334578318] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 20:10:53,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2022178497] [2023-08-30 20:10:53,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:10:53,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 20:10:53,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 20:10:53,992 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) [2023-08-30 20:10:53,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-30 20:10:54,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:10:54,117 INFO L263 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-30 20:10:54,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 20:10:54,179 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-30 20:10:54,179 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 20:10:54,228 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-30 20:10:54,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2022178497] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 20:10:54,229 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 20:10:54,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2023-08-30 20:10:54,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616277599] [2023-08-30 20:10:54,229 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 20:10:54,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-30 20:10:54,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:10:54,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-30 20:10:54,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2023-08-30 20:10:54,398 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 495 [2023-08-30 20:10:54,400 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 58 transitions, 429 flow. Second operand has 12 states, 12 states have (on average 201.83333333333334) internal successors, (2422), 12 states have internal predecessors, (2422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:10:54,400 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:10:54,400 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 495 [2023-08-30 20:10:54,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:10:54,610 INFO L130 PetriNetUnfolder]: 949/1472 cut-off events. [2023-08-30 20:10:54,611 INFO L131 PetriNetUnfolder]: For 4771/4771 co-relation queries the response was YES. [2023-08-30 20:10:54,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5720 conditions, 1472 events. 949/1472 cut-off events. For 4771/4771 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5597 event pairs, 669 based on Foata normal form. 2/1474 useless extension candidates. Maximal degree in co-relation 5287. Up to 1332 conditions per place. [2023-08-30 20:10:54,618 INFO L137 encePairwiseOnDemand]: 490/495 looper letters, 42 selfloop transitions, 3 changer transitions 33/78 dead transitions. [2023-08-30 20:10:54,618 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 78 transitions, 598 flow [2023-08-30 20:10:54,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 20:10:54,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 20:10:54,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1251 transitions. [2023-08-30 20:10:54,621 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4212121212121212 [2023-08-30 20:10:54,621 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1251 transitions. [2023-08-30 20:10:54,621 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1251 transitions. [2023-08-30 20:10:54,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:10:54,622 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1251 transitions. [2023-08-30 20:10:54,624 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 208.5) internal successors, (1251), 6 states have internal predecessors, (1251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:10:54,626 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 495.0) internal successors, (3465), 7 states have internal predecessors, (3465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:10:54,627 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 495.0) internal successors, (3465), 7 states have internal predecessors, (3465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:10:54,627 INFO L175 Difference]: Start difference. First operand has 64 places, 58 transitions, 429 flow. Second operand 6 states and 1251 transitions. [2023-08-30 20:10:54,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 78 transitions, 598 flow [2023-08-30 20:10:54,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 78 transitions, 560 flow, removed 19 selfloop flow, removed 1 redundant places. [2023-08-30 20:10:54,632 INFO L231 Difference]: Finished difference. Result has 68 places, 45 transitions, 275 flow [2023-08-30 20:10:54,632 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=311, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=275, PETRI_PLACES=68, PETRI_TRANSITIONS=45} [2023-08-30 20:10:54,632 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 34 predicate places. [2023-08-30 20:10:54,632 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 45 transitions, 275 flow [2023-08-30 20:10:54,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 201.83333333333334) internal successors, (2422), 12 states have internal predecessors, (2422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:10:54,633 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:10:54,633 INFO L208 CegarLoopForPetriNet]: trace histogram [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] [2023-08-30 20:10:54,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-30 20:10:54,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-08-30 20:10:54,841 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-30 20:10:54,841 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:10:54,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1711614402, now seen corresponding path program 2 times [2023-08-30 20:10:54,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:10:54,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046674013] [2023-08-30 20:10:54,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:10:54,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:10:54,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:10:57,630 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:10:57,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:10:57,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046674013] [2023-08-30 20:10:57,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046674013] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 20:10:57,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1227902970] [2023-08-30 20:10:57,630 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 20:10:57,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 20:10:57,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 20:10:57,631 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) [2023-08-30 20:10:57,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-30 20:10:57,782 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 20:10:57,782 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 20:10:57,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 74 conjunts are in the unsatisfiable core [2023-08-30 20:10:57,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 20:10:58,636 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-30 20:10:58,636 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 20:11:11,034 WARN L222 SmtUtils]: Spent 10.05s on a formula simplification that was a NOOP. DAG size: 40 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 20:11:13,170 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| c_~manager~0.base))) (let ((.cse7 (* c_~client_back~0 4)) (.cse1 (select .cse2 (+ c_~manager~0.offset (* c_~manager_back~0 4))))) (let ((.cse3 (forall ((~client~0.base Int) (~client~0.offset Int)) (let ((.cse8 (select |c_#memory_int| ~client~0.base))) (or (not (= .cse1 (select .cse8 (+ .cse7 ~client~0.offset)))) (= (select .cse8 (+ (* c_~client_front~0 4) ~client~0.offset)) .cse1))))) (.cse0 (forall ((~client~0.base Int) (~client~0.offset Int)) (not (= .cse1 (select (select |c_#memory_int| ~client~0.base) (+ .cse7 ~client~0.offset))))))) (let ((.cse5 (and .cse3 .cse0)) (.cse6 (= (mod c_~safe~0 256) 0))) (and (or (let ((.cse4 (= c_~update~0 (select (select |c_#memory_int| c_~node~0.base) (+ (* c_~node_front~0 4) c_~node~0.offset))))) (and (or (and (or .cse0 (= .cse1 (select .cse2 (+ (* 4 c_~manager_front~0) c_~manager~0.offset)))) .cse3) (not .cse4)) (or .cse5 .cse4))) .cse6) (or .cse5 (not .cse6))))))) is different from false [2023-08-30 20:12:05,524 WARN L222 SmtUtils]: Spent 52.20s on a formula simplification. DAG size of input: 71 DAG size of output: 69 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 20:13:02,126 WARN L222 SmtUtils]: Spent 54.25s on a formula simplification. DAG size of input: 79 DAG size of output: 75 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 20:13:02,205 INFO L321 Elim1Store]: treesize reduction 39, result has 60.2 percent of original size [2023-08-30 20:13:02,205 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 67 [2023-08-30 20:13:02,283 INFO L321 Elim1Store]: treesize reduction 48, result has 70.7 percent of original size [2023-08-30 20:13:02,284 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 61 treesize of output 127 [2023-08-30 20:13:02,366 INFO L321 Elim1Store]: treesize reduction 48, result has 68.8 percent of original size [2023-08-30 20:13:02,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 61 treesize of output 117 [2023-08-30 20:13:02,553 INFO L321 Elim1Store]: treesize reduction 266, result has 43.9 percent of original size [2023-08-30 20:13:02,553 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 127 treesize of output 233 [2023-08-30 20:13:02,937 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 1 not checked. [2023-08-30 20:13:02,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1227902970] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 20:13:02,937 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 20:13:02,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 13] total 43 [2023-08-30 20:13:02,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264308441] [2023-08-30 20:13:02,938 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 20:13:02,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-08-30 20:13:02,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:13:02,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-08-30 20:13:02,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=1627, Unknown=3, NotChecked=84, Total=1980 [2023-08-30 20:13:04,953 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 20:13:06,979 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 20:13:09,031 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 20:13:11,067 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 20:13:13,078 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 20:13:15,083 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 20:13:17,118 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 20:13:19,135 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 20:13:21,267 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 20:13:23,343 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 20:13:25,361 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 20:13:27,399 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 20:13:29,412 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 20:13:31,834 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 20:13:33,850 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 20:13:35,894 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 20:13:37,912 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 20:13:39,916 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 20:13:41,937 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 20:13:43,958 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 20:13:45,969 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 20:13:45,981 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 495 [2023-08-30 20:13:45,984 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 45 transitions, 275 flow. Second operand has 45 states, 45 states have (on average 141.04444444444445) internal successors, (6347), 45 states have internal predecessors, (6347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:13:45,984 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:13:45,984 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 495 [2023-08-30 20:13:45,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:13:53,975 WARN L222 SmtUtils]: Spent 7.91s on a formula simplification. DAG size of input: 116 DAG size of output: 84 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 20:14:11,320 WARN L222 SmtUtils]: Spent 16.14s on a formula simplification. DAG size of input: 85 DAG size of output: 70 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 20:14:33,754 WARN L222 SmtUtils]: Spent 18.19s on a formula simplification. DAG size of input: 117 DAG size of output: 68 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 20:15:32,528 WARN L222 SmtUtils]: Spent 56.70s on a formula simplification. DAG size of input: 83 DAG size of output: 76 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 20:15:34,568 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 20:15:36,580 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 20:15:38,584 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 20:15:40,588 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 20:15:42,592 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 20:15:44,595 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 20:16:32,803 WARN L222 SmtUtils]: Spent 46.16s on a formula simplification. DAG size of input: 58 DAG size of output: 51 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 20:16:45,178 WARN L222 SmtUtils]: Spent 12.16s on a formula simplification. DAG size of input: 105 DAG size of output: 82 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 20:17:17,449 WARN L222 SmtUtils]: Spent 18.16s on a formula simplification. DAG size of input: 98 DAG size of output: 60 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 20:17:19,472 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 20:17:21,475 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 20:17:23,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 20:17:25,505 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 20:17:27,508 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 20:17:29,510 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 20:17:31,530 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 20:17:33,541 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 20:17:35,545 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 20:17:37,550 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 20:17:39,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 20:17:51,873 WARN L222 SmtUtils]: Spent 12.12s on a formula simplification. DAG size of input: 91 DAG size of output: 75 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 20:17:53,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 20:17:55,906 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 20:17:57,911 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 20:17:59,917 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 20:18:01,932 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 20:18:04,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 20:18:06,046 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 20:18:08,048 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 20:18:10,053 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 20:18:12,055 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 20:18:14,191 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 20:18:14,533 INFO L130 PetriNetUnfolder]: 1320/2122 cut-off events. [2023-08-30 20:18:14,533 INFO L131 PetriNetUnfolder]: For 3947/3947 co-relation queries the response was YES. [2023-08-30 20:18:14,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7099 conditions, 2122 events. 1320/2122 cut-off events. For 3947/3947 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 9083 event pairs, 520 based on Foata normal form. 1/2123 useless extension candidates. Maximal degree in co-relation 7062. Up to 1245 conditions per place. [2023-08-30 20:18:14,548 INFO L137 encePairwiseOnDemand]: 477/495 looper letters, 118 selfloop transitions, 62 changer transitions 72/252 dead transitions. [2023-08-30 20:18:14,548 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 252 transitions, 1526 flow [2023-08-30 20:18:14,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-08-30 20:18:14,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2023-08-30 20:18:14,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 6360 transitions. [2023-08-30 20:18:14,561 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.29201101928374656 [2023-08-30 20:18:14,561 INFO L72 ComplementDD]: Start complementDD. Operand 44 states and 6360 transitions. [2023-08-30 20:18:14,561 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 6360 transitions. [2023-08-30 20:18:14,564 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 20:18:14,564 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 44 states and 6360 transitions. [2023-08-30 20:18:14,572 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 45 states, 44 states have (on average 144.54545454545453) internal successors, (6360), 44 states have internal predecessors, (6360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:18:14,589 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 45 states, 45 states have (on average 495.0) internal successors, (22275), 45 states have internal predecessors, (22275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:18:14,591 INFO L81 ComplementDD]: Finished complementDD. Result has 45 states, 45 states have (on average 495.0) internal successors, (22275), 45 states have internal predecessors, (22275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:18:14,591 INFO L175 Difference]: Start difference. First operand has 68 places, 45 transitions, 275 flow. Second operand 44 states and 6360 transitions. [2023-08-30 20:18:14,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 252 transitions, 1526 flow [2023-08-30 20:18:14,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 252 transitions, 1484 flow, removed 18 selfloop flow, removed 5 redundant places. [2023-08-30 20:18:14,598 INFO L231 Difference]: Finished difference. Result has 106 places, 99 transitions, 801 flow [2023-08-30 20:18:14,598 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=495, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=44, PETRI_FLOW=801, PETRI_PLACES=106, PETRI_TRANSITIONS=99} [2023-08-30 20:18:14,598 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 72 predicate places. [2023-08-30 20:18:14,598 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 99 transitions, 801 flow [2023-08-30 20:18:14,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 141.04444444444445) internal successors, (6347), 45 states have internal predecessors, (6347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:18:14,600 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 20:18:14,600 INFO L208 CegarLoopForPetriNet]: trace histogram [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] [2023-08-30 20:18:14,622 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-30 20:18:14,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 20:18:14,809 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-30 20:18:14,809 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 20:18:14,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1225962343, now seen corresponding path program 3 times [2023-08-30 20:18:14,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 20:18:14,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246735860] [2023-08-30 20:18:14,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 20:18:14,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 20:18:14,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 20:18:17,597 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 20:18:17,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 20:18:17,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246735860] [2023-08-30 20:18:17,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246735860] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 20:18:17,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2125400956] [2023-08-30 20:18:17,597 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 20:18:17,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 20:18:17,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 20:18:17,599 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) [2023-08-30 20:18:17,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-30 20:18:17,806 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-08-30 20:18:17,806 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 20:18:17,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 91 conjunts are in the unsatisfiable core [2023-08-30 20:18:17,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 20:18:18,802 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-30 20:18:18,802 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 20:18:39,770 WARN L222 SmtUtils]: Spent 20.06s on a formula simplification that was a NOOP. DAG size: 73 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 20:19:26,317 WARN L222 SmtUtils]: Spent 44.21s on a formula simplification. DAG size of input: 84 DAG size of output: 79 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 20:19:26,429 INFO L321 Elim1Store]: treesize reduction 48, result has 70.7 percent of original size [2023-08-30 20:19:26,429 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 61 treesize of output 127 [2023-08-30 20:19:26,524 INFO L321 Elim1Store]: treesize reduction 48, result has 70.7 percent of original size [2023-08-30 20:19:26,524 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 62 treesize of output 127 [2023-08-30 20:19:26,608 INFO L321 Elim1Store]: treesize reduction 48, result has 69.2 percent of original size [2023-08-30 20:19:26,608 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 63 treesize of output 119 [2023-08-30 20:19:26,643 INFO L321 Elim1Store]: treesize reduction 153, result has 0.6 percent of original size [2023-08-30 20:19:26,643 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 61 treesize of output 1 [2023-08-30 20:19:26,673 INFO L321 Elim1Store]: treesize reduction 39, result has 60.2 percent of original size [2023-08-30 20:19:26,674 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 67 [2023-08-30 20:19:27,280 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-30 20:19:27,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2125400956] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 20:19:27,280 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 20:19:27,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 15] total 49 [2023-08-30 20:19:27,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478209479] [2023-08-30 20:19:27,281 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 20:19:27,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-08-30 20:19:27,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 20:19:27,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-08-30 20:19:27,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=471, Invalid=2078, Unknown=1, NotChecked=0, Total=2550 [2023-08-30 20:19:29,741 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 20:19:32,790 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 20:19:35,009 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 20:19:37,428 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 20:19:39,484 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 20:19:41,637 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 20:19:43,695 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 20:19:45,729 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 20:19:45,827 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 495 [2023-08-30 20:19:45,830 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 99 transitions, 801 flow. Second operand has 51 states, 51 states have (on average 156.92156862745097) internal successors, (8003), 51 states have internal predecessors, (8003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 20:19:45,830 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 20:19:45,831 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 495 [2023-08-30 20:19:45,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 20:20:48,269 WARN L222 SmtUtils]: Spent 1.04m on a formula simplification. DAG size of input: 135 DAG size of output: 85 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 20:20:50,281 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 20:20:52,289 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 20:21:54,256 WARN L222 SmtUtils]: Spent 57.12s on a formula simplification. DAG size of input: 79 DAG size of output: 74 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 20:22:22,944 WARN L222 SmtUtils]: Spent 28.32s on a formula simplification. DAG size of input: 116 DAG size of output: 82 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 20:22:25,019 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 20:22:27,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 20:22:29,031 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-30 20:22:57,583 WARN L222 SmtUtils]: Spent 28.34s on a formula simplification. DAG size of input: 121 DAG size of output: 88 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 20:22:59,833 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 20:23:01,844 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-30 20:23:03,848 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] Killed by 15