/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/unroll-cond-5.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 05:36:46,428 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 05:36:46,429 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 05:36:46,463 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 05:36:46,465 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 05:36:46,467 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 05:36:46,470 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 05:36:46,474 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 05:36:46,480 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 05:36:46,484 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 05:36:46,484 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 05:36:46,485 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 05:36:46,485 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 05:36:46,486 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 05:36:46,488 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 05:36:46,489 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 05:36:46,490 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 05:36:46,491 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 05:36:46,493 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 05:36:46,498 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 05:36:46,500 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 05:36:46,502 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 05:36:46,503 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 05:36:46,504 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 05:36:46,510 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 05:36:46,511 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 05:36:46,511 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 05:36:46,513 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 05:36:46,513 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 05:36:46,514 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 05:36:46,514 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 05:36:46,520 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 05:36:46,521 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 05:36:46,521 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 05:36:46,522 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 05:36:46,522 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 05:36:46,523 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 05:36:46,523 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 05:36:46,523 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 05:36:46,524 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 05:36:46,524 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 05:36:46,525 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-13 05:36:46,556 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 05:36:46,556 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 05:36:46,558 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 05:36:46,559 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 05:36:46,559 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 05:36:46,559 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 05:36:46,560 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 05:36:46,560 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 05:36:46,560 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 05:36:46,560 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 05:36:46,561 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 05:36:46,561 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 05:36:46,561 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 05:36:46,561 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 05:36:46,561 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 05:36:46,561 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 05:36:46,561 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 05:36:46,562 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 05:36:46,562 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 05:36:46,562 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 05:36:46,562 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 05:36:46,562 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 05:36:46,562 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 05:36:46,562 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 05:36:46,563 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 05:36:46,563 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 05:36:46,563 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 05:36:46,563 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 05:36:46,563 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-13 05:36:46,864 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 05:36:46,883 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 05:36:46,885 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 05:36:46,885 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 05:36:46,885 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 05:36:46,886 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/unroll-cond-5.wvr.c [2022-12-13 05:36:47,984 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 05:36:48,209 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 05:36:48,210 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-cond-5.wvr.c [2022-12-13 05:36:48,216 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cee17830/f9d3a420123940ed95f14e5d286a67fb/FLAGd3290c624 [2022-12-13 05:36:48,240 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cee17830/f9d3a420123940ed95f14e5d286a67fb [2022-12-13 05:36:48,242 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 05:36:48,243 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 05:36:48,246 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 05:36:48,246 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 05:36:48,248 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 05:36:48,249 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 05:36:48" (1/1) ... [2022-12-13 05:36:48,250 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35f025f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:36:48, skipping insertion in model container [2022-12-13 05:36:48,250 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 05:36:48" (1/1) ... [2022-12-13 05:36:48,256 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 05:36:48,284 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 05:36:48,471 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-cond-5.wvr.c[2975,2988] [2022-12-13 05:36:48,477 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 05:36:48,489 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 05:36:48,511 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-cond-5.wvr.c[2975,2988] [2022-12-13 05:36:48,514 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 05:36:48,529 INFO L208 MainTranslator]: Completed translation [2022-12-13 05:36:48,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:36:48 WrapperNode [2022-12-13 05:36:48,530 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 05:36:48,532 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 05:36:48,532 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 05:36:48,533 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 05:36:48,539 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:36:48" (1/1) ... [2022-12-13 05:36:48,557 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:36:48" (1/1) ... [2022-12-13 05:36:48,587 INFO L138 Inliner]: procedures = 24, calls = 45, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 204 [2022-12-13 05:36:48,588 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 05:36:48,588 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 05:36:48,588 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 05:36:48,589 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 05:36:48,596 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:36:48" (1/1) ... [2022-12-13 05:36:48,596 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:36:48" (1/1) ... [2022-12-13 05:36:48,608 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:36:48" (1/1) ... [2022-12-13 05:36:48,608 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:36:48" (1/1) ... [2022-12-13 05:36:48,614 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:36:48" (1/1) ... [2022-12-13 05:36:48,628 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:36:48" (1/1) ... [2022-12-13 05:36:48,629 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:36:48" (1/1) ... [2022-12-13 05:36:48,630 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:36:48" (1/1) ... [2022-12-13 05:36:48,632 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 05:36:48,633 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 05:36:48,633 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 05:36:48,633 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 05:36:48,634 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:36:48" (1/1) ... [2022-12-13 05:36:48,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 05:36:48,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 05:36:48,668 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 05:36:48,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 05:36:48,704 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 05:36:48,705 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 05:36:48,705 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 05:36:48,706 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 05:36:48,706 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 05:36:48,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 05:36:48,706 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 05:36:48,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 05:36:48,706 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 05:36:48,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 05:36:48,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 05:36:48,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 05:36:48,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 05:36:48,708 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 05:36:48,802 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 05:36:48,803 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 05:36:49,230 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 05:36:49,240 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 05:36:49,240 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-13 05:36:49,242 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 05:36:49 BoogieIcfgContainer [2022-12-13 05:36:49,242 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 05:36:49,244 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 05:36:49,244 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 05:36:49,247 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 05:36:49,247 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 05:36:48" (1/3) ... [2022-12-13 05:36:49,247 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2589d2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 05:36:49, skipping insertion in model container [2022-12-13 05:36:49,248 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:36:48" (2/3) ... [2022-12-13 05:36:49,248 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2589d2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 05:36:49, skipping insertion in model container [2022-12-13 05:36:49,248 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 05:36:49" (3/3) ... [2022-12-13 05:36:49,249 INFO L112 eAbstractionObserver]: Analyzing ICFG unroll-cond-5.wvr.c [2022-12-13 05:36:49,265 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 05:36:49,265 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 05:36:49,265 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 05:36:49,362 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-13 05:36:49,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 230 places, 247 transitions, 510 flow [2022-12-13 05:36:49,526 INFO L130 PetriNetUnfolder]: 24/245 cut-off events. [2022-12-13 05:36:49,527 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 05:36:49,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 254 conditions, 245 events. 24/245 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 480 event pairs, 0 based on Foata normal form. 0/220 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2022-12-13 05:36:49,534 INFO L82 GeneralOperation]: Start removeDead. Operand has 230 places, 247 transitions, 510 flow [2022-12-13 05:36:49,543 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 220 places, 237 transitions, 486 flow [2022-12-13 05:36:49,544 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:36:49,563 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 220 places, 237 transitions, 486 flow [2022-12-13 05:36:49,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 220 places, 237 transitions, 486 flow [2022-12-13 05:36:49,635 INFO L130 PetriNetUnfolder]: 24/237 cut-off events. [2022-12-13 05:36:49,636 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 05:36:49,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 246 conditions, 237 events. 24/237 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 460 event pairs, 0 based on Foata normal form. 0/213 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2022-12-13 05:36:49,647 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 220 places, 237 transitions, 486 flow [2022-12-13 05:36:49,648 INFO L226 LiptonReduction]: Number of co-enabled transitions 6892 [2022-12-13 05:37:12,377 WARN L233 SmtUtils]: Spent 5.56s on a formula simplification that was a NOOP. DAG size: 197 (called from [L 310] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 05:37:13,419 INFO L241 LiptonReduction]: Total number of compositions: 216 [2022-12-13 05:37:13,433 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 05:37:13,437 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=false, mAutomataTypeConcurrency=REPEATED_LIPTON_PN, 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;@55886a6e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 05:37:13,437 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-13 05:37:13,443 INFO L130 PetriNetUnfolder]: 3/16 cut-off events. [2022-12-13 05:37:13,443 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 05:37:13,444 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:37:13,444 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:37:13,444 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 05:37:13,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:37:13,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1113317458, now seen corresponding path program 1 times [2022-12-13 05:37:13,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:37:13,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348381208] [2022-12-13 05:37:13,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:37:13,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:37:13,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:37:13,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:37:13,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:37:13,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348381208] [2022-12-13 05:37:13,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348381208] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:37:13,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:37:13,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 05:37:13,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396470990] [2022-12-13 05:37:13,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:37:13,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 05:37:13,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:37:13,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 05:37:13,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 05:37:13,925 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2022-12-13 05:37:13,927 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 17 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:37:13,927 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:37:13,927 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2022-12-13 05:37:13,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:37:13,996 INFO L130 PetriNetUnfolder]: 49/84 cut-off events. [2022-12-13 05:37:13,996 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-12-13 05:37:13,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181 conditions, 84 events. 49/84 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 188 event pairs, 19 based on Foata normal form. 0/54 useless extension candidates. Maximal degree in co-relation 129. Up to 81 conditions per place. [2022-12-13 05:37:13,999 INFO L137 encePairwiseOnDemand]: 14/17 looper letters, 14 selfloop transitions, 2 changer transitions 0/18 dead transitions. [2022-12-13 05:37:13,999 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 18 transitions, 80 flow [2022-12-13 05:37:14,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 05:37:14,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 05:37:14,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-12-13 05:37:14,009 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.45098039215686275 [2022-12-13 05:37:14,013 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 2 predicate places. [2022-12-13 05:37:14,014 INFO L82 GeneralOperation]: Start removeDead. Operand has 23 places, 18 transitions, 80 flow [2022-12-13 05:37:14,014 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 23 places, 18 transitions, 80 flow [2022-12-13 05:37:14,015 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:37:14,016 INFO L89 Accepts]: Start accepts. Operand has 23 places, 18 transitions, 80 flow [2022-12-13 05:37:14,019 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:37:14,019 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:37:14,019 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 23 places, 18 transitions, 80 flow [2022-12-13 05:37:14,030 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 18 transitions, 80 flow [2022-12-13 05:37:14,030 INFO L226 LiptonReduction]: Number of co-enabled transitions 22 [2022-12-13 05:37:14,921 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 05:37:14,922 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 907 [2022-12-13 05:37:14,923 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 17 transitions, 76 flow [2022-12-13 05:37:14,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:37:14,923 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:37:14,923 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:37:14,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 05:37:14,924 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 05:37:14,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:37:14,924 INFO L85 PathProgramCache]: Analyzing trace with hash 139568478, now seen corresponding path program 1 times [2022-12-13 05:37:14,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:37:14,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120213605] [2022-12-13 05:37:14,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:37:14,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:37:15,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:37:15,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:37:15,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:37:15,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120213605] [2022-12-13 05:37:15,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120213605] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:37:15,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:37:15,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 05:37:15,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670716149] [2022-12-13 05:37:15,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:37:15,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 05:37:15,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:37:15,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 05:37:15,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 05:37:15,246 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-13 05:37:15,246 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 17 transitions, 76 flow. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:37:15,246 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:37:15,246 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-13 05:37:15,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:37:16,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 05:37:18,721 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-13 05:37:18,784 INFO L130 PetriNetUnfolder]: 72/134 cut-off events. [2022-12-13 05:37:18,785 INFO L131 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2022-12-13 05:37:18,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 406 conditions, 134 events. 72/134 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 368 event pairs, 24 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 286. Up to 113 conditions per place. [2022-12-13 05:37:18,786 INFO L137 encePairwiseOnDemand]: 11/17 looper letters, 34 selfloop transitions, 5 changer transitions 0/39 dead transitions. [2022-12-13 05:37:18,786 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 39 transitions, 253 flow [2022-12-13 05:37:18,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 05:37:18,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 05:37:18,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-12-13 05:37:18,787 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.47058823529411764 [2022-12-13 05:37:18,788 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 5 predicate places. [2022-12-13 05:37:18,788 INFO L82 GeneralOperation]: Start removeDead. Operand has 26 places, 39 transitions, 253 flow [2022-12-13 05:37:18,789 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 26 places, 39 transitions, 253 flow [2022-12-13 05:37:18,790 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:37:18,790 INFO L89 Accepts]: Start accepts. Operand has 26 places, 39 transitions, 253 flow [2022-12-13 05:37:18,791 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:37:18,791 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:37:18,791 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 39 transitions, 253 flow [2022-12-13 05:37:18,792 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 39 transitions, 253 flow [2022-12-13 05:37:18,792 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:37:18,793 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:37:18,794 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4 [2022-12-13 05:37:18,794 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 39 transitions, 253 flow [2022-12-13 05:37:18,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:37:18,794 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:37:18,794 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:37:18,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 05:37:18,795 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 05:37:18,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:37:18,795 INFO L85 PathProgramCache]: Analyzing trace with hash 791731748, now seen corresponding path program 2 times [2022-12-13 05:37:18,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:37:18,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948816710] [2022-12-13 05:37:18,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:37:18,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:37:18,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:37:18,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:37:18,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:37:18,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948816710] [2022-12-13 05:37:18,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948816710] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:37:18,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:37:18,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 05:37:18,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882721676] [2022-12-13 05:37:18,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:37:18,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 05:37:18,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:37:18,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 05:37:18,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 05:37:18,994 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-13 05:37:18,995 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 39 transitions, 253 flow. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:37:18,995 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:37:18,995 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-13 05:37:18,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:37:19,158 INFO L130 PetriNetUnfolder]: 111/207 cut-off events. [2022-12-13 05:37:19,158 INFO L131 PetriNetUnfolder]: For 54/54 co-relation queries the response was YES. [2022-12-13 05:37:19,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 835 conditions, 207 events. 111/207 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 669 event pairs, 24 based on Foata normal form. 0/154 useless extension candidates. Maximal degree in co-relation 592. Up to 182 conditions per place. [2022-12-13 05:37:19,161 INFO L137 encePairwiseOnDemand]: 11/17 looper letters, 63 selfloop transitions, 12 changer transitions 0/75 dead transitions. [2022-12-13 05:37:19,162 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 75 transitions, 633 flow [2022-12-13 05:37:19,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 05:37:19,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 05:37:19,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2022-12-13 05:37:19,164 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4235294117647059 [2022-12-13 05:37:19,165 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 9 predicate places. [2022-12-13 05:37:19,165 INFO L82 GeneralOperation]: Start removeDead. Operand has 30 places, 75 transitions, 633 flow [2022-12-13 05:37:19,167 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 75 transitions, 633 flow [2022-12-13 05:37:19,168 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:37:19,168 INFO L89 Accepts]: Start accepts. Operand has 30 places, 75 transitions, 633 flow [2022-12-13 05:37:19,170 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:37:19,170 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:37:19,170 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 75 transitions, 633 flow [2022-12-13 05:37:19,173 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 30 places, 75 transitions, 633 flow [2022-12-13 05:37:19,173 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:37:19,174 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:37:19,175 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-13 05:37:19,175 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 75 transitions, 633 flow [2022-12-13 05:37:19,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:37:19,175 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:37:19,176 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:37:19,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 05:37:19,176 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 05:37:19,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:37:19,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1071985620, now seen corresponding path program 3 times [2022-12-13 05:37:19,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:37:19,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495235022] [2022-12-13 05:37:19,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:37:19,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:37:19,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:37:19,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:37:19,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:37:19,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495235022] [2022-12-13 05:37:19,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495235022] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:37:19,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:37:19,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 05:37:19,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889402932] [2022-12-13 05:37:19,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:37:19,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 05:37:19,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:37:19,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 05:37:19,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 05:37:19,393 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-13 05:37:19,393 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 75 transitions, 633 flow. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:37:19,393 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:37:19,393 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-13 05:37:19,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:37:19,585 INFO L130 PetriNetUnfolder]: 125/235 cut-off events. [2022-12-13 05:37:19,586 INFO L131 PetriNetUnfolder]: For 61/61 co-relation queries the response was YES. [2022-12-13 05:37:19,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1186 conditions, 235 events. 125/235 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 828 event pairs, 24 based on Foata normal form. 0/174 useless extension candidates. Maximal degree in co-relation 833. Up to 210 conditions per place. [2022-12-13 05:37:19,587 INFO L137 encePairwiseOnDemand]: 11/17 looper letters, 76 selfloop transitions, 16 changer transitions 0/92 dead transitions. [2022-12-13 05:37:19,587 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 92 transitions, 962 flow [2022-12-13 05:37:19,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 05:37:19,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 05:37:19,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-12-13 05:37:19,590 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5058823529411764 [2022-12-13 05:37:19,591 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 13 predicate places. [2022-12-13 05:37:19,591 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 92 transitions, 962 flow [2022-12-13 05:37:19,593 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 34 places, 92 transitions, 962 flow [2022-12-13 05:37:19,595 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:37:19,595 INFO L89 Accepts]: Start accepts. Operand has 34 places, 92 transitions, 962 flow [2022-12-13 05:37:19,597 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:37:19,597 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:37:19,597 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 92 transitions, 962 flow [2022-12-13 05:37:19,599 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 92 transitions, 962 flow [2022-12-13 05:37:19,600 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:37:19,603 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:37:19,608 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 13 [2022-12-13 05:37:19,611 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 92 transitions, 962 flow [2022-12-13 05:37:19,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:37:19,611 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:37:19,612 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:37:19,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 05:37:19,612 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 05:37:19,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:37:19,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1932013350, now seen corresponding path program 4 times [2022-12-13 05:37:19,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:37:19,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162940201] [2022-12-13 05:37:19,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:37:19,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:37:19,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:37:19,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:37:19,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:37:19,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162940201] [2022-12-13 05:37:19,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162940201] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:37:19,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:37:19,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 05:37:19,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293433506] [2022-12-13 05:37:19,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:37:19,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 05:37:19,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:37:19,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 05:37:19,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 05:37:19,781 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-13 05:37:19,781 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 92 transitions, 962 flow. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:37:19,782 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:37:19,782 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-13 05:37:19,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:37:20,845 INFO L130 PetriNetUnfolder]: 122/226 cut-off events. [2022-12-13 05:37:20,846 INFO L131 PetriNetUnfolder]: For 57/57 co-relation queries the response was YES. [2022-12-13 05:37:20,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1366 conditions, 226 events. 122/226 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 754 event pairs, 24 based on Foata normal form. 0/169 useless extension candidates. Maximal degree in co-relation 984. Up to 201 conditions per place. [2022-12-13 05:37:20,848 INFO L137 encePairwiseOnDemand]: 11/17 looper letters, 70 selfloop transitions, 16 changer transitions 0/86 dead transitions. [2022-12-13 05:37:20,848 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 86 transitions, 1068 flow [2022-12-13 05:37:20,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 05:37:20,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 05:37:20,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-12-13 05:37:20,849 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4823529411764706 [2022-12-13 05:37:20,850 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 17 predicate places. [2022-12-13 05:37:20,850 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 86 transitions, 1068 flow [2022-12-13 05:37:20,852 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 86 transitions, 1068 flow [2022-12-13 05:37:20,853 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:37:20,854 INFO L89 Accepts]: Start accepts. Operand has 38 places, 86 transitions, 1068 flow [2022-12-13 05:37:20,855 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:37:20,855 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:37:20,855 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 86 transitions, 1068 flow [2022-12-13 05:37:20,856 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 86 transitions, 1068 flow [2022-12-13 05:37:20,856 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:37:20,857 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:37:20,857 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4 [2022-12-13 05:37:20,858 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 86 transitions, 1068 flow [2022-12-13 05:37:20,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:37:20,858 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:37:20,858 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:37:20,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 05:37:20,858 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 05:37:20,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:37:20,859 INFO L85 PathProgramCache]: Analyzing trace with hash -2001028378, now seen corresponding path program 5 times [2022-12-13 05:37:20,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:37:20,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058435799] [2022-12-13 05:37:20,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:37:20,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:37:20,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:37:20,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:37:20,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:37:20,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058435799] [2022-12-13 05:37:20,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058435799] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:37:20,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:37:20,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 05:37:20,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305588995] [2022-12-13 05:37:20,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:37:20,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 05:37:20,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:37:20,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 05:37:20,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 05:37:20,992 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-13 05:37:20,992 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 86 transitions, 1068 flow. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:37:20,992 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:37:20,992 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-13 05:37:20,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:37:21,175 INFO L130 PetriNetUnfolder]: 120/224 cut-off events. [2022-12-13 05:37:21,176 INFO L131 PetriNetUnfolder]: For 59/59 co-relation queries the response was YES. [2022-12-13 05:37:21,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1579 conditions, 224 events. 120/224 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 757 event pairs, 24 based on Foata normal form. 0/169 useless extension candidates. Maximal degree in co-relation 1136. Up to 199 conditions per place. [2022-12-13 05:37:21,178 INFO L137 encePairwiseOnDemand]: 11/17 looper letters, 69 selfloop transitions, 16 changer transitions 0/85 dead transitions. [2022-12-13 05:37:21,178 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 85 transitions, 1226 flow [2022-12-13 05:37:21,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 05:37:21,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 05:37:21,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 39 transitions. [2022-12-13 05:37:21,179 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4588235294117647 [2022-12-13 05:37:21,180 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 21 predicate places. [2022-12-13 05:37:21,180 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 85 transitions, 1226 flow [2022-12-13 05:37:21,182 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 85 transitions, 1226 flow [2022-12-13 05:37:21,183 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:37:21,183 INFO L89 Accepts]: Start accepts. Operand has 42 places, 85 transitions, 1226 flow [2022-12-13 05:37:21,184 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:37:21,184 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:37:21,184 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 85 transitions, 1226 flow [2022-12-13 05:37:21,186 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 85 transitions, 1226 flow [2022-12-13 05:37:21,186 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:37:21,186 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:37:21,187 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4 [2022-12-13 05:37:21,187 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 85 transitions, 1226 flow [2022-12-13 05:37:21,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:37:21,187 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:37:21,187 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:37:21,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 05:37:21,188 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 05:37:21,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:37:21,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1433911188, now seen corresponding path program 6 times [2022-12-13 05:37:21,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:37:21,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486329350] [2022-12-13 05:37:21,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:37:21,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:37:21,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:37:21,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:37:21,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:37:21,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486329350] [2022-12-13 05:37:21,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486329350] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:37:21,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 05:37:21,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 05:37:21,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477513189] [2022-12-13 05:37:21,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:37:21,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 05:37:21,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:37:21,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 05:37:21,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 05:37:21,324 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-13 05:37:21,324 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 85 transitions, 1226 flow. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:37:21,324 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:37:21,325 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-13 05:37:21,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:37:21,606 INFO L130 PetriNetUnfolder]: 117/215 cut-off events. [2022-12-13 05:37:21,607 INFO L131 PetriNetUnfolder]: For 56/56 co-relation queries the response was YES. [2022-12-13 05:37:21,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1730 conditions, 215 events. 117/215 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 697 event pairs, 24 based on Foata normal form. 0/164 useless extension candidates. Maximal degree in co-relation 1276. Up to 190 conditions per place. [2022-12-13 05:37:21,609 INFO L137 encePairwiseOnDemand]: 11/17 looper letters, 64 selfloop transitions, 15 changer transitions 0/79 dead transitions. [2022-12-13 05:37:21,609 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 79 transitions, 1294 flow [2022-12-13 05:37:21,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 05:37:21,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 05:37:21,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2022-12-13 05:37:21,610 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4117647058823529 [2022-12-13 05:37:21,610 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 25 predicate places. [2022-12-13 05:37:21,611 INFO L82 GeneralOperation]: Start removeDead. Operand has 46 places, 79 transitions, 1294 flow [2022-12-13 05:37:21,613 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 79 transitions, 1294 flow [2022-12-13 05:37:21,614 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:37:21,614 INFO L89 Accepts]: Start accepts. Operand has 46 places, 79 transitions, 1294 flow [2022-12-13 05:37:21,615 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:37:21,615 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:37:21,616 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 79 transitions, 1294 flow [2022-12-13 05:37:21,617 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 79 transitions, 1294 flow [2022-12-13 05:37:21,617 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:37:21,617 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:37:21,618 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4 [2022-12-13 05:37:21,618 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 79 transitions, 1294 flow [2022-12-13 05:37:21,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:37:21,618 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:37:21,618 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:37:21,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 05:37:21,619 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 05:37:21,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:37:21,619 INFO L85 PathProgramCache]: Analyzing trace with hash 835730506, now seen corresponding path program 1 times [2022-12-13 05:37:21,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:37:21,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939505291] [2022-12-13 05:37:21,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:37:21,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:37:21,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:37:21,864 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:37:21,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:37:21,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939505291] [2022-12-13 05:37:21,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939505291] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 05:37:21,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1484145363] [2022-12-13 05:37:21,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:37:21,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:37:21,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 05:37:21,871 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 05:37:21,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 05:37:21,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:37:21,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 43 conjunts are in the unsatisfiable core [2022-12-13 05:37:22,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 05:37:22,056 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-13 05:37:22,099 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 05:37:22,143 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 05:37:22,800 INFO L321 Elim1Store]: treesize reduction 312, result has 7.4 percent of original size [2022-12-13 05:37:22,801 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 14 new quantified variables, introduced 36 case distinctions, treesize of input 531 treesize of output 380 [2022-12-13 05:37:23,728 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:37:23,728 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 05:37:23,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1484145363] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 05:37:23,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 05:37:23,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 11 [2022-12-13 05:37:23,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895800292] [2022-12-13 05:37:23,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 05:37:23,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 05:37:23,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:37:23,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 05:37:23,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-12-13 05:37:23,730 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 17 [2022-12-13 05:37:23,730 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 79 transitions, 1294 flow. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:37:23,730 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:37:23,730 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 17 [2022-12-13 05:37:23,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:37:24,634 INFO L130 PetriNetUnfolder]: 201/363 cut-off events. [2022-12-13 05:37:24,635 INFO L131 PetriNetUnfolder]: For 229/229 co-relation queries the response was YES. [2022-12-13 05:37:24,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3234 conditions, 363 events. 201/363 cut-off events. For 229/229 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1389 event pairs, 14 based on Foata normal form. 2/277 useless extension candidates. Maximal degree in co-relation 1882. Up to 320 conditions per place. [2022-12-13 05:37:24,638 INFO L137 encePairwiseOnDemand]: 10/17 looper letters, 82 selfloop transitions, 21 changer transitions 42/151 dead transitions. [2022-12-13 05:37:24,638 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 151 transitions, 2778 flow [2022-12-13 05:37:24,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 05:37:24,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 05:37:24,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2022-12-13 05:37:24,639 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5588235294117647 [2022-12-13 05:37:24,640 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 30 predicate places. [2022-12-13 05:37:24,640 INFO L82 GeneralOperation]: Start removeDead. Operand has 51 places, 151 transitions, 2778 flow [2022-12-13 05:37:24,643 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 109 transitions, 1995 flow [2022-12-13 05:37:24,645 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:37:24,646 INFO L89 Accepts]: Start accepts. Operand has 50 places, 109 transitions, 1995 flow [2022-12-13 05:37:24,647 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:37:24,647 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:37:24,647 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 109 transitions, 1995 flow [2022-12-13 05:37:24,649 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 109 transitions, 1995 flow [2022-12-13 05:37:24,649 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:37:26,477 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 05:37:26,478 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1833 [2022-12-13 05:37:26,478 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 108 transitions, 1977 flow [2022-12-13 05:37:26,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:37:26,478 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:37:26,478 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:37:26,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 05:37:26,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:37:26,684 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 05:37:26,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:37:26,685 INFO L85 PathProgramCache]: Analyzing trace with hash -194859609, now seen corresponding path program 1 times [2022-12-13 05:37:26,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:37:26,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927301938] [2022-12-13 05:37:26,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:37:26,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:37:26,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:37:26,922 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:37:26,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:37:26,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927301938] [2022-12-13 05:37:26,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927301938] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 05:37:26,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [310547651] [2022-12-13 05:37:26,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:37:26,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:37:26,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 05:37:26,924 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 05:37:26,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 05:37:27,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:37:27,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 46 conjunts are in the unsatisfiable core [2022-12-13 05:37:27,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 05:37:27,051 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-12-13 05:37:27,055 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 05:37:27,091 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 05:37:27,541 INFO L321 Elim1Store]: treesize reduction 57, result has 14.9 percent of original size [2022-12-13 05:37:27,542 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 340 treesize of output 323 [2022-12-13 05:37:28,835 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:37:28,835 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 05:37:40,686 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:37:40,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [310547651] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 05:37:40,687 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 05:37:40,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2022-12-13 05:37:40,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519750021] [2022-12-13 05:37:40,687 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 05:37:40,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-13 05:37:40,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 05:37:40,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-13 05:37:40,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=239, Unknown=3, NotChecked=0, Total=306 [2022-12-13 05:37:40,688 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-13 05:37:40,688 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 108 transitions, 1977 flow. Second operand has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:37:40,688 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 05:37:40,689 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-13 05:37:40,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 05:37:45,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 [] [2022-12-13 05:37:48,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 [] [2022-12-13 05:37:50,928 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 05:37:53,162 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 05:38:21,067 WARN L233 SmtUtils]: Spent 27.01s on a formula simplification. DAG size of input: 108 DAG size of output: 92 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 05:38:43,825 WARN L233 SmtUtils]: Spent 16.42s on a formula simplification. DAG size of input: 109 DAG size of output: 73 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 05:38:49,213 INFO L130 PetriNetUnfolder]: 509/953 cut-off events. [2022-12-13 05:38:49,213 INFO L131 PetriNetUnfolder]: For 479/479 co-relation queries the response was YES. [2022-12-13 05:38:49,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9507 conditions, 953 events. 509/953 cut-off events. For 479/479 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 4947 event pairs, 20 based on Foata normal form. 7/706 useless extension candidates. Maximal degree in co-relation 5132. Up to 874 conditions per place. [2022-12-13 05:38:49,221 INFO L137 encePairwiseOnDemand]: 8/18 looper letters, 222 selfloop transitions, 86 changer transitions 100/408 dead transitions. [2022-12-13 05:38:49,221 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 408 transitions, 8314 flow [2022-12-13 05:38:49,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-12-13 05:38:49,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2022-12-13 05:38:49,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 238 transitions. [2022-12-13 05:38:49,224 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4006734006734007 [2022-12-13 05:38:49,224 INFO L295 CegarLoopForPetriNet]: 21 programPoint places, 60 predicate places. [2022-12-13 05:38:49,224 INFO L82 GeneralOperation]: Start removeDead. Operand has 81 places, 408 transitions, 8314 flow [2022-12-13 05:38:49,233 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 75 places, 308 transitions, 6255 flow [2022-12-13 05:38:49,242 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 05:38:49,242 INFO L89 Accepts]: Start accepts. Operand has 75 places, 308 transitions, 6255 flow [2022-12-13 05:38:49,246 INFO L95 Accepts]: Finished accepts. [2022-12-13 05:38:49,247 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 05:38:49,247 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 308 transitions, 6255 flow [2022-12-13 05:38:49,252 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 308 transitions, 6255 flow [2022-12-13 05:38:49,252 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 05:38:49,253 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 05:38:49,254 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-13 05:38:49,254 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 308 transitions, 6255 flow [2022-12-13 05:38:49,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 05:38:49,254 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 05:38:49,254 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 05:38:49,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-13 05:38:49,463 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,SelfDestructingSolverStorable8 [2022-12-13 05:38:49,463 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-13 05:38:49,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 05:38:49,463 INFO L85 PathProgramCache]: Analyzing trace with hash 752233639, now seen corresponding path program 2 times [2022-12-13 05:38:49,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 05:38:49,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168129847] [2022-12-13 05:38:49,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 05:38:49,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 05:38:49,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 05:38:49,711 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:38:49,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 05:38:49,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168129847] [2022-12-13 05:38:49,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168129847] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 05:38:49,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [720209154] [2022-12-13 05:38:49,712 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 05:38:49,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:38:49,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 05:38:49,714 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 05:38:49,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 05:38:49,914 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 05:38:49,915 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 05:38:49,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 42 conjunts are in the unsatisfiable core [2022-12-13 05:38:49,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 05:38:49,941 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-12-13 05:38:49,944 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 05:38:49,967 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 05:38:50,462 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 05:38:50,463 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 05:38:50,471 INFO L321 Elim1Store]: treesize reduction 3, result has 70.0 percent of original size [2022-12-13 05:38:50,471 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 19 [2022-12-13 05:38:50,502 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 05:38:50,502 INFO L328 TraceCheckSpWp]: Computing backward predicates... Received shutdown request... [2022-12-13 05:51:14,391 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 05:51:14,391 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-13 05:51:14,693 WARN L249 SmtUtils]: Removed 2 from assertion stack [2022-12-13 05:51:14,694 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-13 05:51:14,699 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-13 05:51:14,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 05:51:14,895 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 15 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 15 for 15ms.. [2022-12-13 05:51:14,896 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-13 05:51:14,896 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-13 05:51:14,897 INFO L445 BasicCegarLoop]: Path program histogram: [6, 2, 1, 1] [2022-12-13 05:51:14,900 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 05:51:14,900 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 05:51:14,903 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 05:51:14 BasicIcfg [2022-12-13 05:51:14,903 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 05:51:14,904 INFO L158 Benchmark]: Toolchain (without parser) took 866660.62ms. Allocated memory was 188.7MB in the beginning and 453.0MB in the end (delta: 264.2MB). Free memory was 164.8MB in the beginning and 397.5MB in the end (delta: -232.6MB). Peak memory consumption was 303.0MB. Max. memory is 8.0GB. [2022-12-13 05:51:14,904 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 188.7MB. Free memory was 165.1MB in the beginning and 165.0MB in the end (delta: 83.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 05:51:14,904 INFO L158 Benchmark]: CACSL2BoogieTranslator took 284.64ms. Allocated memory is still 188.7MB. Free memory was 164.8MB in the beginning and 152.8MB in the end (delta: 12.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-13 05:51:14,904 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.53ms. Allocated memory is still 188.7MB. Free memory was 152.8MB in the beginning and 150.2MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-13 05:51:14,905 INFO L158 Benchmark]: Boogie Preprocessor took 44.21ms. Allocated memory is still 188.7MB. Free memory was 150.2MB in the beginning and 148.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-13 05:51:14,905 INFO L158 Benchmark]: RCFGBuilder took 608.71ms. Allocated memory is still 188.7MB. Free memory was 148.6MB in the beginning and 128.1MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2022-12-13 05:51:14,905 INFO L158 Benchmark]: TraceAbstraction took 865658.98ms. Allocated memory was 188.7MB in the beginning and 453.0MB in the end (delta: 264.2MB). Free memory was 126.6MB in the beginning and 397.5MB in the end (delta: -270.9MB). Peak memory consumption was 265.2MB. Max. memory is 8.0GB. [2022-12-13 05:51:14,909 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 188.7MB. Free memory was 165.1MB in the beginning and 165.0MB in the end (delta: 83.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 284.64ms. Allocated memory is still 188.7MB. Free memory was 164.8MB in the beginning and 152.8MB in the end (delta: 12.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 55.53ms. Allocated memory is still 188.7MB. Free memory was 152.8MB in the beginning and 150.2MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 44.21ms. Allocated memory is still 188.7MB. Free memory was 150.2MB in the beginning and 148.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 608.71ms. Allocated memory is still 188.7MB. Free memory was 148.6MB in the beginning and 128.1MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 865658.98ms. Allocated memory was 188.7MB in the beginning and 453.0MB in the end (delta: 264.2MB). Free memory was 126.6MB in the beginning and 397.5MB in the end (delta: -270.9MB). Peak memory consumption was 265.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 23.8s, 220 PlacesBefore, 21 PlacesAfterwards, 237 TransitionsBefore, 17 TransitionsAfterwards, 6892 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 64 TrivialYvCompositions, 135 ConcurrentYvCompositions, 17 ChoiceCompositions, 216 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4270, independent: 4268, independent conditional: 4268, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4270, independent: 4268, independent conditional: 0, independent unconditional: 4268, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4270, independent: 4268, independent conditional: 0, independent unconditional: 4268, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4270, independent: 4268, independent conditional: 0, independent unconditional: 4268, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3913, independent: 3911, independent conditional: 0, independent unconditional: 3911, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3913, independent: 3911, independent conditional: 0, independent unconditional: 3911, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4270, independent: 357, independent conditional: 0, independent unconditional: 357, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3913, unknown conditional: 0, unknown unconditional: 3913] , Statistics on independence cache: Total cache size (in pairs): 7727, Positive cache size: 7725, Positive conditional cache size: 0, Positive unconditional cache size: 7725, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.9s, 23 PlacesBefore, 22 PlacesAfterwards, 18 TransitionsBefore, 17 TransitionsAfterwards, 22 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 26 PlacesBefore, 26 PlacesAfterwards, 39 TransitionsBefore, 39 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 30 PlacesBefore, 30 PlacesAfterwards, 75 TransitionsBefore, 75 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 34 PlacesBefore, 34 PlacesAfterwards, 92 TransitionsBefore, 92 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 38 PlacesBefore, 38 PlacesAfterwards, 86 TransitionsBefore, 86 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 42 PlacesBefore, 42 PlacesAfterwards, 85 TransitionsBefore, 85 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 46 PlacesBefore, 46 PlacesAfterwards, 79 TransitionsBefore, 79 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.8s, 50 PlacesBefore, 49 PlacesAfterwards, 109 TransitionsBefore, 108 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 75 PlacesBefore, 75 PlacesAfterwards, 308 TransitionsBefore, 308 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - TimeoutResultAtElement [Line: 115]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 15 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 15 for 15ms.. - TimeoutResultAtElement [Line: 110]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 15 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 15 for 15ms.. - TimeoutResultAtElement [Line: 109]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 15 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 15 for 15ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 360 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 865.5s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 75.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 24.0s, HoareTripleCheckerStatistics: 10 mSolverCounterUnknown, 440 SdHoareTripleChecker+Valid, 22.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 440 mSDsluCounter, 99 SdHoareTripleChecker+Invalid, 22.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 72 mSDsCounter, 117 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1442 IncrementalHoareTripleChecker+Invalid, 1569 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 117 mSolverCounterUnsat, 27 mSDtfsCounter, 1442 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 136 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 56.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6255occurred in iteration=9, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 16.9s InterpolantComputationTime, 156 NumberOfCodeBlocks, 156 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 158 ConstructedInterpolants, 2 QuantifiedInterpolants, 4313 SizeOfPredicates, 67 NumberOfNonLiveVariables, 324 ConjunctsInSsa, 89 ConjunctsInUnsatCore, 12 InterpolantComputations, 8 PerfectInterpolantSequences, 1/5 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown