/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/popl20-bad-three-array-sum-alt.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 02:28:57,411 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 02:28:57,413 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 02:28:57,454 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 02:28:57,455 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 02:28:57,457 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 02:28:57,459 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 02:28:57,462 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 02:28:57,466 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 02:28:57,470 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 02:28:57,471 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 02:28:57,473 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 02:28:57,473 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 02:28:57,475 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 02:28:57,475 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 02:28:57,478 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 02:28:57,479 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 02:28:57,479 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 02:28:57,481 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 02:28:57,485 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 02:28:57,486 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 02:28:57,487 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 02:28:57,488 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 02:28:57,488 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 02:28:57,493 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 02:28:57,494 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 02:28:57,494 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 02:28:57,495 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 02:28:57,496 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 02:28:57,496 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 02:28:57,496 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 02:28:57,498 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 02:28:57,499 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 02:28:57,499 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 02:28:57,500 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 02:28:57,500 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 02:28:57,500 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 02:28:57,500 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 02:28:57,500 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 02:28:57,501 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 02:28:57,501 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 02:28:57,502 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-06 02:28:57,529 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 02:28:57,530 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 02:28:57,531 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 02:28:57,531 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 02:28:57,531 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 02:28:57,532 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 02:28:57,532 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 02:28:57,532 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 02:28:57,532 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 02:28:57,532 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 02:28:57,533 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 02:28:57,533 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 02:28:57,533 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 02:28:57,533 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 02:28:57,533 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 02:28:57,533 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 02:28:57,533 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 02:28:57,534 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 02:28:57,534 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 02:28:57,534 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 02:28:57,534 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 02:28:57,534 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 02:28:57,534 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 02:28:57,534 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 02:28:57,534 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 02:28:57,534 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 02:28:57,534 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 02:28:57,535 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 02:28:57,535 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-06 02:28:57,799 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 02:28:57,828 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 02:28:57,830 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 02:28:57,831 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 02:28:57,831 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 02:28:57,832 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-three-array-sum-alt.wvr.c [2022-12-06 02:28:58,944 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 02:28:59,178 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 02:28:59,178 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-three-array-sum-alt.wvr.c [2022-12-06 02:28:59,185 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bb0d1e9a/5961e5c03ffa42f4a47b668d2d717c67/FLAGa6be892ce [2022-12-06 02:28:59,204 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bb0d1e9a/5961e5c03ffa42f4a47b668d2d717c67 [2022-12-06 02:28:59,206 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 02:28:59,207 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 02:28:59,209 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 02:28:59,209 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 02:28:59,211 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 02:28:59,211 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 02:28:59" (1/1) ... [2022-12-06 02:28:59,212 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75ed03ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:28:59, skipping insertion in model container [2022-12-06 02:28:59,212 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 02:28:59" (1/1) ... [2022-12-06 02:28:59,217 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 02:28:59,234 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 02:28:59,376 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/popl20-bad-three-array-sum-alt.wvr.c[2412,2425] [2022-12-06 02:28:59,390 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 02:28:59,398 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 02:28:59,428 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/popl20-bad-three-array-sum-alt.wvr.c[2412,2425] [2022-12-06 02:28:59,437 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 02:28:59,446 INFO L208 MainTranslator]: Completed translation [2022-12-06 02:28:59,447 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:28:59 WrapperNode [2022-12-06 02:28:59,447 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 02:28:59,449 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 02:28:59,449 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 02:28:59,450 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 02:28:59,454 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:28:59" (1/1) ... [2022-12-06 02:28:59,462 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:28:59" (1/1) ... [2022-12-06 02:28:59,488 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 15, calls inlined = 27, statements flattened = 271 [2022-12-06 02:28:59,488 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 02:28:59,488 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 02:28:59,489 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 02:28:59,489 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 02:28:59,495 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:28:59" (1/1) ... [2022-12-06 02:28:59,496 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:28:59" (1/1) ... [2022-12-06 02:28:59,508 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:28:59" (1/1) ... [2022-12-06 02:28:59,508 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:28:59" (1/1) ... [2022-12-06 02:28:59,514 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:28:59" (1/1) ... [2022-12-06 02:28:59,517 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:28:59" (1/1) ... [2022-12-06 02:28:59,518 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:28:59" (1/1) ... [2022-12-06 02:28:59,531 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:28:59" (1/1) ... [2022-12-06 02:28:59,534 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 02:28:59,535 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 02:28:59,535 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 02:28:59,535 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 02:28:59,536 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:28:59" (1/1) ... [2022-12-06 02:28:59,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 02:28:59,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:28:59,573 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-06 02:28:59,595 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-06 02:28:59,607 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 02:28:59,607 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 02:28:59,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 02:28:59,608 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 02:28:59,608 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 02:28:59,608 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 02:28:59,608 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 02:28:59,608 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 02:28:59,608 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 02:28:59,608 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 02:28:59,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 02:28:59,609 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 02:28:59,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 02:28:59,609 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 02:28:59,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 02:28:59,610 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 02:28:59,729 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 02:28:59,730 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 02:29:00,063 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 02:29:00,071 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 02:29:00,071 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2022-12-06 02:29:00,073 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 02:29:00 BoogieIcfgContainer [2022-12-06 02:29:00,073 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 02:29:00,074 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 02:29:00,075 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 02:29:00,077 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 02:29:00,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 02:28:59" (1/3) ... [2022-12-06 02:29:00,077 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f75dcf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 02:29:00, skipping insertion in model container [2022-12-06 02:29:00,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:28:59" (2/3) ... [2022-12-06 02:29:00,077 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f75dcf0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 02:29:00, skipping insertion in model container [2022-12-06 02:29:00,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 02:29:00" (3/3) ... [2022-12-06 02:29:00,078 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-three-array-sum-alt.wvr.c [2022-12-06 02:29:00,090 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 02:29:00,090 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 02:29:00,090 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 02:29:00,180 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-06 02:29:00,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 298 places, 317 transitions, 658 flow [2022-12-06 02:29:00,332 INFO L130 PetriNetUnfolder]: 29/314 cut-off events. [2022-12-06 02:29:00,332 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 02:29:00,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 327 conditions, 314 events. 29/314 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 427 event pairs, 0 based on Foata normal form. 0/284 useless extension candidates. Maximal degree in co-relation 209. Up to 2 conditions per place. [2022-12-06 02:29:00,345 INFO L82 GeneralOperation]: Start removeDead. Operand has 298 places, 317 transitions, 658 flow [2022-12-06 02:29:00,355 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 285 places, 304 transitions, 626 flow [2022-12-06 02:29:00,356 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:29:00,367 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 285 places, 304 transitions, 626 flow [2022-12-06 02:29:00,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 285 places, 304 transitions, 626 flow [2022-12-06 02:29:00,430 INFO L130 PetriNetUnfolder]: 29/304 cut-off events. [2022-12-06 02:29:00,430 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 02:29:00,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 317 conditions, 304 events. 29/304 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 422 event pairs, 0 based on Foata normal form. 0/275 useless extension candidates. Maximal degree in co-relation 209. Up to 2 conditions per place. [2022-12-06 02:29:00,461 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 285 places, 304 transitions, 626 flow [2022-12-06 02:29:00,461 INFO L188 LiptonReduction]: Number of co-enabled transitions 12810 [2022-12-06 02:29:09,897 INFO L203 LiptonReduction]: Total number of compositions: 276 [2022-12-06 02:29:09,908 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 02:29:09,912 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;@3f5c3036, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 02:29:09,912 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 02:29:09,917 INFO L130 PetriNetUnfolder]: 6/27 cut-off events. [2022-12-06 02:29:09,917 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 02:29:09,917 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:29:09,918 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:29:09,918 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:29:09,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:29:09,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1440705028, now seen corresponding path program 1 times [2022-12-06 02:29:09,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:29:09,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761453239] [2022-12-06 02:29:09,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:29:09,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:29:10,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:29:10,460 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-06 02:29:10,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:29:10,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761453239] [2022-12-06 02:29:10,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761453239] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:29:10,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:29:10,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 02:29:10,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462929202] [2022-12-06 02:29:10,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:29:10,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 02:29:10,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:29:10,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 02:29:10,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 02:29:10,486 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 28 [2022-12-06 02:29:10,487 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 28 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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-06 02:29:10,487 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:29:10,487 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 28 [2022-12-06 02:29:10,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:29:10,591 INFO L130 PetriNetUnfolder]: 362/512 cut-off events. [2022-12-06 02:29:10,591 INFO L131 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2022-12-06 02:29:10,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1076 conditions, 512 events. 362/512 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1612 event pairs, 39 based on Foata normal form. 1/312 useless extension candidates. Maximal degree in co-relation 803. Up to 421 conditions per place. [2022-12-06 02:29:10,596 INFO L137 encePairwiseOnDemand]: 23/28 looper letters, 36 selfloop transitions, 4 changer transitions 1/44 dead transitions. [2022-12-06 02:29:10,596 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 44 transitions, 203 flow [2022-12-06 02:29:10,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 02:29:10,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 02:29:10,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2022-12-06 02:29:10,604 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6071428571428571 [2022-12-06 02:29:10,607 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 2 predicate places. [2022-12-06 02:29:10,608 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:29:10,608 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 44 transitions, 203 flow [2022-12-06 02:29:10,614 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 44 transitions, 203 flow [2022-12-06 02:29:10,614 INFO L188 LiptonReduction]: Number of co-enabled transitions 110 [2022-12-06 02:29:10,614 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:29:10,616 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-06 02:29:10,616 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 44 transitions, 203 flow [2022-12-06 02:29:10,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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-06 02:29:10,617 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:29:10,617 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:29:10,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 02:29:10,620 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:29:10,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:29:10,620 INFO L85 PathProgramCache]: Analyzing trace with hash 638595226, now seen corresponding path program 1 times [2022-12-06 02:29:10,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:29:10,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819621147] [2022-12-06 02:29:10,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:29:10,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:29:10,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:29:10,758 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-06 02:29:10,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:29:10,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819621147] [2022-12-06 02:29:10,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819621147] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:29:10,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:29:10,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 02:29:10,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431191190] [2022-12-06 02:29:10,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:29:10,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 02:29:10,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:29:10,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 02:29:10,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 02:29:10,762 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 28 [2022-12-06 02:29:10,762 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 44 transitions, 203 flow. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 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-06 02:29:10,762 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:29:10,763 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 28 [2022-12-06 02:29:10,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:29:10,944 INFO L130 PetriNetUnfolder]: 681/999 cut-off events. [2022-12-06 02:29:10,948 INFO L131 PetriNetUnfolder]: For 250/254 co-relation queries the response was YES. [2022-12-06 02:29:10,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3029 conditions, 999 events. 681/999 cut-off events. For 250/254 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3945 event pairs, 86 based on Foata normal form. 0/673 useless extension candidates. Maximal degree in co-relation 1193. Up to 705 conditions per place. [2022-12-06 02:29:10,955 INFO L137 encePairwiseOnDemand]: 19/28 looper letters, 87 selfloop transitions, 10 changer transitions 6/105 dead transitions. [2022-12-06 02:29:10,955 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 105 transitions, 696 flow [2022-12-06 02:29:10,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 02:29:10,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 02:29:10,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2022-12-06 02:29:10,957 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5285714285714286 [2022-12-06 02:29:10,957 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 6 predicate places. [2022-12-06 02:29:10,958 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:29:10,959 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 105 transitions, 696 flow [2022-12-06 02:29:10,963 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 105 transitions, 696 flow [2022-12-06 02:29:10,963 INFO L188 LiptonReduction]: Number of co-enabled transitions 170 [2022-12-06 02:29:10,964 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:29:10,965 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-06 02:29:10,966 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 105 transitions, 696 flow [2022-12-06 02:29:10,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 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-06 02:29:10,966 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:29:10,966 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:29:10,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 02:29:10,966 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:29:10,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:29:10,967 INFO L85 PathProgramCache]: Analyzing trace with hash -574008586, now seen corresponding path program 1 times [2022-12-06 02:29:10,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:29:10,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984014019] [2022-12-06 02:29:10,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:29:10,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:29:10,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:29:11,054 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-06 02:29:11,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:29:11,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984014019] [2022-12-06 02:29:11,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984014019] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:29:11,054 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:29:11,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 02:29:11,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406357312] [2022-12-06 02:29:11,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:29:11,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 02:29:11,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:29:11,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 02:29:11,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 02:29:11,055 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 28 [2022-12-06 02:29:11,056 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 105 transitions, 696 flow. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 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-06 02:29:11,056 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:29:11,056 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 28 [2022-12-06 02:29:11,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:29:11,275 INFO L130 PetriNetUnfolder]: 642/983 cut-off events. [2022-12-06 02:29:11,275 INFO L131 PetriNetUnfolder]: For 678/690 co-relation queries the response was YES. [2022-12-06 02:29:11,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3761 conditions, 983 events. 642/983 cut-off events. For 678/690 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 4121 event pairs, 115 based on Foata normal form. 12/762 useless extension candidates. Maximal degree in co-relation 1615. Up to 546 conditions per place. [2022-12-06 02:29:11,279 INFO L137 encePairwiseOnDemand]: 19/28 looper letters, 97 selfloop transitions, 10 changer transitions 18/128 dead transitions. [2022-12-06 02:29:11,279 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 128 transitions, 1098 flow [2022-12-06 02:29:11,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 02:29:11,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 02:29:11,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2022-12-06 02:29:11,280 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2022-12-06 02:29:11,281 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 10 predicate places. [2022-12-06 02:29:11,281 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:29:11,281 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 128 transitions, 1098 flow [2022-12-06 02:29:11,285 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 128 transitions, 1098 flow [2022-12-06 02:29:11,285 INFO L188 LiptonReduction]: Number of co-enabled transitions 72 [2022-12-06 02:29:11,285 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:29:11,286 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5 [2022-12-06 02:29:11,286 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 128 transitions, 1098 flow [2022-12-06 02:29:11,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 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-06 02:29:11,286 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:29:11,286 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:29:11,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 02:29:11,287 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:29:11,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:29:11,287 INFO L85 PathProgramCache]: Analyzing trace with hash 923479627, now seen corresponding path program 1 times [2022-12-06 02:29:11,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:29:11,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456921459] [2022-12-06 02:29:11,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:29:11,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:29:11,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:29:11,358 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-06 02:29:11,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:29:11,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456921459] [2022-12-06 02:29:11,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456921459] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:29:11,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:29:11,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 02:29:11,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006657327] [2022-12-06 02:29:11,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:29:11,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 02:29:11,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:29:11,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 02:29:11,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 02:29:11,360 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 28 [2022-12-06 02:29:11,360 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 128 transitions, 1098 flow. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 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-06 02:29:11,360 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:29:11,360 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 28 [2022-12-06 02:29:11,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:29:11,501 INFO L130 PetriNetUnfolder]: 564/875 cut-off events. [2022-12-06 02:29:11,502 INFO L131 PetriNetUnfolder]: For 1286/1298 co-relation queries the response was YES. [2022-12-06 02:29:11,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3951 conditions, 875 events. 564/875 cut-off events. For 1286/1298 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3316 event pairs, 142 based on Foata normal form. 12/715 useless extension candidates. Maximal degree in co-relation 2101. Up to 535 conditions per place. [2022-12-06 02:29:11,506 INFO L137 encePairwiseOnDemand]: 19/28 looper letters, 38 selfloop transitions, 6 changer transitions 57/103 dead transitions. [2022-12-06 02:29:11,506 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 103 transitions, 1069 flow [2022-12-06 02:29:11,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 02:29:11,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 02:29:11,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2022-12-06 02:29:11,507 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4928571428571429 [2022-12-06 02:29:11,508 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 14 predicate places. [2022-12-06 02:29:11,508 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:29:11,508 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 103 transitions, 1069 flow [2022-12-06 02:29:11,512 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 103 transitions, 1069 flow [2022-12-06 02:29:11,512 INFO L188 LiptonReduction]: Number of co-enabled transitions 12 [2022-12-06 02:29:11,513 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:29:11,513 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 5 [2022-12-06 02:29:11,513 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 103 transitions, 1069 flow [2022-12-06 02:29:11,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 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-06 02:29:11,514 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:29:11,514 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:29:11,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 02:29:11,514 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:29:11,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:29:11,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1913999005, now seen corresponding path program 1 times [2022-12-06 02:29:11,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:29:11,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271165043] [2022-12-06 02:29:11,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:29:11,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:29:11,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:29:11,610 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 02:29:11,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:29:11,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271165043] [2022-12-06 02:29:11,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271165043] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:29:11,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [365039155] [2022-12-06 02:29:11,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:29:11,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:29:11,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:29:11,641 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-06 02:29:11,646 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-06 02:29:11,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:29:11,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 02:29:11,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:29:11,779 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 02:29:11,779 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:29:11,808 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 02:29:11,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [365039155] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-06 02:29:11,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-06 02:29:11,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2022-12-06 02:29:11,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777116143] [2022-12-06 02:29:11,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:29:11,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 02:29:11,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:29:11,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 02:29:11,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-12-06 02:29:11,810 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 28 [2022-12-06 02:29:11,810 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 103 transitions, 1069 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 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-06 02:29:11,810 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:29:11,810 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 28 [2022-12-06 02:29:11,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:29:11,949 INFO L130 PetriNetUnfolder]: 573/902 cut-off events. [2022-12-06 02:29:11,949 INFO L131 PetriNetUnfolder]: For 2533/2651 co-relation queries the response was YES. [2022-12-06 02:29:11,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4842 conditions, 902 events. 573/902 cut-off events. For 2533/2651 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3722 event pairs, 67 based on Foata normal form. 76/840 useless extension candidates. Maximal degree in co-relation 2671. Up to 469 conditions per place. [2022-12-06 02:29:11,953 INFO L137 encePairwiseOnDemand]: 21/28 looper letters, 51 selfloop transitions, 5 changer transitions 90/148 dead transitions. [2022-12-06 02:29:11,953 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 148 transitions, 1822 flow [2022-12-06 02:29:11,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 02:29:11,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 02:29:11,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-12-06 02:29:11,954 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4857142857142857 [2022-12-06 02:29:11,955 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 18 predicate places. [2022-12-06 02:29:11,955 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:29:11,955 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 148 transitions, 1822 flow [2022-12-06 02:29:11,982 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 148 transitions, 1822 flow [2022-12-06 02:29:11,983 INFO L188 LiptonReduction]: Number of co-enabled transitions 16 [2022-12-06 02:29:11,983 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:29:11,984 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 29 [2022-12-06 02:29:11,984 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 148 transitions, 1822 flow [2022-12-06 02:29:11,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 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-06 02:29:11,984 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:29:11,984 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:29:11,992 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-06 02:29:12,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:29:12,190 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:29:12,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:29:12,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1066112884, now seen corresponding path program 1 times [2022-12-06 02:29:12,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:29:12,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150939020] [2022-12-06 02:29:12,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:29:12,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:29:12,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:29:12,304 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 02:29:12,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:29:12,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150939020] [2022-12-06 02:29:12,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150939020] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:29:12,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1659906924] [2022-12-06 02:29:12,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:29:12,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:29:12,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:29:12,306 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-06 02:29:12,320 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-06 02:29:12,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:29:12,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 02:29:12,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:29:12,442 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 02:29:12,443 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:29:12,485 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 02:29:12,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1659906924] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-06 02:29:12,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-06 02:29:12,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2022-12-06 02:29:12,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574256531] [2022-12-06 02:29:12,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:29:12,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 02:29:12,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:29:12,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 02:29:12,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-12-06 02:29:12,487 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 28 [2022-12-06 02:29:12,487 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 148 transitions, 1822 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 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-06 02:29:12,487 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:29:12,487 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 28 [2022-12-06 02:29:12,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:29:12,656 INFO L130 PetriNetUnfolder]: 603/930 cut-off events. [2022-12-06 02:29:12,656 INFO L131 PetriNetUnfolder]: For 4360/4596 co-relation queries the response was YES. [2022-12-06 02:29:12,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5951 conditions, 930 events. 603/930 cut-off events. For 4360/4596 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3797 event pairs, 55 based on Foata normal form. 50/834 useless extension candidates. Maximal degree in co-relation 3688. Up to 555 conditions per place. [2022-12-06 02:29:12,662 INFO L137 encePairwiseOnDemand]: 21/28 looper letters, 73 selfloop transitions, 7 changer transitions 87/169 dead transitions. [2022-12-06 02:29:12,662 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 169 transitions, 2406 flow [2022-12-06 02:29:12,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 02:29:12,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 02:29:12,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-12-06 02:29:12,663 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4857142857142857 [2022-12-06 02:29:12,664 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 22 predicate places. [2022-12-06 02:29:12,664 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:29:12,665 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 169 transitions, 2406 flow [2022-12-06 02:29:12,672 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 169 transitions, 2406 flow [2022-12-06 02:29:12,672 INFO L188 LiptonReduction]: Number of co-enabled transitions 18 [2022-12-06 02:29:12,672 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:29:12,673 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-06 02:29:12,673 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 169 transitions, 2406 flow [2022-12-06 02:29:12,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 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-06 02:29:12,674 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:29:12,674 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:29:12,693 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-06 02:29:12,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-12-06 02:29:12,879 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:29:12,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:29:12,880 INFO L85 PathProgramCache]: Analyzing trace with hash 2047773252, now seen corresponding path program 1 times [2022-12-06 02:29:12,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:29:12,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513723853] [2022-12-06 02:29:12,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:29:12,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:29:12,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:29:13,011 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-06 02:29:13,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:29:13,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513723853] [2022-12-06 02:29:13,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513723853] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:29:13,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2010393007] [2022-12-06 02:29:13,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:29:13,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:29:13,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:29:13,028 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-06 02:29:13,066 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-06 02:29:13,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:29:13,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 02:29:13,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:29:13,166 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-06 02:29:13,166 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:29:13,196 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-06 02:29:13,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2010393007] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-06 02:29:13,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-06 02:29:13,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2022-12-06 02:29:13,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058628338] [2022-12-06 02:29:13,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:29:13,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 02:29:13,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:29:13,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 02:29:13,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-12-06 02:29:13,198 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 28 [2022-12-06 02:29:13,198 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 169 transitions, 2406 flow. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 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-06 02:29:13,198 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:29:13,198 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 28 [2022-12-06 02:29:13,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:29:13,393 INFO L130 PetriNetUnfolder]: 637/982 cut-off events. [2022-12-06 02:29:13,393 INFO L131 PetriNetUnfolder]: For 4988/5184 co-relation queries the response was YES. [2022-12-06 02:29:13,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7161 conditions, 982 events. 637/982 cut-off events. For 4988/5184 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3824 event pairs, 72 based on Foata normal form. 18/856 useless extension candidates. Maximal degree in co-relation 4741. Up to 625 conditions per place. [2022-12-06 02:29:13,399 INFO L137 encePairwiseOnDemand]: 21/28 looper letters, 96 selfloop transitions, 10 changer transitions 84/192 dead transitions. [2022-12-06 02:29:13,399 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 192 transitions, 3099 flow [2022-12-06 02:29:13,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 02:29:13,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 02:29:13,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-12-06 02:29:13,400 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4857142857142857 [2022-12-06 02:29:13,400 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 26 predicate places. [2022-12-06 02:29:13,401 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:29:13,401 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 192 transitions, 3099 flow [2022-12-06 02:29:13,407 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 192 transitions, 3099 flow [2022-12-06 02:29:13,408 INFO L188 LiptonReduction]: Number of co-enabled transitions 18 [2022-12-06 02:29:13,408 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:29:13,408 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-06 02:29:13,409 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 192 transitions, 3099 flow [2022-12-06 02:29:13,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 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-06 02:29:13,409 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:29:13,409 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:29:13,415 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-06 02:29:13,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:29:13,614 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:29:13,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:29:13,614 INFO L85 PathProgramCache]: Analyzing trace with hash 237476162, now seen corresponding path program 1 times [2022-12-06 02:29:13,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:29:13,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677756492] [2022-12-06 02:29:13,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:29:13,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:29:13,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:29:15,127 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:29:15,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:29:15,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677756492] [2022-12-06 02:29:15,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677756492] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:29:15,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1228944027] [2022-12-06 02:29:15,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:29:15,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:29:15,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:29:15,140 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:29:15,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-06 02:29:15,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:29:15,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 75 conjunts are in the unsatisfiable core [2022-12-06 02:29:15,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:29:15,507 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:29:15,507 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 23 [2022-12-06 02:29:15,528 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 02:29:15,528 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:29:15,661 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:29:15,661 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 19 [2022-12-06 02:29:15,672 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-06 02:29:15,673 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 13 [2022-12-06 02:29:15,772 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 02:29:15,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1228944027] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:29:15,772 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:29:15,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 6] total 23 [2022-12-06 02:29:15,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753666586] [2022-12-06 02:29:15,773 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:29:15,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-06 02:29:15,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:29:15,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-06 02:29:15,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=507, Unknown=0, NotChecked=0, Total=600 [2022-12-06 02:29:15,774 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-06 02:29:15,774 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 192 transitions, 3099 flow. Second operand has 25 states, 24 states have (on average 2.5833333333333335) internal successors, (62), 24 states have internal predecessors, (62), 0 states have call successors, (0), 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-06 02:29:15,774 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:29:15,774 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-06 02:29:15,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:29:16,447 INFO L130 PetriNetUnfolder]: 943/1458 cut-off events. [2022-12-06 02:29:16,448 INFO L131 PetriNetUnfolder]: For 5983/5983 co-relation queries the response was YES. [2022-12-06 02:29:16,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11660 conditions, 1458 events. 943/1458 cut-off events. For 5983/5983 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 5867 event pairs, 35 based on Foata normal form. 1/1224 useless extension candidates. Maximal degree in co-relation 8296. Up to 986 conditions per place. [2022-12-06 02:29:16,458 INFO L137 encePairwiseOnDemand]: 13/28 looper letters, 154 selfloop transitions, 50 changer transitions 117/321 dead transitions. [2022-12-06 02:29:16,458 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 321 transitions, 5706 flow [2022-12-06 02:29:16,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 02:29:16,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 02:29:16,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 139 transitions. [2022-12-06 02:29:16,460 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.38186813186813184 [2022-12-06 02:29:16,461 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 38 predicate places. [2022-12-06 02:29:16,463 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:29:16,463 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 321 transitions, 5706 flow [2022-12-06 02:29:16,473 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 321 transitions, 5706 flow [2022-12-06 02:29:16,473 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:29:16,474 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:29:16,476 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-06 02:29:16,476 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 321 transitions, 5706 flow [2022-12-06 02:29:16,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.5833333333333335) internal successors, (62), 24 states have internal predecessors, (62), 0 states have call successors, (0), 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-06 02:29:16,476 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:29:16,476 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:29:16,481 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-06 02:29:16,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:29:16,681 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:29:16,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:29:16,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1946856220, now seen corresponding path program 2 times [2022-12-06 02:29:16,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:29:16,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564846983] [2022-12-06 02:29:16,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:29:16,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:29:16,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:29:17,862 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 02:29:17,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:29:17,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564846983] [2022-12-06 02:29:17,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564846983] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:29:17,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1104360314] [2022-12-06 02:29:17,863 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 02:29:17,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:29:17,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:29:17,864 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:29:17,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-06 02:29:17,989 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 02:29:17,989 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:29:17,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 86 conjunts are in the unsatisfiable core [2022-12-06 02:29:17,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:29:18,030 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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-06 02:29:18,073 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-06 02:29:18,073 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-06 02:29:18,292 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 02:29:18,306 INFO L321 Elim1Store]: treesize reduction 27, result has 35.7 percent of original size [2022-12-06 02:29:18,306 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 42 [2022-12-06 02:29:18,419 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:29:18,419 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 102 treesize of output 106 [2022-12-06 02:29:18,469 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 02:29:18,469 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:29:22,504 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:29:22,505 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 42 [2022-12-06 02:29:22,519 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 02:29:22,524 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-06 02:29:22,524 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 13 [2022-12-06 02:29:22,678 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 02:29:22,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1104360314] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:29:22,679 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:29:22,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 9] total 25 [2022-12-06 02:29:22,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583958139] [2022-12-06 02:29:22,679 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:29:22,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-12-06 02:29:22,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:29:22,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-06 02:29:22,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=601, Unknown=1, NotChecked=0, Total=702 [2022-12-06 02:29:22,680 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-06 02:29:22,680 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 321 transitions, 5706 flow. Second operand has 27 states, 26 states have (on average 2.423076923076923) internal successors, (63), 26 states have internal predecessors, (63), 0 states have call successors, (0), 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-06 02:29:22,680 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:29:22,680 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-06 02:29:22,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:29:23,823 INFO L130 PetriNetUnfolder]: 1087/1667 cut-off events. [2022-12-06 02:29:23,823 INFO L131 PetriNetUnfolder]: For 6769/6769 co-relation queries the response was YES. [2022-12-06 02:29:23,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15192 conditions, 1667 events. 1087/1667 cut-off events. For 6769/6769 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 6795 event pairs, 47 based on Foata normal form. 1/1381 useless extension candidates. Maximal degree in co-relation 11284. Up to 1189 conditions per place. [2022-12-06 02:29:23,840 INFO L137 encePairwiseOnDemand]: 12/28 looper letters, 194 selfloop transitions, 57 changer transitions 118/369 dead transitions. [2022-12-06 02:29:23,840 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 369 transitions, 7322 flow [2022-12-06 02:29:23,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 02:29:23,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-06 02:29:23,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 129 transitions. [2022-12-06 02:29:23,842 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.30714285714285716 [2022-12-06 02:29:23,843 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 52 predicate places. [2022-12-06 02:29:23,843 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:29:23,844 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 84 places, 369 transitions, 7322 flow [2022-12-06 02:29:23,857 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 84 places, 369 transitions, 7322 flow [2022-12-06 02:29:23,857 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:29:23,858 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:29:23,859 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16 [2022-12-06 02:29:23,859 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 369 transitions, 7322 flow [2022-12-06 02:29:23,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.423076923076923) internal successors, (63), 26 states have internal predecessors, (63), 0 states have call successors, (0), 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-06 02:29:23,859 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:29:23,859 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:29:23,879 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-06 02:29:24,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:29:24,065 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:29:24,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:29:24,066 INFO L85 PathProgramCache]: Analyzing trace with hash 325412158, now seen corresponding path program 3 times [2022-12-06 02:29:24,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:29:24,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476553037] [2022-12-06 02:29:24,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:29:24,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:29:24,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:29:24,869 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 02:29:24,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:29:24,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476553037] [2022-12-06 02:29:24,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476553037] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:29:24,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [362871265] [2022-12-06 02:29:24,869 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 02:29:24,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:29:24,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:29:24,871 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:29:24,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-06 02:29:25,002 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-06 02:29:25,003 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:29:25,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 86 conjunts are in the unsatisfiable core [2022-12-06 02:29:25,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:29:25,025 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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-06 02:29:25,051 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-06 02:29:25,051 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-06 02:29:25,248 INFO L321 Elim1Store]: treesize reduction 27, result has 35.7 percent of original size [2022-12-06 02:29:25,249 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 38 [2022-12-06 02:29:25,357 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:29:25,357 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 102 treesize of output 106 [2022-12-06 02:29:25,413 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 02:29:25,413 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:29:26,679 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:29:26,680 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 42 [2022-12-06 02:29:26,700 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 02:29:26,706 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-06 02:29:26,707 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 13 [2022-12-06 02:29:26,873 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 02:29:26,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [362871265] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:29:26,874 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:29:26,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 19 [2022-12-06 02:29:26,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556458041] [2022-12-06 02:29:26,874 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:29:26,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-06 02:29:26,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:29:26,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-06 02:29:26,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2022-12-06 02:29:26,877 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-06 02:29:26,877 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 369 transitions, 7322 flow. Second operand has 21 states, 20 states have (on average 2.6) internal successors, (52), 20 states have internal predecessors, (52), 0 states have call successors, (0), 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-06 02:29:26,877 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:29:26,878 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-06 02:29:26,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:29:27,690 INFO L130 PetriNetUnfolder]: 1175/1796 cut-off events. [2022-12-06 02:29:27,690 INFO L131 PetriNetUnfolder]: For 7200/7200 co-relation queries the response was YES. [2022-12-06 02:29:27,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18288 conditions, 1796 events. 1175/1796 cut-off events. For 7200/7200 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 7385 event pairs, 47 based on Foata normal form. 1/1466 useless extension candidates. Maximal degree in co-relation 13818. Up to 1318 conditions per place. [2022-12-06 02:29:27,711 INFO L137 encePairwiseOnDemand]: 15/28 looper letters, 216 selfloop transitions, 54 changer transitions 119/389 dead transitions. [2022-12-06 02:29:27,711 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 389 transitions, 8512 flow [2022-12-06 02:29:27,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 02:29:27,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 02:29:27,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 109 transitions. [2022-12-06 02:29:27,712 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3538961038961039 [2022-12-06 02:29:27,713 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 62 predicate places. [2022-12-06 02:29:27,717 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:29:27,717 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 94 places, 389 transitions, 8512 flow [2022-12-06 02:29:27,742 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 389 transitions, 8512 flow [2022-12-06 02:29:27,742 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:29:27,744 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:29:27,745 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 32 [2022-12-06 02:29:27,745 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 389 transitions, 8512 flow [2022-12-06 02:29:27,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.6) internal successors, (52), 20 states have internal predecessors, (52), 0 states have call successors, (0), 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-06 02:29:27,745 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:29:27,746 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:29:27,759 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-06 02:29:27,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:29:27,952 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:29:27,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:29:27,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1385201150, now seen corresponding path program 4 times [2022-12-06 02:29:27,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:29:27,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869244049] [2022-12-06 02:29:27,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:29:27,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:29:28,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:29:28,642 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 02:29:28,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:29:28,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869244049] [2022-12-06 02:29:28,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869244049] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:29:28,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1374571698] [2022-12-06 02:29:28,643 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 02:29:28,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:29:28,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:29:28,644 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:29:28,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-06 02:29:28,775 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 02:29:28,776 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:29:28,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 75 conjunts are in the unsatisfiable core [2022-12-06 02:29:28,780 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:29:28,977 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:29:28,977 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 23 [2022-12-06 02:29:28,993 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 02:29:28,993 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:29:29,112 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:29:29,112 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 19 [2022-12-06 02:29:29,121 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-06 02:29:29,121 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 13 [2022-12-06 02:29:29,168 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 02:29:29,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1374571698] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:29:29,168 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:29:29,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 6] total 15 [2022-12-06 02:29:29,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686224349] [2022-12-06 02:29:29,168 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:29:29,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 02:29:29,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:29:29,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 02:29:29,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2022-12-06 02:29:29,169 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-06 02:29:29,169 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 389 transitions, 8512 flow. Second operand has 17 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 0 states have call successors, (0), 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-06 02:29:29,170 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:29:29,170 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-06 02:29:29,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:29:29,825 INFO L130 PetriNetUnfolder]: 1265/1929 cut-off events. [2022-12-06 02:29:29,825 INFO L131 PetriNetUnfolder]: For 7226/7226 co-relation queries the response was YES. [2022-12-06 02:29:29,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21691 conditions, 1929 events. 1265/1929 cut-off events. For 7226/7226 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 8002 event pairs, 53 based on Foata normal form. 1/1555 useless extension candidates. Maximal degree in co-relation 16592. Up to 1451 conditions per place. [2022-12-06 02:29:29,838 INFO L137 encePairwiseOnDemand]: 18/28 looper letters, 240 selfloop transitions, 51 changer transitions 120/411 dead transitions. [2022-12-06 02:29:29,838 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 411 transitions, 9833 flow [2022-12-06 02:29:29,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 02:29:29,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 02:29:29,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 111 transitions. [2022-12-06 02:29:29,840 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.44047619047619047 [2022-12-06 02:29:29,840 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 70 predicate places. [2022-12-06 02:29:29,841 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:29:29,841 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 411 transitions, 9833 flow [2022-12-06 02:29:29,853 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 411 transitions, 9833 flow [2022-12-06 02:29:29,854 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:29:29,855 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:29:29,855 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-06 02:29:29,855 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 411 transitions, 9833 flow [2022-12-06 02:29:29,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 0 states have call successors, (0), 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-06 02:29:29,855 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:29:29,856 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:29:29,860 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-06 02:29:30,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:29:30,060 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:29:30,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:29:30,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1494733566, now seen corresponding path program 5 times [2022-12-06 02:29:30,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:29:30,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834621502] [2022-12-06 02:29:30,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:29:30,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:29:30,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:29:31,056 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 02:29:31,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:29:31,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834621502] [2022-12-06 02:29:31,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834621502] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:29:31,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1386932636] [2022-12-06 02:29:31,057 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-06 02:29:31,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:29:31,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:29:31,058 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:29:31,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-06 02:29:31,165 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-12-06 02:29:31,166 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:29:31,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 86 conjunts are in the unsatisfiable core [2022-12-06 02:29:31,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:29:31,203 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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-06 02:29:31,247 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-06 02:29:31,247 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-06 02:29:31,469 INFO L321 Elim1Store]: treesize reduction 27, result has 35.7 percent of original size [2022-12-06 02:29:31,469 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 38 [2022-12-06 02:29:31,638 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:29:31,639 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 102 treesize of output 106 [2022-12-06 02:29:31,689 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 02:29:31,689 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:29:34,389 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:29:34,390 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 42 [2022-12-06 02:29:34,408 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 02:29:34,413 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-06 02:29:34,413 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 13 [2022-12-06 02:29:34,591 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 02:29:34,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1386932636] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:29:34,591 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:29:34,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 9] total 26 [2022-12-06 02:29:34,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445182791] [2022-12-06 02:29:34,592 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:29:34,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-06 02:29:34,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:29:34,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-06 02:29:34,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=651, Unknown=0, NotChecked=0, Total=756 [2022-12-06 02:29:34,594 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-06 02:29:34,595 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 411 transitions, 9833 flow. Second operand has 28 states, 27 states have (on average 2.3703703703703702) internal successors, (64), 27 states have internal predecessors, (64), 0 states have call successors, (0), 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-06 02:29:34,595 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:29:34,596 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-06 02:29:34,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:29:35,807 INFO L130 PetriNetUnfolder]: 1409/2138 cut-off events. [2022-12-06 02:29:35,807 INFO L131 PetriNetUnfolder]: For 6996/6996 co-relation queries the response was YES. [2022-12-06 02:29:35,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26291 conditions, 2138 events. 1409/2138 cut-off events. For 6996/6996 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 9039 event pairs, 51 based on Foata normal form. 1/1700 useless extension candidates. Maximal degree in co-relation 20590. Up to 1656 conditions per place. [2022-12-06 02:29:35,820 INFO L137 encePairwiseOnDemand]: 12/28 looper letters, 258 selfloop transitions, 68 changer transitions 121/447 dead transitions. [2022-12-06 02:29:35,820 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 447 transitions, 11599 flow [2022-12-06 02:29:35,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 02:29:35,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-06 02:29:35,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 131 transitions. [2022-12-06 02:29:35,822 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3119047619047619 [2022-12-06 02:29:35,822 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 84 predicate places. [2022-12-06 02:29:35,824 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:29:35,824 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 116 places, 447 transitions, 11599 flow [2022-12-06 02:29:35,844 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 116 places, 447 transitions, 11599 flow [2022-12-06 02:29:35,844 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:29:35,846 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:29:35,847 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 24 [2022-12-06 02:29:35,847 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 447 transitions, 11599 flow [2022-12-06 02:29:35,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.3703703703703702) internal successors, (64), 27 states have internal predecessors, (64), 0 states have call successors, (0), 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-06 02:29:35,847 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:29:35,847 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:29:35,855 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-06 02:29:36,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-06 02:29:36,054 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:29:36,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:29:36,054 INFO L85 PathProgramCache]: Analyzing trace with hash 236242912, now seen corresponding path program 6 times [2022-12-06 02:29:36,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:29:36,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730518746] [2022-12-06 02:29:36,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:29:36,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:29:36,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:29:36,684 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 02:29:36,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:29:36,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730518746] [2022-12-06 02:29:36,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730518746] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:29:36,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1796797558] [2022-12-06 02:29:36,684 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-06 02:29:36,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:29:36,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:29:36,700 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:29:36,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-06 02:29:36,869 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-12-06 02:29:36,869 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:29:36,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 75 conjunts are in the unsatisfiable core [2022-12-06 02:29:36,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:29:37,074 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:29:37,075 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 23 [2022-12-06 02:29:37,095 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 02:29:37,095 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:29:37,252 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:29:37,252 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 19 [2022-12-06 02:29:37,263 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-06 02:29:37,263 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 13 [2022-12-06 02:29:37,326 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 02:29:37,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1796797558] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:29:37,328 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:29:37,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 6] total 15 [2022-12-06 02:29:37,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134776763] [2022-12-06 02:29:37,328 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:29:37,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 02:29:37,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:29:37,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 02:29:37,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2022-12-06 02:29:37,330 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-06 02:29:37,330 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 447 transitions, 11599 flow. Second operand has 17 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 0 states have call successors, (0), 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-06 02:29:37,330 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:29:37,330 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-06 02:29:37,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:29:38,144 INFO L130 PetriNetUnfolder]: 1499/2271 cut-off events. [2022-12-06 02:29:38,145 INFO L131 PetriNetUnfolder]: For 7687/7687 co-relation queries the response was YES. [2022-12-06 02:29:38,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30302 conditions, 2271 events. 1499/2271 cut-off events. For 7687/7687 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 9700 event pairs, 91 based on Foata normal form. 1/1789 useless extension candidates. Maximal degree in co-relation 23924. Up to 1789 conditions per place. [2022-12-06 02:29:38,169 INFO L137 encePairwiseOnDemand]: 18/28 looper letters, 296 selfloop transitions, 51 changer transitions 122/469 dead transitions. [2022-12-06 02:29:38,169 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 469 transitions, 13124 flow [2022-12-06 02:29:38,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 02:29:38,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 02:29:38,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions. [2022-12-06 02:29:38,170 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.43253968253968256 [2022-12-06 02:29:38,171 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 92 predicate places. [2022-12-06 02:29:38,173 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:29:38,173 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 469 transitions, 13124 flow [2022-12-06 02:29:38,195 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 124 places, 469 transitions, 13124 flow [2022-12-06 02:29:38,195 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:29:38,198 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:29:38,199 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 28 [2022-12-06 02:29:38,199 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 469 transitions, 13124 flow [2022-12-06 02:29:38,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 0 states have call successors, (0), 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-06 02:29:38,199 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:29:38,199 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:29:38,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-06 02:29:38,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-06 02:29:38,416 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:29:38,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:29:38,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1939838716, now seen corresponding path program 7 times [2022-12-06 02:29:38,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:29:38,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620056909] [2022-12-06 02:29:38,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:29:38,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:29:38,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:29:39,061 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 02:29:39,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:29:39,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620056909] [2022-12-06 02:29:39,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620056909] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:29:39,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1643882936] [2022-12-06 02:29:39,061 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-06 02:29:39,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:29:39,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:29:39,063 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:29:39,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-06 02:29:39,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:29:39,174 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 79 conjunts are in the unsatisfiable core [2022-12-06 02:29:39,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:29:39,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:29:39,371 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-06 02:29:39,474 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:29:39,474 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 23 [2022-12-06 02:29:39,493 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 02:29:39,493 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:29:39,653 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~asum~0 c_~bsum~0))) (and (forall ((v_ArrVal_746 (Array Int Int))) (<= .cse0 (+ c_~csum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_746) c_~A~0.base) c_~A~0.offset)))) (forall ((v_ArrVal_746 (Array Int Int))) (<= (+ c_~csum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_746) c_~A~0.base) c_~A~0.offset)) .cse0)))) is different from false [2022-12-06 02:29:39,663 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:29:39,663 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 38 [2022-12-06 02:29:39,668 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2022-12-06 02:29:39,676 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 02:29:39,680 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-06 02:29:39,681 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 13 [2022-12-06 02:29:39,773 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2022-12-06 02:29:39,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1643882936] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:29:39,774 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:29:39,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 25 [2022-12-06 02:29:39,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651738014] [2022-12-06 02:29:39,774 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:29:39,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-12-06 02:29:39,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:29:39,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-06 02:29:39,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=554, Unknown=1, NotChecked=48, Total=702 [2022-12-06 02:29:39,775 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-06 02:29:39,775 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 469 transitions, 13124 flow. Second operand has 27 states, 26 states have (on average 2.576923076923077) internal successors, (67), 26 states have internal predecessors, (67), 0 states have call successors, (0), 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-06 02:29:39,775 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:29:39,775 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-06 02:29:39,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:29:40,792 INFO L130 PetriNetUnfolder]: 1753/2642 cut-off events. [2022-12-06 02:29:40,793 INFO L131 PetriNetUnfolder]: For 8483/8483 co-relation queries the response was YES. [2022-12-06 02:29:40,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37951 conditions, 2642 events. 1753/2642 cut-off events. For 8483/8483 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 11634 event pairs, 53 based on Foata normal form. 1/2077 useless extension candidates. Maximal degree in co-relation 29496. Up to 2138 conditions per place. [2022-12-06 02:29:40,809 INFO L137 encePairwiseOnDemand]: 17/28 looper letters, 345 selfloop transitions, 87 changer transitions 123/555 dead transitions. [2022-12-06 02:29:40,809 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 555 transitions, 16659 flow [2022-12-06 02:29:40,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 02:29:40,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 02:29:40,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 117 transitions. [2022-12-06 02:29:40,811 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.41785714285714287 [2022-12-06 02:29:40,811 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 101 predicate places. [2022-12-06 02:29:40,812 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:29:40,812 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 555 transitions, 16659 flow [2022-12-06 02:29:40,830 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 133 places, 555 transitions, 16659 flow [2022-12-06 02:29:40,830 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:29:40,831 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:29:40,832 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 21 [2022-12-06 02:29:40,833 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 555 transitions, 16659 flow [2022-12-06 02:29:40,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.576923076923077) internal successors, (67), 26 states have internal predecessors, (67), 0 states have call successors, (0), 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-06 02:29:40,833 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:29:40,833 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:29:40,840 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-06 02:29:41,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-06 02:29:41,037 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:29:41,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:29:41,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1727794258, now seen corresponding path program 8 times [2022-12-06 02:29:41,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:29:41,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913231355] [2022-12-06 02:29:41,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:29:41,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:29:41,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:29:42,104 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 02:29:42,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:29:42,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913231355] [2022-12-06 02:29:42,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913231355] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:29:42,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [308268585] [2022-12-06 02:29:42,104 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 02:29:42,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:29:42,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:29:42,105 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:29:42,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-06 02:29:42,238 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 02:29:42,238 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:29:42,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 90 conjunts are in the unsatisfiable core [2022-12-06 02:29:42,242 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:29:42,282 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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-06 02:29:42,325 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-06 02:29:42,326 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-06 02:29:42,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:29:42,543 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-06 02:29:42,612 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 02:29:42,625 INFO L321 Elim1Store]: treesize reduction 27, result has 35.7 percent of original size [2022-12-06 02:29:42,625 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 42 [2022-12-06 02:29:42,734 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:29:42,734 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 102 treesize of output 106 [2022-12-06 02:29:42,796 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 02:29:42,796 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:29:43,087 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ (* |c_thread2Thread1of1ForFork1_~i~1#1| 4) c_~B~0.offset))) (and (forall ((~C~0.offset Int) (v_ArrVal_814 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_814))) (let ((.cse0 (select (select .cse2 c_~B~0.base) c_~B~0.offset)) (.cse1 (select (select .cse2 c_~A~0.base) c_~A~0.offset))) (<= (+ .cse0 c_~csum~0 .cse1) (+ (select (select (store .cse2 c_~C~0.base (store (select .cse2 c_~C~0.base) ~C~0.offset (+ .cse0 .cse1))) c_~B~0.base) .cse3) c_~asum~0 c_~bsum~0))))) (forall ((~C~0.offset Int) (v_ArrVal_814 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_814))) (let ((.cse5 (select (select .cse4 c_~B~0.base) c_~B~0.offset)) (.cse6 (select (select .cse4 c_~A~0.base) c_~A~0.offset))) (<= (+ (select (select (store .cse4 c_~C~0.base (store (select .cse4 c_~C~0.base) ~C~0.offset (+ .cse5 .cse6))) c_~B~0.base) .cse3) c_~asum~0 c_~bsum~0) (+ .cse5 c_~csum~0 .cse6))))))) is different from false [2022-12-06 02:29:43,098 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((~C~0.offset Int) (v_ArrVal_814 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_814))) (let ((.cse1 (select (select .cse0 c_~B~0.base) c_~B~0.offset)) (.cse2 (select (select .cse0 c_~A~0.base) c_~A~0.offset))) (<= (+ c_~asum~0 c_~bsum~0 (select (select (store .cse0 c_~C~0.base (store (select .cse0 c_~C~0.base) ~C~0.offset (+ .cse1 .cse2))) c_~B~0.base) c_~B~0.offset)) (+ .cse1 c_~csum~0 .cse2))))) (forall ((~C~0.offset Int) (v_ArrVal_814 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_814))) (let ((.cse3 (select (select .cse5 c_~B~0.base) c_~B~0.offset)) (.cse4 (select (select .cse5 c_~A~0.base) c_~A~0.offset))) (<= (+ .cse3 c_~csum~0 .cse4) (+ c_~asum~0 c_~bsum~0 (select (select (store .cse5 c_~C~0.base (store (select .cse5 c_~C~0.base) ~C~0.offset (+ .cse3 .cse4))) c_~B~0.base) c_~B~0.offset))))))) is different from false [2022-12-06 02:29:43,131 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:29:43,132 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 1598 treesize of output 1414 [2022-12-06 02:29:43,154 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:29:43,154 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1496 treesize of output 1388 [2022-12-06 02:38:38,469 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:38,497 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:38,515 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:38,524 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:38,587 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:38,772 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:38,783 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:38,801 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:38,805 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:43,794 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:38:43,795 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 139 treesize of output 101 [2022-12-06 02:38:43,799 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 86 [2022-12-06 02:38:43,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:38:43,823 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 59 [2022-12-06 02:38:43,924 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:38:43,925 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2281 treesize of output 1563 [2022-12-06 02:38:43,968 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1774 treesize of output 1614 [2022-12-06 02:38:44,227 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:44,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:38:44,240 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1892 treesize of output 1191 [2022-12-06 02:38:44,255 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:44,263 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:44,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:38:44,270 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 726 treesize of output 451 [2022-12-06 02:38:44,279 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:44,286 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:44,291 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:44,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:38:44,297 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 351 treesize of output 222 [2022-12-06 02:38:44,304 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:44,307 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:44,312 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:44,315 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:44,319 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:44,322 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:44,325 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:44,328 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:44,331 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:44,341 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:44,344 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:44,349 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:44,352 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:44,356 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:44,358 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:44,362 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:44,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:38:44,368 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 470 treesize of output 302 [2022-12-06 02:38:44,375 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 298 treesize of output 274 [2022-12-06 02:38:44,401 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:44,404 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:44,409 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:44,412 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:44,415 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:44,417 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:44,510 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:38:44,510 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 159 treesize of output 129 [2022-12-06 02:38:44,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:38:44,546 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-06 02:38:44,546 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 121 treesize of output 1 [2022-12-06 02:38:44,552 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:44,556 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:44,560 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:44,566 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:44,570 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:44,574 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:44,578 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:44,582 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:44,603 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:38:44,603 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 72 treesize of output 72 [2022-12-06 02:38:44,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:38:44,656 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-06 02:38:44,657 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 894 treesize of output 1 [2022-12-06 02:38:44,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:38:44,673 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-06 02:38:44,673 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 490 treesize of output 1 [2022-12-06 02:38:44,683 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:44,686 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:44,691 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:44,696 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:44,701 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:44,704 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:44,708 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:44,714 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:44,718 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:44,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:38:44,747 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-06 02:38:44,748 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 1880 treesize of output 1 [2022-12-06 02:38:44,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:38:44,794 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-06 02:38:44,794 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 2385 treesize of output 1 [2022-12-06 02:38:44,808 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:44,815 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:44,820 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 8 [2022-12-06 02:38:44,824 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:44,828 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:44,831 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:44,834 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:44,837 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:44,841 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:44,846 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:44,849 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:44,852 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:44,855 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:44,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:38:44,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 36 [2022-12-06 02:38:44,866 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:44,870 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:44,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:38:44,903 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-06 02:38:44,903 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 894 treesize of output 1 [2022-12-06 02:38:44,912 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:44,915 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:44,919 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:44,924 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:44,927 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:44,930 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:44,933 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:44,938 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:44,941 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:44,944 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:44,947 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:44,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:38:44,958 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-06 02:38:44,958 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 520 treesize of output 1 [2022-12-06 02:38:44,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:38:44,982 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-06 02:38:44,982 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 1880 treesize of output 1 [2022-12-06 02:38:44,988 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:44,994 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:44,998 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:45,003 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:45,007 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:45,011 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:45,017 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:45,023 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:45,027 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:45,034 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:45,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:38:45,043 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-06 02:38:45,043 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 1 [2022-12-06 02:38:45,048 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:45,052 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:45,055 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:45,058 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:45,063 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:45,068 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:45,073 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:45,076 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:45,079 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:45,083 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:45,087 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:45,109 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:45,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:38:45,154 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-06 02:38:45,155 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 2445 treesize of output 1 [2022-12-06 02:38:45,223 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:38:45,224 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 159 treesize of output 129 [2022-12-06 02:38:45,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:38:45,301 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-06 02:38:45,301 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 121 treesize of output 1 [2022-12-06 02:38:45,324 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:38:45,324 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 72 treesize of output 72 [2022-12-06 02:38:45,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:38:45,412 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-06 02:38:45,412 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 894 treesize of output 1 [2022-12-06 02:38:45,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:38:45,431 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-06 02:38:45,431 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 490 treesize of output 1 [2022-12-06 02:38:45,443 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:45,447 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:45,454 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:45,460 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:45,467 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:45,471 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:45,475 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:45,484 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:45,488 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:45,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:38:45,528 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-06 02:38:45,528 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 121 treesize of output 1 [2022-12-06 02:38:45,535 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:45,541 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:45,546 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:45,551 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:45,557 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:45,562 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:45,567 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:45,573 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:45,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:38:45,587 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-06 02:38:45,588 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 160 treesize of output 1 [2022-12-06 02:38:45,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:38:45,605 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-06 02:38:45,606 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 894 treesize of output 1 [2022-12-06 02:38:45,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:38:45,628 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:38:45,629 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 566 treesize of output 332 [2022-12-06 02:38:45,766 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:45,771 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:45,776 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:45,780 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:45,783 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:45,790 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:45,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:38:45,800 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-06 02:38:45,801 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 359 treesize of output 1 [2022-12-06 02:38:45,804 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:45,809 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:45,847 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:45,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:38:45,908 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-06 02:38:45,909 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 2615 treesize of output 1 [2022-12-06 02:38:45,921 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:45,925 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:45,928 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:45,933 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:45,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:38:45,946 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-06 02:38:45,946 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 490 treesize of output 1 [2022-12-06 02:38:45,950 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:45,954 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:45,961 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:45,964 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:45,967 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:45,971 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:45,977 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:45,983 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:45,986 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:46,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:38:46,023 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-06 02:38:46,024 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 2340 treesize of output 1 [2022-12-06 02:38:46,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:38:46,053 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-06 02:38:46,053 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 1880 treesize of output 1 [2022-12-06 02:38:46,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:38:46,099 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-06 02:38:46,099 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 2385 treesize of output 1 [2022-12-06 02:38:46,114 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:46,122 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:46,127 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:46,130 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:46,133 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:46,138 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:46,141 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:46,144 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:46,151 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:46,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:38:46,156 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 36 [2022-12-06 02:38:46,162 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:46,166 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-12-06 02:38:46,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:38:46,172 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 29 [2022-12-06 02:38:46,190 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 02:38:46,191 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-06 02:38:46,209 INFO L321 Elim1Store]: treesize reduction 21, result has 43.2 percent of original size [2022-12-06 02:38:46,209 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 262 treesize of output 165 [2022-12-06 02:38:46,215 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 122 [2022-12-06 02:38:46,470 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:38:46,471 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 45 treesize of output 64 [2022-12-06 02:38:46,531 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 1 not checked. [2022-12-06 02:38:46,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [308268585] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:38:46,531 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:38:46,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 31 [2022-12-06 02:38:46,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645008167] [2022-12-06 02:38:46,531 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:38:46,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-12-06 02:38:46,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:38:46,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-06 02:38:46,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=826, Unknown=2, NotChecked=118, Total=1056 [2022-12-06 02:38:46,532 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 28 [2022-12-06 02:38:46,532 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 555 transitions, 16659 flow. Second operand has 33 states, 32 states have (on average 2.0) internal successors, (64), 32 states have internal predecessors, (64), 0 states have call successors, (0), 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-06 02:38:46,532 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:38:46,532 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 28 [2022-12-06 02:38:46,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:38:48,467 INFO L130 PetriNetUnfolder]: 1891/2841 cut-off events. [2022-12-06 02:38:48,467 INFO L131 PetriNetUnfolder]: For 9222/9222 co-relation queries the response was YES. [2022-12-06 02:38:48,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43712 conditions, 2841 events. 1891/2841 cut-off events. For 9222/9222 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 12671 event pairs, 47 based on Foata normal form. 1/2223 useless extension candidates. Maximal degree in co-relation 34407. Up to 2329 conditions per place. [2022-12-06 02:38:48,506 INFO L137 encePairwiseOnDemand]: 8/28 looper letters, 378 selfloop transitions, 101 changer transitions 124/603 dead transitions. [2022-12-06 02:38:48,506 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 603 transitions, 19312 flow [2022-12-06 02:38:48,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-06 02:38:48,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-06 02:38:48,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 141 transitions. [2022-12-06 02:38:48,508 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.31473214285714285 [2022-12-06 02:38:48,508 INFO L294 CegarLoopForPetriNet]: 32 programPoint places, 116 predicate places. [2022-12-06 02:38:48,509 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:38:48,509 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 603 transitions, 19312 flow [2022-12-06 02:38:48,539 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 148 places, 603 transitions, 19312 flow [2022-12-06 02:38:48,539 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:38:48,542 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:38:48,543 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 35 [2022-12-06 02:38:48,543 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 603 transitions, 19312 flow [2022-12-06 02:38:48,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.0) internal successors, (64), 32 states have internal predecessors, (64), 0 states have call successors, (0), 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-06 02:38:48,543 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:38:48,543 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:38:48,566 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-06 02:38:48,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-06 02:38:48,767 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:38:48,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:38:48,767 INFO L85 PathProgramCache]: Analyzing trace with hash -536501696, now seen corresponding path program 9 times [2022-12-06 02:38:48,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:38:48,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250867717] [2022-12-06 02:38:48,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:38:48,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:38:48,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:38:49,575 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 02:38:49,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:38:49,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250867717] [2022-12-06 02:38:49,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250867717] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:38:49,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1900402035] [2022-12-06 02:38:49,576 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 02:38:49,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:38:49,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:38:49,577 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:38:49,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-06 02:38:49,735 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-06 02:38:49,736 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 02:38:49,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 90 conjunts are in the unsatisfiable core [2022-12-06 02:38:49,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:38:49,773 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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-06 02:38:49,817 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-06 02:38:49,817 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-06 02:38:49,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 02:38:49,985 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-06 02:38:50,084 INFO L321 Elim1Store]: treesize reduction 27, result has 35.7 percent of original size [2022-12-06 02:38:50,085 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 38 [2022-12-06 02:38:50,235 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:38:50,235 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 102 treesize of output 106 [2022-12-06 02:38:50,322 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 02:38:50,322 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:38:50,632 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((~C~0.offset Int) (v_ArrVal_882 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_882))) (let ((.cse0 (select (select .cse2 c_~B~0.base) c_~B~0.offset)) (.cse1 (select (select .cse2 c_~A~0.base) c_~A~0.offset))) (<= (+ .cse0 c_~csum~0 .cse1) (+ c_~asum~0 c_~bsum~0 (select (select (store .cse2 c_~C~0.base (store (select .cse2 c_~C~0.base) ~C~0.offset (+ .cse0 .cse1))) c_~B~0.base) c_~B~0.offset)))))) (forall ((~C~0.offset Int) (v_ArrVal_882 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_882))) (let ((.cse4 (select (select .cse3 c_~B~0.base) c_~B~0.offset)) (.cse5 (select (select .cse3 c_~A~0.base) c_~A~0.offset))) (<= (+ c_~asum~0 c_~bsum~0 (select (select (store .cse3 c_~C~0.base (store (select .cse3 c_~C~0.base) ~C~0.offset (+ .cse4 .cse5))) c_~B~0.base) c_~B~0.offset)) (+ .cse4 c_~csum~0 .cse5)))))) is different from false [2022-12-06 02:38:50,661 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:38:50,661 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 1756 treesize of output 1554 [2022-12-06 02:38:50,678 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:38:50,678 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1664 treesize of output 1566 Received shutdown request... [2022-12-06 02:42:54,745 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-06 02:42:54,746 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 02:42:54,748 WARN L249 SmtUtils]: Removed 1 from assertion stack [2022-12-06 02:42:54,750 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-06 02:42:54,758 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-12-06 02:42:54,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-06 02:42:54,956 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 29 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. [2022-12-06 02:42:54,957 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-06 02:42:54,957 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-06 02:42:54,958 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-06 02:42:54,958 INFO L458 BasicCegarLoop]: Path program histogram: [9, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:42:54,960 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 02:42:54,960 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 02:42:54,962 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 02:42:54 BasicIcfg [2022-12-06 02:42:54,962 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 02:42:54,962 INFO L158 Benchmark]: Toolchain (without parser) took 835755.47ms. Allocated memory was 226.5MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 203.0MB in the beginning and 1.3GB in the end (delta: -1.1GB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2022-12-06 02:42:54,962 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 226.5MB. Free memory is still 203.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 02:42:54,962 INFO L158 Benchmark]: CACSL2BoogieTranslator took 239.57ms. Allocated memory is still 226.5MB. Free memory was 203.0MB in the beginning and 191.1MB in the end (delta: 11.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-06 02:42:54,963 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.08ms. Allocated memory is still 226.5MB. Free memory was 191.1MB in the beginning and 188.7MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 02:42:54,963 INFO L158 Benchmark]: Boogie Preprocessor took 46.03ms. Allocated memory is still 226.5MB. Free memory was 188.3MB in the beginning and 186.6MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 02:42:54,963 INFO L158 Benchmark]: RCFGBuilder took 537.88ms. Allocated memory is still 226.5MB. Free memory was 186.2MB in the beginning and 162.1MB in the end (delta: 24.1MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2022-12-06 02:42:54,963 INFO L158 Benchmark]: TraceAbstraction took 834887.41ms. Allocated memory was 226.5MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 161.5MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. [2022-12-06 02:42:54,964 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.10ms. Allocated memory is still 226.5MB. Free memory is still 203.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 239.57ms. Allocated memory is still 226.5MB. Free memory was 203.0MB in the beginning and 191.1MB in the end (delta: 11.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 39.08ms. Allocated memory is still 226.5MB. Free memory was 191.1MB in the beginning and 188.7MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 46.03ms. Allocated memory is still 226.5MB. Free memory was 188.3MB in the beginning and 186.6MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 537.88ms. Allocated memory is still 226.5MB. Free memory was 186.2MB in the beginning and 162.1MB in the end (delta: 24.1MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * TraceAbstraction took 834887.41ms. Allocated memory was 226.5MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 161.5MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.4s, 285 PlacesBefore, 32 PlacesAfterwards, 304 TransitionsBefore, 28 TransitionsAfterwards, 12810 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 136 TrivialYvCompositions, 117 ConcurrentYvCompositions, 23 ChoiceCompositions, 276 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7793, independent: 7778, independent conditional: 7778, independent unconditional: 0, dependent: 15, dependent conditional: 15, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7793, independent: 7778, independent conditional: 0, independent unconditional: 7778, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7793, independent: 7778, independent conditional: 0, independent unconditional: 7778, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7793, independent: 7778, independent conditional: 0, independent unconditional: 7778, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7151, independent: 7138, independent conditional: 0, independent unconditional: 7138, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7151, independent: 7133, independent conditional: 0, independent unconditional: 7133, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 18, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 23, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 7793, independent: 640, independent conditional: 0, independent unconditional: 640, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 7151, unknown conditional: 0, unknown unconditional: 7151] , Statistics on independence cache: Total cache size (in pairs): 14092, Positive cache size: 14079, Positive conditional cache size: 0, Positive unconditional cache size: 14079, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, 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, 44 TransitionsBefore, 44 TransitionsAfterwards, 110 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, 105 TransitionsBefore, 105 TransitionsAfterwards, 170 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, 128 TransitionsBefore, 128 TransitionsAfterwards, 72 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, 103 TransitionsBefore, 103 TransitionsAfterwards, 12 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, 50 PlacesBefore, 50 PlacesAfterwards, 148 TransitionsBefore, 148 TransitionsAfterwards, 16 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, 54 PlacesBefore, 54 PlacesAfterwards, 169 TransitionsBefore, 169 TransitionsAfterwards, 18 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, 58 PlacesBefore, 58 PlacesAfterwards, 192 TransitionsBefore, 192 TransitionsAfterwards, 18 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, 70 PlacesBefore, 70 PlacesAfterwards, 321 TransitionsBefore, 321 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, 84 PlacesBefore, 84 PlacesAfterwards, 369 TransitionsBefore, 369 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, 94 PlacesBefore, 94 PlacesAfterwards, 389 TransitionsBefore, 389 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, 102 PlacesBefore, 102 PlacesAfterwards, 411 TransitionsBefore, 411 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, 116 PlacesBefore, 116 PlacesAfterwards, 447 TransitionsBefore, 447 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, 124 PlacesBefore, 124 PlacesAfterwards, 469 TransitionsBefore, 469 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, 133 PlacesBefore, 133 PlacesAfterwards, 555 TransitionsBefore, 555 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, 148 PlacesBefore, 148 PlacesAfterwards, 603 TransitionsBefore, 603 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: 91]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNetWithRepeatedLiptonReduction was analyzing trace of length 29 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 83]: 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 29 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 84]: 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 29 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 85]: 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 29 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 406 locations, 4 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: 834.8s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 9, EmptinessCheckTime: 0.0s, AutomataDifference: 9.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2037 SdHoareTripleChecker+Valid, 4.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2037 mSDsluCounter, 565 SdHoareTripleChecker+Invalid, 3.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 246 IncrementalHoareTripleChecker+Unchecked, 489 mSDsCounter, 174 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7117 IncrementalHoareTripleChecker+Invalid, 7537 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 174 mSolverCounterUnsat, 76 mSDtfsCounter, 7117 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 762 GetRequests, 467 SyntacticMatches, 28 SemanticMatches, 267 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 1831 ImplicationChecksByTransitivity, 12.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19312occurred in iteration=15, InterpolantAutomatonStates: 131, 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.2s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 564.1s InterpolantComputationTime, 697 NumberOfCodeBlocks, 697 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 963 ConstructedInterpolants, 44 QuantifiedInterpolants, 16722 SizeOfPredicates, 226 NumberOfNonLiveVariables, 3953 ConjunctsInSsa, 670 ConjunctsInUnsatCore, 37 InterpolantComputations, 7 PerfectInterpolantSequences, 103/186 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