./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_70-funloop_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_70-funloop_racefree.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2a10f98c1a89e2ac521234c9e4f0eca565cc5bc1484e9c7d67d861e216c6f9ba --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 10:17:16,025 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 10:17:16,027 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 10:17:16,052 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 10:17:16,052 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 10:17:16,053 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 10:17:16,054 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 10:17:16,056 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 10:17:16,057 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 10:17:16,058 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 10:17:16,059 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 10:17:16,060 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 10:17:16,060 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 10:17:16,061 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 10:17:16,062 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 10:17:16,063 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 10:17:16,063 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 10:17:16,064 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 10:17:16,065 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 10:17:16,067 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 10:17:16,068 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 10:17:16,069 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 10:17:16,070 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 10:17:16,071 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 10:17:16,072 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 10:17:16,074 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 10:17:16,074 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 10:17:16,075 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 10:17:16,076 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 10:17:16,076 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 10:17:16,077 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 10:17:16,077 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 10:17:16,078 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 10:17:16,078 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 10:17:16,079 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 10:17:16,080 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 10:17:16,080 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 10:17:16,081 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 10:17:16,081 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 10:17:16,081 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 10:17:16,082 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 10:17:16,083 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 10:17:16,083 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-12 10:17:16,101 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 10:17:16,102 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 10:17:16,102 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 10:17:16,102 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 10:17:16,103 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 10:17:16,103 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 10:17:16,104 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 10:17:16,104 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 10:17:16,104 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 10:17:16,104 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 10:17:16,104 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 10:17:16,105 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 10:17:16,105 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 10:17:16,105 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 10:17:16,105 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 10:17:16,105 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 10:17:16,105 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 10:17:16,105 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 10:17:16,105 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 10:17:16,105 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 10:17:16,106 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 10:17:16,106 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 10:17:16,106 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 10:17:16,106 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 10:17:16,106 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 10:17:16,106 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 10:17:16,106 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 10:17:16,106 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 10:17:16,106 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 10:17:16,107 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 10:17:16,107 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 10:17:16,107 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 10:17:16,107 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 10:17:16,107 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2a10f98c1a89e2ac521234c9e4f0eca565cc5bc1484e9c7d67d861e216c6f9ba [2022-07-12 10:17:16,359 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 10:17:16,383 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 10:17:16,386 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 10:17:16,387 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 10:17:16,387 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 10:17:16,389 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_70-funloop_racefree.i [2022-07-12 10:17:16,447 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04063a67d/fb3a3f32a45b4d82b9659a822c4d67fe/FLAGb4b29e750 [2022-07-12 10:17:16,944 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 10:17:16,945 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_70-funloop_racefree.i [2022-07-12 10:17:16,966 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04063a67d/fb3a3f32a45b4d82b9659a822c4d67fe/FLAGb4b29e750 [2022-07-12 10:17:17,241 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04063a67d/fb3a3f32a45b4d82b9659a822c4d67fe [2022-07-12 10:17:17,243 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 10:17:17,244 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 10:17:17,247 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 10:17:17,248 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 10:17:17,250 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 10:17:17,251 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 10:17:17" (1/1) ... [2022-07-12 10:17:17,252 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d890e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:17:17, skipping insertion in model container [2022-07-12 10:17:17,252 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 10:17:17" (1/1) ... [2022-07-12 10:17:17,260 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 10:17:17,307 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 10:17:17,664 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_70-funloop_racefree.i[41323,41336] [2022-07-12 10:17:17,691 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 10:17:17,702 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 10:17:17,732 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_70-funloop_racefree.i[41323,41336] [2022-07-12 10:17:17,740 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 10:17:17,779 INFO L208 MainTranslator]: Completed translation [2022-07-12 10:17:17,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:17:17 WrapperNode [2022-07-12 10:17:17,780 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 10:17:17,781 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 10:17:17,781 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 10:17:17,781 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 10:17:17,787 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:17:17" (1/1) ... [2022-07-12 10:17:17,809 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:17:17" (1/1) ... [2022-07-12 10:17:17,830 INFO L137 Inliner]: procedures = 271, calls = 31, calls flagged for inlining = 5, calls inlined = 6, statements flattened = 193 [2022-07-12 10:17:17,831 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 10:17:17,832 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 10:17:17,832 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 10:17:17,832 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 10:17:17,838 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:17:17" (1/1) ... [2022-07-12 10:17:17,839 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:17:17" (1/1) ... [2022-07-12 10:17:17,842 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:17:17" (1/1) ... [2022-07-12 10:17:17,842 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:17:17" (1/1) ... [2022-07-12 10:17:17,849 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:17:17" (1/1) ... [2022-07-12 10:17:17,854 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:17:17" (1/1) ... [2022-07-12 10:17:17,856 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:17:17" (1/1) ... [2022-07-12 10:17:17,859 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 10:17:17,860 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 10:17:17,860 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 10:17:17,860 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 10:17:17,861 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:17:17" (1/1) ... [2022-07-12 10:17:17,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 10:17:17,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:17:17,899 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 10:17:17,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 10:17:17,934 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 10:17:17,934 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 10:17:17,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 10:17:17,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 10:17:17,935 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-07-12 10:17:17,935 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 10:17:17,937 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-07-12 10:17:17,937 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-07-12 10:17:17,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 10:17:17,938 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 10:17:17,938 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 10:17:17,939 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-12 10:17:18,120 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 10:17:18,122 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 10:17:18,466 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 10:17:18,474 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 10:17:18,474 INFO L299 CfgBuilder]: Removed 25 assume(true) statements. [2022-07-12 10:17:18,476 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 10:17:18 BoogieIcfgContainer [2022-07-12 10:17:18,476 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 10:17:18,477 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 10:17:18,477 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 10:17:18,480 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 10:17:18,480 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 10:17:17" (1/3) ... [2022-07-12 10:17:18,481 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b38489f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 10:17:18, skipping insertion in model container [2022-07-12 10:17:18,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 10:17:17" (2/3) ... [2022-07-12 10:17:18,482 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b38489f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 10:17:18, skipping insertion in model container [2022-07-12 10:17:18,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 10:17:18" (3/3) ... [2022-07-12 10:17:18,483 INFO L111 eAbstractionObserver]: Analyzing ICFG 28-race_reach_70-funloop_racefree.i [2022-07-12 10:17:18,487 WARN L143 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-07-12 10:17:18,493 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 10:17:18,493 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-12 10:17:18,493 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-07-12 10:17:18,567 INFO L135 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-07-12 10:17:18,629 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 170 places, 200 transitions, 408 flow [2022-07-12 10:17:18,739 INFO L129 PetriNetUnfolder]: 49/284 cut-off events. [2022-07-12 10:17:18,740 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-07-12 10:17:18,747 INFO L84 FinitePrefix]: Finished finitePrefix Result has 290 conditions, 284 events. 49/284 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1028 event pairs, 0 based on Foata normal form. 0/229 useless extension candidates. Maximal degree in co-relation 160. Up to 8 conditions per place. [2022-07-12 10:17:18,748 INFO L82 GeneralOperation]: Start removeDead. Operand has 170 places, 200 transitions, 408 flow [2022-07-12 10:17:18,759 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 166 places, 195 transitions, 395 flow [2022-07-12 10:17:18,775 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 10:17:18,781 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2338b5d9, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@524e2a76 [2022-07-12 10:17:18,782 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-07-12 10:17:18,806 INFO L129 PetriNetUnfolder]: 13/113 cut-off events. [2022-07-12 10:17:18,806 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-12 10:17:18,807 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:17:18,808 INFO L200 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:17:18,809 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-07-12 10:17:18,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:17:18,815 INFO L85 PathProgramCache]: Analyzing trace with hash 322036200, now seen corresponding path program 1 times [2022-07-12 10:17:18,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:17:18,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783779659] [2022-07-12 10:17:18,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:17:18,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:17:18,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:17:19,034 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-12 10:17:19,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:17:19,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783779659] [2022-07-12 10:17:19,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783779659] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:17:19,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:17:19,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 10:17:19,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697249510] [2022-07-12 10:17:19,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:17:19,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 10:17:19,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:17:19,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 10:17:19,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 10:17:19,075 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 200 [2022-07-12 10:17:19,079 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 195 transitions, 395 flow. Second operand has 3 states, 3 states have (on average 163.33333333333334) internal successors, (490), 3 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:17:19,079 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:17:19,079 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 200 [2022-07-12 10:17:19,080 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:17:19,130 INFO L129 PetriNetUnfolder]: 7/239 cut-off events. [2022-07-12 10:17:19,130 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-07-12 10:17:19,132 INFO L84 FinitePrefix]: Finished finitePrefix Result has 257 conditions, 239 events. 7/239 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 781 event pairs, 0 based on Foata normal form. 40/265 useless extension candidates. Maximal degree in co-relation 134. Up to 9 conditions per place. [2022-07-12 10:17:19,134 INFO L132 encePairwiseOnDemand]: 170/200 looper letters, 10 selfloop transitions, 2 changer transitions 0/170 dead transitions. [2022-07-12 10:17:19,134 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 170 transitions, 369 flow [2022-07-12 10:17:19,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 10:17:19,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-12 10:17:19,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 527 transitions. [2022-07-12 10:17:19,147 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8783333333333333 [2022-07-12 10:17:19,148 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 527 transitions. [2022-07-12 10:17:19,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 527 transitions. [2022-07-12 10:17:19,150 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:17:19,152 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 527 transitions. [2022-07-12 10:17:19,155 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 175.66666666666666) internal successors, (527), 3 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:17:19,163 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:17:19,166 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:17:19,168 INFO L186 Difference]: Start difference. First operand has 166 places, 195 transitions, 395 flow. Second operand 3 states and 527 transitions. [2022-07-12 10:17:19,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 170 transitions, 369 flow [2022-07-12 10:17:19,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 170 transitions, 369 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-07-12 10:17:19,177 INFO L242 Difference]: Finished difference. Result has 167 places, 167 transitions, 349 flow [2022-07-12 10:17:19,179 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=337, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=349, PETRI_PLACES=167, PETRI_TRANSITIONS=167} [2022-07-12 10:17:19,185 INFO L279 CegarLoopForPetriNet]: 166 programPoint places, 1 predicate places. [2022-07-12 10:17:19,186 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 167 transitions, 349 flow [2022-07-12 10:17:19,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.33333333333334) internal successors, (490), 3 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:17:19,186 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:17:19,187 INFO L200 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:17:19,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 10:17:19,187 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-07-12 10:17:19,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:17:19,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1156168181, now seen corresponding path program 1 times [2022-07-12 10:17:19,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:17:19,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359773640] [2022-07-12 10:17:19,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:17:19,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:17:19,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:17:19,273 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-12 10:17:19,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:17:19,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359773640] [2022-07-12 10:17:19,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359773640] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:17:19,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1916865891] [2022-07-12 10:17:19,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:17:19,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:17:19,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:17:19,277 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:17:19,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 10:17:19,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:17:19,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 10:17:19,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:17:19,450 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-12 10:17:19,450 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:17:19,504 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-12 10:17:19,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1916865891] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:17:19,505 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:17:19,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-07-12 10:17:19,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885206978] [2022-07-12 10:17:19,506 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:17:19,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 10:17:19,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:17:19,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 10:17:19,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-12 10:17:19,511 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 200 [2022-07-12 10:17:19,519 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 167 transitions, 349 flow. Second operand has 10 states, 10 states have (on average 163.1) internal successors, (1631), 10 states have internal predecessors, (1631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:17:19,519 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:17:19,520 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 200 [2022-07-12 10:17:19,520 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:17:19,643 INFO L129 PetriNetUnfolder]: 7/246 cut-off events. [2022-07-12 10:17:19,643 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-12 10:17:19,647 INFO L84 FinitePrefix]: Finished finitePrefix Result has 280 conditions, 246 events. 7/246 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 777 event pairs, 0 based on Foata normal form. 2/235 useless extension candidates. Maximal degree in co-relation 239. Up to 6 conditions per place. [2022-07-12 10:17:19,648 INFO L132 encePairwiseOnDemand]: 194/200 looper letters, 11 selfloop transitions, 9 changer transitions 0/177 dead transitions. [2022-07-12 10:17:19,648 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 177 transitions, 411 flow [2022-07-12 10:17:19,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 10:17:19,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-12 10:17:19,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1471 transitions. [2022-07-12 10:17:19,653 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8172222222222222 [2022-07-12 10:17:19,653 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1471 transitions. [2022-07-12 10:17:19,653 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1471 transitions. [2022-07-12 10:17:19,654 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:17:19,654 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1471 transitions. [2022-07-12 10:17:19,657 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 163.44444444444446) internal successors, (1471), 9 states have internal predecessors, (1471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:17:19,662 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 200.0) internal successors, (2000), 10 states have internal predecessors, (2000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:17:19,663 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 200.0) internal successors, (2000), 10 states have internal predecessors, (2000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:17:19,663 INFO L186 Difference]: Start difference. First operand has 167 places, 167 transitions, 349 flow. Second operand 9 states and 1471 transitions. [2022-07-12 10:17:19,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 177 transitions, 411 flow [2022-07-12 10:17:19,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 177 transitions, 409 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-07-12 10:17:19,673 INFO L242 Difference]: Finished difference. Result has 177 places, 173 transitions, 397 flow [2022-07-12 10:17:19,673 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=347, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=397, PETRI_PLACES=177, PETRI_TRANSITIONS=173} [2022-07-12 10:17:19,674 INFO L279 CegarLoopForPetriNet]: 166 programPoint places, 11 predicate places. [2022-07-12 10:17:19,674 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 173 transitions, 397 flow [2022-07-12 10:17:19,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 163.1) internal successors, (1631), 10 states have internal predecessors, (1631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:17:19,676 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:17:19,676 INFO L200 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:17:19,698 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-12 10:17:19,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:17:19,892 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-07-12 10:17:19,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:17:19,892 INFO L85 PathProgramCache]: Analyzing trace with hash 235263019, now seen corresponding path program 2 times [2022-07-12 10:17:19,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:17:19,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518910538] [2022-07-12 10:17:19,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:17:19,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:17:19,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:17:20,033 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-12 10:17:20,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:17:20,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518910538] [2022-07-12 10:17:20,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518910538] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:17:20,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1644980856] [2022-07-12 10:17:20,034 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 10:17:20,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:17:20,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:17:20,036 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:17:20,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-12 10:17:20,136 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 10:17:20,136 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 10:17:20,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 10:17:20,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:17:20,204 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-12 10:17:20,204 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:17:20,307 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-12 10:17:20,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1644980856] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:17:20,307 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:17:20,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-07-12 10:17:20,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429400222] [2022-07-12 10:17:20,308 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:17:20,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-12 10:17:20,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:17:20,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-12 10:17:20,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-07-12 10:17:20,314 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 200 [2022-07-12 10:17:20,318 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 173 transitions, 397 flow. Second operand has 18 states, 18 states have (on average 163.27777777777777) internal successors, (2939), 18 states have internal predecessors, (2939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:17:20,318 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:17:20,318 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 200 [2022-07-12 10:17:20,318 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:17:20,535 INFO L129 PetriNetUnfolder]: 7/266 cut-off events. [2022-07-12 10:17:20,535 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2022-07-12 10:17:20,537 INFO L84 FinitePrefix]: Finished finitePrefix Result has 369 conditions, 266 events. 7/266 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 777 event pairs, 0 based on Foata normal form. 4/257 useless extension candidates. Maximal degree in co-relation 224. Up to 11 conditions per place. [2022-07-12 10:17:20,538 INFO L132 encePairwiseOnDemand]: 194/200 looper letters, 19 selfloop transitions, 21 changer transitions 0/197 dead transitions. [2022-07-12 10:17:20,538 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 197 transitions, 585 flow [2022-07-12 10:17:20,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-12 10:17:20,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-07-12 10:17:20,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3425 transitions. [2022-07-12 10:17:20,547 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8154761904761905 [2022-07-12 10:17:20,547 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 3425 transitions. [2022-07-12 10:17:20,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 3425 transitions. [2022-07-12 10:17:20,549 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:17:20,549 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 3425 transitions. [2022-07-12 10:17:20,557 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 163.0952380952381) internal successors, (3425), 21 states have internal predecessors, (3425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:17:20,565 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 200.0) internal successors, (4400), 22 states have internal predecessors, (4400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:17:20,566 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 200.0) internal successors, (4400), 22 states have internal predecessors, (4400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:17:20,566 INFO L186 Difference]: Start difference. First operand has 177 places, 173 transitions, 397 flow. Second operand 21 states and 3425 transitions. [2022-07-12 10:17:20,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 197 transitions, 585 flow [2022-07-12 10:17:20,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 197 transitions, 571 flow, removed 6 selfloop flow, removed 1 redundant places. [2022-07-12 10:17:20,586 INFO L242 Difference]: Finished difference. Result has 201 places, 186 transitions, 521 flow [2022-07-12 10:17:20,587 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=391, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=521, PETRI_PLACES=201, PETRI_TRANSITIONS=186} [2022-07-12 10:17:20,589 INFO L279 CegarLoopForPetriNet]: 166 programPoint places, 35 predicate places. [2022-07-12 10:17:20,589 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 186 transitions, 521 flow [2022-07-12 10:17:20,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 163.27777777777777) internal successors, (2939), 18 states have internal predecessors, (2939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:17:20,591 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:17:20,592 INFO L200 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:17:20,619 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-12 10:17:20,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-07-12 10:17:20,808 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-07-12 10:17:20,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:17:20,808 INFO L85 PathProgramCache]: Analyzing trace with hash 716011627, now seen corresponding path program 3 times [2022-07-12 10:17:20,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:17:20,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640633654] [2022-07-12 10:17:20,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:17:20,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:17:20,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:17:21,014 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-12 10:17:21,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:17:21,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640633654] [2022-07-12 10:17:21,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640633654] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:17:21,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [263872577] [2022-07-12 10:17:21,019 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-12 10:17:21,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:17:21,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:17:21,024 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:17:21,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-12 10:17:21,149 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-07-12 10:17:21,149 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 10:17:21,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-12 10:17:21,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:17:21,224 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-12 10:17:21,225 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:17:21,378 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-12 10:17:21,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [263872577] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:17:21,379 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:17:21,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2022-07-12 10:17:21,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48123742] [2022-07-12 10:17:21,379 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:17:21,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-12 10:17:21,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:17:21,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-12 10:17:21,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2022-07-12 10:17:21,393 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 200 [2022-07-12 10:17:21,410 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 186 transitions, 521 flow. Second operand has 23 states, 23 states have (on average 163.43478260869566) internal successors, (3759), 23 states have internal predecessors, (3759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:17:21,411 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:17:21,411 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 200 [2022-07-12 10:17:21,411 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:17:21,878 INFO L129 PetriNetUnfolder]: 7/281 cut-off events. [2022-07-12 10:17:21,878 INFO L130 PetriNetUnfolder]: For 110/110 co-relation queries the response was YES. [2022-07-12 10:17:21,879 INFO L84 FinitePrefix]: Finished finitePrefix Result has 470 conditions, 281 events. 7/281 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 777 event pairs, 0 based on Foata normal form. 3/271 useless extension candidates. Maximal degree in co-relation 320. Up to 17 conditions per place. [2022-07-12 10:17:21,882 INFO L132 encePairwiseOnDemand]: 194/200 looper letters, 25 selfloop transitions, 30 changer transitions 0/212 dead transitions. [2022-07-12 10:17:21,882 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 212 transitions, 777 flow [2022-07-12 10:17:21,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-07-12 10:17:21,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-07-12 10:17:21,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 4888 transitions. [2022-07-12 10:17:21,926 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8146666666666667 [2022-07-12 10:17:21,927 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 4888 transitions. [2022-07-12 10:17:21,927 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 4888 transitions. [2022-07-12 10:17:21,929 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:17:21,929 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 4888 transitions. [2022-07-12 10:17:21,937 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 162.93333333333334) internal successors, (4888), 30 states have internal predecessors, (4888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:17:21,972 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 200.0) internal successors, (6200), 31 states have internal predecessors, (6200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:17:21,974 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 200.0) internal successors, (6200), 31 states have internal predecessors, (6200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:17:21,974 INFO L186 Difference]: Start difference. First operand has 201 places, 186 transitions, 521 flow. Second operand 30 states and 4888 transitions. [2022-07-12 10:17:21,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 212 transitions, 777 flow [2022-07-12 10:17:21,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 212 transitions, 747 flow, removed 9 selfloop flow, removed 6 redundant places. [2022-07-12 10:17:21,985 INFO L242 Difference]: Finished difference. Result has 228 places, 196 transitions, 649 flow [2022-07-12 10:17:21,985 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=497, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=649, PETRI_PLACES=228, PETRI_TRANSITIONS=196} [2022-07-12 10:17:21,986 INFO L279 CegarLoopForPetriNet]: 166 programPoint places, 62 predicate places. [2022-07-12 10:17:21,999 INFO L495 AbstractCegarLoop]: Abstraction has has 228 places, 196 transitions, 649 flow [2022-07-12 10:17:22,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 163.43478260869566) internal successors, (3759), 23 states have internal predecessors, (3759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:17:22,002 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:17:22,002 INFO L200 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:17:22,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-12 10:17:22,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:17:22,223 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-07-12 10:17:22,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:17:22,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1764751544, now seen corresponding path program 4 times [2022-07-12 10:17:22,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:17:22,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610222048] [2022-07-12 10:17:22,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:17:22,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:17:22,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 10:17:22,252 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-12 10:17:22,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 10:17:22,295 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-12 10:17:22,295 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-12 10:17:22,296 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2022-07-12 10:17:22,298 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2022-07-12 10:17:22,298 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2022-07-12 10:17:22,298 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2022-07-12 10:17:22,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 10:17:22,301 INFO L356 BasicCegarLoop]: Path program histogram: [4, 1] [2022-07-12 10:17:22,303 WARN L231 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-07-12 10:17:22,303 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-07-12 10:17:22,333 INFO L135 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-07-12 10:17:22,336 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 230 places, 273 transitions, 564 flow [2022-07-12 10:17:22,384 INFO L129 PetriNetUnfolder]: 82/466 cut-off events. [2022-07-12 10:17:22,384 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-07-12 10:17:22,390 INFO L84 FinitePrefix]: Finished finitePrefix Result has 480 conditions, 466 events. 82/466 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2089 event pairs, 0 based on Foata normal form. 0/375 useless extension candidates. Maximal degree in co-relation 286. Up to 12 conditions per place. [2022-07-12 10:17:22,390 INFO L82 GeneralOperation]: Start removeDead. Operand has 230 places, 273 transitions, 564 flow [2022-07-12 10:17:22,396 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 230 places, 273 transitions, 564 flow [2022-07-12 10:17:22,397 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 10:17:22,397 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2338b5d9, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@524e2a76 [2022-07-12 10:17:22,398 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-07-12 10:17:22,410 INFO L129 PetriNetUnfolder]: 26/200 cut-off events. [2022-07-12 10:17:22,410 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-12 10:17:22,410 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:17:22,410 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:17:22,410 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-07-12 10:17:22,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:17:22,411 INFO L85 PathProgramCache]: Analyzing trace with hash 509040557, now seen corresponding path program 1 times [2022-07-12 10:17:22,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:17:22,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990978329] [2022-07-12 10:17:22,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:17:22,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:17:22,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:17:22,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:17:22,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:17:22,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990978329] [2022-07-12 10:17:22,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990978329] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:17:22,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:17:22,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 10:17:22,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655049852] [2022-07-12 10:17:22,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:17:22,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 10:17:22,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:17:22,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 10:17:22,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 10:17:22,442 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 220 out of 273 [2022-07-12 10:17:22,443 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 273 transitions, 564 flow. Second operand has 3 states, 3 states have (on average 221.0) internal successors, (663), 3 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:17:22,443 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:17:22,444 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 220 of 273 [2022-07-12 10:17:22,444 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:17:22,522 INFO L129 PetriNetUnfolder]: 14/397 cut-off events. [2022-07-12 10:17:22,522 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2022-07-12 10:17:22,526 INFO L84 FinitePrefix]: Finished finitePrefix Result has 429 conditions, 397 events. 14/397 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1819 event pairs, 0 based on Foata normal form. 83/457 useless extension candidates. Maximal degree in co-relation 259. Up to 14 conditions per place. [2022-07-12 10:17:22,528 INFO L132 encePairwiseOnDemand]: 231/273 looper letters, 13 selfloop transitions, 2 changer transitions 0/235 dead transitions. [2022-07-12 10:17:22,528 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 235 transitions, 518 flow [2022-07-12 10:17:22,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 10:17:22,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-12 10:17:22,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 716 transitions. [2022-07-12 10:17:22,530 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8742368742368742 [2022-07-12 10:17:22,531 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 716 transitions. [2022-07-12 10:17:22,531 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 716 transitions. [2022-07-12 10:17:22,531 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:17:22,531 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 716 transitions. [2022-07-12 10:17:22,533 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 238.66666666666666) internal successors, (716), 3 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:17:22,536 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:17:22,537 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:17:22,537 INFO L186 Difference]: Start difference. First operand has 230 places, 273 transitions, 564 flow. Second operand 3 states and 716 transitions. [2022-07-12 10:17:22,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 235 transitions, 518 flow [2022-07-12 10:17:22,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 235 transitions, 518 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-07-12 10:17:22,542 INFO L242 Difference]: Finished difference. Result has 230 places, 232 transitions, 492 flow [2022-07-12 10:17:22,543 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=492, PETRI_PLACES=230, PETRI_TRANSITIONS=232} [2022-07-12 10:17:22,546 INFO L279 CegarLoopForPetriNet]: 230 programPoint places, 0 predicate places. [2022-07-12 10:17:22,546 INFO L495 AbstractCegarLoop]: Abstraction has has 230 places, 232 transitions, 492 flow [2022-07-12 10:17:22,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 221.0) internal successors, (663), 3 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:17:22,548 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:17:22,548 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:17:22,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 10:17:22,549 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-07-12 10:17:22,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:17:22,550 INFO L85 PathProgramCache]: Analyzing trace with hash 879811681, now seen corresponding path program 1 times [2022-07-12 10:17:22,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:17:22,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261476197] [2022-07-12 10:17:22,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:17:22,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:17:22,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:17:22,591 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:17:22,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:17:22,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261476197] [2022-07-12 10:17:22,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261476197] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:17:22,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1034356827] [2022-07-12 10:17:22,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:17:22,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:17:22,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:17:22,600 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:17:22,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-12 10:17:22,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:17:22,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 10:17:22,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:17:22,696 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 10:17:22,696 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 10:17:22,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1034356827] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:17:22,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 10:17:22,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-07-12 10:17:22,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982939376] [2022-07-12 10:17:22,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:17:22,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 10:17:22,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:17:22,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 10:17:22,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 10:17:22,699 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 220 out of 273 [2022-07-12 10:17:22,699 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 232 transitions, 492 flow. Second operand has 3 states, 3 states have (on average 221.0) internal successors, (663), 3 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:17:22,700 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:17:22,700 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 220 of 273 [2022-07-12 10:17:22,700 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:17:22,753 INFO L129 PetriNetUnfolder]: 11/341 cut-off events. [2022-07-12 10:17:22,754 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2022-07-12 10:17:22,757 INFO L84 FinitePrefix]: Finished finitePrefix Result has 383 conditions, 341 events. 11/341 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1455 event pairs, 0 based on Foata normal form. 0/323 useless extension candidates. Maximal degree in co-relation 346. Up to 16 conditions per place. [2022-07-12 10:17:22,758 INFO L132 encePairwiseOnDemand]: 270/273 looper letters, 13 selfloop transitions, 2 changer transitions 0/236 dead transitions. [2022-07-12 10:17:22,758 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 236 transitions, 530 flow [2022-07-12 10:17:22,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 10:17:22,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-12 10:17:22,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 676 transitions. [2022-07-12 10:17:22,760 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8253968253968254 [2022-07-12 10:17:22,760 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 676 transitions. [2022-07-12 10:17:22,760 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 676 transitions. [2022-07-12 10:17:22,761 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:17:22,761 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 676 transitions. [2022-07-12 10:17:22,762 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 225.33333333333334) internal successors, (676), 3 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:17:22,764 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:17:22,764 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:17:22,764 INFO L186 Difference]: Start difference. First operand has 230 places, 232 transitions, 492 flow. Second operand 3 states and 676 transitions. [2022-07-12 10:17:22,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 236 transitions, 530 flow [2022-07-12 10:17:22,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 236 transitions, 528 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-07-12 10:17:22,769 INFO L242 Difference]: Finished difference. Result has 232 places, 233 transitions, 502 flow [2022-07-12 10:17:22,769 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=502, PETRI_PLACES=232, PETRI_TRANSITIONS=233} [2022-07-12 10:17:22,769 INFO L279 CegarLoopForPetriNet]: 230 programPoint places, 2 predicate places. [2022-07-12 10:17:22,770 INFO L495 AbstractCegarLoop]: Abstraction has has 232 places, 233 transitions, 502 flow [2022-07-12 10:17:22,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 221.0) internal successors, (663), 3 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:17:22,770 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:17:22,770 INFO L200 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:17:22,796 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-12 10:17:22,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:17:22,994 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-07-12 10:17:22,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:17:22,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1759427479, now seen corresponding path program 1 times [2022-07-12 10:17:22,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:17:22,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807001241] [2022-07-12 10:17:22,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:17:22,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:17:23,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:17:23,031 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-12 10:17:23,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:17:23,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807001241] [2022-07-12 10:17:23,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807001241] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:17:23,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [921840052] [2022-07-12 10:17:23,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:17:23,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:17:23,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:17:23,033 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:17:23,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-12 10:17:23,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:17:23,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 10:17:23,113 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:17:23,135 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-12 10:17:23,135 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:17:23,158 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-12 10:17:23,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [921840052] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:17:23,159 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:17:23,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-07-12 10:17:23,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136455920] [2022-07-12 10:17:23,160 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:17:23,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 10:17:23,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:17:23,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 10:17:23,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-12 10:17:23,163 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 273 [2022-07-12 10:17:23,165 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 233 transitions, 502 flow. Second operand has 10 states, 10 states have (on average 221.2) internal successors, (2212), 10 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:17:23,165 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:17:23,166 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 273 [2022-07-12 10:17:23,166 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:17:23,299 INFO L129 PetriNetUnfolder]: 11/348 cut-off events. [2022-07-12 10:17:23,299 INFO L130 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2022-07-12 10:17:23,302 INFO L84 FinitePrefix]: Finished finitePrefix Result has 402 conditions, 348 events. 11/348 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1450 event pairs, 0 based on Foata normal form. 2/334 useless extension candidates. Maximal degree in co-relation 331. Up to 11 conditions per place. [2022-07-12 10:17:23,303 INFO L132 encePairwiseOnDemand]: 267/273 looper letters, 14 selfloop transitions, 9 changer transitions 0/243 dead transitions. [2022-07-12 10:17:23,304 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 243 transitions, 570 flow [2022-07-12 10:17:23,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 10:17:23,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-12 10:17:23,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1996 transitions. [2022-07-12 10:17:23,308 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8123728123728123 [2022-07-12 10:17:23,308 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1996 transitions. [2022-07-12 10:17:23,308 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1996 transitions. [2022-07-12 10:17:23,309 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:17:23,310 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1996 transitions. [2022-07-12 10:17:23,314 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 221.77777777777777) internal successors, (1996), 9 states have internal predecessors, (1996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:17:23,317 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 273.0) internal successors, (2730), 10 states have internal predecessors, (2730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:17:23,318 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 273.0) internal successors, (2730), 10 states have internal predecessors, (2730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:17:23,318 INFO L186 Difference]: Start difference. First operand has 232 places, 233 transitions, 502 flow. Second operand 9 states and 1996 transitions. [2022-07-12 10:17:23,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 243 transitions, 570 flow [2022-07-12 10:17:23,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 243 transitions, 568 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-07-12 10:17:23,323 INFO L242 Difference]: Finished difference. Result has 242 places, 239 transitions, 550 flow [2022-07-12 10:17:23,323 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=500, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=550, PETRI_PLACES=242, PETRI_TRANSITIONS=239} [2022-07-12 10:17:23,324 INFO L279 CegarLoopForPetriNet]: 230 programPoint places, 12 predicate places. [2022-07-12 10:17:23,324 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 239 transitions, 550 flow [2022-07-12 10:17:23,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 221.2) internal successors, (2212), 10 states have internal predecessors, (2212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:17:23,326 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:17:23,326 INFO L200 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:17:23,350 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-12 10:17:23,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:17:23,550 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-07-12 10:17:23,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:17:23,550 INFO L85 PathProgramCache]: Analyzing trace with hash 914949097, now seen corresponding path program 2 times [2022-07-12 10:17:23,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:17:23,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706182847] [2022-07-12 10:17:23,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:17:23,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:17:23,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:17:23,640 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-12 10:17:23,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:17:23,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706182847] [2022-07-12 10:17:23,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706182847] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:17:23,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [890554229] [2022-07-12 10:17:23,641 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 10:17:23,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:17:23,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:17:23,643 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:17:23,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-12 10:17:23,728 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 10:17:23,728 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 10:17:23,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 10:17:23,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:17:23,769 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-12 10:17:23,769 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:17:23,850 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-12 10:17:23,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [890554229] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:17:23,851 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:17:23,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-07-12 10:17:23,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608918373] [2022-07-12 10:17:23,851 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:17:23,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-12 10:17:23,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:17:23,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-12 10:17:23,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-07-12 10:17:23,855 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 273 [2022-07-12 10:17:23,858 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 239 transitions, 550 flow. Second operand has 18 states, 18 states have (on average 221.33333333333334) internal successors, (3984), 18 states have internal predecessors, (3984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:17:23,858 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:17:23,858 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 273 [2022-07-12 10:17:23,858 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:17:24,076 INFO L129 PetriNetUnfolder]: 11/368 cut-off events. [2022-07-12 10:17:24,077 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2022-07-12 10:17:24,080 INFO L84 FinitePrefix]: Finished finitePrefix Result has 491 conditions, 368 events. 11/368 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1450 event pairs, 0 based on Foata normal form. 4/356 useless extension candidates. Maximal degree in co-relation 335. Up to 11 conditions per place. [2022-07-12 10:17:24,081 INFO L132 encePairwiseOnDemand]: 267/273 looper letters, 22 selfloop transitions, 21 changer transitions 0/263 dead transitions. [2022-07-12 10:17:24,081 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 263 transitions, 744 flow [2022-07-12 10:17:24,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-12 10:17:24,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-07-12 10:17:24,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 4646 transitions. [2022-07-12 10:17:24,092 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8103959532530961 [2022-07-12 10:17:24,092 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 4646 transitions. [2022-07-12 10:17:24,092 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 4646 transitions. [2022-07-12 10:17:24,094 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:17:24,094 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 4646 transitions. [2022-07-12 10:17:24,102 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 221.23809523809524) internal successors, (4646), 21 states have internal predecessors, (4646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:17:24,112 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 273.0) internal successors, (6006), 22 states have internal predecessors, (6006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:17:24,113 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 273.0) internal successors, (6006), 22 states have internal predecessors, (6006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:17:24,113 INFO L186 Difference]: Start difference. First operand has 242 places, 239 transitions, 550 flow. Second operand 21 states and 4646 transitions. [2022-07-12 10:17:24,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 263 transitions, 744 flow [2022-07-12 10:17:24,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 263 transitions, 730 flow, removed 6 selfloop flow, removed 1 redundant places. [2022-07-12 10:17:24,119 INFO L242 Difference]: Finished difference. Result has 266 places, 252 transitions, 674 flow [2022-07-12 10:17:24,120 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=544, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=674, PETRI_PLACES=266, PETRI_TRANSITIONS=252} [2022-07-12 10:17:24,121 INFO L279 CegarLoopForPetriNet]: 230 programPoint places, 36 predicate places. [2022-07-12 10:17:24,121 INFO L495 AbstractCegarLoop]: Abstraction has has 266 places, 252 transitions, 674 flow [2022-07-12 10:17:24,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 221.33333333333334) internal successors, (3984), 18 states have internal predecessors, (3984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:17:24,123 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:17:24,123 INFO L200 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:17:24,147 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-12 10:17:24,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:17:24,337 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-07-12 10:17:24,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:17:24,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1718903529, now seen corresponding path program 3 times [2022-07-12 10:17:24,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:17:24,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943056928] [2022-07-12 10:17:24,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:17:24,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:17:24,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:17:24,499 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-12 10:17:24,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:17:24,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943056928] [2022-07-12 10:17:24,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943056928] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:17:24,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1488087992] [2022-07-12 10:17:24,500 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-12 10:17:24,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:17:24,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:17:24,501 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:17:24,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-12 10:17:24,633 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-07-12 10:17:24,634 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 10:17:24,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-12 10:17:24,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:17:24,714 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-12 10:17:24,714 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:17:24,831 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-12 10:17:24,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1488087992] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:17:24,831 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:17:24,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2022-07-12 10:17:24,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694269676] [2022-07-12 10:17:24,832 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:17:24,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-12 10:17:24,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:17:24,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-12 10:17:24,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2022-07-12 10:17:24,837 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 273 [2022-07-12 10:17:24,841 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 252 transitions, 674 flow. Second operand has 23 states, 23 states have (on average 221.47826086956522) internal successors, (5094), 23 states have internal predecessors, (5094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:17:24,841 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:17:24,841 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 273 [2022-07-12 10:17:24,842 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:17:25,178 INFO L129 PetriNetUnfolder]: 11/383 cut-off events. [2022-07-12 10:17:25,178 INFO L130 PetriNetUnfolder]: For 126/126 co-relation queries the response was YES. [2022-07-12 10:17:25,181 INFO L84 FinitePrefix]: Finished finitePrefix Result has 592 conditions, 383 events. 11/383 cut-off events. For 126/126 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1450 event pairs, 0 based on Foata normal form. 3/370 useless extension candidates. Maximal degree in co-relation 410. Up to 17 conditions per place. [2022-07-12 10:17:25,182 INFO L132 encePairwiseOnDemand]: 267/273 looper letters, 28 selfloop transitions, 30 changer transitions 0/278 dead transitions. [2022-07-12 10:17:25,182 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 278 transitions, 936 flow [2022-07-12 10:17:25,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-07-12 10:17:25,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-07-12 10:17:25,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 6631 transitions. [2022-07-12 10:17:25,191 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8096459096459097 [2022-07-12 10:17:25,191 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 6631 transitions. [2022-07-12 10:17:25,191 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 6631 transitions. [2022-07-12 10:17:25,194 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:17:25,194 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 6631 transitions. [2022-07-12 10:17:25,202 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 221.03333333333333) internal successors, (6631), 30 states have internal predecessors, (6631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:17:25,212 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 273.0) internal successors, (8463), 31 states have internal predecessors, (8463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:17:25,214 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 273.0) internal successors, (8463), 31 states have internal predecessors, (8463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:17:25,214 INFO L186 Difference]: Start difference. First operand has 266 places, 252 transitions, 674 flow. Second operand 30 states and 6631 transitions. [2022-07-12 10:17:25,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 278 transitions, 936 flow [2022-07-12 10:17:25,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 278 transitions, 906 flow, removed 9 selfloop flow, removed 6 redundant places. [2022-07-12 10:17:25,221 INFO L242 Difference]: Finished difference. Result has 293 places, 262 transitions, 802 flow [2022-07-12 10:17:25,221 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=650, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=802, PETRI_PLACES=293, PETRI_TRANSITIONS=262} [2022-07-12 10:17:25,222 INFO L279 CegarLoopForPetriNet]: 230 programPoint places, 63 predicate places. [2022-07-12 10:17:25,222 INFO L495 AbstractCegarLoop]: Abstraction has has 293 places, 262 transitions, 802 flow [2022-07-12 10:17:25,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 221.47826086956522) internal successors, (5094), 23 states have internal predecessors, (5094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:17:25,224 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:17:25,224 INFO L200 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:17:25,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-12 10:17:25,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:17:25,444 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-07-12 10:17:25,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:17:25,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1050686411, now seen corresponding path program 4 times [2022-07-12 10:17:25,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:17:25,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115525328] [2022-07-12 10:17:25,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:17:25,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:17:25,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 10:17:25,482 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-12 10:17:25,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 10:17:25,512 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-12 10:17:25,513 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-12 10:17:25,513 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2022-07-12 10:17:25,513 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-07-12 10:17:25,513 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2022-07-12 10:17:25,513 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2022-07-12 10:17:25,513 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-07-12 10:17:25,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 10:17:25,514 INFO L356 BasicCegarLoop]: Path program histogram: [4, 1, 1] [2022-07-12 10:17:25,514 WARN L231 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2022-07-12 10:17:25,514 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2022-07-12 10:17:25,556 INFO L135 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-07-12 10:17:25,561 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 290 places, 346 transitions, 722 flow [2022-07-12 10:17:25,635 INFO L129 PetriNetUnfolder]: 120/681 cut-off events. [2022-07-12 10:17:25,635 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2022-07-12 10:17:25,646 INFO L84 FinitePrefix]: Finished finitePrefix Result has 709 conditions, 681 events. 120/681 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 3308 event pairs, 1 based on Foata normal form. 0/550 useless extension candidates. Maximal degree in co-relation 474. Up to 16 conditions per place. [2022-07-12 10:17:25,646 INFO L82 GeneralOperation]: Start removeDead. Operand has 290 places, 346 transitions, 722 flow [2022-07-12 10:17:25,656 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 290 places, 346 transitions, 722 flow [2022-07-12 10:17:25,657 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 10:17:25,657 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2338b5d9, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@524e2a76 [2022-07-12 10:17:25,657 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-07-12 10:17:25,668 INFO L129 PetriNetUnfolder]: 26/206 cut-off events. [2022-07-12 10:17:25,668 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-12 10:17:25,668 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:17:25,668 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:17:25,669 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-07-12 10:17:25,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:17:25,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1851205037, now seen corresponding path program 1 times [2022-07-12 10:17:25,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:17:25,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131807440] [2022-07-12 10:17:25,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:17:25,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:17:25,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:17:25,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:17:25,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:17:25,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131807440] [2022-07-12 10:17:25,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131807440] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:17:25,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:17:25,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 10:17:25,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757017940] [2022-07-12 10:17:25,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:17:25,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 10:17:25,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:17:25,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 10:17:25,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 10:17:25,693 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 346 [2022-07-12 10:17:25,694 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 346 transitions, 722 flow. Second operand has 3 states, 3 states have (on average 279.0) internal successors, (837), 3 states have internal predecessors, (837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:17:25,694 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:17:25,694 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 346 [2022-07-12 10:17:25,694 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:17:25,789 INFO L129 PetriNetUnfolder]: 23/581 cut-off events. [2022-07-12 10:17:25,789 INFO L130 PetriNetUnfolder]: For 49/49 co-relation queries the response was YES. [2022-07-12 10:17:25,795 INFO L84 FinitePrefix]: Finished finitePrefix Result has 636 conditions, 581 events. 23/581 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 3044 event pairs, 1 based on Foata normal form. 182/729 useless extension candidates. Maximal degree in co-relation 422. Up to 23 conditions per place. [2022-07-12 10:17:25,797 INFO L132 encePairwiseOnDemand]: 292/346 looper letters, 15 selfloop transitions, 2 changer transitions 0/295 dead transitions. [2022-07-12 10:17:25,798 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 295 transitions, 654 flow [2022-07-12 10:17:25,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 10:17:25,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-12 10:17:25,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 904 transitions. [2022-07-12 10:17:25,800 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8709055876685935 [2022-07-12 10:17:25,800 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 904 transitions. [2022-07-12 10:17:25,800 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 904 transitions. [2022-07-12 10:17:25,800 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:17:25,800 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 904 transitions. [2022-07-12 10:17:25,802 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 301.3333333333333) internal successors, (904), 3 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:17:25,803 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 346.0) internal successors, (1384), 4 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:17:25,804 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 346.0) internal successors, (1384), 4 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:17:25,804 INFO L186 Difference]: Start difference. First operand has 290 places, 346 transitions, 722 flow. Second operand 3 states and 904 transitions. [2022-07-12 10:17:25,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 295 transitions, 654 flow [2022-07-12 10:17:25,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 295 transitions, 654 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-07-12 10:17:25,809 INFO L242 Difference]: Finished difference. Result has 289 places, 292 transitions, 624 flow [2022-07-12 10:17:25,810 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=612, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=289, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=624, PETRI_PLACES=289, PETRI_TRANSITIONS=292} [2022-07-12 10:17:25,810 INFO L279 CegarLoopForPetriNet]: 290 programPoint places, -1 predicate places. [2022-07-12 10:17:25,810 INFO L495 AbstractCegarLoop]: Abstraction has has 289 places, 292 transitions, 624 flow [2022-07-12 10:17:25,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 279.0) internal successors, (837), 3 states have internal predecessors, (837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:17:25,811 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:17:25,811 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:17:25,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-12 10:17:25,811 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-07-12 10:17:25,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:17:25,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1513088709, now seen corresponding path program 1 times [2022-07-12 10:17:25,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:17:25,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722761929] [2022-07-12 10:17:25,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:17:25,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:17:25,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:17:25,838 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:17:25,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:17:25,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722761929] [2022-07-12 10:17:25,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722761929] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:17:25,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [688057616] [2022-07-12 10:17:25,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:17:25,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:17:25,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:17:25,841 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:17:25,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-12 10:17:25,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:17:25,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 10:17:25,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:17:25,937 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 10:17:25,937 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 10:17:25,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [688057616] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:17:25,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 10:17:25,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-07-12 10:17:25,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419381115] [2022-07-12 10:17:25,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:17:25,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 10:17:25,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:17:25,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 10:17:25,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 10:17:25,940 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 346 [2022-07-12 10:17:25,941 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 292 transitions, 624 flow. Second operand has 3 states, 3 states have (on average 279.0) internal successors, (837), 3 states have internal predecessors, (837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:17:25,941 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:17:25,941 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 346 [2022-07-12 10:17:25,941 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:17:26,028 INFO L129 PetriNetUnfolder]: 20/525 cut-off events. [2022-07-12 10:17:26,028 INFO L130 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-07-12 10:17:26,035 INFO L84 FinitePrefix]: Finished finitePrefix Result has 595 conditions, 525 events. 20/525 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2681 event pairs, 1 based on Foata normal form. 0/496 useless extension candidates. Maximal degree in co-relation 557. Up to 30 conditions per place. [2022-07-12 10:17:26,038 INFO L132 encePairwiseOnDemand]: 343/346 looper letters, 15 selfloop transitions, 2 changer transitions 0/296 dead transitions. [2022-07-12 10:17:26,038 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 296 transitions, 666 flow [2022-07-12 10:17:26,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 10:17:26,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-12 10:17:26,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 852 transitions. [2022-07-12 10:17:26,040 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8208092485549133 [2022-07-12 10:17:26,041 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 852 transitions. [2022-07-12 10:17:26,041 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 852 transitions. [2022-07-12 10:17:26,041 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:17:26,041 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 852 transitions. [2022-07-12 10:17:26,043 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 284.0) internal successors, (852), 3 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:17:26,044 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 346.0) internal successors, (1384), 4 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:17:26,044 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 346.0) internal successors, (1384), 4 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:17:26,044 INFO L186 Difference]: Start difference. First operand has 289 places, 292 transitions, 624 flow. Second operand 3 states and 852 transitions. [2022-07-12 10:17:26,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 296 transitions, 666 flow [2022-07-12 10:17:26,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 296 transitions, 664 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-07-12 10:17:26,050 INFO L242 Difference]: Finished difference. Result has 291 places, 293 transitions, 634 flow [2022-07-12 10:17:26,051 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=622, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=634, PETRI_PLACES=291, PETRI_TRANSITIONS=293} [2022-07-12 10:17:26,051 INFO L279 CegarLoopForPetriNet]: 290 programPoint places, 1 predicate places. [2022-07-12 10:17:26,052 INFO L495 AbstractCegarLoop]: Abstraction has has 291 places, 293 transitions, 634 flow [2022-07-12 10:17:26,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 279.0) internal successors, (837), 3 states have internal predecessors, (837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:17:26,052 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:17:26,052 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:17:26,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-12 10:17:26,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-12 10:17:26,268 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-07-12 10:17:26,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:17:26,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1584273556, now seen corresponding path program 1 times [2022-07-12 10:17:26,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:17:26,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744413566] [2022-07-12 10:17:26,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:17:26,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:17:26,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:17:26,298 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:17:26,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:17:26,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744413566] [2022-07-12 10:17:26,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744413566] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:17:26,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [986991096] [2022-07-12 10:17:26,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:17:26,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:17:26,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:17:26,301 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:17:26,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-12 10:17:26,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:17:26,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 10:17:26,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:17:26,429 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:17:26,430 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:17:26,452 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:17:26,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [986991096] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:17:26,453 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:17:26,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-07-12 10:17:26,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509118172] [2022-07-12 10:17:26,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:17:26,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 10:17:26,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:17:26,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 10:17:26,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-12 10:17:26,457 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 346 [2022-07-12 10:17:26,460 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 293 transitions, 634 flow. Second operand has 10 states, 10 states have (on average 279.1) internal successors, (2791), 10 states have internal predecessors, (2791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:17:26,460 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:17:26,460 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 346 [2022-07-12 10:17:26,460 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:17:26,598 INFO L129 PetriNetUnfolder]: 20/532 cut-off events. [2022-07-12 10:17:26,598 INFO L130 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2022-07-12 10:17:26,605 INFO L84 FinitePrefix]: Finished finitePrefix Result has 611 conditions, 532 events. 20/532 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2678 event pairs, 1 based on Foata normal form. 2/508 useless extension candidates. Maximal degree in co-relation 539. Up to 20 conditions per place. [2022-07-12 10:17:26,608 INFO L132 encePairwiseOnDemand]: 340/346 looper letters, 16 selfloop transitions, 9 changer transitions 0/303 dead transitions. [2022-07-12 10:17:26,608 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 303 transitions, 706 flow [2022-07-12 10:17:26,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 10:17:26,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-12 10:17:26,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2520 transitions. [2022-07-12 10:17:26,612 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8092485549132948 [2022-07-12 10:17:26,612 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2520 transitions. [2022-07-12 10:17:26,612 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2520 transitions. [2022-07-12 10:17:26,613 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:17:26,613 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2520 transitions. [2022-07-12 10:17:26,616 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 280.0) internal successors, (2520), 9 states have internal predecessors, (2520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:17:26,620 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 346.0) internal successors, (3460), 10 states have internal predecessors, (3460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:17:26,621 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 346.0) internal successors, (3460), 10 states have internal predecessors, (3460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:17:26,621 INFO L186 Difference]: Start difference. First operand has 291 places, 293 transitions, 634 flow. Second operand 9 states and 2520 transitions. [2022-07-12 10:17:26,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 303 transitions, 706 flow [2022-07-12 10:17:26,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 303 transitions, 704 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-07-12 10:17:26,627 INFO L242 Difference]: Finished difference. Result has 301 places, 299 transitions, 682 flow [2022-07-12 10:17:26,628 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=632, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=682, PETRI_PLACES=301, PETRI_TRANSITIONS=299} [2022-07-12 10:17:26,629 INFO L279 CegarLoopForPetriNet]: 290 programPoint places, 11 predicate places. [2022-07-12 10:17:26,629 INFO L495 AbstractCegarLoop]: Abstraction has has 301 places, 299 transitions, 682 flow [2022-07-12 10:17:26,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 279.1) internal successors, (2791), 10 states have internal predecessors, (2791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:17:26,630 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:17:26,630 INFO L200 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:17:26,657 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-07-12 10:17:26,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-12 10:17:26,847 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-07-12 10:17:26,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:17:26,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1224153428, now seen corresponding path program 2 times [2022-07-12 10:17:26,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:17:26,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853244783] [2022-07-12 10:17:26,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:17:26,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:17:26,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:17:26,914 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:17:26,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:17:26,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853244783] [2022-07-12 10:17:26,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853244783] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:17:26,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1968062634] [2022-07-12 10:17:26,915 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 10:17:26,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:17:26,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:17:26,917 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:17:26,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-12 10:17:27,007 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-12 10:17:27,008 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 10:17:27,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-12 10:17:27,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:17:27,054 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-07-12 10:17:27,177 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 10:17:27,178 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 10:17:27,215 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-12 10:17:27,300 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-07-12 10:17:27,350 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-12 10:17:27,351 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 10:17:27,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1968062634] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:17:27,351 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 10:17:27,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [9] total 19 [2022-07-12 10:17:27,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676452801] [2022-07-12 10:17:27,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:17:27,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 10:17:27,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:17:27,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 10:17:27,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2022-07-12 10:17:27,355 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 346 [2022-07-12 10:17:27,357 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 299 transitions, 682 flow. Second operand has 12 states, 12 states have (on average 232.33333333333334) internal successors, (2788), 12 states have internal predecessors, (2788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:17:27,357 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:17:27,357 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 346 [2022-07-12 10:17:27,357 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:18:04,378 INFO L129 PetriNetUnfolder]: 112920/268752 cut-off events. [2022-07-12 10:18:04,378 INFO L130 PetriNetUnfolder]: For 9789/10023 co-relation queries the response was YES. [2022-07-12 10:18:07,814 INFO L84 FinitePrefix]: Finished finitePrefix Result has 417000 conditions, 268752 events. 112920/268752 cut-off events. For 9789/10023 co-relation queries the response was YES. Maximal size of possible extension queue 7311. Compared 3849921 event pairs, 6433 based on Foata normal form. 19/253241 useless extension candidates. Maximal degree in co-relation 416911. Up to 49715 conditions per place. [2022-07-12 10:18:09,688 INFO L132 encePairwiseOnDemand]: 328/346 looper letters, 301 selfloop transitions, 48 changer transitions 0/587 dead transitions. [2022-07-12 10:18:09,688 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 587 transitions, 2109 flow [2022-07-12 10:18:09,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 10:18:09,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-07-12 10:18:09,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 3800 transitions. [2022-07-12 10:18:09,693 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7321772639691715 [2022-07-12 10:18:09,694 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 3800 transitions. [2022-07-12 10:18:09,694 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 3800 transitions. [2022-07-12 10:18:09,695 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:18:09,695 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 3800 transitions. [2022-07-12 10:18:09,700 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 253.33333333333334) internal successors, (3800), 15 states have internal predecessors, (3800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:18:09,707 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 346.0) internal successors, (5536), 16 states have internal predecessors, (5536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:18:09,708 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 346.0) internal successors, (5536), 16 states have internal predecessors, (5536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:18:09,708 INFO L186 Difference]: Start difference. First operand has 301 places, 299 transitions, 682 flow. Second operand 15 states and 3800 transitions. [2022-07-12 10:18:09,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 587 transitions, 2109 flow [2022-07-12 10:18:09,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 587 transitions, 2103 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-07-12 10:18:09,725 INFO L242 Difference]: Finished difference. Result has 325 places, 353 transitions, 1031 flow [2022-07-12 10:18:09,726 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=676, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1031, PETRI_PLACES=325, PETRI_TRANSITIONS=353} [2022-07-12 10:18:09,727 INFO L279 CegarLoopForPetriNet]: 290 programPoint places, 35 predicate places. [2022-07-12 10:18:09,727 INFO L495 AbstractCegarLoop]: Abstraction has has 325 places, 353 transitions, 1031 flow [2022-07-12 10:18:09,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 232.33333333333334) internal successors, (2788), 12 states have internal predecessors, (2788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:18:09,728 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:18:09,728 INFO L200 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:18:09,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-12 10:18:09,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-12 10:18:09,953 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-07-12 10:18:09,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:18:09,953 INFO L85 PathProgramCache]: Analyzing trace with hash 657728224, now seen corresponding path program 1 times [2022-07-12 10:18:09,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:18:09,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759144817] [2022-07-12 10:18:09,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:18:09,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:18:09,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:18:10,016 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-12 10:18:10,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:18:10,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759144817] [2022-07-12 10:18:10,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759144817] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:18:10,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1559993019] [2022-07-12 10:18:10,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:18:10,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:18:10,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:18:10,019 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:18:10,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-12 10:18:10,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:18:10,117 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 10:18:10,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:18:10,184 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 10:18:10,184 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:18:10,285 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 10:18:10,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1559993019] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:18:10,285 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:18:10,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2022-07-12 10:18:10,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757998475] [2022-07-12 10:18:10,286 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:18:10,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-12 10:18:10,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:18:10,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-12 10:18:10,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2022-07-12 10:18:10,290 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 270 out of 346 [2022-07-12 10:18:10,293 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 353 transitions, 1031 flow. Second operand has 19 states, 19 states have (on average 273.05263157894734) internal successors, (5188), 19 states have internal predecessors, (5188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:18:10,293 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:18:10,293 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 270 of 346 [2022-07-12 10:18:10,293 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:18:12,627 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1373] t_funEXIT-->L957-4: Formula: (= v_t_funThread3of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem48#1_15| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][245], [t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse, 462#true, 1083#true, Black: 295#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 399#(<= |ULTIMATE.start_main_~i~3#1| 0), Black: 1064#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (exists ((|t_funThread1of3ForFork0_cache_entry_addref_~entry#1.offset| Int)) (= (select ((as const (Array Int Int)) 0) |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.offset|) |t_funThread1of3ForFork0_cache_entry_addref_#t~mem40#1|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 1066#(and (<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1|) (<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1|)), Black: 1044#(<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1|), Black: 1051#(<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1|), Black: 1058#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 1068#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4))), Black: 1062#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4))), Black: 1056#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 1060#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 897#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 736#(< |ULTIMATE.start_main_~i~1#1| 10), 223#L957-4true, Black: 466#(<= |ULTIMATE.start_main_~i~1#1| 1), t_funThread1of3ForFork0NotInUse, 893#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1))]) [2022-07-12 10:18:12,628 INFO L384 tUnfolder$Statistics]: this new event has 203 ancestors and is cut-off event [2022-07-12 10:18:12,628 INFO L387 tUnfolder$Statistics]: existing Event has 203 ancestors and is cut-off event [2022-07-12 10:18:12,628 INFO L387 tUnfolder$Statistics]: existing Event has 167 ancestors and is cut-off event [2022-07-12 10:18:12,628 INFO L387 tUnfolder$Statistics]: existing Event has 167 ancestors and is cut-off event [2022-07-12 10:18:12,838 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1372] t_funEXIT-->L957-4: Formula: (= v_t_funThread2of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem48#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_13|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_13|} AuxVars[] AssignedVars[][146], [t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse, 462#true, 1083#true, Black: 295#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 399#(<= |ULTIMATE.start_main_~i~3#1| 0), Black: 1064#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (exists ((|t_funThread1of3ForFork0_cache_entry_addref_~entry#1.offset| Int)) (= (select ((as const (Array Int Int)) 0) |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.offset|) |t_funThread1of3ForFork0_cache_entry_addref_#t~mem40#1|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 1066#(and (<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1|) (<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1|)), Black: 1044#(<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1|), Black: 1051#(<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1|), Black: 1058#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 1068#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4))), Black: 1062#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4))), Black: 1056#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 1060#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 897#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 736#(< |ULTIMATE.start_main_~i~1#1| 10), 223#L957-4true, Black: 466#(<= |ULTIMATE.start_main_~i~1#1| 1), t_funThread1of3ForFork0NotInUse, 893#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1))]) [2022-07-12 10:18:12,839 INFO L384 tUnfolder$Statistics]: this new event has 216 ancestors and is cut-off event [2022-07-12 10:18:12,839 INFO L387 tUnfolder$Statistics]: existing Event has 144 ancestors and is cut-off event [2022-07-12 10:18:12,839 INFO L387 tUnfolder$Statistics]: existing Event has 144 ancestors and is cut-off event [2022-07-12 10:18:12,839 INFO L387 tUnfolder$Statistics]: existing Event has 180 ancestors and is cut-off event [2022-07-12 10:18:12,890 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1372] t_funEXIT-->L957-4: Formula: (= v_t_funThread2of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem48#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_13|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_13|} AuxVars[] AssignedVars[][146], [t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0InUse, 462#true, 1083#true, Black: 295#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 399#(<= |ULTIMATE.start_main_~i~3#1| 0), 81#t_funENTRYtrue, Black: 1064#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (exists ((|t_funThread1of3ForFork0_cache_entry_addref_~entry#1.offset| Int)) (= (select ((as const (Array Int Int)) 0) |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.offset|) |t_funThread1of3ForFork0_cache_entry_addref_#t~mem40#1|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 1066#(and (<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1|) (<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1|)), Black: 1044#(<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1|), Black: 1051#(<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1|), Black: 1058#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 1068#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4))), Black: 1062#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4))), Black: 1056#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 1060#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 897#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 736#(< |ULTIMATE.start_main_~i~1#1| 10), 223#L957-4true, Black: 466#(<= |ULTIMATE.start_main_~i~1#1| 1), t_funThread1of3ForFork0NotInUse, 893#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1))]) [2022-07-12 10:18:12,890 INFO L384 tUnfolder$Statistics]: this new event has 226 ancestors and is cut-off event [2022-07-12 10:18:12,890 INFO L387 tUnfolder$Statistics]: existing Event has 154 ancestors and is cut-off event [2022-07-12 10:18:12,891 INFO L387 tUnfolder$Statistics]: existing Event has 154 ancestors and is cut-off event [2022-07-12 10:18:12,891 INFO L387 tUnfolder$Statistics]: existing Event has 190 ancestors and is cut-off event [2022-07-12 10:18:12,895 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1372] t_funEXIT-->L957-4: Formula: (= v_t_funThread2of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem48#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_13|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_13|} AuxVars[] AssignedVars[][146], [t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse, 462#true, 1083#true, Black: 295#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 399#(<= |ULTIMATE.start_main_~i~3#1| 0), Black: 1064#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (exists ((|t_funThread1of3ForFork0_cache_entry_addref_~entry#1.offset| Int)) (= (select ((as const (Array Int Int)) 0) |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.offset|) |t_funThread1of3ForFork0_cache_entry_addref_#t~mem40#1|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 1066#(and (<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1|) (<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1|)), Black: 1044#(<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1|), Black: 1051#(<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1|), Black: 1058#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 1068#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4))), Black: 1062#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4))), Black: 1056#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 1060#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 897#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), 46#t_funENTRYtrue, Black: 736#(< |ULTIMATE.start_main_~i~1#1| 10), 223#L957-4true, Black: 466#(<= |ULTIMATE.start_main_~i~1#1| 1), 893#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1)), t_funThread1of3ForFork0InUse]) [2022-07-12 10:18:12,896 INFO L384 tUnfolder$Statistics]: this new event has 226 ancestors and is cut-off event [2022-07-12 10:18:12,896 INFO L387 tUnfolder$Statistics]: existing Event has 131 ancestors and is cut-off event [2022-07-12 10:18:12,896 INFO L387 tUnfolder$Statistics]: existing Event has 131 ancestors and is cut-off event [2022-07-12 10:18:12,896 INFO L387 tUnfolder$Statistics]: existing Event has 167 ancestors and is cut-off event [2022-07-12 10:18:12,917 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1372] t_funEXIT-->L957-4: Formula: (= v_t_funThread2of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem48#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_13|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_13|} AuxVars[] AssignedVars[][146], [t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse, 462#true, 1083#true, Black: 295#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 399#(<= |ULTIMATE.start_main_~i~3#1| 0), Black: 1064#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (exists ((|t_funThread1of3ForFork0_cache_entry_addref_~entry#1.offset| Int)) (= (select ((as const (Array Int Int)) 0) |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.offset|) |t_funThread1of3ForFork0_cache_entry_addref_#t~mem40#1|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 1066#(and (<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1|) (<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1|)), Black: 1044#(<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1|), Black: 1051#(<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1|), Black: 1058#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 1068#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4))), Black: 1062#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4))), Black: 1056#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), 250#L947-2true, Black: 1060#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 897#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 736#(< |ULTIMATE.start_main_~i~1#1| 10), 223#L957-4true, Black: 466#(<= |ULTIMATE.start_main_~i~1#1| 1), 893#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1)), t_funThread1of3ForFork0InUse]) [2022-07-12 10:18:12,917 INFO L384 tUnfolder$Statistics]: this new event has 232 ancestors and is cut-off event [2022-07-12 10:18:12,917 INFO L387 tUnfolder$Statistics]: existing Event has 173 ancestors and is cut-off event [2022-07-12 10:18:12,917 INFO L387 tUnfolder$Statistics]: existing Event has 137 ancestors and is cut-off event [2022-07-12 10:18:12,917 INFO L387 tUnfolder$Statistics]: existing Event has 137 ancestors and is cut-off event [2022-07-12 10:18:12,922 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1373] t_funEXIT-->L957-4: Formula: (= v_t_funThread3of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem48#1_15| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][245], [t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse, 462#true, 1083#true, Black: 295#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 399#(<= |ULTIMATE.start_main_~i~3#1| 0), Black: 1064#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (exists ((|t_funThread1of3ForFork0_cache_entry_addref_~entry#1.offset| Int)) (= (select ((as const (Array Int Int)) 0) |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.offset|) |t_funThread1of3ForFork0_cache_entry_addref_#t~mem40#1|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 1066#(and (<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1|) (<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1|)), Black: 1044#(<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1|), Black: 1051#(<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1|), Black: 1058#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 1068#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4))), Black: 1062#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4))), Black: 1056#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 1060#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 897#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), 238#L940true, 223#L957-4true, Black: 736#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 466#(<= |ULTIMATE.start_main_~i~1#1| 1), 893#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1)), t_funThread1of3ForFork0InUse]) [2022-07-12 10:18:12,922 INFO L384 tUnfolder$Statistics]: this new event has 234 ancestors and is cut-off event [2022-07-12 10:18:12,922 INFO L387 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-07-12 10:18:12,923 INFO L387 tUnfolder$Statistics]: existing Event has 162 ancestors and is cut-off event [2022-07-12 10:18:12,923 INFO L387 tUnfolder$Statistics]: existing Event has 162 ancestors and is cut-off event [2022-07-12 10:18:12,939 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1372] t_funEXIT-->L957-4: Formula: (= v_t_funThread2of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem48#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_13|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_13|} AuxVars[] AssignedVars[][146], [t_funThread2of3ForFork0NotInUse, t_funThread3of3ForFork0NotInUse, 462#true, 1083#true, 41#L941-30true, Black: 295#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 399#(<= |ULTIMATE.start_main_~i~3#1| 0), Black: 1064#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (exists ((|t_funThread1of3ForFork0_cache_entry_addref_~entry#1.offset| Int)) (= (select ((as const (Array Int Int)) 0) |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.offset|) |t_funThread1of3ForFork0_cache_entry_addref_#t~mem40#1|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 1066#(and (<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1|) (<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1|)), Black: 1044#(<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1|), Black: 1051#(<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1|), Black: 1058#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 1068#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4))), Black: 1062#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4))), Black: 1056#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 1060#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 897#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 736#(< |ULTIMATE.start_main_~i~1#1| 10), 223#L957-4true, Black: 466#(<= |ULTIMATE.start_main_~i~1#1| 1), 893#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1)), t_funThread1of3ForFork0InUse]) [2022-07-12 10:18:12,939 INFO L384 tUnfolder$Statistics]: this new event has 242 ancestors and is cut-off event [2022-07-12 10:18:12,939 INFO L387 tUnfolder$Statistics]: existing Event has 147 ancestors and is cut-off event [2022-07-12 10:18:12,939 INFO L387 tUnfolder$Statistics]: existing Event has 147 ancestors and is cut-off event [2022-07-12 10:18:12,939 INFO L387 tUnfolder$Statistics]: existing Event has 183 ancestors and is cut-off event [2022-07-12 10:18:12,946 INFO L129 PetriNetUnfolder]: 1166/11881 cut-off events. [2022-07-12 10:18:12,946 INFO L130 PetriNetUnfolder]: For 3249/4549 co-relation queries the response was YES. [2022-07-12 10:18:13,162 INFO L84 FinitePrefix]: Finished finitePrefix Result has 15848 conditions, 11881 events. 1166/11881 cut-off events. For 3249/4549 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 146589 event pairs, 115 based on Foata normal form. 33/11072 useless extension candidates. Maximal degree in co-relation 15682. Up to 557 conditions per place. [2022-07-12 10:18:13,247 INFO L132 encePairwiseOnDemand]: 335/346 looper letters, 37 selfloop transitions, 26 changer transitions 0/386 dead transitions. [2022-07-12 10:18:13,247 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 349 places, 386 transitions, 1285 flow [2022-07-12 10:18:13,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-12 10:18:13,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-07-12 10:18:13,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 6816 transitions. [2022-07-12 10:18:13,259 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7879768786127168 [2022-07-12 10:18:13,259 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 6816 transitions. [2022-07-12 10:18:13,259 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 6816 transitions. [2022-07-12 10:18:13,262 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:18:13,262 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 6816 transitions. [2022-07-12 10:18:13,273 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 272.64) internal successors, (6816), 25 states have internal predecessors, (6816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:18:13,285 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 346.0) internal successors, (8996), 26 states have internal predecessors, (8996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:18:13,287 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 346.0) internal successors, (8996), 26 states have internal predecessors, (8996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:18:13,287 INFO L186 Difference]: Start difference. First operand has 325 places, 353 transitions, 1031 flow. Second operand 25 states and 6816 transitions. [2022-07-12 10:18:13,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 349 places, 386 transitions, 1285 flow [2022-07-12 10:18:13,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 349 places, 386 transitions, 1285 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-07-12 10:18:13,575 INFO L242 Difference]: Finished difference. Result has 357 places, 369 transitions, 1195 flow [2022-07-12 10:18:13,576 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=1031, PETRI_DIFFERENCE_MINUEND_PLACES=325, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=337, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=1195, PETRI_PLACES=357, PETRI_TRANSITIONS=369} [2022-07-12 10:18:13,577 INFO L279 CegarLoopForPetriNet]: 290 programPoint places, 67 predicate places. [2022-07-12 10:18:13,577 INFO L495 AbstractCegarLoop]: Abstraction has has 357 places, 369 transitions, 1195 flow [2022-07-12 10:18:13,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 273.05263157894734) internal successors, (5188), 19 states have internal predecessors, (5188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:18:13,578 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:18:13,578 INFO L200 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:18:13,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-07-12 10:18:13,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-07-12 10:18:13,803 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-07-12 10:18:13,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:18:13,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1799201985, now seen corresponding path program 1 times [2022-07-12 10:18:13,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:18:13,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390535812] [2022-07-12 10:18:13,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:18:13,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:18:13,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:18:13,961 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-07-12 10:18:13,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:18:13,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390535812] [2022-07-12 10:18:13,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390535812] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:18:13,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [973993033] [2022-07-12 10:18:13,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:18:13,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:18:13,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:18:13,964 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:18:13,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-12 10:18:14,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:18:14,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-12 10:18:14,083 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:18:14,147 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-07-12 10:18:14,148 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:18:14,270 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-07-12 10:18:14,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [973993033] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:18:14,270 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:18:14,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2022-07-12 10:18:14,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864119512] [2022-07-12 10:18:14,271 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:18:14,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-12 10:18:14,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:18:14,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-12 10:18:14,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2022-07-12 10:18:14,276 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 346 [2022-07-12 10:18:14,280 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 357 places, 369 transitions, 1195 flow. Second operand has 23 states, 23 states have (on average 279.5217391304348) internal successors, (6429), 23 states have internal predecessors, (6429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:18:14,280 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:18:14,280 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 346 [2022-07-12 10:18:14,281 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:18:16,570 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1373] t_funEXIT-->L957-4: Formula: (= v_t_funThread3of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem48#1_15| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][254], [1083#true, Black: 399#(<= |ULTIMATE.start_main_~i~3#1| 0), 1571#true, Black: 1205#(<= |ULTIMATE.start_main_~i~1#1| 3), Black: 1416#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 1561#(and (= 0 |ULTIMATE.start_main_#t~post43#1|) (<= |ULTIMATE.start_main_~i~3#1| 1)), 223#L957-4true, 893#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1)), t_funThread1of3ForFork0NotInUse, Black: 1085#(= |ULTIMATE.start_main_~i~3#1| 0), t_funThread2of3ForFork0NotInUse, Black: 1444#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 1427#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 1087#(<= |ULTIMATE.start_main_~i~3#1| 1), t_funThread3of3ForFork0NotInUse, 462#true, Black: 295#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 1064#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (exists ((|t_funThread1of3ForFork0_cache_entry_addref_~entry#1.offset| Int)) (= (select ((as const (Array Int Int)) 0) |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.offset|) |t_funThread1of3ForFork0_cache_entry_addref_#t~mem40#1|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 1066#(and (<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1|) (<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1|)), Black: 1044#(<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1|), Black: 1051#(<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1|), Black: 1058#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 1068#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4))), Black: 1062#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4))), Black: 1056#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 1060#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 897#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 736#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 466#(<= |ULTIMATE.start_main_~i~1#1| 1)]) [2022-07-12 10:18:16,571 INFO L384 tUnfolder$Statistics]: this new event has 218 ancestors and is cut-off event [2022-07-12 10:18:16,571 INFO L387 tUnfolder$Statistics]: existing Event has 182 ancestors and is cut-off event [2022-07-12 10:18:16,571 INFO L387 tUnfolder$Statistics]: existing Event has 182 ancestors and is cut-off event [2022-07-12 10:18:16,572 INFO L387 tUnfolder$Statistics]: existing Event has 218 ancestors and is cut-off event [2022-07-12 10:18:16,765 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1372] t_funEXIT-->L957-4: Formula: (= v_t_funThread2of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem48#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_13|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_13|} AuxVars[] AssignedVars[][157], [1083#true, Black: 399#(<= |ULTIMATE.start_main_~i~3#1| 0), 1571#true, Black: 1205#(<= |ULTIMATE.start_main_~i~1#1| 3), Black: 1416#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 1561#(and (= 0 |ULTIMATE.start_main_#t~post43#1|) (<= |ULTIMATE.start_main_~i~3#1| 1)), 223#L957-4true, t_funThread1of3ForFork0NotInUse, 893#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1)), Black: 1085#(= |ULTIMATE.start_main_~i~3#1| 0), Black: 1444#(< |ULTIMATE.start_main_~i~1#1| 8), t_funThread2of3ForFork0NotInUse, Black: 1427#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 1087#(<= |ULTIMATE.start_main_~i~3#1| 1), t_funThread3of3ForFork0NotInUse, 462#true, Black: 295#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 1064#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (exists ((|t_funThread1of3ForFork0_cache_entry_addref_~entry#1.offset| Int)) (= (select ((as const (Array Int Int)) 0) |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.offset|) |t_funThread1of3ForFork0_cache_entry_addref_#t~mem40#1|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 1066#(and (<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1|) (<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1|)), Black: 1044#(<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1|), Black: 1051#(<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1|), Black: 1058#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 1068#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4))), Black: 1062#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4))), Black: 1056#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 1060#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 897#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 736#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 466#(<= |ULTIMATE.start_main_~i~1#1| 1)]) [2022-07-12 10:18:16,765 INFO L384 tUnfolder$Statistics]: this new event has 231 ancestors and is cut-off event [2022-07-12 10:18:16,765 INFO L387 tUnfolder$Statistics]: existing Event has 159 ancestors and is cut-off event [2022-07-12 10:18:16,765 INFO L387 tUnfolder$Statistics]: existing Event has 195 ancestors and is cut-off event [2022-07-12 10:18:16,765 INFO L387 tUnfolder$Statistics]: existing Event has 159 ancestors and is cut-off event [2022-07-12 10:18:16,817 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1372] t_funEXIT-->L957-4: Formula: (= v_t_funThread2of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem48#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_13|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_13|} AuxVars[] AssignedVars[][157], [1083#true, Black: 399#(<= |ULTIMATE.start_main_~i~3#1| 0), 81#t_funENTRYtrue, 1571#true, Black: 1205#(<= |ULTIMATE.start_main_~i~1#1| 3), Black: 1416#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 1561#(and (= 0 |ULTIMATE.start_main_#t~post43#1|) (<= |ULTIMATE.start_main_~i~3#1| 1)), 223#L957-4true, t_funThread1of3ForFork0NotInUse, 893#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1)), Black: 1085#(= |ULTIMATE.start_main_~i~3#1| 0), t_funThread2of3ForFork0NotInUse, Black: 1444#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 1427#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 1087#(<= |ULTIMATE.start_main_~i~3#1| 1), t_funThread3of3ForFork0InUse, 462#true, Black: 295#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 1064#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (exists ((|t_funThread1of3ForFork0_cache_entry_addref_~entry#1.offset| Int)) (= (select ((as const (Array Int Int)) 0) |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.offset|) |t_funThread1of3ForFork0_cache_entry_addref_#t~mem40#1|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 1066#(and (<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1|) (<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1|)), Black: 1044#(<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1|), Black: 1051#(<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1|), Black: 1058#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 1068#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4))), Black: 1062#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4))), Black: 1056#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 1060#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 897#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 736#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 466#(<= |ULTIMATE.start_main_~i~1#1| 1)]) [2022-07-12 10:18:16,817 INFO L384 tUnfolder$Statistics]: this new event has 241 ancestors and is cut-off event [2022-07-12 10:18:16,817 INFO L387 tUnfolder$Statistics]: existing Event has 169 ancestors and is cut-off event [2022-07-12 10:18:16,817 INFO L387 tUnfolder$Statistics]: existing Event has 205 ancestors and is cut-off event [2022-07-12 10:18:16,817 INFO L387 tUnfolder$Statistics]: existing Event has 169 ancestors and is cut-off event [2022-07-12 10:18:16,822 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1372] t_funEXIT-->L957-4: Formula: (= v_t_funThread2of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem48#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_13|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_13|} AuxVars[] AssignedVars[][157], [1083#true, Black: 399#(<= |ULTIMATE.start_main_~i~3#1| 0), 1571#true, 46#t_funENTRYtrue, Black: 1205#(<= |ULTIMATE.start_main_~i~1#1| 3), Black: 1416#(< |ULTIMATE.start_main_~i~1#1| 10), 223#L957-4true, Black: 1561#(and (= 0 |ULTIMATE.start_main_#t~post43#1|) (<= |ULTIMATE.start_main_~i~3#1| 1)), 893#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1)), Black: 1085#(= |ULTIMATE.start_main_~i~3#1| 0), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0NotInUse, Black: 1444#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 1427#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 1087#(<= |ULTIMATE.start_main_~i~3#1| 1), t_funThread3of3ForFork0NotInUse, 462#true, Black: 295#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 1064#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (exists ((|t_funThread1of3ForFork0_cache_entry_addref_~entry#1.offset| Int)) (= (select ((as const (Array Int Int)) 0) |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.offset|) |t_funThread1of3ForFork0_cache_entry_addref_#t~mem40#1|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 1066#(and (<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1|) (<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1|)), Black: 1044#(<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1|), Black: 1051#(<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1|), Black: 1058#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 1068#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4))), Black: 1062#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4))), Black: 1056#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 1060#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 897#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 736#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 466#(<= |ULTIMATE.start_main_~i~1#1| 1)]) [2022-07-12 10:18:16,822 INFO L384 tUnfolder$Statistics]: this new event has 241 ancestors and is cut-off event [2022-07-12 10:18:16,822 INFO L387 tUnfolder$Statistics]: existing Event has 146 ancestors and is cut-off event [2022-07-12 10:18:16,822 INFO L387 tUnfolder$Statistics]: existing Event has 182 ancestors and is cut-off event [2022-07-12 10:18:16,822 INFO L387 tUnfolder$Statistics]: existing Event has 146 ancestors and is cut-off event [2022-07-12 10:18:16,846 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1372] t_funEXIT-->L957-4: Formula: (= v_t_funThread2of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem48#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_13|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_13|} AuxVars[] AssignedVars[][157], [1083#true, Black: 399#(<= |ULTIMATE.start_main_~i~3#1| 0), 1571#true, 250#L947-2true, Black: 1205#(<= |ULTIMATE.start_main_~i~1#1| 3), Black: 1416#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 1561#(and (= 0 |ULTIMATE.start_main_#t~post43#1|) (<= |ULTIMATE.start_main_~i~3#1| 1)), 223#L957-4true, 893#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1)), Black: 1085#(= |ULTIMATE.start_main_~i~3#1| 0), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0NotInUse, Black: 1444#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 1427#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 1087#(<= |ULTIMATE.start_main_~i~3#1| 1), t_funThread3of3ForFork0NotInUse, 462#true, Black: 295#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 1064#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (exists ((|t_funThread1of3ForFork0_cache_entry_addref_~entry#1.offset| Int)) (= (select ((as const (Array Int Int)) 0) |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.offset|) |t_funThread1of3ForFork0_cache_entry_addref_#t~mem40#1|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 1066#(and (<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1|) (<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1|)), Black: 1044#(<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1|), Black: 1051#(<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1|), Black: 1058#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 1068#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4))), Black: 1062#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4))), Black: 1056#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 1060#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 897#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 736#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 466#(<= |ULTIMATE.start_main_~i~1#1| 1)]) [2022-07-12 10:18:16,846 INFO L384 tUnfolder$Statistics]: this new event has 247 ancestors and is cut-off event [2022-07-12 10:18:16,847 INFO L387 tUnfolder$Statistics]: existing Event has 152 ancestors and is cut-off event [2022-07-12 10:18:16,847 INFO L387 tUnfolder$Statistics]: existing Event has 188 ancestors and is cut-off event [2022-07-12 10:18:16,847 INFO L387 tUnfolder$Statistics]: existing Event has 152 ancestors and is cut-off event [2022-07-12 10:18:16,854 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1373] t_funEXIT-->L957-4: Formula: (= v_t_funThread3of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem48#1_15| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_15|, t_funThread3of3ForFork0_thidvar0=v_t_funThread3of3ForFork0_thidvar0_4} AuxVars[] AssignedVars[][254], [1083#true, Black: 399#(<= |ULTIMATE.start_main_~i~3#1| 0), 1571#true, Black: 1205#(<= |ULTIMATE.start_main_~i~1#1| 3), Black: 1416#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 1561#(and (= 0 |ULTIMATE.start_main_#t~post43#1|) (<= |ULTIMATE.start_main_~i~3#1| 1)), 223#L957-4true, 893#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1)), t_funThread1of3ForFork0InUse, Black: 1085#(= |ULTIMATE.start_main_~i~3#1| 0), Black: 1444#(< |ULTIMATE.start_main_~i~1#1| 8), t_funThread2of3ForFork0NotInUse, Black: 1427#(< |ULTIMATE.start_main_~i~1#1| 9), t_funThread3of3ForFork0NotInUse, Black: 1087#(<= |ULTIMATE.start_main_~i~3#1| 1), 462#true, Black: 295#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 1064#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (exists ((|t_funThread1of3ForFork0_cache_entry_addref_~entry#1.offset| Int)) (= (select ((as const (Array Int Int)) 0) |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.offset|) |t_funThread1of3ForFork0_cache_entry_addref_#t~mem40#1|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 1066#(and (<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1|) (<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1|)), Black: 1044#(<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1|), Black: 1051#(<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1|), Black: 1058#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 1068#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4))), Black: 1062#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4))), Black: 1056#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 1060#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 897#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), 238#L940true, Black: 736#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 466#(<= |ULTIMATE.start_main_~i~1#1| 1)]) [2022-07-12 10:18:16,854 INFO L384 tUnfolder$Statistics]: this new event has 249 ancestors and is cut-off event [2022-07-12 10:18:16,854 INFO L387 tUnfolder$Statistics]: existing Event has 177 ancestors and is cut-off event [2022-07-12 10:18:16,854 INFO L387 tUnfolder$Statistics]: existing Event has 177 ancestors and is cut-off event [2022-07-12 10:18:16,854 INFO L387 tUnfolder$Statistics]: existing Event has 213 ancestors and is cut-off event [2022-07-12 10:18:16,873 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1372] t_funEXIT-->L957-4: Formula: (= v_t_funThread2of3ForFork0_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem48#1_13| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) InVars {t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_13|} OutVars{t_funThread2of3ForFork0_thidvar0=v_t_funThread2of3ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_13|} AuxVars[] AssignedVars[][157], [1083#true, Black: 399#(<= |ULTIMATE.start_main_~i~3#1| 0), 1571#true, Black: 1205#(<= |ULTIMATE.start_main_~i~1#1| 3), Black: 1416#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 1561#(and (= 0 |ULTIMATE.start_main_#t~post43#1|) (<= |ULTIMATE.start_main_~i~3#1| 1)), 223#L957-4true, 893#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1)), t_funThread1of3ForFork0InUse, Black: 1085#(= |ULTIMATE.start_main_~i~3#1| 0), t_funThread2of3ForFork0NotInUse, Black: 1444#(< |ULTIMATE.start_main_~i~1#1| 8), Black: 1427#(< |ULTIMATE.start_main_~i~1#1| 9), Black: 1087#(<= |ULTIMATE.start_main_~i~3#1| 1), t_funThread3of3ForFork0NotInUse, 462#true, 41#L941-30true, Black: 295#(= |ULTIMATE.start_main_~i~1#1| 0), Black: 1064#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (exists ((|t_funThread1of3ForFork0_cache_entry_addref_~entry#1.offset| Int)) (= (select ((as const (Array Int Int)) 0) |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.offset|) |t_funThread1of3ForFork0_cache_entry_addref_#t~mem40#1|)) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 1066#(and (<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1|) (<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1|)), Black: 1044#(<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_#in~cond#1|), Black: 1051#(<= 1 |t_funThread1of3ForFork0___VERIFIER_assert_~cond#1|), Black: 1058#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 1068#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4))), Black: 1062#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4))), Black: 1056#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 1060#(and (= |~#cache~0.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_~entry#1.base| 4) (= |t_funThread1of3ForFork0_cache_entry_addref_#in~entry#1.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| 4)) (not (= |ULTIMATE.start_main_~#t_ids~0#1.base| 4))), Black: 897#(and (= |~#cache~0.base| 4) (= (select |#valid| 4) 1) (= ((as const (Array Int Int)) 0) (select |#memory_int| |~#cache~0.base|))), Black: 736#(< |ULTIMATE.start_main_~i~1#1| 10), Black: 466#(<= |ULTIMATE.start_main_~i~1#1| 1)]) [2022-07-12 10:18:16,873 INFO L384 tUnfolder$Statistics]: this new event has 257 ancestors and is cut-off event [2022-07-12 10:18:16,873 INFO L387 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-07-12 10:18:16,873 INFO L387 tUnfolder$Statistics]: existing Event has 162 ancestors and is cut-off event [2022-07-12 10:18:16,873 INFO L387 tUnfolder$Statistics]: existing Event has 162 ancestors and is cut-off event [2022-07-12 10:18:16,881 INFO L129 PetriNetUnfolder]: 1156/11778 cut-off events. [2022-07-12 10:18:16,881 INFO L130 PetriNetUnfolder]: For 3304/3926 co-relation queries the response was YES. [2022-07-12 10:18:17,290 INFO L84 FinitePrefix]: Finished finitePrefix Result has 15787 conditions, 11778 events. 1156/11778 cut-off events. For 3304/3926 co-relation queries the response was YES. Maximal size of possible extension queue 269. Compared 144746 event pairs, 116 based on Foata normal form. 7/10945 useless extension candidates. Maximal degree in co-relation 15514. Up to 548 conditions per place. [2022-07-12 10:18:17,349 INFO L132 encePairwiseOnDemand]: 340/346 looper letters, 30 selfloop transitions, 30 changer transitions 0/395 dead transitions. [2022-07-12 10:18:17,349 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 395 transitions, 1461 flow [2022-07-12 10:18:17,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-07-12 10:18:17,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-07-12 10:18:17,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 8373 transitions. [2022-07-12 10:18:17,361 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8066473988439307 [2022-07-12 10:18:17,361 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 8373 transitions. [2022-07-12 10:18:17,361 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 8373 transitions. [2022-07-12 10:18:17,364 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:18:17,365 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 8373 transitions. [2022-07-12 10:18:17,378 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 279.1) internal successors, (8373), 30 states have internal predecessors, (8373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:18:17,397 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 346.0) internal successors, (10726), 31 states have internal predecessors, (10726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:18:17,399 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 346.0) internal successors, (10726), 31 states have internal predecessors, (10726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:18:17,399 INFO L186 Difference]: Start difference. First operand has 357 places, 369 transitions, 1195 flow. Second operand 30 states and 8373 transitions. [2022-07-12 10:18:17,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 386 places, 395 transitions, 1461 flow [2022-07-12 10:18:17,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 379 places, 395 transitions, 1427 flow, removed 10 selfloop flow, removed 7 redundant places. [2022-07-12 10:18:17,419 INFO L242 Difference]: Finished difference. Result has 383 places, 379 transitions, 1319 flow [2022-07-12 10:18:17,420 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=346, PETRI_DIFFERENCE_MINUEND_FLOW=1167, PETRI_DIFFERENCE_MINUEND_PLACES=350, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=346, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=1319, PETRI_PLACES=383, PETRI_TRANSITIONS=379} [2022-07-12 10:18:17,420 INFO L279 CegarLoopForPetriNet]: 290 programPoint places, 93 predicate places. [2022-07-12 10:18:17,420 INFO L495 AbstractCegarLoop]: Abstraction has has 383 places, 379 transitions, 1319 flow [2022-07-12 10:18:17,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 279.5217391304348) internal successors, (6429), 23 states have internal predecessors, (6429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:18:17,422 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:18:17,422 INFO L200 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:18:17,443 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-07-12 10:18:17,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-12 10:18:17,632 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-07-12 10:18:17,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:18:17,632 INFO L85 PathProgramCache]: Analyzing trace with hash -974264783, now seen corresponding path program 2 times [2022-07-12 10:18:17,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:18:17,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326841862] [2022-07-12 10:18:17,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:18:17,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:18:17,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 10:18:17,661 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-12 10:18:17,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 10:18:17,688 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-12 10:18:17,688 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-12 10:18:17,689 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2022-07-12 10:18:17,689 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-07-12 10:18:17,689 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2022-07-12 10:18:17,689 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2022-07-12 10:18:17,689 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2022-07-12 10:18:17,690 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-07-12 10:18:17,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-12 10:18:17,690 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1] [2022-07-12 10:18:17,691 WARN L231 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2022-07-12 10:18:17,691 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2022-07-12 10:18:17,724 INFO L135 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-07-12 10:18:17,728 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 350 places, 419 transitions, 882 flow [2022-07-12 10:18:17,858 INFO L129 PetriNetUnfolder]: 170/964 cut-off events. [2022-07-12 10:18:17,858 INFO L130 PetriNetUnfolder]: For 48/48 co-relation queries the response was YES. [2022-07-12 10:18:17,873 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1019 conditions, 964 events. 170/964 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 4977 event pairs, 6 based on Foata normal form. 0/785 useless extension candidates. Maximal degree in co-relation 701. Up to 32 conditions per place. [2022-07-12 10:18:17,874 INFO L82 GeneralOperation]: Start removeDead. Operand has 350 places, 419 transitions, 882 flow [2022-07-12 10:18:17,884 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 350 places, 419 transitions, 882 flow [2022-07-12 10:18:17,885 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 10:18:17,885 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2338b5d9, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@524e2a76 [2022-07-12 10:18:17,886 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-07-12 10:18:17,897 INFO L129 PetriNetUnfolder]: 25/198 cut-off events. [2022-07-12 10:18:17,897 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-12 10:18:17,897 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:18:17,898 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:18:17,898 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-07-12 10:18:17,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:18:17,898 INFO L85 PathProgramCache]: Analyzing trace with hash 99825964, now seen corresponding path program 1 times [2022-07-12 10:18:17,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:18:17,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725842122] [2022-07-12 10:18:17,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:18:17,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:18:17,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:18:17,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:18:17,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:18:17,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725842122] [2022-07-12 10:18:17,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725842122] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:18:17,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:18:17,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 10:18:17,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429493716] [2022-07-12 10:18:17,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:18:17,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-12 10:18:17,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:18:17,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-12 10:18:17,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 10:18:17,915 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 343 out of 419 [2022-07-12 10:18:17,916 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 350 places, 419 transitions, 882 flow. Second operand has 2 states, 2 states have (on average 343.5) internal successors, (687), 2 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:18:17,916 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:18:17,916 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 343 of 419 [2022-07-12 10:18:17,916 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:18:18,075 INFO L129 PetriNetUnfolder]: 40/825 cut-off events. [2022-07-12 10:18:18,075 INFO L130 PetriNetUnfolder]: For 122/122 co-relation queries the response was YES. [2022-07-12 10:18:18,089 INFO L84 FinitePrefix]: Finished finitePrefix Result has 917 conditions, 825 events. 40/825 cut-off events. For 122/122 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4698 event pairs, 6 based on Foata normal form. 427/1203 useless extension candidates. Maximal degree in co-relation 612. Up to 37 conditions per place. [2022-07-12 10:18:18,094 INFO L132 encePairwiseOnDemand]: 356/419 looper letters, 8 selfloop transitions, 0 changer transitions 0/351 dead transitions. [2022-07-12 10:18:18,094 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 351 transitions, 762 flow [2022-07-12 10:18:18,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-12 10:18:18,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-07-12 10:18:18,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 757 transitions. [2022-07-12 10:18:18,096 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9033412887828163 [2022-07-12 10:18:18,096 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 757 transitions. [2022-07-12 10:18:18,096 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 757 transitions. [2022-07-12 10:18:18,097 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:18:18,097 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 757 transitions. [2022-07-12 10:18:18,098 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 378.5) internal successors, (757), 2 states have internal predecessors, (757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:18:18,099 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 419.0) internal successors, (1257), 3 states have internal predecessors, (1257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:18:18,099 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 419.0) internal successors, (1257), 3 states have internal predecessors, (1257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:18:18,100 INFO L186 Difference]: Start difference. First operand has 350 places, 419 transitions, 882 flow. Second operand 2 states and 757 transitions. [2022-07-12 10:18:18,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 346 places, 351 transitions, 762 flow [2022-07-12 10:18:18,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 351 transitions, 762 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-07-12 10:18:18,106 INFO L242 Difference]: Finished difference. Result has 346 places, 351 transitions, 746 flow [2022-07-12 10:18:18,107 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=419, PETRI_DIFFERENCE_MINUEND_FLOW=746, PETRI_DIFFERENCE_MINUEND_PLACES=345, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=351, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=746, PETRI_PLACES=346, PETRI_TRANSITIONS=351} [2022-07-12 10:18:18,108 INFO L279 CegarLoopForPetriNet]: 350 programPoint places, -4 predicate places. [2022-07-12 10:18:18,108 INFO L495 AbstractCegarLoop]: Abstraction has has 346 places, 351 transitions, 746 flow [2022-07-12 10:18:18,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 343.5) internal successors, (687), 2 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:18:18,108 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:18:18,108 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:18:18,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-12 10:18:18,109 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-07-12 10:18:18,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:18:18,109 INFO L85 PathProgramCache]: Analyzing trace with hash 311176877, now seen corresponding path program 1 times [2022-07-12 10:18:18,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:18:18,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175993722] [2022-07-12 10:18:18,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:18:18,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:18:18,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:18:18,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:18:18,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:18:18,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175993722] [2022-07-12 10:18:18,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175993722] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:18:18,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 10:18:18,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 10:18:18,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550087556] [2022-07-12 10:18:18,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:18:18,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 10:18:18,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:18:18,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 10:18:18,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 10:18:18,129 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 336 out of 419 [2022-07-12 10:18:18,130 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 346 places, 351 transitions, 746 flow. Second operand has 3 states, 3 states have (on average 337.0) internal successors, (1011), 3 states have internal predecessors, (1011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:18:18,130 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:18:18,130 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 336 of 419 [2022-07-12 10:18:18,130 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:18:18,270 INFO L129 PetriNetUnfolder]: 40/829 cut-off events. [2022-07-12 10:18:18,271 INFO L130 PetriNetUnfolder]: For 122/122 co-relation queries the response was YES. [2022-07-12 10:18:18,284 INFO L84 FinitePrefix]: Finished finitePrefix Result has 933 conditions, 829 events. 40/829 cut-off events. For 122/122 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4695 event pairs, 6 based on Foata normal form. 0/780 useless extension candidates. Maximal degree in co-relation 926. Up to 44 conditions per place. [2022-07-12 10:18:18,288 INFO L132 encePairwiseOnDemand]: 416/419 looper letters, 17 selfloop transitions, 2 changer transitions 0/355 dead transitions. [2022-07-12 10:18:18,288 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 355 transitions, 792 flow [2022-07-12 10:18:18,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 10:18:18,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-12 10:18:18,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1028 transitions. [2022-07-12 10:18:18,290 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8178202068416865 [2022-07-12 10:18:18,290 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1028 transitions. [2022-07-12 10:18:18,290 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1028 transitions. [2022-07-12 10:18:18,290 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:18:18,290 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1028 transitions. [2022-07-12 10:18:18,292 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 342.6666666666667) internal successors, (1028), 3 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:18:18,293 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 419.0) internal successors, (1676), 4 states have internal predecessors, (1676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:18:18,293 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 419.0) internal successors, (1676), 4 states have internal predecessors, (1676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:18:18,293 INFO L186 Difference]: Start difference. First operand has 346 places, 351 transitions, 746 flow. Second operand 3 states and 1028 transitions. [2022-07-12 10:18:18,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 355 transitions, 792 flow [2022-07-12 10:18:18,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 348 places, 355 transitions, 792 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-07-12 10:18:18,300 INFO L242 Difference]: Finished difference. Result has 349 places, 352 transitions, 758 flow [2022-07-12 10:18:18,300 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=419, PETRI_DIFFERENCE_MINUEND_FLOW=746, PETRI_DIFFERENCE_MINUEND_PLACES=346, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=349, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=758, PETRI_PLACES=349, PETRI_TRANSITIONS=352} [2022-07-12 10:18:18,301 INFO L279 CegarLoopForPetriNet]: 350 programPoint places, -1 predicate places. [2022-07-12 10:18:18,301 INFO L495 AbstractCegarLoop]: Abstraction has has 349 places, 352 transitions, 758 flow [2022-07-12 10:18:18,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 337.0) internal successors, (1011), 3 states have internal predecessors, (1011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:18:18,301 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:18:18,302 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:18:18,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-12 10:18:18,302 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-07-12 10:18:18,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:18:18,302 INFO L85 PathProgramCache]: Analyzing trace with hash -835847906, now seen corresponding path program 1 times [2022-07-12 10:18:18,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:18:18,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268458844] [2022-07-12 10:18:18,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:18:18,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:18:18,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:18:18,333 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:18:18,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:18:18,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268458844] [2022-07-12 10:18:18,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268458844] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:18:18,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319222607] [2022-07-12 10:18:18,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:18:18,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:18:18,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:18:18,340 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:18:18,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-12 10:18:18,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:18:18,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 10:18:18,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:18:18,457 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 10:18:18,457 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 10:18:18,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1319222607] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:18:18,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 10:18:18,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-07-12 10:18:18,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627935612] [2022-07-12 10:18:18,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:18:18,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 10:18:18,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:18:18,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 10:18:18,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 10:18:18,460 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 336 out of 419 [2022-07-12 10:18:18,461 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 349 places, 352 transitions, 758 flow. Second operand has 3 states, 3 states have (on average 337.0) internal successors, (1011), 3 states have internal predecessors, (1011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:18:18,461 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:18:18,461 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 336 of 419 [2022-07-12 10:18:18,461 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:18:18,602 INFO L129 PetriNetUnfolder]: 37/773 cut-off events. [2022-07-12 10:18:18,602 INFO L130 PetriNetUnfolder]: For 113/113 co-relation queries the response was YES. [2022-07-12 10:18:18,614 INFO L84 FinitePrefix]: Finished finitePrefix Result has 897 conditions, 773 events. 37/773 cut-off events. For 113/113 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4322 event pairs, 6 based on Foata normal form. 0/729 useless extension candidates. Maximal degree in co-relation 888. Up to 56 conditions per place. [2022-07-12 10:18:18,617 INFO L132 encePairwiseOnDemand]: 416/419 looper letters, 17 selfloop transitions, 2 changer transitions 0/356 dead transitions. [2022-07-12 10:18:18,617 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 351 places, 356 transitions, 804 flow [2022-07-12 10:18:18,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 10:18:18,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-12 10:18:18,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1028 transitions. [2022-07-12 10:18:18,620 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8178202068416865 [2022-07-12 10:18:18,620 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1028 transitions. [2022-07-12 10:18:18,621 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1028 transitions. [2022-07-12 10:18:18,621 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:18:18,621 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1028 transitions. [2022-07-12 10:18:18,622 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 342.6666666666667) internal successors, (1028), 3 states have internal predecessors, (1028), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:18:18,624 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 419.0) internal successors, (1676), 4 states have internal predecessors, (1676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:18:18,624 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 419.0) internal successors, (1676), 4 states have internal predecessors, (1676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:18:18,624 INFO L186 Difference]: Start difference. First operand has 349 places, 352 transitions, 758 flow. Second operand 3 states and 1028 transitions. [2022-07-12 10:18:18,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 351 places, 356 transitions, 804 flow [2022-07-12 10:18:18,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 350 places, 356 transitions, 802 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-07-12 10:18:18,630 INFO L242 Difference]: Finished difference. Result has 351 places, 353 transitions, 768 flow [2022-07-12 10:18:18,631 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=419, PETRI_DIFFERENCE_MINUEND_FLOW=756, PETRI_DIFFERENCE_MINUEND_PLACES=348, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=352, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=350, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=768, PETRI_PLACES=351, PETRI_TRANSITIONS=353} [2022-07-12 10:18:18,631 INFO L279 CegarLoopForPetriNet]: 350 programPoint places, 1 predicate places. [2022-07-12 10:18:18,631 INFO L495 AbstractCegarLoop]: Abstraction has has 351 places, 353 transitions, 768 flow [2022-07-12 10:18:18,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 337.0) internal successors, (1011), 3 states have internal predecessors, (1011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:18:18,632 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:18:18,632 INFO L200 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:18:18,651 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-07-12 10:18:18,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-07-12 10:18:18,837 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-07-12 10:18:18,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:18:18,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1049280298, now seen corresponding path program 1 times [2022-07-12 10:18:18,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:18:18,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322559926] [2022-07-12 10:18:18,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:18:18,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:18:18,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:18:18,865 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:18:18,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:18:18,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322559926] [2022-07-12 10:18:18,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322559926] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:18:18,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2070179779] [2022-07-12 10:18:18,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:18:18,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:18:18,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:18:18,868 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:18:18,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-12 10:18:18,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:18:18,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 10:18:18,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:18:18,994 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:18:18,994 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 10:18:19,016 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:18:19,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2070179779] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 10:18:19,016 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 10:18:19,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-07-12 10:18:19,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670966290] [2022-07-12 10:18:19,017 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 10:18:19,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 10:18:19,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:18:19,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 10:18:19,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-12 10:18:19,020 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 335 out of 419 [2022-07-12 10:18:19,022 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 351 places, 353 transitions, 768 flow. Second operand has 10 states, 10 states have (on average 337.1) internal successors, (3371), 10 states have internal predecessors, (3371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:18:19,022 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:18:19,022 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 335 of 419 [2022-07-12 10:18:19,022 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-12 10:18:19,202 INFO L129 PetriNetUnfolder]: 37/780 cut-off events. [2022-07-12 10:18:19,203 INFO L130 PetriNetUnfolder]: For 123/123 co-relation queries the response was YES. [2022-07-12 10:18:19,216 INFO L84 FinitePrefix]: Finished finitePrefix Result has 910 conditions, 780 events. 37/780 cut-off events. For 123/123 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 4326 event pairs, 6 based on Foata normal form. 2/742 useless extension candidates. Maximal degree in co-relation 900. Up to 41 conditions per place. [2022-07-12 10:18:19,220 INFO L132 encePairwiseOnDemand]: 413/419 looper letters, 18 selfloop transitions, 9 changer transitions 0/363 dead transitions. [2022-07-12 10:18:19,220 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 359 places, 363 transitions, 844 flow [2022-07-12 10:18:19,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 10:18:19,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-12 10:18:19,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 3044 transitions. [2022-07-12 10:18:19,224 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8072129408644921 [2022-07-12 10:18:19,224 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 3044 transitions. [2022-07-12 10:18:19,224 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 3044 transitions. [2022-07-12 10:18:19,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-12 10:18:19,225 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 3044 transitions. [2022-07-12 10:18:19,228 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 338.22222222222223) internal successors, (3044), 9 states have internal predecessors, (3044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:18:19,231 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 419.0) internal successors, (4190), 10 states have internal predecessors, (4190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:18:19,231 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 419.0) internal successors, (4190), 10 states have internal predecessors, (4190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:18:19,231 INFO L186 Difference]: Start difference. First operand has 351 places, 353 transitions, 768 flow. Second operand 9 states and 3044 transitions. [2022-07-12 10:18:19,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 359 places, 363 transitions, 844 flow [2022-07-12 10:18:19,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 363 transitions, 842 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-07-12 10:18:19,238 INFO L242 Difference]: Finished difference. Result has 361 places, 359 transitions, 816 flow [2022-07-12 10:18:19,238 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=419, PETRI_DIFFERENCE_MINUEND_FLOW=766, PETRI_DIFFERENCE_MINUEND_PLACES=350, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=347, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=816, PETRI_PLACES=361, PETRI_TRANSITIONS=359} [2022-07-12 10:18:19,239 INFO L279 CegarLoopForPetriNet]: 350 programPoint places, 11 predicate places. [2022-07-12 10:18:19,239 INFO L495 AbstractCegarLoop]: Abstraction has has 361 places, 359 transitions, 816 flow [2022-07-12 10:18:19,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 337.1) internal successors, (3371), 10 states have internal predecessors, (3371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:18:19,239 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-12 10:18:19,240 INFO L200 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 10:18:19,266 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-12 10:18:19,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:18:19,463 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2022-07-12 10:18:19,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 10:18:19,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1226572234, now seen corresponding path program 2 times [2022-07-12 10:18:19,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 10:18:19,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535138336] [2022-07-12 10:18:19,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 10:18:19,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 10:18:19,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 10:18:19,524 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 10:18:19,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 10:18:19,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535138336] [2022-07-12 10:18:19,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535138336] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 10:18:19,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1915543015] [2022-07-12 10:18:19,525 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 10:18:19,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 10:18:19,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 10:18:19,526 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 10:18:19,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-12 10:18:19,636 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-12 10:18:19,636 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 10:18:19,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-12 10:18:19,639 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 10:18:19,657 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2022-07-12 10:18:19,890 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-12 10:18:19,890 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-12 10:18:19,925 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-07-12 10:18:20,010 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-07-12 10:18:20,060 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-12 10:18:20,061 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 10:18:20,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1915543015] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 10:18:20,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 10:18:20,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [9] total 19 [2022-07-12 10:18:20,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500875603] [2022-07-12 10:18:20,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 10:18:20,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 10:18:20,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 10:18:20,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 10:18:20,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2022-07-12 10:18:20,065 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 282 out of 419 [2022-07-12 10:18:20,066 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 361 places, 359 transitions, 816 flow. Second operand has 12 states, 12 states have (on average 284.3333333333333) internal successors, (3412), 12 states have internal predecessors, (3412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 10:18:20,067 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-12 10:18:20,067 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 282 of 419 [2022-07-12 10:18:20,067 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand