./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/bench-exp2x4.wvr.c --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/weaver/bench-exp2x4.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f3514ef3a93910f9ac9453b24d3813c22e07d2a41de38e0bc0d58abd31257770 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-09-01 11:32:11,123 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-09-01 11:32:11,126 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-09-01 11:32:11,175 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-09-01 11:32:11,177 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-09-01 11:32:11,180 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-09-01 11:32:11,183 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-09-01 11:32:11,186 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-09-01 11:32:11,188 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-09-01 11:32:11,193 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-09-01 11:32:11,194 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-09-01 11:32:11,197 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-09-01 11:32:11,197 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-09-01 11:32:11,199 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-09-01 11:32:11,200 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-09-01 11:32:11,205 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-09-01 11:32:11,206 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-09-01 11:32:11,207 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-09-01 11:32:11,209 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-09-01 11:32:11,214 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-09-01 11:32:11,215 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-09-01 11:32:11,216 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-09-01 11:32:11,217 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-09-01 11:32:11,217 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-09-01 11:32:11,224 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-09-01 11:32:11,224 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-09-01 11:32:11,225 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-09-01 11:32:11,227 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-09-01 11:32:11,227 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-09-01 11:32:11,228 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-09-01 11:32:11,228 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-09-01 11:32:11,234 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-09-01 11:32:11,235 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-09-01 11:32:11,236 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-09-01 11:32:11,238 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-09-01 11:32:11,238 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-09-01 11:32:11,238 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-09-01 11:32:11,239 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-09-01 11:32:11,239 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-09-01 11:32:11,240 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-09-01 11:32:11,240 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-09-01 11:32:11,242 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-09-01 11:32:11,275 INFO L113 SettingsManager]: Loading preferences was successful [2023-09-01 11:32:11,276 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-01 11:32:11,277 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-01 11:32:11,277 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-01 11:32:11,278 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-09-01 11:32:11,278 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-09-01 11:32:11,279 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-01 11:32:11,279 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-09-01 11:32:11,279 INFO L138 SettingsManager]: * Use SBE=true [2023-09-01 11:32:11,279 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-01 11:32:11,280 INFO L138 SettingsManager]: * sizeof long=4 [2023-09-01 11:32:11,280 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-01 11:32:11,280 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-09-01 11:32:11,281 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-09-01 11:32:11,281 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-09-01 11:32:11,281 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-09-01 11:32:11,281 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-09-01 11:32:11,281 INFO L138 SettingsManager]: * sizeof long double=12 [2023-09-01 11:32:11,281 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-09-01 11:32:11,282 INFO L138 SettingsManager]: * Use constant arrays=true [2023-09-01 11:32:11,282 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-09-01 11:32:11,282 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-01 11:32:11,282 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-01 11:32:11,282 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-09-01 11:32:11,283 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 11:32:11,283 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-01 11:32:11,283 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-09-01 11:32:11,283 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-09-01 11:32:11,283 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-01 11:32:11,283 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-09-01 11:32:11,284 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-09-01 11:32:11,284 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-09-01 11:32:11,284 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-09-01 11:32:11,284 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-09-01 11:32:11,285 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-09-01 11:32:11,285 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f3514ef3a93910f9ac9453b24d3813c22e07d2a41de38e0bc0d58abd31257770 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-09-01 11:32:11,591 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-01 11:32:11,610 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-01 11:32:11,613 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-01 11:32:11,614 INFO L271 PluginConnector]: Initializing CDTParser... [2023-09-01 11:32:11,615 INFO L275 PluginConnector]: CDTParser initialized [2023-09-01 11:32:11,616 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp2x4.wvr.c [2023-09-01 11:32:12,917 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-09-01 11:32:13,100 INFO L351 CDTParser]: Found 1 translation units. [2023-09-01 11:32:13,101 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x4.wvr.c [2023-09-01 11:32:13,106 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e393ef79/02d8384f151547168f8e0421fe965ebe/FLAG1297e3586 [2023-09-01 11:32:13,118 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e393ef79/02d8384f151547168f8e0421fe965ebe [2023-09-01 11:32:13,121 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-01 11:32:13,122 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-09-01 11:32:13,123 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-01 11:32:13,123 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-01 11:32:13,126 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-01 11:32:13,127 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 11:32:13" (1/1) ... [2023-09-01 11:32:13,127 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25b79047 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 11:32:13, skipping insertion in model container [2023-09-01 11:32:13,128 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 11:32:13" (1/1) ... [2023-09-01 11:32:13,133 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-09-01 11:32:13,146 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-09-01 11:32:13,278 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x4.wvr.c[2309,2322] [2023-09-01 11:32:13,288 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 11:32:13,300 INFO L203 MainTranslator]: Completed pre-run [2023-09-01 11:32:13,340 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x4.wvr.c[2309,2322] [2023-09-01 11:32:13,343 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 11:32:13,357 INFO L208 MainTranslator]: Completed translation [2023-09-01 11:32:13,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 11:32:13 WrapperNode [2023-09-01 11:32:13,359 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-01 11:32:13,361 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-01 11:32:13,361 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-01 11:32:13,361 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-01 11:32:13,367 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 11:32:13" (1/1) ... [2023-09-01 11:32:13,382 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 11:32:13" (1/1) ... [2023-09-01 11:32:13,408 INFO L138 Inliner]: procedures = 20, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 96 [2023-09-01 11:32:13,433 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-01 11:32:13,434 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-01 11:32:13,434 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-01 11:32:13,434 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-09-01 11:32:13,449 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 11:32:13" (1/1) ... [2023-09-01 11:32:13,450 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 11:32:13" (1/1) ... [2023-09-01 11:32:13,452 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 11:32:13" (1/1) ... [2023-09-01 11:32:13,452 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 11:32:13" (1/1) ... [2023-09-01 11:32:13,456 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 11:32:13" (1/1) ... [2023-09-01 11:32:13,471 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 11:32:13" (1/1) ... [2023-09-01 11:32:13,472 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 11:32:13" (1/1) ... [2023-09-01 11:32:13,473 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 11:32:13" (1/1) ... [2023-09-01 11:32:13,475 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-01 11:32:13,476 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-01 11:32:13,476 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-09-01 11:32:13,476 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-09-01 11:32:13,477 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 11:32:13" (1/1) ... [2023-09-01 11:32:13,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 11:32:13,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 11:32:13,504 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-09-01 11:32:13,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-09-01 11:32:13,542 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-01 11:32:13,542 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-09-01 11:32:13,543 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-09-01 11:32:13,543 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-09-01 11:32:13,543 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-09-01 11:32:13,544 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-09-01 11:32:13,544 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-09-01 11:32:13,544 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-09-01 11:32:13,545 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-09-01 11:32:13,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-01 11:32:13,545 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-01 11:32:13,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-01 11:32:13,545 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-01 11:32:13,545 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-01 11:32:13,545 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-09-01 11:32:13,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-01 11:32:13,547 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-09-01 11:32:13,655 INFO L236 CfgBuilder]: Building ICFG [2023-09-01 11:32:13,657 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-01 11:32:13,938 INFO L277 CfgBuilder]: Performing block encoding [2023-09-01 11:32:13,945 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-01 11:32:13,946 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-09-01 11:32:13,948 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 11:32:13 BoogieIcfgContainer [2023-09-01 11:32:13,948 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-01 11:32:13,950 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-09-01 11:32:13,950 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-09-01 11:32:13,952 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-09-01 11:32:13,953 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.09 11:32:13" (1/3) ... [2023-09-01 11:32:13,953 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12ec3c9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 11:32:13, skipping insertion in model container [2023-09-01 11:32:13,954 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 11:32:13" (2/3) ... [2023-09-01 11:32:13,954 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12ec3c9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 11:32:13, skipping insertion in model container [2023-09-01 11:32:13,954 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 11:32:13" (3/3) ... [2023-09-01 11:32:13,955 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp2x4.wvr.c [2023-09-01 11:32:13,962 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-09-01 11:32:13,970 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-09-01 11:32:13,970 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-09-01 11:32:13,970 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-09-01 11:32:14,060 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-09-01 11:32:14,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 130 places, 127 transitions, 286 flow [2023-09-01 11:32:14,204 INFO L130 PetriNetUnfolder]: 10/123 cut-off events. [2023-09-01 11:32:14,205 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-09-01 11:32:14,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 123 events. 10/123 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 62 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2023-09-01 11:32:14,211 INFO L82 GeneralOperation]: Start removeDead. Operand has 130 places, 127 transitions, 286 flow [2023-09-01 11:32:14,217 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 114 places, 111 transitions, 246 flow [2023-09-01 11:32:14,220 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-09-01 11:32:14,237 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 114 places, 111 transitions, 246 flow [2023-09-01 11:32:14,240 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 114 places, 111 transitions, 246 flow [2023-09-01 11:32:14,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 111 transitions, 246 flow [2023-09-01 11:32:14,286 INFO L130 PetriNetUnfolder]: 10/111 cut-off events. [2023-09-01 11:32:14,286 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-09-01 11:32:14,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 111 events. 10/111 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 61 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2023-09-01 11:32:14,290 INFO L119 LiptonReduction]: Number of co-enabled transitions 1512 [2023-09-01 11:32:17,649 INFO L134 LiptonReduction]: Checked pairs total: 1649 [2023-09-01 11:32:17,649 INFO L136 LiptonReduction]: Total number of compositions: 99 [2023-09-01 11:32:17,661 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-09-01 11:32:17,666 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5fcd7264, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-09-01 11:32:17,667 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-09-01 11:32:17,673 INFO L130 PetriNetUnfolder]: 4/24 cut-off events. [2023-09-01 11:32:17,673 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-09-01 11:32:17,673 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 11:32:17,674 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 11:32:17,674 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-01 11:32:17,678 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 11:32:17,679 INFO L85 PathProgramCache]: Analyzing trace with hash 340783593, now seen corresponding path program 1 times [2023-09-01 11:32:17,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 11:32:17,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635325172] [2023-09-01 11:32:17,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 11:32:17,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 11:32:17,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 11:32:18,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 11:32:18,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 11:32:18,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635325172] [2023-09-01 11:32:18,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635325172] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 11:32:18,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 11:32:18,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 11:32:18,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013104417] [2023-09-01 11:32:18,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 11:32:18,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 11:32:18,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 11:32:18,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 11:32:18,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 11:32:18,435 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 226 [2023-09-01 11:32:18,440 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 11:32:18,441 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 11:32:18,441 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 226 [2023-09-01 11:32:18,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 11:32:18,589 INFO L130 PetriNetUnfolder]: 497/677 cut-off events. [2023-09-01 11:32:18,589 INFO L131 PetriNetUnfolder]: For 49/49 co-relation queries the response was YES. [2023-09-01 11:32:18,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1448 conditions, 677 events. 497/677 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1778 event pairs, 117 based on Foata normal form. 1/414 useless extension candidates. Maximal degree in co-relation 1016. Up to 471 conditions per place. [2023-09-01 11:32:18,599 INFO L137 encePairwiseOnDemand]: 220/226 looper letters, 41 selfloop transitions, 5 changer transitions 1/47 dead transitions. [2023-09-01 11:32:18,600 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 47 transitions, 233 flow [2023-09-01 11:32:18,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 11:32:18,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 11:32:18,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 336 transitions. [2023-09-01 11:32:18,612 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49557522123893805 [2023-09-01 11:32:18,612 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 336 transitions. [2023-09-01 11:32:18,613 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 336 transitions. [2023-09-01 11:32:18,614 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 11:32:18,616 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 336 transitions. [2023-09-01 11:32:18,623 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 11:32:18,630 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 226.0) internal successors, (904), 4 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) [2023-09-01 11:32:18,631 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 226.0) internal successors, (904), 4 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) [2023-09-01 11:32:18,633 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 74 flow. Second operand 3 states and 336 transitions. [2023-09-01 11:32:18,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 47 transitions, 233 flow [2023-09-01 11:32:18,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 47 transitions, 203 flow, removed 0 selfloop flow, removed 8 redundant places. [2023-09-01 11:32:18,641 INFO L231 Difference]: Finished difference. Result has 29 places, 29 transitions, 91 flow [2023-09-01 11:32:18,643 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=91, PETRI_PLACES=29, PETRI_TRANSITIONS=29} [2023-09-01 11:32:18,647 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, -5 predicate places. [2023-09-01 11:32:18,647 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 29 transitions, 91 flow [2023-09-01 11:32:18,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 11:32:18,648 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 11:32:18,649 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 11:32:18,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-09-01 11:32:18,652 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-01 11:32:18,660 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 11:32:18,660 INFO L85 PathProgramCache]: Analyzing trace with hash -321644511, now seen corresponding path program 1 times [2023-09-01 11:32:18,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 11:32:18,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65192643] [2023-09-01 11:32:18,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 11:32:18,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 11:32:18,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 11:32:18,938 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 11:32:18,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 11:32:18,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65192643] [2023-09-01 11:32:18,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65192643] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 11:32:18,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 11:32:18,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 11:32:18,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484082933] [2023-09-01 11:32:18,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 11:32:18,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 11:32:18,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 11:32:18,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 11:32:18,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-09-01 11:32:19,025 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 226 [2023-09-01 11:32:19,025 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 29 transitions, 91 flow. Second operand has 4 states, 4 states have (on average 95.5) internal successors, (382), 4 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 11:32:19,025 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 11:32:19,026 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 226 [2023-09-01 11:32:19,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 11:32:19,167 INFO L130 PetriNetUnfolder]: 461/641 cut-off events. [2023-09-01 11:32:19,168 INFO L131 PetriNetUnfolder]: For 177/177 co-relation queries the response was YES. [2023-09-01 11:32:19,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1641 conditions, 641 events. 461/641 cut-off events. For 177/177 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1830 event pairs, 17 based on Foata normal form. 36/677 useless extension candidates. Maximal degree in co-relation 586. Up to 435 conditions per place. [2023-09-01 11:32:19,172 INFO L137 encePairwiseOnDemand]: 219/226 looper letters, 50 selfloop transitions, 9 changer transitions 1/60 dead transitions. [2023-09-01 11:32:19,172 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 60 transitions, 289 flow [2023-09-01 11:32:19,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 11:32:19,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 11:32:19,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 422 transitions. [2023-09-01 11:32:19,175 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4668141592920354 [2023-09-01 11:32:19,175 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 422 transitions. [2023-09-01 11:32:19,175 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 422 transitions. [2023-09-01 11:32:19,175 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 11:32:19,175 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 422 transitions. [2023-09-01 11:32:19,177 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 105.5) internal successors, (422), 4 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 11:32:19,179 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 226.0) internal successors, (1130), 5 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 11:32:19,179 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 226.0) internal successors, (1130), 5 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 11:32:19,180 INFO L175 Difference]: Start difference. First operand has 29 places, 29 transitions, 91 flow. Second operand 4 states and 422 transitions. [2023-09-01 11:32:19,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 60 transitions, 289 flow [2023-09-01 11:32:19,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 60 transitions, 282 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 11:32:19,182 INFO L231 Difference]: Finished difference. Result has 32 places, 33 transitions, 127 flow [2023-09-01 11:32:19,182 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=127, PETRI_PLACES=32, PETRI_TRANSITIONS=33} [2023-09-01 11:32:19,183 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2023-09-01 11:32:19,183 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 33 transitions, 127 flow [2023-09-01 11:32:19,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.5) internal successors, (382), 4 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 11:32:19,184 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 11:32:19,184 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 11:32:19,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-09-01 11:32:19,184 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-01 11:32:19,185 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 11:32:19,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1574738466, now seen corresponding path program 1 times [2023-09-01 11:32:19,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 11:32:19,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956485139] [2023-09-01 11:32:19,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 11:32:19,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 11:32:19,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 11:32:19,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 11:32:19,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 11:32:19,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956485139] [2023-09-01 11:32:19,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956485139] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 11:32:19,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 11:32:19,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 11:32:19,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824541416] [2023-09-01 11:32:19,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 11:32:19,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 11:32:19,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 11:32:19,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 11:32:19,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-09-01 11:32:19,443 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 226 [2023-09-01 11:32:19,444 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 33 transitions, 127 flow. Second operand has 4 states, 4 states have (on average 95.5) internal successors, (382), 4 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 11:32:19,444 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 11:32:19,444 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 226 [2023-09-01 11:32:19,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 11:32:19,588 INFO L130 PetriNetUnfolder]: 431/611 cut-off events. [2023-09-01 11:32:19,588 INFO L131 PetriNetUnfolder]: For 478/478 co-relation queries the response was YES. [2023-09-01 11:32:19,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1721 conditions, 611 events. 431/611 cut-off events. For 478/478 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1711 event pairs, 47 based on Foata normal form. 30/641 useless extension candidates. Maximal degree in co-relation 523. Up to 405 conditions per place. [2023-09-01 11:32:19,592 INFO L137 encePairwiseOnDemand]: 219/226 looper letters, 44 selfloop transitions, 11 changer transitions 11/66 dead transitions. [2023-09-01 11:32:19,592 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 66 transitions, 359 flow [2023-09-01 11:32:19,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 11:32:19,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 11:32:19,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 422 transitions. [2023-09-01 11:32:19,594 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4668141592920354 [2023-09-01 11:32:19,594 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 422 transitions. [2023-09-01 11:32:19,594 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 422 transitions. [2023-09-01 11:32:19,594 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 11:32:19,595 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 422 transitions. [2023-09-01 11:32:19,596 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 105.5) internal successors, (422), 4 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 11:32:19,598 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 226.0) internal successors, (1130), 5 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 11:32:19,598 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 226.0) internal successors, (1130), 5 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 11:32:19,601 INFO L175 Difference]: Start difference. First operand has 32 places, 33 transitions, 127 flow. Second operand 4 states and 422 transitions. [2023-09-01 11:32:19,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 66 transitions, 359 flow [2023-09-01 11:32:19,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 66 transitions, 341 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 11:32:19,603 INFO L231 Difference]: Finished difference. Result has 34 places, 37 transitions, 162 flow [2023-09-01 11:32:19,603 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=162, PETRI_PLACES=34, PETRI_TRANSITIONS=37} [2023-09-01 11:32:19,604 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 0 predicate places. [2023-09-01 11:32:19,604 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 37 transitions, 162 flow [2023-09-01 11:32:19,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.5) internal successors, (382), 4 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 11:32:19,605 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 11:32:19,605 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 11:32:19,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-09-01 11:32:19,605 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-01 11:32:19,606 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 11:32:19,606 INFO L85 PathProgramCache]: Analyzing trace with hash 763566634, now seen corresponding path program 1 times [2023-09-01 11:32:19,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 11:32:19,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363026430] [2023-09-01 11:32:19,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 11:32:19,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 11:32:19,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 11:32:19,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 11:32:19,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 11:32:19,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363026430] [2023-09-01 11:32:19,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363026430] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 11:32:19,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [564832656] [2023-09-01 11:32:19,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 11:32:19,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 11:32:19,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 11:32:19,817 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 11:32:19,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-09-01 11:32:19,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 11:32:19,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 7 conjunts are in the unsatisfiable core [2023-09-01 11:32:19,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 11:32:20,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 11:32:20,391 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 11:32:20,467 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 11:32:20,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [564832656] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 11:32:20,468 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 11:32:20,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-09-01 11:32:20,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213683418] [2023-09-01 11:32:20,468 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 11:32:20,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-09-01 11:32:20,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 11:32:20,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-09-01 11:32:20,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-09-01 11:32:20,590 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 226 [2023-09-01 11:32:20,591 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 37 transitions, 162 flow. Second operand has 7 states, 7 states have (on average 98.0) internal successors, (686), 7 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 11:32:20,591 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 11:32:20,591 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 226 [2023-09-01 11:32:20,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 11:32:20,848 INFO L130 PetriNetUnfolder]: 809/1129 cut-off events. [2023-09-01 11:32:20,848 INFO L131 PetriNetUnfolder]: For 716/716 co-relation queries the response was YES. [2023-09-01 11:32:20,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3396 conditions, 1129 events. 809/1129 cut-off events. For 716/716 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3542 event pairs, 185 based on Foata normal form. 30/1159 useless extension candidates. Maximal degree in co-relation 819. Up to 422 conditions per place. [2023-09-01 11:32:20,855 INFO L137 encePairwiseOnDemand]: 219/226 looper letters, 85 selfloop transitions, 14 changer transitions 3/102 dead transitions. [2023-09-01 11:32:20,855 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 102 transitions, 567 flow [2023-09-01 11:32:20,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 11:32:20,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 11:32:20,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 636 transitions. [2023-09-01 11:32:20,858 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4690265486725664 [2023-09-01 11:32:20,858 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 636 transitions. [2023-09-01 11:32:20,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 636 transitions. [2023-09-01 11:32:20,859 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 11:32:20,859 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 636 transitions. [2023-09-01 11:32:20,860 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 106.0) internal successors, (636), 6 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 11:32:20,863 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 226.0) internal successors, (1582), 7 states have internal predecessors, (1582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 11:32:20,864 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 226.0) internal successors, (1582), 7 states have internal predecessors, (1582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 11:32:20,864 INFO L175 Difference]: Start difference. First operand has 34 places, 37 transitions, 162 flow. Second operand 6 states and 636 transitions. [2023-09-01 11:32:20,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 102 transitions, 567 flow [2023-09-01 11:32:20,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 102 transitions, 558 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 11:32:20,867 INFO L231 Difference]: Finished difference. Result has 41 places, 42 transitions, 224 flow [2023-09-01 11:32:20,867 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=224, PETRI_PLACES=41, PETRI_TRANSITIONS=42} [2023-09-01 11:32:20,868 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 7 predicate places. [2023-09-01 11:32:20,868 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 42 transitions, 224 flow [2023-09-01 11:32:20,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 98.0) internal successors, (686), 7 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 11:32:20,869 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 11:32:20,869 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 11:32:20,884 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-09-01 11:32:21,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 11:32:21,075 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-01 11:32:21,076 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 11:32:21,076 INFO L85 PathProgramCache]: Analyzing trace with hash -266488156, now seen corresponding path program 2 times [2023-09-01 11:32:21,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 11:32:21,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358135321] [2023-09-01 11:32:21,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 11:32:21,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 11:32:21,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 11:32:21,235 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 11:32:21,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 11:32:21,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358135321] [2023-09-01 11:32:21,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358135321] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 11:32:21,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 11:32:21,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 11:32:21,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390999109] [2023-09-01 11:32:21,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 11:32:21,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 11:32:21,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 11:32:21,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 11:32:21,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 11:32:21,326 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 226 [2023-09-01 11:32:21,326 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 42 transitions, 224 flow. Second operand has 4 states, 4 states have (on average 96.5) internal successors, (386), 4 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 11:32:21,327 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 11:32:21,327 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 226 [2023-09-01 11:32:21,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 11:32:21,512 INFO L130 PetriNetUnfolder]: 897/1245 cut-off events. [2023-09-01 11:32:21,513 INFO L131 PetriNetUnfolder]: For 1855/1855 co-relation queries the response was YES. [2023-09-01 11:32:21,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4386 conditions, 1245 events. 897/1245 cut-off events. For 1855/1855 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 3982 event pairs, 229 based on Foata normal form. 28/1273 useless extension candidates. Maximal degree in co-relation 2498. Up to 937 conditions per place. [2023-09-01 11:32:21,521 INFO L137 encePairwiseOnDemand]: 220/226 looper letters, 59 selfloop transitions, 10 changer transitions 3/72 dead transitions. [2023-09-01 11:32:21,521 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 72 transitions, 473 flow [2023-09-01 11:32:21,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 11:32:21,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 11:32:21,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 424 transitions. [2023-09-01 11:32:21,524 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4690265486725664 [2023-09-01 11:32:21,524 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 424 transitions. [2023-09-01 11:32:21,524 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 424 transitions. [2023-09-01 11:32:21,524 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 11:32:21,524 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 424 transitions. [2023-09-01 11:32:21,526 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 11:32:21,527 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 226.0) internal successors, (1130), 5 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 11:32:21,527 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 226.0) internal successors, (1130), 5 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 11:32:21,528 INFO L175 Difference]: Start difference. First operand has 41 places, 42 transitions, 224 flow. Second operand 4 states and 424 transitions. [2023-09-01 11:32:21,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 72 transitions, 473 flow [2023-09-01 11:32:21,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 72 transitions, 462 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-09-01 11:32:21,535 INFO L231 Difference]: Finished difference. Result has 44 places, 43 transitions, 246 flow [2023-09-01 11:32:21,535 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=246, PETRI_PLACES=44, PETRI_TRANSITIONS=43} [2023-09-01 11:32:21,536 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 10 predicate places. [2023-09-01 11:32:21,536 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 43 transitions, 246 flow [2023-09-01 11:32:21,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 96.5) internal successors, (386), 4 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 11:32:21,537 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 11:32:21,537 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 11:32:21,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-09-01 11:32:21,537 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-01 11:32:21,537 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 11:32:21,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1410911463, now seen corresponding path program 2 times [2023-09-01 11:32:21,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 11:32:21,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295534343] [2023-09-01 11:32:21,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 11:32:21,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 11:32:21,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 11:32:21,672 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 11:32:21,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 11:32:21,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295534343] [2023-09-01 11:32:21,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295534343] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 11:32:21,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [131141246] [2023-09-01 11:32:21,673 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-09-01 11:32:21,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 11:32:21,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 11:32:21,675 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 11:32:21,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-09-01 11:32:21,775 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-09-01 11:32:21,775 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 11:32:21,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 7 conjunts are in the unsatisfiable core [2023-09-01 11:32:21,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 11:32:21,889 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 11:32:21,890 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 11:32:21,952 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 11:32:21,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [131141246] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 11:32:21,952 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 11:32:21,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-09-01 11:32:21,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401941224] [2023-09-01 11:32:21,953 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 11:32:21,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-09-01 11:32:21,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 11:32:21,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-09-01 11:32:21,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-09-01 11:32:22,053 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 226 [2023-09-01 11:32:22,054 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 43 transitions, 246 flow. Second operand has 7 states, 7 states have (on average 96.28571428571429) internal successors, (674), 7 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 11:32:22,054 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 11:32:22,054 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 226 [2023-09-01 11:32:22,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 11:32:22,458 INFO L130 PetriNetUnfolder]: 1793/2461 cut-off events. [2023-09-01 11:32:22,458 INFO L131 PetriNetUnfolder]: For 4636/4636 co-relation queries the response was YES. [2023-09-01 11:32:22,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9082 conditions, 2461 events. 1793/2461 cut-off events. For 4636/4636 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 9125 event pairs, 325 based on Foata normal form. 104/2565 useless extension candidates. Maximal degree in co-relation 4890. Up to 1139 conditions per place. [2023-09-01 11:32:22,476 INFO L137 encePairwiseOnDemand]: 219/226 looper letters, 111 selfloop transitions, 14 changer transitions 3/128 dead transitions. [2023-09-01 11:32:22,476 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 128 transitions, 880 flow [2023-09-01 11:32:22,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 11:32:22,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 11:32:22,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 640 transitions. [2023-09-01 11:32:22,479 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.471976401179941 [2023-09-01 11:32:22,480 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 640 transitions. [2023-09-01 11:32:22,480 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 640 transitions. [2023-09-01 11:32:22,481 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 11:32:22,481 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 640 transitions. [2023-09-01 11:32:22,482 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 106.66666666666667) internal successors, (640), 6 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 11:32:22,484 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 226.0) internal successors, (1582), 7 states have internal predecessors, (1582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 11:32:22,485 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 226.0) internal successors, (1582), 7 states have internal predecessors, (1582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 11:32:22,485 INFO L175 Difference]: Start difference. First operand has 44 places, 43 transitions, 246 flow. Second operand 6 states and 640 transitions. [2023-09-01 11:32:22,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 128 transitions, 880 flow [2023-09-01 11:32:22,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 128 transitions, 844 flow, removed 8 selfloop flow, removed 2 redundant places. [2023-09-01 11:32:22,503 INFO L231 Difference]: Finished difference. Result has 50 places, 48 transitions, 296 flow [2023-09-01 11:32:22,503 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=296, PETRI_PLACES=50, PETRI_TRANSITIONS=48} [2023-09-01 11:32:22,506 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 16 predicate places. [2023-09-01 11:32:22,506 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 48 transitions, 296 flow [2023-09-01 11:32:22,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 96.28571428571429) internal successors, (674), 7 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 11:32:22,507 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 11:32:22,507 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 11:32:22,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 [2023-09-01 11:32:22,713 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,SelfDestructingSolverStorable5 [2023-09-01 11:32:22,713 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-01 11:32:22,714 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 11:32:22,714 INFO L85 PathProgramCache]: Analyzing trace with hash -115641799, now seen corresponding path program 1 times [2023-09-01 11:32:22,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 11:32:22,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119049381] [2023-09-01 11:32:22,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 11:32:22,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 11:32:22,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 11:32:22,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 11:32:22,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 11:32:22,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119049381] [2023-09-01 11:32:22,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119049381] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 11:32:22,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [297030333] [2023-09-01 11:32:22,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 11:32:22,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 11:32:22,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 11:32:22,879 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 11:32:22,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-09-01 11:32:22,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 11:32:22,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 7 conjunts are in the unsatisfiable core [2023-09-01 11:32:22,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 11:32:23,068 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 11:32:23,068 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 11:32:23,130 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 11:32:23,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [297030333] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 11:32:23,131 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 11:32:23,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-09-01 11:32:23,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645070462] [2023-09-01 11:32:23,131 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 11:32:23,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-09-01 11:32:23,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 11:32:23,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-09-01 11:32:23,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-09-01 11:32:23,247 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 226 [2023-09-01 11:32:23,248 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 48 transitions, 296 flow. Second operand has 7 states, 7 states have (on average 96.28571428571429) internal successors, (674), 7 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 11:32:23,248 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 11:32:23,248 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 226 [2023-09-01 11:32:23,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 11:32:23,667 INFO L130 PetriNetUnfolder]: 2267/3107 cut-off events. [2023-09-01 11:32:23,667 INFO L131 PetriNetUnfolder]: For 8064/8064 co-relation queries the response was YES. [2023-09-01 11:32:23,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12686 conditions, 3107 events. 2267/3107 cut-off events. For 8064/8064 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 11984 event pairs, 505 based on Foata normal form. 76/3183 useless extension candidates. Maximal degree in co-relation 6978. Up to 1779 conditions per place. [2023-09-01 11:32:23,691 INFO L137 encePairwiseOnDemand]: 219/226 looper letters, 114 selfloop transitions, 14 changer transitions 3/131 dead transitions. [2023-09-01 11:32:23,691 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 131 transitions, 935 flow [2023-09-01 11:32:23,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 11:32:23,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 11:32:23,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 640 transitions. [2023-09-01 11:32:23,694 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.471976401179941 [2023-09-01 11:32:23,694 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 640 transitions. [2023-09-01 11:32:23,694 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 640 transitions. [2023-09-01 11:32:23,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 11:32:23,695 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 640 transitions. [2023-09-01 11:32:23,696 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 106.66666666666667) internal successors, (640), 6 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 11:32:23,698 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 226.0) internal successors, (1582), 7 states have internal predecessors, (1582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 11:32:23,698 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 226.0) internal successors, (1582), 7 states have internal predecessors, (1582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 11:32:23,699 INFO L175 Difference]: Start difference. First operand has 50 places, 48 transitions, 296 flow. Second operand 6 states and 640 transitions. [2023-09-01 11:32:23,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 131 transitions, 935 flow [2023-09-01 11:32:23,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 131 transitions, 924 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-09-01 11:32:23,714 INFO L231 Difference]: Finished difference. Result has 56 places, 51 transitions, 348 flow [2023-09-01 11:32:23,714 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=285, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=348, PETRI_PLACES=56, PETRI_TRANSITIONS=51} [2023-09-01 11:32:23,715 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 22 predicate places. [2023-09-01 11:32:23,715 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 51 transitions, 348 flow [2023-09-01 11:32:23,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 96.28571428571429) internal successors, (674), 7 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 11:32:23,716 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 11:32:23,716 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 11:32:23,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-09-01 11:32:23,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 11:32:23,921 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-01 11:32:23,922 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 11:32:23,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1691541935, now seen corresponding path program 1 times [2023-09-01 11:32:23,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 11:32:23,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462099273] [2023-09-01 11:32:23,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 11:32:23,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 11:32:23,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 11:32:24,448 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 11:32:24,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 11:32:24,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462099273] [2023-09-01 11:32:24,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462099273] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 11:32:24,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [232026658] [2023-09-01 11:32:24,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 11:32:24,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 11:32:24,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 11:32:24,450 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 11:32:24,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-09-01 11:32:25,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 11:32:25,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 16 conjunts are in the unsatisfiable core [2023-09-01 11:32:25,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 11:32:39,387 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 11:32:39,388 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 11:32:48,493 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 11:32:48,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [232026658] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 11:32:48,494 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 11:32:48,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2023-09-01 11:32:48,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790868430] [2023-09-01 11:32:48,495 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 11:32:48,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-09-01 11:32:48,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 11:32:48,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-09-01 11:32:48,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=115, Unknown=7, NotChecked=0, Total=156 [2023-09-01 11:32:51,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:32:53,912 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:32:56,325 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:32:58,561 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:33:00,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:33:02,837 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:33:05,185 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:33:05,364 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 226 [2023-09-01 11:33:05,366 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 51 transitions, 348 flow. Second operand has 13 states, 13 states have (on average 89.0) internal successors, (1157), 13 states have internal predecessors, (1157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 11:33:05,366 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 11:33:05,366 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 226 [2023-09-01 11:33:05,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 11:33:08,378 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:33:22,159 WARN L222 SmtUtils]: Spent 9.28s on a formula simplification. DAG size of input: 62 DAG size of output: 31 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 11:33:24,811 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:33:26,880 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:33:28,891 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:33:31,012 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:33:33,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:33:35,075 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:33:41,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 11:33:43,819 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:33:46,011 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:33:49,551 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 11:33:51,875 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:33:53,885 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:33:56,012 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:34:03,624 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:34:12,270 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:34:14,422 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:34:25,917 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:34:27,271 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:34:29,570 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 11:34:32,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 11:34:33,474 INFO L130 PetriNetUnfolder]: 3161/4327 cut-off events. [2023-09-01 11:34:33,475 INFO L131 PetriNetUnfolder]: For 15732/15732 co-relation queries the response was YES. [2023-09-01 11:34:33,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19260 conditions, 4327 events. 3161/4327 cut-off events. For 15732/15732 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 17741 event pairs, 629 based on Foata normal form. 2/4329 useless extension candidates. Maximal degree in co-relation 16271. Up to 3231 conditions per place. [2023-09-01 11:34:33,511 INFO L137 encePairwiseOnDemand]: 219/226 looper letters, 142 selfloop transitions, 41 changer transitions 5/188 dead transitions. [2023-09-01 11:34:33,512 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 188 transitions, 1442 flow [2023-09-01 11:34:33,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-09-01 11:34:33,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-09-01 11:34:33,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1091 transitions. [2023-09-01 11:34:33,516 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43885760257441675 [2023-09-01 11:34:33,517 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1091 transitions. [2023-09-01 11:34:33,517 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1091 transitions. [2023-09-01 11:34:33,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 11:34:33,518 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1091 transitions. [2023-09-01 11:34:33,520 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 99.18181818181819) internal successors, (1091), 11 states have internal predecessors, (1091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 11:34:33,525 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 226.0) internal successors, (2712), 12 states have internal predecessors, (2712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 11:34:33,526 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 226.0) internal successors, (2712), 12 states have internal predecessors, (2712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 11:34:33,526 INFO L175 Difference]: Start difference. First operand has 56 places, 51 transitions, 348 flow. Second operand 11 states and 1091 transitions. [2023-09-01 11:34:33,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 188 transitions, 1442 flow [2023-09-01 11:34:33,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 188 transitions, 1377 flow, removed 6 selfloop flow, removed 3 redundant places. [2023-09-01 11:34:33,547 INFO L231 Difference]: Finished difference. Result has 69 places, 83 transitions, 696 flow [2023-09-01 11:34:33,548 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=696, PETRI_PLACES=69, PETRI_TRANSITIONS=83} [2023-09-01 11:34:33,550 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 35 predicate places. [2023-09-01 11:34:33,550 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 83 transitions, 696 flow [2023-09-01 11:34:33,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 89.0) internal successors, (1157), 13 states have internal predecessors, (1157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 11:34:33,551 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 11:34:33,551 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 11:34:33,561 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-09-01 11:34:33,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 11:34:33,758 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-01 11:34:33,758 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 11:34:33,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1719575699, now seen corresponding path program 2 times [2023-09-01 11:34:33,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 11:34:33,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596426686] [2023-09-01 11:34:33,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 11:34:33,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 11:34:33,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 11:34:34,325 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 11:34:34,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 11:34:34,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596426686] [2023-09-01 11:34:34,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596426686] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 11:34:34,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [377839079] [2023-09-01 11:34:34,326 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-09-01 11:34:34,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 11:34:34,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 11:34:34,329 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) [2023-09-01 11:34:34,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-09-01 11:34:39,824 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-09-01 11:34:39,824 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 11:34:39,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 17 conjunts are in the unsatisfiable core [2023-09-01 11:34:39,829 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 11:35:44,176 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 11:35:44,176 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 11:36:01,099 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 11:36:01,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [377839079] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 11:36:01,100 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 11:36:01,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 5] total 15 [2023-09-01 11:36:01,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847716168] [2023-09-01 11:36:01,100 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 11:36:01,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-09-01 11:36:01,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 11:36:01,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-09-01 11:36:01,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=171, Unknown=23, NotChecked=0, Total=272 [2023-09-01 11:36:04,928 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:36:07,111 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:36:09,791 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:36:12,259 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:36:15,315 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:36:17,910 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:36:20,348 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:36:20,362 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 226 [2023-09-01 11:36:20,363 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 83 transitions, 696 flow. Second operand has 17 states, 17 states have (on average 87.82352941176471) internal successors, (1493), 17 states have internal predecessors, (1493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 11:36:20,363 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 11:36:20,363 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 226 [2023-09-01 11:36:20,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 11:36:22,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:36:29,522 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:36:32,319 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:36:35,702 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:36:38,280 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:36:40,291 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:36:42,326 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:36:44,445 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:36:46,449 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:36:48,456 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:36:50,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:36:59,619 WARN L222 SmtUtils]: Spent 6.99s on a formula simplification. DAG size of input: 54 DAG size of output: 47 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 11:37:01,622 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:37:04,234 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:37:06,239 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:37:08,242 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:37:10,248 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:37:23,293 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:37:26,117 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:37:28,128 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:37:36,139 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:37:37,290 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:37:38,467 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:37:40,472 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:37:42,483 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:37:45,355 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:37:47,363 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:37:49,376 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:37:51,426 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:37:53,430 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:37:55,444 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:37:57,448 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:37:59,455 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:38:01,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:38:03,079 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:38:04,237 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:38:06,250 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 11:38:08,345 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 11:38:10,367 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 11:38:12,373 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 11:38:14,100 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:38:16,121 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:38:20,011 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:38:22,035 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:38:24,040 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:38:26,364 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:38:28,539 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:38:30,549 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:38:32,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:38:34,564 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:38:37,037 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:38:39,056 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:38:41,398 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:38:43,406 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:38:45,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:38:48,615 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:38:53,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:38:54,785 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:38:56,788 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:38:58,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:39:07,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:39:11,528 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:39:35,010 WARN L222 SmtUtils]: Spent 9.26s on a formula simplification. DAG size of input: 48 DAG size of output: 45 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 11:39:36,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:39:39,269 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:39:41,274 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:39:43,991 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 11:39:46,724 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:39:49,042 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:39:51,262 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:39:53,277 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:39:55,283 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:39:56,380 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:39:57,796 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:40:05,489 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 11:40:08,037 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 11:40:10,041 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 11:40:12,045 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 11:40:13,054 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 11:40:15,057 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 11:40:28,980 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 11:40:31,079 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:40:33,545 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:40:35,569 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:40:37,576 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:40:40,636 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:40:43,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:40:45,855 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:40:47,858 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:40:50,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 11:40:52,217 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 11:40:54,243 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 11:40:56,247 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 11:40:58,275 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 11:41:00,573 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:41:03,359 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:41:04,445 INFO L130 PetriNetUnfolder]: 4947/6814 cut-off events. [2023-09-01 11:41:04,445 INFO L131 PetriNetUnfolder]: For 26905/26905 co-relation queries the response was YES. [2023-09-01 11:41:04,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32796 conditions, 6814 events. 4947/6814 cut-off events. For 26905/26905 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 30943 event pairs, 416 based on Foata normal form. 31/6845 useless extension candidates. Maximal degree in co-relation 31609. Up to 4543 conditions per place. [2023-09-01 11:41:04,479 INFO L137 encePairwiseOnDemand]: 210/226 looper letters, 196 selfloop transitions, 111 changer transitions 14/321 dead transitions. [2023-09-01 11:41:04,479 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 321 transitions, 2771 flow [2023-09-01 11:41:04,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-09-01 11:41:04,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-09-01 11:41:04,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1752 transitions. [2023-09-01 11:41:04,485 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4306784660766962 [2023-09-01 11:41:04,485 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1752 transitions. [2023-09-01 11:41:04,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1752 transitions. [2023-09-01 11:41:04,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 11:41:04,486 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1752 transitions. [2023-09-01 11:41:04,490 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 97.33333333333333) internal successors, (1752), 18 states have internal predecessors, (1752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 11:41:04,495 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 226.0) internal successors, (4294), 19 states have internal predecessors, (4294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 11:41:04,496 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 226.0) internal successors, (4294), 19 states have internal predecessors, (4294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 11:41:04,496 INFO L175 Difference]: Start difference. First operand has 69 places, 83 transitions, 696 flow. Second operand 18 states and 1752 transitions. [2023-09-01 11:41:04,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 321 transitions, 2771 flow [2023-09-01 11:41:04,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 321 transitions, 2694 flow, removed 34 selfloop flow, removed 1 redundant places. [2023-09-01 11:41:04,551 INFO L231 Difference]: Finished difference. Result has 97 places, 181 transitions, 1918 flow [2023-09-01 11:41:04,551 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=621, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1918, PETRI_PLACES=97, PETRI_TRANSITIONS=181} [2023-09-01 11:41:04,552 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 63 predicate places. [2023-09-01 11:41:04,552 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 181 transitions, 1918 flow [2023-09-01 11:41:04,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 87.82352941176471) internal successors, (1493), 17 states have internal predecessors, (1493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 11:41:04,553 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 11:41:04,553 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 11:41:04,560 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-09-01 11:41:04,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 11:41:04,761 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-09-01 11:41:04,761 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 11:41:04,761 INFO L85 PathProgramCache]: Analyzing trace with hash 428160059, now seen corresponding path program 1 times [2023-09-01 11:41:04,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 11:41:04,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946231861] [2023-09-01 11:41:04,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 11:41:04,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 11:41:04,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 11:41:05,524 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 11:41:05,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 11:41:05,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946231861] [2023-09-01 11:41:05,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946231861] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 11:41:05,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [147426707] [2023-09-01 11:41:05,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 11:41:05,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 11:41:05,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 11:41:05,526 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) [2023-09-01 11:41:05,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-09-01 11:41:06,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 11:41:06,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 17 conjunts are in the unsatisfiable core [2023-09-01 11:41:06,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 11:42:04,141 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 11:42:04,141 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 11:42:17,016 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 11:42:17,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [147426707] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 11:42:17,016 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 11:42:17,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2023-09-01 11:42:17,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494487912] [2023-09-01 11:42:17,017 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 11:42:17,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-09-01 11:42:17,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 11:42:17,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-09-01 11:42:17,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=168, Unknown=12, NotChecked=0, Total=240 [2023-09-01 11:42:19,054 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:42:22,370 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:42:24,441 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:42:27,049 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:42:29,272 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:42:31,420 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:42:33,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:42:35,914 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:42:35,921 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 226 [2023-09-01 11:42:35,922 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 181 transitions, 1918 flow. Second operand has 16 states, 16 states have (on average 87.9375) internal successors, (1407), 16 states have internal predecessors, (1407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 11:42:35,922 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 11:42:35,922 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 226 [2023-09-01 11:42:35,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 11:42:38,011 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:42:40,039 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:42:41,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:43:06,250 WARN L222 SmtUtils]: Spent 16.01s on a formula simplification. DAG size of input: 68 DAG size of output: 52 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 11:43:08,270 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 11:43:10,296 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 11:43:31,797 WARN L222 SmtUtils]: Spent 16.57s on a formula simplification. DAG size of input: 98 DAG size of output: 61 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 11:43:33,803 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:43:35,888 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:43:37,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:43:40,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:44:09,244 WARN L222 SmtUtils]: Spent 22.14s on a formula simplification. DAG size of input: 81 DAG size of output: 61 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 11:44:11,140 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:44:13,143 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:44:15,149 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:44:16,697 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:44:18,717 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 11:44:20,726 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 11:44:23,422 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:44:25,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:44:35,508 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:44:46,766 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:44:49,171 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.40s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:44:51,190 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:44:53,214 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:44:54,815 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:44:56,821 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:44:58,879 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:45:00,896 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:45:09,396 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:45:19,317 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 11:45:21,321 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 11:45:23,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 11:45:25,961 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 11:45:27,966 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:45:29,969 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:45:31,974 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:45:33,979 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:45:36,171 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:45:38,178 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:45:40,192 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:45:42,195 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:45:44,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:45:46,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:45:48,537 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 11:45:50,590 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 11:45:52,666 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:45:54,715 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:46:07,127 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:46:09,421 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 11:46:11,430 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:46:13,792 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:46:16,077 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:46:18,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:46:19,972 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:46:22,219 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:46:24,236 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:46:26,675 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 11:46:27,832 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:46:29,852 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:46:31,878 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:46:34,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:46:36,716 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:46:38,884 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:46:40,299 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 11:46:42,315 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] Killed by 15