/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-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-three-array-min.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 05:42:06,755 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 05:42:06,757 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 05:42:06,804 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 05:42:06,804 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 05:42:06,806 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 05:42:06,809 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 05:42:06,813 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 05:42:06,820 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 05:42:06,820 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 05:42:06,821 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 05:42:06,829 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 05:42:06,829 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 05:42:06,830 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 05:42:06,831 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 05:42:06,832 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 05:42:06,832 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 05:42:06,833 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 05:42:06,834 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 05:42:06,835 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 05:42:06,836 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 05:42:06,837 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 05:42:06,838 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 05:42:06,839 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 05:42:06,841 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 05:42:06,842 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 05:42:06,842 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 05:42:06,842 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 05:42:06,843 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 05:42:06,843 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 05:42:06,844 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 05:42:06,844 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 05:42:06,845 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 05:42:06,845 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 05:42:06,846 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 05:42:06,846 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 05:42:06,847 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 05:42:06,847 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 05:42:06,852 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 05:42:06,854 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 05:42:06,854 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 05:42:06,855 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-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 05:42:06,883 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 05:42:06,883 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 05:42:06,885 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 05:42:06,885 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 05:42:06,885 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 05:42:06,886 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 05:42:06,886 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 05:42:06,886 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 05:42:06,886 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 05:42:06,886 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 05:42:06,887 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 05:42:06,887 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 05:42:06,887 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 05:42:06,888 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 05:42:06,888 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 05:42:06,888 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 05:42:06,888 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 05:42:06,888 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 05:42:06,888 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 05:42:06,888 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 05:42:06,888 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 05:42:06,889 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:42:06,889 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 05:42:06,889 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 05:42:06,889 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 05:42:06,889 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 05:42:06,889 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 05:42:06,889 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 05:42:06,890 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 [2022-12-06 05:42:07,230 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 05:42:07,247 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 05:42:07,249 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 05:42:07,250 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 05:42:07,250 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 05:42:07,257 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-three-array-min.wvr.c [2022-12-06 05:42:08,347 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 05:42:08,532 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 05:42:08,533 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-three-array-min.wvr.c [2022-12-06 05:42:08,544 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e57eb44e3/68162ed096af4e67b62fa37871474239/FLAGb01c9508f [2022-12-06 05:42:08,556 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e57eb44e3/68162ed096af4e67b62fa37871474239 [2022-12-06 05:42:08,558 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 05:42:08,559 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 05:42:08,559 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 05:42:08,560 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 05:42:08,561 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 05:42:08,562 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:42:08" (1/1) ... [2022-12-06 05:42:08,562 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5258d7d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:42:08, skipping insertion in model container [2022-12-06 05:42:08,562 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:42:08" (1/1) ... [2022-12-06 05:42:08,568 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 05:42:08,584 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 05:42:08,716 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:42:08,718 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:42:08,719 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:42:08,724 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:42:08,725 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:42:08,726 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:42:08,737 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-three-array-min.wvr.c[2815,2828] [2022-12-06 05:42:08,754 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:42:08,762 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 05:42:08,779 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:42:08,780 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:42:08,781 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:42:08,785 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:42:08,786 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:42:08,787 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:42:08,800 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-three-array-min.wvr.c[2815,2828] [2022-12-06 05:42:08,802 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:42:08,813 INFO L208 MainTranslator]: Completed translation [2022-12-06 05:42:08,813 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:42:08 WrapperNode [2022-12-06 05:42:08,813 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 05:42:08,814 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 05:42:08,814 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 05:42:08,814 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 05:42:08,819 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:42:08" (1/1) ... [2022-12-06 05:42:08,836 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:42:08" (1/1) ... [2022-12-06 05:42:08,864 INFO L138 Inliner]: procedures = 26, calls = 57, calls flagged for inlining = 14, calls inlined = 22, statements flattened = 232 [2022-12-06 05:42:08,865 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 05:42:08,866 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 05:42:08,866 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 05:42:08,866 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 05:42:08,872 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:42:08" (1/1) ... [2022-12-06 05:42:08,872 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:42:08" (1/1) ... [2022-12-06 05:42:08,885 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:42:08" (1/1) ... [2022-12-06 05:42:08,886 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:42:08" (1/1) ... [2022-12-06 05:42:08,895 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:42:08" (1/1) ... [2022-12-06 05:42:08,898 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:42:08" (1/1) ... [2022-12-06 05:42:08,900 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:42:08" (1/1) ... [2022-12-06 05:42:08,901 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:42:08" (1/1) ... [2022-12-06 05:42:08,903 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 05:42:08,912 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 05:42:08,913 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 05:42:08,913 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 05:42:08,913 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:42:08" (1/1) ... [2022-12-06 05:42:08,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:42:08,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:42:08,948 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 05:42:08,969 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 05:42:08,984 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 05:42:08,984 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 05:42:08,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 05:42:08,984 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 05:42:08,984 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 05:42:08,984 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 05:42:08,984 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 05:42:08,984 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 05:42:08,984 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 05:42:08,985 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 05:42:08,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 05:42:08,985 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 05:42:08,985 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 05:42:08,985 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 05:42:08,985 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 05:42:08,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 05:42:08,985 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 05:42:08,986 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 05:42:09,116 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 05:42:09,117 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 05:42:09,455 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 05:42:09,529 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 05:42:09,529 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2022-12-06 05:42:09,531 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:42:09 BoogieIcfgContainer [2022-12-06 05:42:09,531 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 05:42:09,533 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 05:42:09,533 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 05:42:09,535 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 05:42:09,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 05:42:08" (1/3) ... [2022-12-06 05:42:09,535 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a069744 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:42:09, skipping insertion in model container [2022-12-06 05:42:09,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:42:08" (2/3) ... [2022-12-06 05:42:09,536 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a069744 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:42:09, skipping insertion in model container [2022-12-06 05:42:09,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:42:09" (3/3) ... [2022-12-06 05:42:09,537 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-three-array-min.wvr.c [2022-12-06 05:42:09,549 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 05:42:09,550 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 05:42:09,550 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 05:42:09,684 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-06 05:42:09,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 263 places, 280 transitions, 584 flow [2022-12-06 05:42:09,882 INFO L130 PetriNetUnfolder]: 27/277 cut-off events. [2022-12-06 05:42:09,883 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 05:42:09,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 290 conditions, 277 events. 27/277 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 211 event pairs, 0 based on Foata normal form. 0/249 useless extension candidates. Maximal degree in co-relation 218. Up to 3 conditions per place. [2022-12-06 05:42:09,891 INFO L82 GeneralOperation]: Start removeDead. Operand has 263 places, 280 transitions, 584 flow [2022-12-06 05:42:09,902 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 250 places, 267 transitions, 552 flow [2022-12-06 05:42:09,904 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:42:09,924 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 250 places, 267 transitions, 552 flow [2022-12-06 05:42:09,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 250 places, 267 transitions, 552 flow [2022-12-06 05:42:10,032 INFO L130 PetriNetUnfolder]: 27/267 cut-off events. [2022-12-06 05:42:10,043 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 05:42:10,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 280 conditions, 267 events. 27/267 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 210 event pairs, 0 based on Foata normal form. 0/240 useless extension candidates. Maximal degree in co-relation 218. Up to 3 conditions per place. [2022-12-06 05:42:10,050 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 250 places, 267 transitions, 552 flow [2022-12-06 05:42:10,050 INFO L188 LiptonReduction]: Number of co-enabled transitions 2634 [2022-12-06 05:42:18,575 INFO L203 LiptonReduction]: Total number of compositions: 233 [2022-12-06 05:42:18,586 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 05:42:18,591 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;@55d813cd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 05:42:18,591 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 05:42:18,615 INFO L130 PetriNetUnfolder]: 9/34 cut-off events. [2022-12-06 05:42:18,616 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 05:42:18,616 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:42:18,616 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 05:42:18,617 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 05:42:18,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:42:18,620 INFO L85 PathProgramCache]: Analyzing trace with hash 2088592140, now seen corresponding path program 1 times [2022-12-06 05:42:18,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:42:18,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202071744] [2022-12-06 05:42:18,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:42:18,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:42:18,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:42:19,034 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 05:42:19,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:42:19,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202071744] [2022-12-06 05:42:19,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202071744] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:42:19,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:42:19,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 05:42:19,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419221113] [2022-12-06 05:42:19,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:42:19,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:42:19,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:42:19,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:42:19,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:42:19,060 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 35 [2022-12-06 05:42:19,061 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 35 transitions, 88 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 05:42:19,061 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:42:19,061 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 35 [2022-12-06 05:42:19,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:42:19,205 INFO L130 PetriNetUnfolder]: 747/978 cut-off events. [2022-12-06 05:42:19,206 INFO L131 PetriNetUnfolder]: For 35/35 co-relation queries the response was YES. [2022-12-06 05:42:19,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2011 conditions, 978 events. 747/978 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 3223 event pairs, 313 based on Foata normal form. 0/547 useless extension candidates. Maximal degree in co-relation 1725. Up to 961 conditions per place. [2022-12-06 05:42:19,213 INFO L137 encePairwiseOnDemand]: 32/35 looper letters, 31 selfloop transitions, 2 changer transitions 0/36 dead transitions. [2022-12-06 05:42:19,213 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 36 transitions, 156 flow [2022-12-06 05:42:19,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:42:19,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:42:19,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2022-12-06 05:42:19,222 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4095238095238095 [2022-12-06 05:42:19,223 INFO L175 Difference]: Start difference. First operand has 36 places, 35 transitions, 88 flow. Second operand 3 states and 43 transitions. [2022-12-06 05:42:19,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 36 transitions, 156 flow [2022-12-06 05:42:19,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 36 transitions, 144 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-12-06 05:42:19,229 INFO L231 Difference]: Finished difference. Result has 33 places, 36 transitions, 88 flow [2022-12-06 05:42:19,230 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=33, PETRI_TRANSITIONS=36} [2022-12-06 05:42:19,233 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, -3 predicate places. [2022-12-06 05:42:19,234 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:42:19,235 INFO L89 Accepts]: Start accepts. Operand has 33 places, 36 transitions, 88 flow [2022-12-06 05:42:19,237 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:42:19,237 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:42:19,237 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 36 transitions, 88 flow [2022-12-06 05:42:19,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 36 transitions, 88 flow [2022-12-06 05:42:19,251 INFO L130 PetriNetUnfolder]: 9/36 cut-off events. [2022-12-06 05:42:19,251 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 05:42:19,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 36 events. 9/36 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 37 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 39. Up to 4 conditions per place. [2022-12-06 05:42:19,252 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 36 transitions, 88 flow [2022-12-06 05:42:19,252 INFO L188 LiptonReduction]: Number of co-enabled transitions 318 [2022-12-06 05:42:20,098 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:42:20,099 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 865 [2022-12-06 05:42:20,099 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 35 transitions, 84 flow [2022-12-06 05:42:20,099 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 05:42:20,099 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:42:20,099 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 05:42:20,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 05:42:20,100 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 05:42:20,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:42:20,100 INFO L85 PathProgramCache]: Analyzing trace with hash 280411706, now seen corresponding path program 1 times [2022-12-06 05:42:20,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:42:20,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677788903] [2022-12-06 05:42:20,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:42:20,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:42:20,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:42:20,275 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 05:42:20,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:42:20,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677788903] [2022-12-06 05:42:20,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677788903] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:42:20,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:42:20,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:42:20,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535162915] [2022-12-06 05:42:20,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:42:20,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:42:20,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:42:20,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:42:20,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:42:20,278 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 35 [2022-12-06 05:42:20,278 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 35 transitions, 84 flow. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 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 05:42:20,278 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:42:20,278 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 35 [2022-12-06 05:42:20,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:42:20,424 INFO L130 PetriNetUnfolder]: 747/979 cut-off events. [2022-12-06 05:42:20,424 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 05:42:20,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1974 conditions, 979 events. 747/979 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 3240 event pairs, 313 based on Foata normal form. 0/548 useless extension candidates. Maximal degree in co-relation 1966. Up to 960 conditions per place. [2022-12-06 05:42:20,430 INFO L137 encePairwiseOnDemand]: 29/35 looper letters, 29 selfloop transitions, 5 changer transitions 0/37 dead transitions. [2022-12-06 05:42:20,430 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 37 transitions, 156 flow [2022-12-06 05:42:20,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:42:20,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:42:20,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-12-06 05:42:20,434 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.34285714285714286 [2022-12-06 05:42:20,435 INFO L175 Difference]: Start difference. First operand has 32 places, 35 transitions, 84 flow. Second operand 4 states and 48 transitions. [2022-12-06 05:42:20,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 37 transitions, 156 flow [2022-12-06 05:42:20,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 37 transitions, 148 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-06 05:42:20,437 INFO L231 Difference]: Finished difference. Result has 34 places, 37 transitions, 100 flow [2022-12-06 05:42:20,437 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=100, PETRI_PLACES=34, PETRI_TRANSITIONS=37} [2022-12-06 05:42:20,437 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, -2 predicate places. [2022-12-06 05:42:20,438 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:42:20,438 INFO L89 Accepts]: Start accepts. Operand has 34 places, 37 transitions, 100 flow [2022-12-06 05:42:20,439 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:42:20,439 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:42:20,440 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 37 transitions, 100 flow [2022-12-06 05:42:20,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 37 transitions, 100 flow [2022-12-06 05:42:20,446 INFO L130 PetriNetUnfolder]: 9/37 cut-off events. [2022-12-06 05:42:20,446 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 05:42:20,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 37 events. 9/37 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 37 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 35. Up to 6 conditions per place. [2022-12-06 05:42:20,447 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 37 transitions, 100 flow [2022-12-06 05:42:20,447 INFO L188 LiptonReduction]: Number of co-enabled transitions 318 [2022-12-06 05:42:20,448 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:42:20,450 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-06 05:42:20,450 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 37 transitions, 100 flow [2022-12-06 05:42:20,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 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 05:42:20,451 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:42:20,451 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] [2022-12-06 05:42:20,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 05:42:20,451 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 05:42:20,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:42:20,452 INFO L85 PathProgramCache]: Analyzing trace with hash 384575888, now seen corresponding path program 1 times [2022-12-06 05:42:20,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:42:20,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216999234] [2022-12-06 05:42:20,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:42:20,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:42:20,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:42:20,777 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 05:42:20,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:42:20,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216999234] [2022-12-06 05:42:20,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216999234] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:42:20,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:42:20,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 05:42:20,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2518638] [2022-12-06 05:42:20,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:42:20,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:42:20,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:42:20,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:42:20,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:42:20,781 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 35 [2022-12-06 05:42:20,782 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 37 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 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 05:42:20,782 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:42:20,782 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 35 [2022-12-06 05:42:20,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:42:21,018 INFO L130 PetriNetUnfolder]: 1502/1945 cut-off events. [2022-12-06 05:42:21,019 INFO L131 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2022-12-06 05:42:21,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3932 conditions, 1945 events. 1502/1945 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 7171 event pairs, 321 based on Foata normal form. 1/1093 useless extension candidates. Maximal degree in co-relation 3906. Up to 1071 conditions per place. [2022-12-06 05:42:21,032 INFO L137 encePairwiseOnDemand]: 30/35 looper letters, 52 selfloop transitions, 4 changer transitions 1/60 dead transitions. [2022-12-06 05:42:21,032 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 60 transitions, 265 flow [2022-12-06 05:42:21,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:42:21,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:42:21,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2022-12-06 05:42:21,035 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6190476190476191 [2022-12-06 05:42:21,036 INFO L175 Difference]: Start difference. First operand has 34 places, 37 transitions, 100 flow. Second operand 3 states and 65 transitions. [2022-12-06 05:42:21,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 60 transitions, 265 flow [2022-12-06 05:42:21,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 60 transitions, 264 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 05:42:21,038 INFO L231 Difference]: Finished difference. Result has 36 places, 40 transitions, 125 flow [2022-12-06 05:42:21,038 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=125, PETRI_PLACES=36, PETRI_TRANSITIONS=40} [2022-12-06 05:42:21,039 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 0 predicate places. [2022-12-06 05:42:21,040 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:42:21,040 INFO L89 Accepts]: Start accepts. Operand has 36 places, 40 transitions, 125 flow [2022-12-06 05:42:21,042 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:42:21,042 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:42:21,042 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 40 transitions, 125 flow [2022-12-06 05:42:21,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 40 transitions, 125 flow [2022-12-06 05:42:21,047 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([809] thread3EXIT-->L111-2: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork1_thidvar0_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4)) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][38], [Black: 273#(and (<= 1 ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 277#(<= (+ ~minb~0 ~mina~0) ~minc~0), 275#true, 272#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0)), 89#L111-2true]) [2022-12-06 05:42:21,047 INFO L382 tUnfolder$Statistics]: this new event has 28 ancestors and is cut-off event [2022-12-06 05:42:21,047 INFO L385 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2022-12-06 05:42:21,047 INFO L385 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-06 05:42:21,047 INFO L385 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-06 05:42:21,048 INFO L130 PetriNetUnfolder]: 23/74 cut-off events. [2022-12-06 05:42:21,048 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 05:42:21,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 74 events. 23/74 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 158 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 90. Up to 16 conditions per place. [2022-12-06 05:42:21,049 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 40 transitions, 125 flow [2022-12-06 05:42:21,049 INFO L188 LiptonReduction]: Number of co-enabled transitions 390 [2022-12-06 05:42:21,051 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:42:21,052 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 12 [2022-12-06 05:42:21,052 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 40 transitions, 125 flow [2022-12-06 05:42:21,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 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 05:42:21,052 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:42:21,052 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 05:42:21,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 05:42:21,052 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 05:42:21,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:42:21,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1650078592, now seen corresponding path program 1 times [2022-12-06 05:42:21,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:42:21,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948560424] [2022-12-06 05:42:21,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:42:21,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:42:21,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:42:21,203 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 05:42:21,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:42:21,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948560424] [2022-12-06 05:42:21,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948560424] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:42:21,204 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:42:21,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:42:21,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837619560] [2022-12-06 05:42:21,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:42:21,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:42:21,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:42:21,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:42:21,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:42:21,206 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 35 [2022-12-06 05:42:21,206 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 40 transitions, 125 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 05:42:21,206 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:42:21,206 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 35 [2022-12-06 05:42:21,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:42:21,542 INFO L130 PetriNetUnfolder]: 2299/3085 cut-off events. [2022-12-06 05:42:21,542 INFO L131 PetriNetUnfolder]: For 240/240 co-relation queries the response was YES. [2022-12-06 05:42:21,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6753 conditions, 3085 events. 2299/3085 cut-off events. For 240/240 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 13324 event pairs, 890 based on Foata normal form. 0/1956 useless extension candidates. Maximal degree in co-relation 4049. Up to 1843 conditions per place. [2022-12-06 05:42:21,558 INFO L137 encePairwiseOnDemand]: 26/35 looper letters, 79 selfloop transitions, 8 changer transitions 0/89 dead transitions. [2022-12-06 05:42:21,559 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 89 transitions, 445 flow [2022-12-06 05:42:21,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:42:21,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:42:21,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 90 transitions. [2022-12-06 05:42:21,560 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2022-12-06 05:42:21,560 INFO L175 Difference]: Start difference. First operand has 36 places, 40 transitions, 125 flow. Second operand 5 states and 90 transitions. [2022-12-06 05:42:21,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 89 transitions, 445 flow [2022-12-06 05:42:21,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 89 transitions, 437 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 05:42:21,562 INFO L231 Difference]: Finished difference. Result has 43 places, 46 transitions, 191 flow [2022-12-06 05:42:21,562 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=191, PETRI_PLACES=43, PETRI_TRANSITIONS=46} [2022-12-06 05:42:21,563 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 7 predicate places. [2022-12-06 05:42:21,563 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:42:21,563 INFO L89 Accepts]: Start accepts. Operand has 43 places, 46 transitions, 191 flow [2022-12-06 05:42:21,564 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:42:21,564 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:42:21,564 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 46 transitions, 191 flow [2022-12-06 05:42:21,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 46 transitions, 191 flow [2022-12-06 05:42:21,573 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([809] thread3EXIT-->L111-2: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork1_thidvar0_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4)) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][44], [Black: 281#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0)), Black: 285#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= ~N~0 1)), Black: 273#(and (<= 1 ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 287#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= ~N~0 1) (= thread3Thread1of1ForFork1_~i~2 1)), Black: 277#(<= (+ ~minb~0 ~mina~0) ~minc~0), 279#true, 272#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0)), 89#L111-2true]) [2022-12-06 05:42:21,573 INFO L382 tUnfolder$Statistics]: this new event has 29 ancestors and is cut-off event [2022-12-06 05:42:21,573 INFO L385 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-12-06 05:42:21,574 INFO L385 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2022-12-06 05:42:21,574 INFO L385 tUnfolder$Statistics]: existing Event has 26 ancestors and is cut-off event [2022-12-06 05:42:21,576 INFO L130 PetriNetUnfolder]: 31/119 cut-off events. [2022-12-06 05:42:21,576 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 05:42:21,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 119 events. 31/119 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 369 event pairs, 0 based on Foata normal form. 0/96 useless extension candidates. Maximal degree in co-relation 138. Up to 21 conditions per place. [2022-12-06 05:42:21,578 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 46 transitions, 191 flow [2022-12-06 05:42:21,578 INFO L188 LiptonReduction]: Number of co-enabled transitions 426 [2022-12-06 05:42:21,579 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:42:21,580 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-06 05:42:21,580 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 46 transitions, 191 flow [2022-12-06 05:42:21,580 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 05:42:21,580 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:42:21,580 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 05:42:21,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 05:42:21,580 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 05:42:21,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:42:21,581 INFO L85 PathProgramCache]: Analyzing trace with hash 830845230, now seen corresponding path program 1 times [2022-12-06 05:42:21,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:42:21,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36660721] [2022-12-06 05:42:21,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:42:21,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:42:21,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:42:21,706 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 05:42:21,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:42:21,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36660721] [2022-12-06 05:42:21,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36660721] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:42:21,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [76354865] [2022-12-06 05:42:21,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:42:21,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:42:21,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:42:21,709 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 05:42:21,746 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 05:42:21,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:42:21,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-06 05:42:21,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:42:21,909 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 05:42:21,909 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:42:21,972 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 05:42:21,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [76354865] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:42:21,973 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:42:21,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2022-12-06 05:42:21,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085526002] [2022-12-06 05:42:21,973 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:42:21,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 05:42:21,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:42:21,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 05:42:21,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2022-12-06 05:42:21,974 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 35 [2022-12-06 05:42:21,975 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 46 transitions, 191 flow. Second operand has 13 states, 13 states have (on average 5.615384615384615) internal successors, (73), 13 states have internal predecessors, (73), 0 states have call successors, (0), 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 05:42:21,975 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:42:21,975 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 35 [2022-12-06 05:42:21,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:42:22,405 INFO L130 PetriNetUnfolder]: 1989/2717 cut-off events. [2022-12-06 05:42:22,405 INFO L131 PetriNetUnfolder]: For 319/357 co-relation queries the response was YES. [2022-12-06 05:42:22,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6117 conditions, 2717 events. 1989/2717 cut-off events. For 319/357 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 11657 event pairs, 982 based on Foata normal form. 39/1746 useless extension candidates. Maximal degree in co-relation 4072. Up to 1754 conditions per place. [2022-12-06 05:42:22,421 INFO L137 encePairwiseOnDemand]: 28/35 looper letters, 61 selfloop transitions, 10 changer transitions 0/75 dead transitions. [2022-12-06 05:42:22,421 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 75 transitions, 417 flow [2022-12-06 05:42:22,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:42:22,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:42:22,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 87 transitions. [2022-12-06 05:42:22,423 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3551020408163265 [2022-12-06 05:42:22,423 INFO L175 Difference]: Start difference. First operand has 43 places, 46 transitions, 191 flow. Second operand 7 states and 87 transitions. [2022-12-06 05:42:22,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 75 transitions, 417 flow [2022-12-06 05:42:22,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 75 transitions, 417 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-06 05:42:22,429 INFO L231 Difference]: Finished difference. Result has 51 places, 49 transitions, 238 flow [2022-12-06 05:42:22,429 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=238, PETRI_PLACES=51, PETRI_TRANSITIONS=49} [2022-12-06 05:42:22,429 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 15 predicate places. [2022-12-06 05:42:22,430 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:42:22,430 INFO L89 Accepts]: Start accepts. Operand has 51 places, 49 transitions, 238 flow [2022-12-06 05:42:22,431 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:42:22,431 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:42:22,431 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 49 transitions, 238 flow [2022-12-06 05:42:22,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 51 places, 49 transitions, 238 flow [2022-12-06 05:42:22,442 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([809] thread3EXIT-->L111-2: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork1_thidvar0_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4)) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][47], [Black: 281#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0)), Black: 292#true, Black: 285#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= ~N~0 1)), Black: 273#(and (<= 1 ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 464#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= 2 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= 1 |ULTIMATE.start_create_fresh_int_array_~i~3#1|)), Black: 287#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= ~N~0 1) (= thread3Thread1of1ForFork1_~i~2 1)), 462#(and (<= 2 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= 1 |ULTIMATE.start_create_fresh_int_array_~i~3#1|)), Black: 277#(<= (+ ~minb~0 ~mina~0) ~minc~0), 279#true, 272#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0)), 89#L111-2true]) [2022-12-06 05:42:22,442 INFO L382 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2022-12-06 05:42:22,442 INFO L385 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2022-12-06 05:42:22,442 INFO L385 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-12-06 05:42:22,442 INFO L385 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-06 05:42:22,442 INFO L130 PetriNetUnfolder]: 31/121 cut-off events. [2022-12-06 05:42:22,442 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-06 05:42:22,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 225 conditions, 121 events. 31/121 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 369 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 162. Up to 21 conditions per place. [2022-12-06 05:42:22,444 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 49 transitions, 238 flow [2022-12-06 05:42:22,444 INFO L188 LiptonReduction]: Number of co-enabled transitions 426 [2022-12-06 05:42:25,891 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:42:25,892 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3462 [2022-12-06 05:42:25,892 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 49 transitions, 244 flow [2022-12-06 05:42:25,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.615384615384615) internal successors, (73), 13 states have internal predecessors, (73), 0 states have call successors, (0), 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 05:42:25,892 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:42:25,892 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 05:42:25,903 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 05:42:26,093 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 05:42:26,093 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 05:42:26,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:42:26,094 INFO L85 PathProgramCache]: Analyzing trace with hash 587995441, now seen corresponding path program 1 times [2022-12-06 05:42:26,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:42:26,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379311251] [2022-12-06 05:42:26,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:42:26,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:42:26,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:42:26,165 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 05:42:26,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:42:26,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379311251] [2022-12-06 05:42:26,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379311251] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:42:26,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:42:26,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:42:26,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511187701] [2022-12-06 05:42:26,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:42:26,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:42:26,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:42:26,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:42:26,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:42:26,167 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 37 [2022-12-06 05:42:26,167 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 49 transitions, 244 flow. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 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 05:42:26,167 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:42:26,167 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 37 [2022-12-06 05:42:26,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:42:26,346 INFO L130 PetriNetUnfolder]: 1409/1939 cut-off events. [2022-12-06 05:42:26,346 INFO L131 PetriNetUnfolder]: For 220/240 co-relation queries the response was YES. [2022-12-06 05:42:26,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4458 conditions, 1939 events. 1409/1939 cut-off events. For 220/240 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 7657 event pairs, 654 based on Foata normal form. 20/1320 useless extension candidates. Maximal degree in co-relation 3919. Up to 1685 conditions per place. [2022-12-06 05:42:26,355 INFO L137 encePairwiseOnDemand]: 33/37 looper letters, 40 selfloop transitions, 0 changer transitions 33/75 dead transitions. [2022-12-06 05:42:26,355 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 75 transitions, 456 flow [2022-12-06 05:42:26,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:42:26,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:42:26,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2022-12-06 05:42:26,357 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.49324324324324326 [2022-12-06 05:42:26,357 INFO L175 Difference]: Start difference. First operand has 51 places, 49 transitions, 244 flow. Second operand 4 states and 73 transitions. [2022-12-06 05:42:26,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 75 transitions, 456 flow [2022-12-06 05:42:26,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 75 transitions, 433 flow, removed 6 selfloop flow, removed 2 redundant places. [2022-12-06 05:42:26,361 INFO L231 Difference]: Finished difference. Result has 54 places, 42 transitions, 174 flow [2022-12-06 05:42:26,361 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=221, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=174, PETRI_PLACES=54, PETRI_TRANSITIONS=42} [2022-12-06 05:42:26,363 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 18 predicate places. [2022-12-06 05:42:26,363 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:42:26,363 INFO L89 Accepts]: Start accepts. Operand has 54 places, 42 transitions, 174 flow [2022-12-06 05:42:26,365 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:42:26,365 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:42:26,365 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 42 transitions, 174 flow [2022-12-06 05:42:26,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 42 transitions, 174 flow [2022-12-06 05:42:26,369 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([809] thread3EXIT-->L111-2: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork1_thidvar0_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4)) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][40], [Black: 281#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0)), Black: 292#true, Black: 273#(and (<= 1 ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 285#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= ~N~0 1)), Black: 464#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= 2 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= 1 |ULTIMATE.start_create_fresh_int_array_~i~3#1|)), Black: 287#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= ~N~0 1) (= thread3Thread1of1ForFork1_~i~2 1)), 462#(and (<= 2 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= 1 |ULTIMATE.start_create_fresh_int_array_~i~3#1|)), Black: 277#(<= (+ ~minb~0 ~mina~0) ~minc~0), Black: 470#(<= ~N~0 1), Black: 471#(and (= thread1Thread1of1ForFork2_~i~0 1) (<= ~N~0 1)), 272#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0)), 89#L111-2true]) [2022-12-06 05:42:26,369 INFO L382 tUnfolder$Statistics]: this new event has 30 ancestors and is cut-off event [2022-12-06 05:42:26,369 INFO L385 tUnfolder$Statistics]: existing Event has 27 ancestors and is cut-off event [2022-12-06 05:42:26,370 INFO L385 tUnfolder$Statistics]: existing Event has 30 ancestors and is cut-off event [2022-12-06 05:42:26,370 INFO L385 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-06 05:42:26,371 INFO L130 PetriNetUnfolder]: 23/76 cut-off events. [2022-12-06 05:42:26,371 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-12-06 05:42:26,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148 conditions, 76 events. 23/76 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 157 event pairs, 0 based on Foata normal form. 0/65 useless extension candidates. Maximal degree in co-relation 107. Up to 16 conditions per place. [2022-12-06 05:42:26,372 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 42 transitions, 174 flow [2022-12-06 05:42:26,372 INFO L188 LiptonReduction]: Number of co-enabled transitions 390 [2022-12-06 05:42:26,373 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:42:26,374 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 11 [2022-12-06 05:42:26,374 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 42 transitions, 174 flow [2022-12-06 05:42:26,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 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 05:42:26,374 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:42:26,374 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:42:26,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 05:42:26,374 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 05:42:26,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:42:26,374 INFO L85 PathProgramCache]: Analyzing trace with hash -440613925, now seen corresponding path program 1 times [2022-12-06 05:42:26,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:42:26,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143047153] [2022-12-06 05:42:26,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:42:26,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:42:26,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:42:26,517 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-06 05:42:26,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:42:26,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143047153] [2022-12-06 05:42:26,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143047153] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:42:26,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:42:26,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:42:26,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669283424] [2022-12-06 05:42:26,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:42:26,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:42:26,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:42:26,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:42:26,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:42:26,519 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 35 [2022-12-06 05:42:26,520 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 42 transitions, 174 flow. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 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 05:42:26,520 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:42:26,520 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 35 [2022-12-06 05:42:26,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:42:26,698 INFO L130 PetriNetUnfolder]: 1728/2305 cut-off events. [2022-12-06 05:42:26,699 INFO L131 PetriNetUnfolder]: For 483/483 co-relation queries the response was YES. [2022-12-06 05:42:26,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5632 conditions, 2305 events. 1728/2305 cut-off events. For 483/483 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 8981 event pairs, 494 based on Foata normal form. 0/1741 useless extension candidates. Maximal degree in co-relation 5582. Up to 1714 conditions per place. [2022-12-06 05:42:26,711 INFO L137 encePairwiseOnDemand]: 31/35 looper letters, 57 selfloop transitions, 3 changer transitions 0/62 dead transitions. [2022-12-06 05:42:26,711 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 62 transitions, 356 flow [2022-12-06 05:42:26,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:42:26,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:42:26,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2022-12-06 05:42:26,712 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.42142857142857143 [2022-12-06 05:42:26,712 INFO L175 Difference]: Start difference. First operand has 47 places, 42 transitions, 174 flow. Second operand 4 states and 59 transitions. [2022-12-06 05:42:26,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 62 transitions, 356 flow [2022-12-06 05:42:26,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 62 transitions, 317 flow, removed 12 selfloop flow, removed 9 redundant places. [2022-12-06 05:42:26,716 INFO L231 Difference]: Finished difference. Result has 42 places, 43 transitions, 157 flow [2022-12-06 05:42:26,716 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=157, PETRI_PLACES=42, PETRI_TRANSITIONS=43} [2022-12-06 05:42:26,716 INFO L294 CegarLoopForPetriNet]: 36 programPoint places, 6 predicate places. [2022-12-06 05:42:26,716 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:42:26,716 INFO L89 Accepts]: Start accepts. Operand has 42 places, 43 transitions, 157 flow [2022-12-06 05:42:26,717 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:42:26,717 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:42:26,717 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 43 transitions, 157 flow [2022-12-06 05:42:26,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 43 transitions, 157 flow [2022-12-06 05:42:26,722 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([809] thread3EXIT-->L111-2: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem30#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread3Thread1of1ForFork1_thidvar0_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4)) InVars {ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_#t~mem30#1=|v_ULTIMATE.start_main_#t~mem30#1_5|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][41], [Black: 281#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0)), Black: 273#(and (<= 1 ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 464#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 1) (<= 2 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= 1 |ULTIMATE.start_create_fresh_int_array_~i~3#1|)), 462#(and (<= 2 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~N~0) (<= 1 |ULTIMATE.start_create_fresh_int_array_~i~3#1|)), Black: 277#(<= (+ ~minb~0 ~mina~0) ~minc~0), Black: 477#(and (= |thread2Thread1of1ForFork0_~i~1#1| 1) (<= 2 ~N~0)), 89#L111-2true, 476#(<= 2 ~N~0)]) [2022-12-06 05:42:26,722 INFO L382 tUnfolder$Statistics]: this new event has 31 ancestors and is cut-off event [2022-12-06 05:42:26,722 INFO L385 tUnfolder$Statistics]: existing Event has 28 ancestors and is cut-off event [2022-12-06 05:42:26,722 INFO L385 tUnfolder$Statistics]: existing Event has 31 ancestors and is cut-off event [2022-12-06 05:42:26,722 INFO L385 tUnfolder$Statistics]: existing Event has 29 ancestors and is cut-off event [2022-12-06 05:42:26,723 INFO L130 PetriNetUnfolder]: 23/77 cut-off events. [2022-12-06 05:42:26,723 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 05:42:26,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 77 events. 23/77 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 164 event pairs, 0 based on Foata normal form. 0/59 useless extension candidates. Maximal degree in co-relation 99. Up to 16 conditions per place. [2022-12-06 05:42:26,724 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 43 transitions, 157 flow [2022-12-06 05:42:26,724 INFO L188 LiptonReduction]: Number of co-enabled transitions 432 [2022-12-06 05:42:26,732 ERROR L799 SequenceRule]: Run adaptation not supported for post-scripts [2022-12-06 05:42:26,733 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:42:26,735 ERROR L123 eatedLiptonReduction]: Lipton reduction run adaptation of counterexample failed. [2022-12-06 05:42:26,735 INFO L89 Accepts]: Start accepts. Operand has 42 places, 42 transitions, 152 flow [2022-12-06 05:42:26,736 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:42:26,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 05:42:26,737 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Lipton reduction run adaptation failed, and the cached counterexample word is no longer accepted by reduced abstraction! at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:132) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.refineAbstraction(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-06 05:42:26,740 INFO L158 Benchmark]: Toolchain (without parser) took 18181.73ms. Allocated memory was 196.1MB in the beginning and 436.2MB in the end (delta: 240.1MB). Free memory was 173.0MB in the beginning and 241.8MB in the end (delta: -68.8MB). Peak memory consumption was 171.9MB. Max. memory is 8.0GB. [2022-12-06 05:42:26,741 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 196.1MB. Free memory was 173.2MB in the beginning and 173.1MB in the end (delta: 152.1kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 05:42:26,741 INFO L158 Benchmark]: CACSL2BoogieTranslator took 253.91ms. Allocated memory is still 196.1MB. Free memory was 172.5MB in the beginning and 159.4MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-06 05:42:26,742 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.85ms. Allocated memory is still 196.1MB. Free memory was 159.4MB in the beginning and 157.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 05:42:26,742 INFO L158 Benchmark]: Boogie Preprocessor took 37.11ms. Allocated memory is still 196.1MB. Free memory was 157.3MB in the beginning and 155.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 05:42:26,742 INFO L158 Benchmark]: RCFGBuilder took 619.74ms. Allocated memory is still 196.1MB. Free memory was 155.2MB in the beginning and 124.3MB in the end (delta: 30.9MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. [2022-12-06 05:42:26,743 INFO L158 Benchmark]: TraceAbstraction took 17207.27ms. Allocated memory was 196.1MB in the beginning and 436.2MB in the end (delta: 240.1MB). Free memory was 123.7MB in the beginning and 241.8MB in the end (delta: -118.1MB). Peak memory consumption was 123.6MB. Max. memory is 8.0GB. [2022-12-06 05:42:26,744 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.18ms. Allocated memory is still 196.1MB. Free memory was 173.2MB in the beginning and 173.1MB in the end (delta: 152.1kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 253.91ms. Allocated memory is still 196.1MB. Free memory was 172.5MB in the beginning and 159.4MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 50.85ms. Allocated memory is still 196.1MB. Free memory was 159.4MB in the beginning and 157.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.11ms. Allocated memory is still 196.1MB. Free memory was 157.3MB in the beginning and 155.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 619.74ms. Allocated memory is still 196.1MB. Free memory was 155.2MB in the beginning and 124.3MB in the end (delta: 30.9MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. * TraceAbstraction took 17207.27ms. Allocated memory was 196.1MB in the beginning and 436.2MB in the end (delta: 240.1MB). Free memory was 123.7MB in the beginning and 241.8MB in the end (delta: -118.1MB). Peak memory consumption was 123.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.5s, 250 PlacesBefore, 36 PlacesAfterwards, 267 TransitionsBefore, 35 TransitionsAfterwards, 2634 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 173 TrivialYvCompositions, 41 ConcurrentYvCompositions, 18 ChoiceCompositions, 233 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1494, independent: 1465, independent conditional: 1465, independent unconditional: 0, dependent: 29, dependent conditional: 29, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1494, independent: 1465, independent conditional: 0, independent unconditional: 1465, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1494, independent: 1465, independent conditional: 0, independent unconditional: 1465, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1494, independent: 1465, independent conditional: 0, independent unconditional: 1465, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1389, independent: 1371, independent conditional: 0, independent unconditional: 1371, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1389, independent: 1371, independent conditional: 0, independent unconditional: 1371, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 18, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 46, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1494, independent: 94, independent conditional: 0, independent unconditional: 94, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 1389, unknown conditional: 0, unknown unconditional: 1389] , Statistics on independence cache: Total cache size (in pairs): 2191, Positive cache size: 2173, Positive conditional cache size: 0, Positive unconditional cache size: 2173, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, 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.8s, 33 PlacesBefore, 32 PlacesAfterwards, 36 TransitionsBefore, 35 TransitionsAfterwards, 318 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 56, independent: 44, independent conditional: 44, independent unconditional: 0, dependent: 12, dependent conditional: 12, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 56, independent: 44, independent conditional: 0, independent unconditional: 44, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 56, independent: 44, independent conditional: 0, independent unconditional: 44, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 56, independent: 44, independent conditional: 0, independent unconditional: 44, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 28, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 28, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 13, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 56, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 28, unknown conditional: 0, unknown unconditional: 28] , Statistics on independence cache: Total cache size (in pairs): 28, Positive cache size: 22, Positive conditional cache size: 0, Positive unconditional cache size: 22, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6, 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, 37 TransitionsBefore, 37 TransitionsAfterwards, 318 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 30, independent: 24, independent conditional: 24, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 30, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 30, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 30, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 2, independent: 2, independent conditional: 0, independent unconditional: 2, 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: 30, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 30, Positive cache size: 24, Positive conditional cache size: 0, Positive unconditional cache size: 24, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6, 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, 36 PlacesBefore, 36 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 390 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 21, independent: 18, independent conditional: 18, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 21, independent: 18, independent conditional: 3, independent unconditional: 15, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 21, independent: 18, independent conditional: 3, independent unconditional: 15, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 21, independent: 18, independent conditional: 3, independent unconditional: 15, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 1, independent: 1, independent conditional: 0, independent unconditional: 1, 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: 21, independent: 17, independent conditional: 3, independent unconditional: 14, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 31, Positive cache size: 25, Positive conditional cache size: 0, Positive unconditional cache size: 25, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 43 PlacesBefore, 43 PlacesAfterwards, 46 TransitionsBefore, 46 TransitionsAfterwards, 426 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 31, independent: 28, independent conditional: 28, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 31, independent: 28, independent conditional: 3, independent unconditional: 25, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 31, independent: 28, independent conditional: 3, independent unconditional: 25, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 31, independent: 28, independent conditional: 3, independent unconditional: 25, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 0, independent unconditional: 10, 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: 10, independent: 10, independent conditional: 0, independent unconditional: 10, 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: 31, independent: 18, independent conditional: 3, independent unconditional: 15, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 41, Positive cache size: 35, Positive conditional cache size: 0, Positive unconditional cache size: 35, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.4s, 51 PlacesBefore, 51 PlacesAfterwards, 49 TransitionsBefore, 49 TransitionsAfterwards, 426 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 72, independent: 66, independent conditional: 66, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 72, independent: 66, independent conditional: 12, independent unconditional: 54, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 72, independent: 66, independent conditional: 8, independent unconditional: 58, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 72, independent: 66, independent conditional: 8, independent unconditional: 58, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 1, independent unconditional: 2, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 72, independent: 63, independent conditional: 7, independent unconditional: 56, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 3, unknown conditional: 1, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 44, Positive cache size: 38, Positive conditional cache size: 1, Positive unconditional cache size: 37, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 4, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 47 PlacesBefore, 47 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 390 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19, independent: 16, independent conditional: 16, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 19, independent: 16, independent conditional: 2, independent unconditional: 14, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 19, independent: 16, independent conditional: 2, independent unconditional: 14, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 19, independent: 16, independent conditional: 2, independent unconditional: 14, dependent: 3, dependent conditional: 0, dependent unconditional: 3, 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: 19, independent: 16, independent conditional: 2, independent unconditional: 14, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 44, Positive cache size: 38, Positive conditional cache size: 1, Positive unconditional cache size: 37, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 42 PlacesBefore, 42 PlacesAfterwards, 43 TransitionsBefore, 42 TransitionsAfterwards, 432 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 70, independent: 63, independent conditional: 63, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 70, independent: 63, independent conditional: 29, independent unconditional: 34, dependent: 7, dependent conditional: 2, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 70, independent: 63, independent conditional: 16, independent unconditional: 47, dependent: 7, dependent conditional: 2, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 70, independent: 63, independent conditional: 16, independent unconditional: 47, dependent: 7, dependent conditional: 2, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 20, independent: 18, independent conditional: 6, independent unconditional: 12, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 20, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 6, dependent conditional: 6, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 70, independent: 45, independent conditional: 10, independent unconditional: 35, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 20, unknown conditional: 8, unknown unconditional: 12] , Statistics on independence cache: Total cache size (in pairs): 64, Positive cache size: 56, Positive conditional cache size: 7, Positive unconditional cache size: 49, Negative cache size: 8, Negative conditional cache size: 2, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 13, Maximal queried relation: 0 - ExceptionOrErrorResult: AssertionError: Lipton reduction run adaptation failed, and the cached counterexample word is no longer accepted by reduced abstraction! de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Lipton reduction run adaptation failed, and the cached counterexample word is no longer accepted by reduced abstraction!: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:132) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-12-06 05:42:26,776 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...