./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 eb692b52 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-?-eb692b5 [2022-07-19 21:19:20,906 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 21:19:20,925 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 21:19:20,969 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 21:19:20,970 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 21:19:20,971 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 21:19:20,973 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 21:19:20,975 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 21:19:20,976 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 21:19:20,980 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 21:19:20,980 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 21:19:20,982 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 21:19:20,982 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 21:19:20,984 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 21:19:20,985 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 21:19:20,987 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 21:19:20,988 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 21:19:20,989 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 21:19:20,990 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 21:19:20,994 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 21:19:20,996 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 21:19:20,997 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 21:19:20,997 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 21:19:20,998 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 21:19:20,999 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 21:19:21,005 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 21:19:21,005 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 21:19:21,005 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 21:19:21,006 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 21:19:21,007 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 21:19:21,008 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 21:19:21,008 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 21:19:21,009 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 21:19:21,010 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 21:19:21,011 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 21:19:21,011 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 21:19:21,011 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 21:19:21,012 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 21:19:21,012 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 21:19:21,012 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 21:19:21,013 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 21:19:21,014 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 21:19:21,016 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 21:19:21,038 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 21:19:21,039 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 21:19:21,039 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 21:19:21,039 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 21:19:21,040 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 21:19:21,040 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 21:19:21,040 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 21:19:21,040 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 21:19:21,040 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 21:19:21,041 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 21:19:21,041 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 21:19:21,042 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 21:19:21,042 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 21:19:21,042 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 21:19:21,042 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 21:19:21,042 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 21:19:21,042 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 21:19:21,043 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 21:19:21,043 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 21:19:21,044 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 21:19:21,044 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 21:19:21,044 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 21:19:21,044 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 21:19:21,044 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 21:19:21,044 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 21:19:21,045 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 21:19:21,045 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 21:19:21,045 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 21:19:21,045 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 21:19:21,045 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 21:19:21,046 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 21:19:21,046 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 21:19:21,046 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 21:19:21,046 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-19 21:19:21,239 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 21:19:21,258 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 21:19:21,260 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 21:19:21,261 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 21:19:21,261 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 21:19:21,262 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-19 21:19:21,318 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb2fd5090/056f890892cb43268286c9a3aac112b3/FLAG506fd3840 [2022-07-19 21:19:21,761 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 21:19:21,769 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_70-funloop_racefree.i [2022-07-19 21:19:21,786 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb2fd5090/056f890892cb43268286c9a3aac112b3/FLAG506fd3840 [2022-07-19 21:19:21,799 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb2fd5090/056f890892cb43268286c9a3aac112b3 [2022-07-19 21:19:21,801 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 21:19:21,803 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 21:19:21,805 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 21:19:21,805 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 21:19:21,807 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 21:19:21,808 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 09:19:21" (1/1) ... [2022-07-19 21:19:21,808 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@221d3a7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:19:21, skipping insertion in model container [2022-07-19 21:19:21,808 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 09:19:21" (1/1) ... [2022-07-19 21:19:21,814 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 21:19:21,850 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 21:19:22,179 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-19 21:19:22,205 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 21:19:22,222 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 21:19:22,258 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-19 21:19:22,266 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 21:19:22,305 INFO L208 MainTranslator]: Completed translation [2022-07-19 21:19:22,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:19:22 WrapperNode [2022-07-19 21:19:22,306 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 21:19:22,306 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 21:19:22,307 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 21:19:22,307 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 21:19:22,312 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:19:22" (1/1) ... [2022-07-19 21:19:22,332 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:19:22" (1/1) ... [2022-07-19 21:19:22,352 INFO L137 Inliner]: procedures = 271, calls = 31, calls flagged for inlining = 5, calls inlined = 6, statements flattened = 193 [2022-07-19 21:19:22,352 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 21:19:22,353 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 21:19:22,353 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 21:19:22,353 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 21:19:22,361 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:19:22" (1/1) ... [2022-07-19 21:19:22,362 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:19:22" (1/1) ... [2022-07-19 21:19:22,366 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:19:22" (1/1) ... [2022-07-19 21:19:22,366 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:19:22" (1/1) ... [2022-07-19 21:19:22,372 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:19:22" (1/1) ... [2022-07-19 21:19:22,376 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:19:22" (1/1) ... [2022-07-19 21:19:22,377 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:19:22" (1/1) ... [2022-07-19 21:19:22,379 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 21:19:22,380 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 21:19:22,380 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 21:19:22,380 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 21:19:22,381 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:19:22" (1/1) ... [2022-07-19 21:19:22,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 21:19:22,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:19:22,400 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-19 21:19:22,404 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-19 21:19:22,435 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-19 21:19:22,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 21:19:22,435 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-19 21:19:22,435 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-19 21:19:22,435 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-07-19 21:19:22,436 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 21:19:22,436 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-07-19 21:19:22,436 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-07-19 21:19:22,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 21:19:22,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 21:19:22,436 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 21:19:22,438 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-19 21:19:22,560 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 21:19:22,561 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 21:19:22,838 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 21:19:22,845 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 21:19:22,847 INFO L299 CfgBuilder]: Removed 25 assume(true) statements. [2022-07-19 21:19:22,848 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 09:19:22 BoogieIcfgContainer [2022-07-19 21:19:22,849 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 21:19:22,850 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 21:19:22,850 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 21:19:22,853 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 21:19:22,853 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 09:19:21" (1/3) ... [2022-07-19 21:19:22,854 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@190ac67e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 09:19:22, skipping insertion in model container [2022-07-19 21:19:22,854 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 09:19:22" (2/3) ... [2022-07-19 21:19:22,854 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@190ac67e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 09:19:22, skipping insertion in model container [2022-07-19 21:19:22,854 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 09:19:22" (3/3) ... [2022-07-19 21:19:22,855 INFO L111 eAbstractionObserver]: Analyzing ICFG 28-race_reach_70-funloop_racefree.i [2022-07-19 21:19:22,858 WARN L143 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-07-19 21:19:22,864 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 21:19:22,864 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-07-19 21:19:22,864 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-07-19 21:19:22,902 INFO L135 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-07-19 21:19:22,939 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 170 places, 200 transitions, 408 flow [2022-07-19 21:19:23,011 INFO L129 PetriNetUnfolder]: 49/284 cut-off events. [2022-07-19 21:19:23,013 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-07-19 21:19:23,019 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-19 21:19:23,019 INFO L82 GeneralOperation]: Start removeDead. Operand has 170 places, 200 transitions, 408 flow [2022-07-19 21:19:23,027 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 166 places, 195 transitions, 395 flow [2022-07-19 21:19:23,035 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 21:19:23,039 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@3fd06af6, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@580cf3ac [2022-07-19 21:19:23,040 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-07-19 21:19:23,050 INFO L129 PetriNetUnfolder]: 13/113 cut-off events. [2022-07-19 21:19:23,050 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-07-19 21:19:23,050 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:19:23,050 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-19 21:19:23,051 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-19 21:19:23,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:19:23,062 INFO L85 PathProgramCache]: Analyzing trace with hash 322036200, now seen corresponding path program 1 times [2022-07-19 21:19:23,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:19:23,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601918711] [2022-07-19 21:19:23,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:19:23,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:19:23,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:19:23,208 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-19 21:19:23,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:19:23,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601918711] [2022-07-19 21:19:23,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601918711] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:19:23,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:19:23,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 21:19:23,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191315862] [2022-07-19 21:19:23,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:19:23,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 21:19:23,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:19:23,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 21:19:23,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 21:19:23,237 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 200 [2022-07-19 21:19:23,240 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-19 21:19:23,240 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:19:23,240 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 200 [2022-07-19 21:19:23,241 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:19:23,309 INFO L129 PetriNetUnfolder]: 7/239 cut-off events. [2022-07-19 21:19:23,309 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-07-19 21:19:23,311 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-19 21:19:23,312 INFO L132 encePairwiseOnDemand]: 170/200 looper letters, 10 selfloop transitions, 2 changer transitions 0/170 dead transitions. [2022-07-19 21:19:23,312 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 170 transitions, 369 flow [2022-07-19 21:19:23,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 21:19:23,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-19 21:19:23,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 527 transitions. [2022-07-19 21:19:23,327 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8783333333333333 [2022-07-19 21:19:23,328 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 527 transitions. [2022-07-19 21:19:23,328 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 527 transitions. [2022-07-19 21:19:23,330 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:19:23,332 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 527 transitions. [2022-07-19 21:19:23,334 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-19 21:19:23,339 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-19 21:19:23,339 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-19 21:19:23,341 INFO L186 Difference]: Start difference. First operand has 166 places, 195 transitions, 395 flow. Second operand 3 states and 527 transitions. [2022-07-19 21:19:23,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 170 transitions, 369 flow [2022-07-19 21:19:23,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 170 transitions, 369 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-07-19 21:19:23,346 INFO L242 Difference]: Finished difference. Result has 167 places, 167 transitions, 349 flow [2022-07-19 21:19:23,348 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-19 21:19:23,350 INFO L279 CegarLoopForPetriNet]: 166 programPoint places, 1 predicate places. [2022-07-19 21:19:23,350 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 167 transitions, 349 flow [2022-07-19 21:19:23,351 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-19 21:19:23,351 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:19:23,351 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-19 21:19:23,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 21:19:23,351 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-19 21:19:23,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:19:23,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1156168181, now seen corresponding path program 1 times [2022-07-19 21:19:23,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:19:23,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802898923] [2022-07-19 21:19:23,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:19:23,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:19:23,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:19:23,404 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-19 21:19:23,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:19:23,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802898923] [2022-07-19 21:19:23,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802898923] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:19:23,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [69429163] [2022-07-19 21:19:23,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:19:23,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:19:23,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:19:23,407 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-19 21:19:23,408 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-19 21:19:23,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:19:23,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-19 21:19:23,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:19:23,523 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-19 21:19:23,523 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 21:19:23,569 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-19 21:19:23,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [69429163] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 21:19:23,569 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 21:19:23,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-07-19 21:19:23,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575664968] [2022-07-19 21:19:23,570 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 21:19:23,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-19 21:19:23,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:19:23,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-19 21:19:23,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-19 21:19:23,574 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 200 [2022-07-19 21:19:23,576 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-19 21:19:23,576 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:19:23,576 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 200 [2022-07-19 21:19:23,576 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:19:23,676 INFO L129 PetriNetUnfolder]: 7/246 cut-off events. [2022-07-19 21:19:23,676 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-19 21:19:23,678 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-19 21:19:23,678 INFO L132 encePairwiseOnDemand]: 194/200 looper letters, 11 selfloop transitions, 9 changer transitions 0/177 dead transitions. [2022-07-19 21:19:23,679 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 177 transitions, 411 flow [2022-07-19 21:19:23,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 21:19:23,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-19 21:19:23,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1471 transitions. [2022-07-19 21:19:23,682 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8172222222222222 [2022-07-19 21:19:23,682 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1471 transitions. [2022-07-19 21:19:23,683 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1471 transitions. [2022-07-19 21:19:23,683 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:19:23,683 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1471 transitions. [2022-07-19 21:19:23,686 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-19 21:19:23,689 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-19 21:19:23,691 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-19 21:19:23,691 INFO L186 Difference]: Start difference. First operand has 167 places, 167 transitions, 349 flow. Second operand 9 states and 1471 transitions. [2022-07-19 21:19:23,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 177 transitions, 411 flow [2022-07-19 21:19:23,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 177 transitions, 409 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-07-19 21:19:23,698 INFO L242 Difference]: Finished difference. Result has 177 places, 173 transitions, 397 flow [2022-07-19 21:19:23,698 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-19 21:19:23,699 INFO L279 CegarLoopForPetriNet]: 166 programPoint places, 11 predicate places. [2022-07-19 21:19:23,700 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 173 transitions, 397 flow [2022-07-19 21:19:23,701 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-19 21:19:23,701 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:19:23,701 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-19 21:19:23,718 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-19 21:19:23,915 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-19 21:19:23,917 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-19 21:19:23,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:19:23,917 INFO L85 PathProgramCache]: Analyzing trace with hash 235263019, now seen corresponding path program 2 times [2022-07-19 21:19:23,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:19:23,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050037932] [2022-07-19 21:19:23,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:19:23,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:19:23,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:19:24,041 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-19 21:19:24,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:19:24,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050037932] [2022-07-19 21:19:24,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050037932] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:19:24,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [279731330] [2022-07-19 21:19:24,043 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 21:19:24,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:19:24,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:19:24,045 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-19 21:19:24,046 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-19 21:19:24,134 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 21:19:24,134 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 21:19:24,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-19 21:19:24,137 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:19:24,185 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-19 21:19:24,187 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 21:19:24,259 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-19 21:19:24,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [279731330] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 21:19:24,264 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 21:19:24,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-07-19 21:19:24,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678015224] [2022-07-19 21:19:24,265 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 21:19:24,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-19 21:19:24,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:19:24,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-19 21:19:24,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-07-19 21:19:24,271 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 200 [2022-07-19 21:19:24,274 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-19 21:19:24,274 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:19:24,274 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 200 [2022-07-19 21:19:24,274 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:19:24,452 INFO L129 PetriNetUnfolder]: 7/266 cut-off events. [2022-07-19 21:19:24,453 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2022-07-19 21:19:24,453 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-19 21:19:24,454 INFO L132 encePairwiseOnDemand]: 194/200 looper letters, 19 selfloop transitions, 21 changer transitions 0/197 dead transitions. [2022-07-19 21:19:24,454 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 197 transitions, 585 flow [2022-07-19 21:19:24,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-19 21:19:24,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-07-19 21:19:24,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3425 transitions. [2022-07-19 21:19:24,460 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8154761904761905 [2022-07-19 21:19:24,460 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 3425 transitions. [2022-07-19 21:19:24,460 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 3425 transitions. [2022-07-19 21:19:24,462 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:19:24,462 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 3425 transitions. [2022-07-19 21:19:24,467 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-19 21:19:24,473 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-19 21:19:24,474 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-19 21:19:24,474 INFO L186 Difference]: Start difference. First operand has 177 places, 173 transitions, 397 flow. Second operand 21 states and 3425 transitions. [2022-07-19 21:19:24,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 197 transitions, 585 flow [2022-07-19 21:19:24,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 197 transitions, 571 flow, removed 6 selfloop flow, removed 1 redundant places. [2022-07-19 21:19:24,478 INFO L242 Difference]: Finished difference. Result has 201 places, 186 transitions, 521 flow [2022-07-19 21:19:24,479 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-19 21:19:24,479 INFO L279 CegarLoopForPetriNet]: 166 programPoint places, 35 predicate places. [2022-07-19 21:19:24,479 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 186 transitions, 521 flow [2022-07-19 21:19:24,480 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-19 21:19:24,481 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:19:24,481 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-19 21:19:24,515 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-19 21:19:24,695 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-19 21:19:24,696 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-19 21:19:24,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:19:24,696 INFO L85 PathProgramCache]: Analyzing trace with hash 716011627, now seen corresponding path program 3 times [2022-07-19 21:19:24,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:19:24,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237513988] [2022-07-19 21:19:24,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:19:24,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:19:24,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:19:24,891 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-19 21:19:24,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:19:24,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237513988] [2022-07-19 21:19:24,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237513988] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:19:24,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [942329735] [2022-07-19 21:19:24,892 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-19 21:19:24,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:19:24,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:19:24,894 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-19 21:19:24,895 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-19 21:19:24,999 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-07-19 21:19:25,000 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 21:19:25,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-19 21:19:25,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:19:25,064 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-19 21:19:25,065 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 21:19:25,174 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-19 21:19:25,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [942329735] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 21:19:25,174 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 21:19:25,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2022-07-19 21:19:25,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416339041] [2022-07-19 21:19:25,174 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 21:19:25,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-19 21:19:25,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:19:25,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-19 21:19:25,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2022-07-19 21:19:25,178 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 200 [2022-07-19 21:19:25,181 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-19 21:19:25,181 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:19:25,181 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 200 [2022-07-19 21:19:25,181 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:19:25,420 INFO L129 PetriNetUnfolder]: 7/281 cut-off events. [2022-07-19 21:19:25,420 INFO L130 PetriNetUnfolder]: For 110/110 co-relation queries the response was YES. [2022-07-19 21:19:25,421 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-19 21:19:25,421 INFO L132 encePairwiseOnDemand]: 194/200 looper letters, 25 selfloop transitions, 30 changer transitions 0/212 dead transitions. [2022-07-19 21:19:25,422 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 212 transitions, 777 flow [2022-07-19 21:19:25,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-07-19 21:19:25,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-07-19 21:19:25,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 4888 transitions. [2022-07-19 21:19:25,429 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8146666666666667 [2022-07-19 21:19:25,429 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 4888 transitions. [2022-07-19 21:19:25,429 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 4888 transitions. [2022-07-19 21:19:25,431 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:19:25,431 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 4888 transitions. [2022-07-19 21:19:25,437 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-19 21:19:25,444 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-19 21:19:25,445 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-19 21:19:25,445 INFO L186 Difference]: Start difference. First operand has 201 places, 186 transitions, 521 flow. Second operand 30 states and 4888 transitions. [2022-07-19 21:19:25,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 212 transitions, 777 flow [2022-07-19 21:19:25,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 212 transitions, 747 flow, removed 9 selfloop flow, removed 6 redundant places. [2022-07-19 21:19:25,450 INFO L242 Difference]: Finished difference. Result has 228 places, 196 transitions, 649 flow [2022-07-19 21:19:25,451 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-19 21:19:25,451 INFO L279 CegarLoopForPetriNet]: 166 programPoint places, 62 predicate places. [2022-07-19 21:19:25,451 INFO L495 AbstractCegarLoop]: Abstraction has has 228 places, 196 transitions, 649 flow [2022-07-19 21:19:25,453 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-19 21:19:25,453 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:19:25,453 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-19 21:19:25,472 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-19 21:19:25,667 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-19 21:19:25,667 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-19 21:19:25,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:19:25,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1764751544, now seen corresponding path program 4 times [2022-07-19 21:19:25,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:19:25,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886865238] [2022-07-19 21:19:25,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:19:25,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:19:25,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 21:19:25,712 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-19 21:19:25,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 21:19:25,765 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-19 21:19:25,765 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-19 21:19:25,766 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2022-07-19 21:19:25,767 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2022-07-19 21:19:25,770 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2022-07-19 21:19:25,770 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2022-07-19 21:19:25,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-19 21:19:25,771 INFO L356 BasicCegarLoop]: Path program histogram: [4, 1] [2022-07-19 21:19:25,776 WARN L231 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-07-19 21:19:25,777 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-07-19 21:19:25,805 INFO L135 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-07-19 21:19:25,807 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 230 places, 273 transitions, 564 flow [2022-07-19 21:19:25,847 INFO L129 PetriNetUnfolder]: 82/466 cut-off events. [2022-07-19 21:19:25,847 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-07-19 21:19:25,851 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-19 21:19:25,851 INFO L82 GeneralOperation]: Start removeDead. Operand has 230 places, 273 transitions, 564 flow [2022-07-19 21:19:25,857 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 230 places, 273 transitions, 564 flow [2022-07-19 21:19:25,858 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 21:19:25,859 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@3fd06af6, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@580cf3ac [2022-07-19 21:19:25,859 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-07-19 21:19:25,883 INFO L129 PetriNetUnfolder]: 26/200 cut-off events. [2022-07-19 21:19:25,883 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-19 21:19:25,883 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:19:25,883 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-19 21:19:25,884 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-19 21:19:25,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:19:25,884 INFO L85 PathProgramCache]: Analyzing trace with hash 509040557, now seen corresponding path program 1 times [2022-07-19 21:19:25,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:19:25,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779036284] [2022-07-19 21:19:25,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:19:25,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:19:25,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:19:25,917 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-19 21:19:25,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:19:25,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779036284] [2022-07-19 21:19:25,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779036284] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:19:25,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:19:25,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 21:19:25,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000348859] [2022-07-19 21:19:25,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:19:25,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 21:19:25,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:19:25,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 21:19:25,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 21:19:25,919 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 220 out of 273 [2022-07-19 21:19:25,920 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-19 21:19:25,920 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:19:25,920 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 220 of 273 [2022-07-19 21:19:25,920 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:19:25,969 INFO L129 PetriNetUnfolder]: 14/397 cut-off events. [2022-07-19 21:19:25,969 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2022-07-19 21:19:25,971 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-19 21:19:25,973 INFO L132 encePairwiseOnDemand]: 231/273 looper letters, 13 selfloop transitions, 2 changer transitions 0/235 dead transitions. [2022-07-19 21:19:25,973 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 235 transitions, 518 flow [2022-07-19 21:19:25,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 21:19:25,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-19 21:19:25,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 716 transitions. [2022-07-19 21:19:25,974 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8742368742368742 [2022-07-19 21:19:25,974 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 716 transitions. [2022-07-19 21:19:25,974 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 716 transitions. [2022-07-19 21:19:25,975 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:19:25,975 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 716 transitions. [2022-07-19 21:19:25,976 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-19 21:19:25,977 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-19 21:19:25,978 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-19 21:19:25,978 INFO L186 Difference]: Start difference. First operand has 230 places, 273 transitions, 564 flow. Second operand 3 states and 716 transitions. [2022-07-19 21:19:25,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 235 transitions, 518 flow [2022-07-19 21:19:25,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 235 transitions, 518 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-07-19 21:19:25,982 INFO L242 Difference]: Finished difference. Result has 230 places, 232 transitions, 492 flow [2022-07-19 21:19:25,982 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-19 21:19:25,984 INFO L279 CegarLoopForPetriNet]: 230 programPoint places, 0 predicate places. [2022-07-19 21:19:25,984 INFO L495 AbstractCegarLoop]: Abstraction has has 230 places, 232 transitions, 492 flow [2022-07-19 21:19:25,985 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-19 21:19:25,988 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:19:25,988 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-19 21:19:25,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-19 21:19:25,988 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-19 21:19:25,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:19:25,989 INFO L85 PathProgramCache]: Analyzing trace with hash 879811681, now seen corresponding path program 1 times [2022-07-19 21:19:25,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:19:25,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887807913] [2022-07-19 21:19:25,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:19:25,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:19:25,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:19:26,027 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-19 21:19:26,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:19:26,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887807913] [2022-07-19 21:19:26,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887807913] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:19:26,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1140453527] [2022-07-19 21:19:26,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:19:26,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:19:26,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:19:26,029 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-19 21:19:26,031 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-19 21:19:26,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:19:26,089 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-19 21:19:26,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:19:26,100 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-19 21:19:26,101 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 21:19:26,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1140453527] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:19:26,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 21:19:26,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-07-19 21:19:26,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946692732] [2022-07-19 21:19:26,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:19:26,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 21:19:26,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:19:26,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 21:19:26,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-19 21:19:26,104 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 220 out of 273 [2022-07-19 21:19:26,104 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-19 21:19:26,104 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:19:26,104 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 220 of 273 [2022-07-19 21:19:26,104 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:19:26,148 INFO L129 PetriNetUnfolder]: 11/341 cut-off events. [2022-07-19 21:19:26,148 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2022-07-19 21:19:26,150 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-19 21:19:26,151 INFO L132 encePairwiseOnDemand]: 270/273 looper letters, 13 selfloop transitions, 2 changer transitions 0/236 dead transitions. [2022-07-19 21:19:26,151 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 236 transitions, 530 flow [2022-07-19 21:19:26,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 21:19:26,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-19 21:19:26,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 676 transitions. [2022-07-19 21:19:26,153 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8253968253968254 [2022-07-19 21:19:26,153 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 676 transitions. [2022-07-19 21:19:26,153 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 676 transitions. [2022-07-19 21:19:26,153 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:19:26,153 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 676 transitions. [2022-07-19 21:19:26,154 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-19 21:19:26,155 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-19 21:19:26,156 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-19 21:19:26,156 INFO L186 Difference]: Start difference. First operand has 230 places, 232 transitions, 492 flow. Second operand 3 states and 676 transitions. [2022-07-19 21:19:26,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 236 transitions, 530 flow [2022-07-19 21:19:26,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 236 transitions, 528 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-07-19 21:19:26,160 INFO L242 Difference]: Finished difference. Result has 232 places, 233 transitions, 502 flow [2022-07-19 21:19:26,160 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-19 21:19:26,161 INFO L279 CegarLoopForPetriNet]: 230 programPoint places, 2 predicate places. [2022-07-19 21:19:26,161 INFO L495 AbstractCegarLoop]: Abstraction has has 232 places, 233 transitions, 502 flow [2022-07-19 21:19:26,161 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-19 21:19:26,161 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:19:26,161 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-19 21:19:26,182 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-19 21:19:26,374 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-19 21:19:26,374 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-19 21:19:26,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:19:26,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1759427479, now seen corresponding path program 1 times [2022-07-19 21:19:26,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:19:26,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197080243] [2022-07-19 21:19:26,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:19:26,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:19:26,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:19:26,408 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-19 21:19:26,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:19:26,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197080243] [2022-07-19 21:19:26,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197080243] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:19:26,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1202387729] [2022-07-19 21:19:26,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:19:26,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:19:26,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:19:26,410 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-19 21:19:26,410 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-19 21:19:26,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:19:26,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-19 21:19:26,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:19:26,502 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-19 21:19:26,502 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 21:19:26,535 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-19 21:19:26,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1202387729] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 21:19:26,535 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 21:19:26,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-07-19 21:19:26,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583305540] [2022-07-19 21:19:26,536 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 21:19:26,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-19 21:19:26,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:19:26,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-19 21:19:26,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-19 21:19:26,539 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 273 [2022-07-19 21:19:26,547 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-19 21:19:26,547 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:19:26,547 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 273 [2022-07-19 21:19:26,547 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:19:26,627 INFO L129 PetriNetUnfolder]: 11/348 cut-off events. [2022-07-19 21:19:26,627 INFO L130 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2022-07-19 21:19:26,629 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-19 21:19:26,630 INFO L132 encePairwiseOnDemand]: 267/273 looper letters, 14 selfloop transitions, 9 changer transitions 0/243 dead transitions. [2022-07-19 21:19:26,630 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 243 transitions, 570 flow [2022-07-19 21:19:26,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 21:19:26,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-19 21:19:26,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1996 transitions. [2022-07-19 21:19:26,634 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8123728123728123 [2022-07-19 21:19:26,634 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1996 transitions. [2022-07-19 21:19:26,634 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1996 transitions. [2022-07-19 21:19:26,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:19:26,635 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1996 transitions. [2022-07-19 21:19:26,638 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-19 21:19:26,640 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-19 21:19:26,641 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-19 21:19:26,641 INFO L186 Difference]: Start difference. First operand has 232 places, 233 transitions, 502 flow. Second operand 9 states and 1996 transitions. [2022-07-19 21:19:26,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 243 transitions, 570 flow [2022-07-19 21:19:26,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 243 transitions, 568 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-07-19 21:19:26,645 INFO L242 Difference]: Finished difference. Result has 242 places, 239 transitions, 550 flow [2022-07-19 21:19:26,645 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-19 21:19:26,645 INFO L279 CegarLoopForPetriNet]: 230 programPoint places, 12 predicate places. [2022-07-19 21:19:26,646 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 239 transitions, 550 flow [2022-07-19 21:19:26,646 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-19 21:19:26,646 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:19:26,646 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-19 21:19:26,666 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-19 21:19:26,863 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-19 21:19:26,863 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-19 21:19:26,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:19:26,864 INFO L85 PathProgramCache]: Analyzing trace with hash 914949097, now seen corresponding path program 2 times [2022-07-19 21:19:26,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:19:26,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608779592] [2022-07-19 21:19:26,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:19:26,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:19:26,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:19:26,909 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-19 21:19:26,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:19:26,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608779592] [2022-07-19 21:19:26,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608779592] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:19:26,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [9084291] [2022-07-19 21:19:26,910 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 21:19:26,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:19:26,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:19:26,912 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-19 21:19:26,913 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-19 21:19:26,978 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 21:19:26,979 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 21:19:26,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-19 21:19:26,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:19:27,011 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-19 21:19:27,011 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 21:19:27,074 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-19 21:19:27,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [9084291] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 21:19:27,075 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 21:19:27,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-07-19 21:19:27,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950573098] [2022-07-19 21:19:27,075 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 21:19:27,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-19 21:19:27,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:19:27,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-19 21:19:27,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-07-19 21:19:27,079 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 273 [2022-07-19 21:19:27,080 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-19 21:19:27,081 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:19:27,081 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 273 [2022-07-19 21:19:27,081 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:19:27,272 INFO L129 PetriNetUnfolder]: 11/368 cut-off events. [2022-07-19 21:19:27,272 INFO L130 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2022-07-19 21:19:27,274 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-19 21:19:27,275 INFO L132 encePairwiseOnDemand]: 267/273 looper letters, 22 selfloop transitions, 21 changer transitions 0/263 dead transitions. [2022-07-19 21:19:27,275 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 263 transitions, 744 flow [2022-07-19 21:19:27,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-19 21:19:27,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-07-19 21:19:27,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 4646 transitions. [2022-07-19 21:19:27,283 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8103959532530961 [2022-07-19 21:19:27,283 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 4646 transitions. [2022-07-19 21:19:27,283 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 4646 transitions. [2022-07-19 21:19:27,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:19:27,285 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 4646 transitions. [2022-07-19 21:19:27,292 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-19 21:19:27,298 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-19 21:19:27,299 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-19 21:19:27,299 INFO L186 Difference]: Start difference. First operand has 242 places, 239 transitions, 550 flow. Second operand 21 states and 4646 transitions. [2022-07-19 21:19:27,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 263 transitions, 744 flow [2022-07-19 21:19:27,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 263 transitions, 730 flow, removed 6 selfloop flow, removed 1 redundant places. [2022-07-19 21:19:27,303 INFO L242 Difference]: Finished difference. Result has 266 places, 252 transitions, 674 flow [2022-07-19 21:19:27,304 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-19 21:19:27,304 INFO L279 CegarLoopForPetriNet]: 230 programPoint places, 36 predicate places. [2022-07-19 21:19:27,304 INFO L495 AbstractCegarLoop]: Abstraction has has 266 places, 252 transitions, 674 flow [2022-07-19 21:19:27,305 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-19 21:19:27,305 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:19:27,306 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-19 21:19:27,330 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-19 21:19:27,523 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-19 21:19:27,523 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-19 21:19:27,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:19:27,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1718903529, now seen corresponding path program 3 times [2022-07-19 21:19:27,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:19:27,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227204755] [2022-07-19 21:19:27,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:19:27,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:19:27,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:19:27,641 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-19 21:19:27,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:19:27,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227204755] [2022-07-19 21:19:27,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227204755] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:19:27,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [874156861] [2022-07-19 21:19:27,641 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-19 21:19:27,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:19:27,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:19:27,643 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-19 21:19:27,644 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-19 21:19:27,741 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-07-19 21:19:27,741 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 21:19:27,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-19 21:19:27,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:19:27,801 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-19 21:19:27,801 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 21:19:27,872 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-19 21:19:27,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [874156861] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 21:19:27,872 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 21:19:27,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2022-07-19 21:19:27,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828827778] [2022-07-19 21:19:27,872 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 21:19:27,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-19 21:19:27,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:19:27,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-19 21:19:27,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2022-07-19 21:19:27,875 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 273 [2022-07-19 21:19:27,878 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-19 21:19:27,878 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:19:27,878 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 273 [2022-07-19 21:19:27,878 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:19:28,168 INFO L129 PetriNetUnfolder]: 11/383 cut-off events. [2022-07-19 21:19:28,168 INFO L130 PetriNetUnfolder]: For 126/126 co-relation queries the response was YES. [2022-07-19 21:19:28,170 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-19 21:19:28,171 INFO L132 encePairwiseOnDemand]: 267/273 looper letters, 28 selfloop transitions, 30 changer transitions 0/278 dead transitions. [2022-07-19 21:19:28,171 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 278 transitions, 936 flow [2022-07-19 21:19:28,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-07-19 21:19:28,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-07-19 21:19:28,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 6631 transitions. [2022-07-19 21:19:28,177 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8096459096459097 [2022-07-19 21:19:28,177 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 6631 transitions. [2022-07-19 21:19:28,177 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 6631 transitions. [2022-07-19 21:19:28,178 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:19:28,178 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 6631 transitions. [2022-07-19 21:19:28,185 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-19 21:19:28,191 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-19 21:19:28,192 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-19 21:19:28,192 INFO L186 Difference]: Start difference. First operand has 266 places, 252 transitions, 674 flow. Second operand 30 states and 6631 transitions. [2022-07-19 21:19:28,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 278 transitions, 936 flow [2022-07-19 21:19:28,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 278 transitions, 906 flow, removed 9 selfloop flow, removed 6 redundant places. [2022-07-19 21:19:28,197 INFO L242 Difference]: Finished difference. Result has 293 places, 262 transitions, 802 flow [2022-07-19 21:19:28,197 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-19 21:19:28,198 INFO L279 CegarLoopForPetriNet]: 230 programPoint places, 63 predicate places. [2022-07-19 21:19:28,198 INFO L495 AbstractCegarLoop]: Abstraction has has 293 places, 262 transitions, 802 flow [2022-07-19 21:19:28,199 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-19 21:19:28,199 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:19:28,199 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-19 21:19:28,219 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-19 21:19:28,415 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-19 21:19:28,416 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-19 21:19:28,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:19:28,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1050686411, now seen corresponding path program 4 times [2022-07-19 21:19:28,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:19:28,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277327529] [2022-07-19 21:19:28,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:19:28,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:19:28,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 21:19:28,437 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-19 21:19:28,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 21:19:28,470 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-19 21:19:28,471 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-19 21:19:28,471 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2022-07-19 21:19:28,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-07-19 21:19:28,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2022-07-19 21:19:28,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2022-07-19 21:19:28,472 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-07-19 21:19:28,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-19 21:19:28,472 INFO L356 BasicCegarLoop]: Path program histogram: [4, 1, 1] [2022-07-19 21:19:28,472 WARN L231 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2022-07-19 21:19:28,472 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2022-07-19 21:19:28,495 INFO L135 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-07-19 21:19:28,497 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 290 places, 346 transitions, 722 flow [2022-07-19 21:19:28,555 INFO L129 PetriNetUnfolder]: 120/681 cut-off events. [2022-07-19 21:19:28,555 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2022-07-19 21:19:28,564 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-19 21:19:28,565 INFO L82 GeneralOperation]: Start removeDead. Operand has 290 places, 346 transitions, 722 flow [2022-07-19 21:19:28,573 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 290 places, 346 transitions, 722 flow [2022-07-19 21:19:28,573 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 21:19:28,575 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@3fd06af6, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@580cf3ac [2022-07-19 21:19:28,575 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-07-19 21:19:28,583 INFO L129 PetriNetUnfolder]: 26/206 cut-off events. [2022-07-19 21:19:28,583 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-19 21:19:28,583 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:19:28,583 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-19 21:19:28,583 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-19 21:19:28,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:19:28,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1851205037, now seen corresponding path program 1 times [2022-07-19 21:19:28,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:19:28,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164934384] [2022-07-19 21:19:28,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:19:28,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:19:28,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:19:28,602 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-19 21:19:28,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:19:28,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164934384] [2022-07-19 21:19:28,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164934384] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:19:28,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:19:28,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 21:19:28,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739916679] [2022-07-19 21:19:28,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:19:28,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 21:19:28,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:19:28,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 21:19:28,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 21:19:28,604 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 346 [2022-07-19 21:19:28,605 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-19 21:19:28,605 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:19:28,605 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 346 [2022-07-19 21:19:28,605 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:19:28,679 INFO L129 PetriNetUnfolder]: 23/581 cut-off events. [2022-07-19 21:19:28,680 INFO L130 PetriNetUnfolder]: For 49/49 co-relation queries the response was YES. [2022-07-19 21:19:28,686 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-19 21:19:28,688 INFO L132 encePairwiseOnDemand]: 292/346 looper letters, 15 selfloop transitions, 2 changer transitions 0/295 dead transitions. [2022-07-19 21:19:28,688 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 295 transitions, 654 flow [2022-07-19 21:19:28,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 21:19:28,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-19 21:19:28,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 904 transitions. [2022-07-19 21:19:28,690 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8709055876685935 [2022-07-19 21:19:28,690 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 904 transitions. [2022-07-19 21:19:28,690 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 904 transitions. [2022-07-19 21:19:28,690 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:19:28,690 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 904 transitions. [2022-07-19 21:19:28,691 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-19 21:19:28,692 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-19 21:19:28,692 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-19 21:19:28,692 INFO L186 Difference]: Start difference. First operand has 290 places, 346 transitions, 722 flow. Second operand 3 states and 904 transitions. [2022-07-19 21:19:28,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 295 transitions, 654 flow [2022-07-19 21:19:28,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 295 transitions, 654 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-07-19 21:19:28,695 INFO L242 Difference]: Finished difference. Result has 289 places, 292 transitions, 624 flow [2022-07-19 21:19:28,696 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-19 21:19:28,696 INFO L279 CegarLoopForPetriNet]: 290 programPoint places, -1 predicate places. [2022-07-19 21:19:28,696 INFO L495 AbstractCegarLoop]: Abstraction has has 289 places, 292 transitions, 624 flow [2022-07-19 21:19:28,697 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-19 21:19:28,697 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:19:28,697 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-19 21:19:28,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-19 21:19:28,697 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-19 21:19:28,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:19:28,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1513088709, now seen corresponding path program 1 times [2022-07-19 21:19:28,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:19:28,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790938321] [2022-07-19 21:19:28,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:19:28,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:19:28,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:19:28,716 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-19 21:19:28,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:19:28,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790938321] [2022-07-19 21:19:28,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790938321] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:19:28,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23116994] [2022-07-19 21:19:28,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:19:28,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:19:28,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:19:28,717 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-19 21:19:28,718 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-19 21:19:28,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:19:28,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-19 21:19:28,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:19:28,791 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-19 21:19:28,791 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 21:19:28,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [23116994] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:19:28,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 21:19:28,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-07-19 21:19:28,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528696457] [2022-07-19 21:19:28,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:19:28,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 21:19:28,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:19:28,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 21:19:28,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-19 21:19:28,793 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 346 [2022-07-19 21:19:28,793 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-19 21:19:28,793 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:19:28,793 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 346 [2022-07-19 21:19:28,793 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:19:28,859 INFO L129 PetriNetUnfolder]: 20/525 cut-off events. [2022-07-19 21:19:28,859 INFO L130 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-07-19 21:19:28,865 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-19 21:19:28,867 INFO L132 encePairwiseOnDemand]: 343/346 looper letters, 15 selfloop transitions, 2 changer transitions 0/296 dead transitions. [2022-07-19 21:19:28,867 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 296 transitions, 666 flow [2022-07-19 21:19:28,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 21:19:28,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-19 21:19:28,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 852 transitions. [2022-07-19 21:19:28,868 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8208092485549133 [2022-07-19 21:19:28,868 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 852 transitions. [2022-07-19 21:19:28,869 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 852 transitions. [2022-07-19 21:19:28,869 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:19:28,869 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 852 transitions. [2022-07-19 21:19:28,869 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-19 21:19:28,870 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-19 21:19:28,870 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-19 21:19:28,871 INFO L186 Difference]: Start difference. First operand has 289 places, 292 transitions, 624 flow. Second operand 3 states and 852 transitions. [2022-07-19 21:19:28,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 296 transitions, 666 flow [2022-07-19 21:19:28,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 296 transitions, 664 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-07-19 21:19:28,874 INFO L242 Difference]: Finished difference. Result has 291 places, 293 transitions, 634 flow [2022-07-19 21:19:28,875 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-19 21:19:28,875 INFO L279 CegarLoopForPetriNet]: 290 programPoint places, 1 predicate places. [2022-07-19 21:19:28,875 INFO L495 AbstractCegarLoop]: Abstraction has has 291 places, 293 transitions, 634 flow [2022-07-19 21:19:28,875 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-19 21:19:28,875 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:19:28,875 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-19 21:19:28,895 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-19 21:19:29,090 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-19 21:19:29,091 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-19 21:19:29,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:19:29,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1584273556, now seen corresponding path program 1 times [2022-07-19 21:19:29,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:19:29,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229437320] [2022-07-19 21:19:29,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:19:29,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:19:29,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:19:29,111 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-19 21:19:29,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:19:29,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229437320] [2022-07-19 21:19:29,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229437320] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:19:29,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [523289915] [2022-07-19 21:19:29,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:19:29,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:19:29,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:19:29,113 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-19 21:19:29,127 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-19 21:19:29,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:19:29,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-19 21:19:29,201 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:19:29,218 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-19 21:19:29,218 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 21:19:29,241 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-19 21:19:29,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [523289915] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 21:19:29,242 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 21:19:29,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-07-19 21:19:29,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180158235] [2022-07-19 21:19:29,242 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 21:19:29,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-19 21:19:29,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:19:29,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-19 21:19:29,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-19 21:19:29,244 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 346 [2022-07-19 21:19:29,246 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-19 21:19:29,246 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:19:29,246 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 346 [2022-07-19 21:19:29,246 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:19:29,340 INFO L129 PetriNetUnfolder]: 20/532 cut-off events. [2022-07-19 21:19:29,340 INFO L130 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2022-07-19 21:19:29,346 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-19 21:19:29,348 INFO L132 encePairwiseOnDemand]: 340/346 looper letters, 16 selfloop transitions, 9 changer transitions 0/303 dead transitions. [2022-07-19 21:19:29,348 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 303 transitions, 706 flow [2022-07-19 21:19:29,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 21:19:29,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-19 21:19:29,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2520 transitions. [2022-07-19 21:19:29,351 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8092485549132948 [2022-07-19 21:19:29,351 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2520 transitions. [2022-07-19 21:19:29,351 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2520 transitions. [2022-07-19 21:19:29,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:19:29,351 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2520 transitions. [2022-07-19 21:19:29,353 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-19 21:19:29,355 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-19 21:19:29,356 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-19 21:19:29,356 INFO L186 Difference]: Start difference. First operand has 291 places, 293 transitions, 634 flow. Second operand 9 states and 2520 transitions. [2022-07-19 21:19:29,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 303 transitions, 706 flow [2022-07-19 21:19:29,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 303 transitions, 704 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-07-19 21:19:29,360 INFO L242 Difference]: Finished difference. Result has 301 places, 299 transitions, 682 flow [2022-07-19 21:19:29,361 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-19 21:19:29,361 INFO L279 CegarLoopForPetriNet]: 290 programPoint places, 11 predicate places. [2022-07-19 21:19:29,361 INFO L495 AbstractCegarLoop]: Abstraction has has 301 places, 299 transitions, 682 flow [2022-07-19 21:19:29,362 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-19 21:19:29,362 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:19:29,362 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-19 21:19:29,378 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-19 21:19:29,578 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-19 21:19:29,579 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-19 21:19:29,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:19:29,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1224153428, now seen corresponding path program 2 times [2022-07-19 21:19:29,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:19:29,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441197289] [2022-07-19 21:19:29,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:19:29,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:19:29,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:19:29,635 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-19 21:19:29,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:19:29,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441197289] [2022-07-19 21:19:29,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441197289] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:19:29,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [255103150] [2022-07-19 21:19:29,635 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 21:19:29,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:19:29,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:19:29,637 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-19 21:19:29,639 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-19 21:19:29,714 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-19 21:19:29,715 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 21:19:29,715 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-19 21:19:29,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:19:29,747 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-19 21:19:29,835 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-19 21:19:29,835 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-19 21:19:29,870 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-19 21:19:29,926 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-19 21:19:29,964 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-19 21:19:29,964 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 21:19:29,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [255103150] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:19:29,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 21:19:29,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [9] total 19 [2022-07-19 21:19:29,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25264932] [2022-07-19 21:19:29,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:19:29,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-19 21:19:29,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:19:29,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-19 21:19:29,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2022-07-19 21:19:29,967 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 346 [2022-07-19 21:19:29,968 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-19 21:19:29,968 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:19:29,968 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 346 [2022-07-19 21:19:29,968 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:20:01,072 INFO L129 PetriNetUnfolder]: 112920/268752 cut-off events. [2022-07-19 21:20:01,072 INFO L130 PetriNetUnfolder]: For 9789/10023 co-relation queries the response was YES. [2022-07-19 21:20:03,522 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-19 21:20:05,090 INFO L132 encePairwiseOnDemand]: 328/346 looper letters, 301 selfloop transitions, 48 changer transitions 0/587 dead transitions. [2022-07-19 21:20:05,090 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 587 transitions, 2109 flow [2022-07-19 21:20:05,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-19 21:20:05,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-07-19 21:20:05,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 3800 transitions. [2022-07-19 21:20:05,094 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7321772639691715 [2022-07-19 21:20:05,094 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 3800 transitions. [2022-07-19 21:20:05,094 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 3800 transitions. [2022-07-19 21:20:05,094 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:20:05,094 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 3800 transitions. [2022-07-19 21:20:05,098 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-19 21:20:05,101 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-19 21:20:05,102 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-19 21:20:05,102 INFO L186 Difference]: Start difference. First operand has 301 places, 299 transitions, 682 flow. Second operand 15 states and 3800 transitions. [2022-07-19 21:20:05,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 587 transitions, 2109 flow [2022-07-19 21:20:05,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 587 transitions, 2103 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-07-19 21:20:05,112 INFO L242 Difference]: Finished difference. Result has 325 places, 353 transitions, 1031 flow [2022-07-19 21:20:05,113 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-19 21:20:05,115 INFO L279 CegarLoopForPetriNet]: 290 programPoint places, 35 predicate places. [2022-07-19 21:20:05,115 INFO L495 AbstractCegarLoop]: Abstraction has has 325 places, 353 transitions, 1031 flow [2022-07-19 21:20:05,116 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-19 21:20:05,116 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:20:05,116 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-19 21:20:05,135 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-19 21:20:05,331 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-19 21:20:05,331 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-19 21:20:05,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:20:05,332 INFO L85 PathProgramCache]: Analyzing trace with hash 657728224, now seen corresponding path program 1 times [2022-07-19 21:20:05,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:20:05,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750731045] [2022-07-19 21:20:05,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:20:05,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:20:05,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:20:05,362 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-19 21:20:05,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:20:05,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750731045] [2022-07-19 21:20:05,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750731045] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:20:05,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1488333037] [2022-07-19 21:20:05,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:20:05,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:20:05,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:20:05,364 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-19 21:20:05,365 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-19 21:20:05,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:20:05,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-19 21:20:05,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:20:05,492 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-19 21:20:05,492 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 21:20:05,562 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-19 21:20:05,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1488333037] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 21:20:05,562 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 21:20:05,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2022-07-19 21:20:05,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315235693] [2022-07-19 21:20:05,563 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 21:20:05,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-19 21:20:05,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:20:05,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-19 21:20:05,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2022-07-19 21:20:05,566 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 270 out of 346 [2022-07-19 21:20:05,569 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-19 21:20:05,569 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:20:05,569 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 270 of 346 [2022-07-19 21:20:05,569 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:20:07,370 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-19 21:20:07,370 INFO L384 tUnfolder$Statistics]: this new event has 203 ancestors and is cut-off event [2022-07-19 21:20:07,370 INFO L387 tUnfolder$Statistics]: existing Event has 203 ancestors and is cut-off event [2022-07-19 21:20:07,370 INFO L387 tUnfolder$Statistics]: existing Event has 167 ancestors and is cut-off event [2022-07-19 21:20:07,370 INFO L387 tUnfolder$Statistics]: existing Event has 167 ancestors and is cut-off event [2022-07-19 21:20:07,512 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-19 21:20:07,512 INFO L384 tUnfolder$Statistics]: this new event has 216 ancestors and is cut-off event [2022-07-19 21:20:07,512 INFO L387 tUnfolder$Statistics]: existing Event has 144 ancestors and is cut-off event [2022-07-19 21:20:07,512 INFO L387 tUnfolder$Statistics]: existing Event has 144 ancestors and is cut-off event [2022-07-19 21:20:07,512 INFO L387 tUnfolder$Statistics]: existing Event has 180 ancestors and is cut-off event [2022-07-19 21:20:07,553 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-19 21:20:07,553 INFO L384 tUnfolder$Statistics]: this new event has 226 ancestors and is cut-off event [2022-07-19 21:20:07,553 INFO L387 tUnfolder$Statistics]: existing Event has 154 ancestors and is cut-off event [2022-07-19 21:20:07,553 INFO L387 tUnfolder$Statistics]: existing Event has 154 ancestors and is cut-off event [2022-07-19 21:20:07,553 INFO L387 tUnfolder$Statistics]: existing Event has 190 ancestors and is cut-off event [2022-07-19 21:20:07,557 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-19 21:20:07,557 INFO L384 tUnfolder$Statistics]: this new event has 226 ancestors and is cut-off event [2022-07-19 21:20:07,557 INFO L387 tUnfolder$Statistics]: existing Event has 131 ancestors and is cut-off event [2022-07-19 21:20:07,557 INFO L387 tUnfolder$Statistics]: existing Event has 131 ancestors and is cut-off event [2022-07-19 21:20:07,557 INFO L387 tUnfolder$Statistics]: existing Event has 167 ancestors and is cut-off event [2022-07-19 21:20:07,576 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-19 21:20:07,576 INFO L384 tUnfolder$Statistics]: this new event has 232 ancestors and is cut-off event [2022-07-19 21:20:07,576 INFO L387 tUnfolder$Statistics]: existing Event has 173 ancestors and is cut-off event [2022-07-19 21:20:07,576 INFO L387 tUnfolder$Statistics]: existing Event has 137 ancestors and is cut-off event [2022-07-19 21:20:07,576 INFO L387 tUnfolder$Statistics]: existing Event has 137 ancestors and is cut-off event [2022-07-19 21:20:07,581 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-19 21:20:07,581 INFO L384 tUnfolder$Statistics]: this new event has 234 ancestors and is cut-off event [2022-07-19 21:20:07,581 INFO L387 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-07-19 21:20:07,581 INFO L387 tUnfolder$Statistics]: existing Event has 162 ancestors and is cut-off event [2022-07-19 21:20:07,581 INFO L387 tUnfolder$Statistics]: existing Event has 162 ancestors and is cut-off event [2022-07-19 21:20:07,597 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-19 21:20:07,597 INFO L384 tUnfolder$Statistics]: this new event has 242 ancestors and is cut-off event [2022-07-19 21:20:07,597 INFO L387 tUnfolder$Statistics]: existing Event has 147 ancestors and is cut-off event [2022-07-19 21:20:07,597 INFO L387 tUnfolder$Statistics]: existing Event has 147 ancestors and is cut-off event [2022-07-19 21:20:07,597 INFO L387 tUnfolder$Statistics]: existing Event has 183 ancestors and is cut-off event [2022-07-19 21:20:07,604 INFO L129 PetriNetUnfolder]: 1166/11881 cut-off events. [2022-07-19 21:20:07,604 INFO L130 PetriNetUnfolder]: For 3249/4549 co-relation queries the response was YES. [2022-07-19 21:20:07,756 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-19 21:20:07,808 INFO L132 encePairwiseOnDemand]: 335/346 looper letters, 37 selfloop transitions, 26 changer transitions 0/386 dead transitions. [2022-07-19 21:20:07,808 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 349 places, 386 transitions, 1285 flow [2022-07-19 21:20:07,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-19 21:20:07,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-07-19 21:20:07,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 6816 transitions. [2022-07-19 21:20:07,813 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.7879768786127168 [2022-07-19 21:20:07,813 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 6816 transitions. [2022-07-19 21:20:07,813 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 6816 transitions. [2022-07-19 21:20:07,814 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:20:07,814 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 6816 transitions. [2022-07-19 21:20:07,820 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-19 21:20:07,826 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-19 21:20:07,827 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-19 21:20:07,827 INFO L186 Difference]: Start difference. First operand has 325 places, 353 transitions, 1031 flow. Second operand 25 states and 6816 transitions. [2022-07-19 21:20:07,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 349 places, 386 transitions, 1285 flow [2022-07-19 21:20:07,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 349 places, 386 transitions, 1285 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-07-19 21:20:07,842 INFO L242 Difference]: Finished difference. Result has 357 places, 369 transitions, 1195 flow [2022-07-19 21:20:07,842 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-19 21:20:07,843 INFO L279 CegarLoopForPetriNet]: 290 programPoint places, 67 predicate places. [2022-07-19 21:20:07,843 INFO L495 AbstractCegarLoop]: Abstraction has has 357 places, 369 transitions, 1195 flow [2022-07-19 21:20:07,844 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-19 21:20:07,844 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:20:07,844 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-19 21:20:07,861 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-19 21:20:08,059 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-19 21:20:08,059 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-19 21:20:08,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:20:08,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1799201985, now seen corresponding path program 1 times [2022-07-19 21:20:08,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:20:08,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841852492] [2022-07-19 21:20:08,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:20:08,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:20:08,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:20:08,181 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-19 21:20:08,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:20:08,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841852492] [2022-07-19 21:20:08,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841852492] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:20:08,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426188079] [2022-07-19 21:20:08,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:20:08,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:20:08,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:20:08,184 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-19 21:20:08,185 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-19 21:20:08,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:20:08,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-19 21:20:08,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:20:08,324 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-19 21:20:08,325 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 21:20:08,414 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-19 21:20:08,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1426188079] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 21:20:08,414 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 21:20:08,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2022-07-19 21:20:08,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226826098] [2022-07-19 21:20:08,415 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 21:20:08,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-19 21:20:08,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:20:08,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-19 21:20:08,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2022-07-19 21:20:08,418 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 346 [2022-07-19 21:20:08,421 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-19 21:20:08,421 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:20:08,421 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 346 [2022-07-19 21:20:08,421 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:20:10,699 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-19 21:20:10,699 INFO L384 tUnfolder$Statistics]: this new event has 218 ancestors and is cut-off event [2022-07-19 21:20:10,700 INFO L387 tUnfolder$Statistics]: existing Event has 182 ancestors and is cut-off event [2022-07-19 21:20:10,700 INFO L387 tUnfolder$Statistics]: existing Event has 182 ancestors and is cut-off event [2022-07-19 21:20:10,700 INFO L387 tUnfolder$Statistics]: existing Event has 218 ancestors and is cut-off event [2022-07-19 21:20:10,850 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-19 21:20:10,850 INFO L384 tUnfolder$Statistics]: this new event has 231 ancestors and is cut-off event [2022-07-19 21:20:10,850 INFO L387 tUnfolder$Statistics]: existing Event has 159 ancestors and is cut-off event [2022-07-19 21:20:10,850 INFO L387 tUnfolder$Statistics]: existing Event has 195 ancestors and is cut-off event [2022-07-19 21:20:10,850 INFO L387 tUnfolder$Statistics]: existing Event has 159 ancestors and is cut-off event [2022-07-19 21:20:10,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[][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-19 21:20:10,895 INFO L384 tUnfolder$Statistics]: this new event has 241 ancestors and is cut-off event [2022-07-19 21:20:10,895 INFO L387 tUnfolder$Statistics]: existing Event has 169 ancestors and is cut-off event [2022-07-19 21:20:10,895 INFO L387 tUnfolder$Statistics]: existing Event has 205 ancestors and is cut-off event [2022-07-19 21:20:10,895 INFO L387 tUnfolder$Statistics]: existing Event has 169 ancestors and is cut-off event [2022-07-19 21:20:10,900 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-19 21:20:10,900 INFO L384 tUnfolder$Statistics]: this new event has 241 ancestors and is cut-off event [2022-07-19 21:20:10,900 INFO L387 tUnfolder$Statistics]: existing Event has 146 ancestors and is cut-off event [2022-07-19 21:20:10,900 INFO L387 tUnfolder$Statistics]: existing Event has 182 ancestors and is cut-off event [2022-07-19 21:20:10,901 INFO L387 tUnfolder$Statistics]: existing Event has 146 ancestors and is cut-off event [2022-07-19 21:20:10,923 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-19 21:20:10,923 INFO L384 tUnfolder$Statistics]: this new event has 247 ancestors and is cut-off event [2022-07-19 21:20:10,923 INFO L387 tUnfolder$Statistics]: existing Event has 152 ancestors and is cut-off event [2022-07-19 21:20:10,923 INFO L387 tUnfolder$Statistics]: existing Event has 188 ancestors and is cut-off event [2022-07-19 21:20:10,923 INFO L387 tUnfolder$Statistics]: existing Event has 152 ancestors and is cut-off event [2022-07-19 21:20:10,928 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-19 21:20:10,928 INFO L384 tUnfolder$Statistics]: this new event has 249 ancestors and is cut-off event [2022-07-19 21:20:10,928 INFO L387 tUnfolder$Statistics]: existing Event has 177 ancestors and is cut-off event [2022-07-19 21:20:10,928 INFO L387 tUnfolder$Statistics]: existing Event has 177 ancestors and is cut-off event [2022-07-19 21:20:10,928 INFO L387 tUnfolder$Statistics]: existing Event has 213 ancestors and is cut-off event [2022-07-19 21:20:10,946 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-19 21:20:10,946 INFO L384 tUnfolder$Statistics]: this new event has 257 ancestors and is cut-off event [2022-07-19 21:20:10,946 INFO L387 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2022-07-19 21:20:10,946 INFO L387 tUnfolder$Statistics]: existing Event has 162 ancestors and is cut-off event [2022-07-19 21:20:10,946 INFO L387 tUnfolder$Statistics]: existing Event has 162 ancestors and is cut-off event [2022-07-19 21:20:10,954 INFO L129 PetriNetUnfolder]: 1156/11778 cut-off events. [2022-07-19 21:20:10,954 INFO L130 PetriNetUnfolder]: For 3304/3926 co-relation queries the response was YES. [2022-07-19 21:20:11,125 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-19 21:20:11,175 INFO L132 encePairwiseOnDemand]: 340/346 looper letters, 30 selfloop transitions, 30 changer transitions 0/395 dead transitions. [2022-07-19 21:20:11,176 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 395 transitions, 1461 flow [2022-07-19 21:20:11,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-07-19 21:20:11,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-07-19 21:20:11,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 8373 transitions. [2022-07-19 21:20:11,181 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8066473988439307 [2022-07-19 21:20:11,181 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 8373 transitions. [2022-07-19 21:20:11,181 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 8373 transitions. [2022-07-19 21:20:11,184 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:20:11,184 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 8373 transitions. [2022-07-19 21:20:11,190 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-19 21:20:11,198 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-19 21:20:11,199 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-19 21:20:11,199 INFO L186 Difference]: Start difference. First operand has 357 places, 369 transitions, 1195 flow. Second operand 30 states and 8373 transitions. [2022-07-19 21:20:11,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 386 places, 395 transitions, 1461 flow [2022-07-19 21:20:11,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 379 places, 395 transitions, 1427 flow, removed 10 selfloop flow, removed 7 redundant places. [2022-07-19 21:20:11,213 INFO L242 Difference]: Finished difference. Result has 383 places, 379 transitions, 1319 flow [2022-07-19 21:20:11,213 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-19 21:20:11,213 INFO L279 CegarLoopForPetriNet]: 290 programPoint places, 93 predicate places. [2022-07-19 21:20:11,214 INFO L495 AbstractCegarLoop]: Abstraction has has 383 places, 379 transitions, 1319 flow [2022-07-19 21:20:11,214 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-19 21:20:11,214 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:20:11,214 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-19 21:20:11,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-19 21:20:11,419 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-19 21:20:11,419 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-19 21:20:11,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:20:11,420 INFO L85 PathProgramCache]: Analyzing trace with hash -974264783, now seen corresponding path program 2 times [2022-07-19 21:20:11,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:20:11,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058675956] [2022-07-19 21:20:11,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:20:11,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:20:11,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 21:20:11,439 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-19 21:20:11,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 21:20:11,466 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-19 21:20:11,467 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-19 21:20:11,467 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2022-07-19 21:20:11,467 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-07-19 21:20:11,467 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2022-07-19 21:20:11,467 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2022-07-19 21:20:11,468 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2022-07-19 21:20:11,468 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-07-19 21:20:11,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-19 21:20:11,468 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1] [2022-07-19 21:20:11,469 WARN L231 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2022-07-19 21:20:11,469 INFO L509 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2022-07-19 21:20:11,492 INFO L135 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-07-19 21:20:11,495 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 350 places, 419 transitions, 882 flow [2022-07-19 21:20:11,591 INFO L129 PetriNetUnfolder]: 170/964 cut-off events. [2022-07-19 21:20:11,591 INFO L130 PetriNetUnfolder]: For 48/48 co-relation queries the response was YES. [2022-07-19 21:20:11,609 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-19 21:20:11,610 INFO L82 GeneralOperation]: Start removeDead. Operand has 350 places, 419 transitions, 882 flow [2022-07-19 21:20:11,619 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 350 places, 419 transitions, 882 flow [2022-07-19 21:20:11,619 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 21:20:11,620 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@3fd06af6, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@580cf3ac [2022-07-19 21:20:11,620 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-07-19 21:20:11,626 INFO L129 PetriNetUnfolder]: 25/198 cut-off events. [2022-07-19 21:20:11,626 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-19 21:20:11,626 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:20:11,771 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-19 21:20:11,771 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-19 21:20:11,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:20:11,772 INFO L85 PathProgramCache]: Analyzing trace with hash 99825964, now seen corresponding path program 1 times [2022-07-19 21:20:11,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:20:11,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968623537] [2022-07-19 21:20:11,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:20:11,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:20:11,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:20:11,780 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-19 21:20:11,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:20:11,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968623537] [2022-07-19 21:20:11,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968623537] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:20:11,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:20:11,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-19 21:20:11,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707806641] [2022-07-19 21:20:11,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:20:11,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-19 21:20:11,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:20:11,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-19 21:20:11,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-19 21:20:11,782 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 343 out of 419 [2022-07-19 21:20:11,783 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-19 21:20:11,783 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:20:11,783 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 343 of 419 [2022-07-19 21:20:11,783 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:20:11,878 INFO L129 PetriNetUnfolder]: 40/825 cut-off events. [2022-07-19 21:20:11,879 INFO L130 PetriNetUnfolder]: For 122/122 co-relation queries the response was YES. [2022-07-19 21:20:11,891 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-19 21:20:11,894 INFO L132 encePairwiseOnDemand]: 356/419 looper letters, 8 selfloop transitions, 0 changer transitions 0/351 dead transitions. [2022-07-19 21:20:11,895 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 351 transitions, 762 flow [2022-07-19 21:20:11,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-19 21:20:11,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-07-19 21:20:11,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 757 transitions. [2022-07-19 21:20:11,896 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.9033412887828163 [2022-07-19 21:20:11,897 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 757 transitions. [2022-07-19 21:20:11,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 757 transitions. [2022-07-19 21:20:11,897 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:20:11,897 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 757 transitions. [2022-07-19 21:20:11,898 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-19 21:20:11,898 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-19 21:20:11,898 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-19 21:20:11,899 INFO L186 Difference]: Start difference. First operand has 350 places, 419 transitions, 882 flow. Second operand 2 states and 757 transitions. [2022-07-19 21:20:11,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 346 places, 351 transitions, 762 flow [2022-07-19 21:20:11,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 351 transitions, 762 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-07-19 21:20:11,903 INFO L242 Difference]: Finished difference. Result has 346 places, 351 transitions, 746 flow [2022-07-19 21:20:11,903 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-19 21:20:11,903 INFO L279 CegarLoopForPetriNet]: 350 programPoint places, -4 predicate places. [2022-07-19 21:20:11,903 INFO L495 AbstractCegarLoop]: Abstraction has has 346 places, 351 transitions, 746 flow [2022-07-19 21:20:11,904 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-19 21:20:11,904 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:20:11,904 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-19 21:20:11,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-19 21:20:11,904 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-19 21:20:11,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:20:11,904 INFO L85 PathProgramCache]: Analyzing trace with hash 311176877, now seen corresponding path program 1 times [2022-07-19 21:20:11,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:20:11,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656193230] [2022-07-19 21:20:11,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:20:11,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:20:11,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:20:11,916 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-19 21:20:11,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:20:11,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656193230] [2022-07-19 21:20:11,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656193230] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:20:11,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 21:20:11,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 21:20:11,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757280460] [2022-07-19 21:20:11,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:20:11,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 21:20:11,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:20:11,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 21:20:11,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 21:20:11,919 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 336 out of 419 [2022-07-19 21:20:11,919 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-19 21:20:11,920 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:20:11,920 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 336 of 419 [2022-07-19 21:20:11,920 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:20:12,024 INFO L129 PetriNetUnfolder]: 40/829 cut-off events. [2022-07-19 21:20:12,024 INFO L130 PetriNetUnfolder]: For 122/122 co-relation queries the response was YES. [2022-07-19 21:20:12,037 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-19 21:20:12,040 INFO L132 encePairwiseOnDemand]: 416/419 looper letters, 17 selfloop transitions, 2 changer transitions 0/355 dead transitions. [2022-07-19 21:20:12,040 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 355 transitions, 792 flow [2022-07-19 21:20:12,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 21:20:12,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-19 21:20:12,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1028 transitions. [2022-07-19 21:20:12,042 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8178202068416865 [2022-07-19 21:20:12,042 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1028 transitions. [2022-07-19 21:20:12,042 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1028 transitions. [2022-07-19 21:20:12,042 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:20:12,042 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1028 transitions. [2022-07-19 21:20:12,043 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-19 21:20:12,044 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-19 21:20:12,044 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-19 21:20:12,044 INFO L186 Difference]: Start difference. First operand has 346 places, 351 transitions, 746 flow. Second operand 3 states and 1028 transitions. [2022-07-19 21:20:12,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 355 transitions, 792 flow [2022-07-19 21:20:12,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 348 places, 355 transitions, 792 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-07-19 21:20:12,048 INFO L242 Difference]: Finished difference. Result has 349 places, 352 transitions, 758 flow [2022-07-19 21:20:12,050 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-19 21:20:12,050 INFO L279 CegarLoopForPetriNet]: 350 programPoint places, -1 predicate places. [2022-07-19 21:20:12,050 INFO L495 AbstractCegarLoop]: Abstraction has has 349 places, 352 transitions, 758 flow [2022-07-19 21:20:12,050 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-19 21:20:12,050 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:20:12,051 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-19 21:20:12,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-19 21:20:12,051 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-19 21:20:12,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:20:12,051 INFO L85 PathProgramCache]: Analyzing trace with hash -835847906, now seen corresponding path program 1 times [2022-07-19 21:20:12,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:20:12,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818331969] [2022-07-19 21:20:12,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:20:12,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:20:12,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:20:12,075 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-19 21:20:12,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:20:12,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818331969] [2022-07-19 21:20:12,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818331969] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:20:12,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [648096481] [2022-07-19 21:20:12,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:20:12,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:20:12,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:20:12,088 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-19 21:20:12,089 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-19 21:20:12,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:20:12,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-19 21:20:12,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:20:12,174 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-19 21:20:12,174 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 21:20:12,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [648096481] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:20:12,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 21:20:12,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-07-19 21:20:12,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509329676] [2022-07-19 21:20:12,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:20:12,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 21:20:12,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:20:12,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 21:20:12,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-19 21:20:12,176 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 336 out of 419 [2022-07-19 21:20:12,177 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-19 21:20:12,177 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:20:12,177 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 336 of 419 [2022-07-19 21:20:12,177 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:20:12,282 INFO L129 PetriNetUnfolder]: 37/773 cut-off events. [2022-07-19 21:20:12,282 INFO L130 PetriNetUnfolder]: For 113/113 co-relation queries the response was YES. [2022-07-19 21:20:12,295 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-19 21:20:12,297 INFO L132 encePairwiseOnDemand]: 416/419 looper letters, 17 selfloop transitions, 2 changer transitions 0/356 dead transitions. [2022-07-19 21:20:12,298 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 351 places, 356 transitions, 804 flow [2022-07-19 21:20:12,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 21:20:12,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-07-19 21:20:12,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1028 transitions. [2022-07-19 21:20:12,299 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8178202068416865 [2022-07-19 21:20:12,299 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1028 transitions. [2022-07-19 21:20:12,299 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1028 transitions. [2022-07-19 21:20:12,299 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:20:12,299 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1028 transitions. [2022-07-19 21:20:12,300 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-19 21:20:12,301 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-19 21:20:12,301 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-19 21:20:12,301 INFO L186 Difference]: Start difference. First operand has 349 places, 352 transitions, 758 flow. Second operand 3 states and 1028 transitions. [2022-07-19 21:20:12,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 351 places, 356 transitions, 804 flow [2022-07-19 21:20:12,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 350 places, 356 transitions, 802 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-07-19 21:20:12,305 INFO L242 Difference]: Finished difference. Result has 351 places, 353 transitions, 768 flow [2022-07-19 21:20:12,305 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-19 21:20:12,306 INFO L279 CegarLoopForPetriNet]: 350 programPoint places, 1 predicate places. [2022-07-19 21:20:12,306 INFO L495 AbstractCegarLoop]: Abstraction has has 351 places, 353 transitions, 768 flow [2022-07-19 21:20:12,306 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-19 21:20:12,306 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:20:12,306 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-19 21:20:12,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-19 21:20:12,512 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-19 21:20:12,512 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-19 21:20:12,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:20:12,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1049280298, now seen corresponding path program 1 times [2022-07-19 21:20:12,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:20:12,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497225510] [2022-07-19 21:20:12,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:20:12,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:20:12,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:20:12,542 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-19 21:20:12,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:20:12,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497225510] [2022-07-19 21:20:12,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497225510] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:20:12,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [244740434] [2022-07-19 21:20:12,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:20:12,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:20:12,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:20:12,552 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-19 21:20:12,553 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-19 21:20:12,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:20:12,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-19 21:20:12,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:20:12,648 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-19 21:20:12,648 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 21:20:12,664 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-19 21:20:12,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [244740434] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 21:20:12,664 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 21:20:12,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-07-19 21:20:12,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515197160] [2022-07-19 21:20:12,665 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 21:20:12,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-19 21:20:12,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:20:12,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-19 21:20:12,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-19 21:20:12,667 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 335 out of 419 [2022-07-19 21:20:12,668 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-19 21:20:12,668 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:20:12,668 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 335 of 419 [2022-07-19 21:20:12,669 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-07-19 21:20:12,806 INFO L129 PetriNetUnfolder]: 37/780 cut-off events. [2022-07-19 21:20:12,806 INFO L130 PetriNetUnfolder]: For 123/123 co-relation queries the response was YES. [2022-07-19 21:20:12,819 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-19 21:20:12,822 INFO L132 encePairwiseOnDemand]: 413/419 looper letters, 18 selfloop transitions, 9 changer transitions 0/363 dead transitions. [2022-07-19 21:20:12,822 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 359 places, 363 transitions, 844 flow [2022-07-19 21:20:12,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 21:20:12,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-07-19 21:20:12,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 3044 transitions. [2022-07-19 21:20:12,824 INFO L488 CegarLoopForPetriNet]: DFA transition density 0.8072129408644921 [2022-07-19 21:20:12,824 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 3044 transitions. [2022-07-19 21:20:12,824 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 3044 transitions. [2022-07-19 21:20:12,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-19 21:20:12,825 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 3044 transitions. [2022-07-19 21:20:12,827 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-19 21:20:12,829 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-19 21:20:12,829 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-19 21:20:12,829 INFO L186 Difference]: Start difference. First operand has 351 places, 353 transitions, 768 flow. Second operand 9 states and 3044 transitions. [2022-07-19 21:20:12,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 359 places, 363 transitions, 844 flow [2022-07-19 21:20:12,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 363 transitions, 842 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-07-19 21:20:12,835 INFO L242 Difference]: Finished difference. Result has 361 places, 359 transitions, 816 flow [2022-07-19 21:20:12,836 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-19 21:20:12,836 INFO L279 CegarLoopForPetriNet]: 350 programPoint places, 11 predicate places. [2022-07-19 21:20:12,836 INFO L495 AbstractCegarLoop]: Abstraction has has 361 places, 359 transitions, 816 flow [2022-07-19 21:20:12,837 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-19 21:20:12,837 INFO L192 CegarLoopForPetriNet]: Found error trace [2022-07-19 21:20:12,837 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-19 21:20:12,869 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-19 21:20:13,055 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-19 21:20:13,055 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-19 21:20:13,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 21:20:13,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1226572234, now seen corresponding path program 2 times [2022-07-19 21:20:13,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 21:20:13,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382315666] [2022-07-19 21:20:13,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 21:20:13,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 21:20:13,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 21:20:13,120 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-19 21:20:13,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 21:20:13,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382315666] [2022-07-19 21:20:13,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382315666] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 21:20:13,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1483039116] [2022-07-19 21:20:13,120 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 21:20:13,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 21:20:13,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 21:20:13,122 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-19 21:20:13,123 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-19 21:20:13,208 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-19 21:20:13,209 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 21:20:13,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-19 21:20:13,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 21:20:13,226 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-19 21:20:13,319 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-19 21:20:13,319 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-19 21:20:13,350 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-19 21:20:13,421 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-19 21:20:13,464 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-19 21:20:13,464 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 21:20:13,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1483039116] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 21:20:13,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 21:20:13,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [9] total 19 [2022-07-19 21:20:13,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479934991] [2022-07-19 21:20:13,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 21:20:13,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-19 21:20:13,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 21:20:13,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-19 21:20:13,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2022-07-19 21:20:13,468 INFO L443 CegarLoopForPetriNet]: Number of universal loopers: 282 out of 419 [2022-07-19 21:20:13,470 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-19 21:20:13,470 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-07-19 21:20:13,470 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 282 of 419 [2022-07-19 21:20:13,470 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand