/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-bad-ring-nondet.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 02:28:22,803 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 02:28:22,805 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 02:28:22,849 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 02:28:22,849 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 02:28:22,852 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 02:28:22,855 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 02:28:22,858 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 02:28:22,862 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 02:28:22,867 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 02:28:22,869 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 02:28:22,871 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 02:28:22,871 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 02:28:22,873 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 02:28:22,875 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 02:28:22,877 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 02:28:22,878 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 02:28:22,879 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 02:28:22,881 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 02:28:22,886 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 02:28:22,887 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 02:28:22,888 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 02:28:22,889 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 02:28:22,889 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 02:28:22,894 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 02:28:22,895 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 02:28:22,895 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 02:28:22,897 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 02:28:22,897 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 02:28:22,898 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 02:28:22,898 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 02:28:22,900 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 02:28:22,901 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 02:28:22,902 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 02:28:22,902 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 02:28:22,903 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 02:28:22,903 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 02:28:22,903 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 02:28:22,903 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 02:28:22,904 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 02:28:22,905 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 02:28:22,909 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-06 02:28:22,940 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 02:28:22,941 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 02:28:22,942 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 02:28:22,942 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 02:28:22,942 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 02:28:22,943 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 02:28:22,943 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 02:28:22,943 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 02:28:22,943 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 02:28:22,943 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 02:28:22,944 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 02:28:22,944 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 02:28:22,944 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 02:28:22,944 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 02:28:22,944 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 02:28:22,944 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 02:28:22,944 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 02:28:22,944 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 02:28:22,944 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 02:28:22,945 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 02:28:22,945 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 02:28:22,945 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 02:28:22,945 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 02:28:22,945 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 02:28:22,945 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 02:28:22,945 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 02:28:22,945 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 02:28:22,945 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 02:28:22,946 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-06 02:28:23,242 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 02:28:23,261 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 02:28:23,264 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 02:28:23,265 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 02:28:23,265 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 02:28:23,267 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-ring-nondet.wvr.c [2022-12-06 02:28:24,474 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 02:28:24,682 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 02:28:24,682 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-ring-nondet.wvr.c [2022-12-06 02:28:24,699 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37dec20ed/ead005787bd0485f849e43d3f1c91ada/FLAGfa604937b [2022-12-06 02:28:24,712 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37dec20ed/ead005787bd0485f849e43d3f1c91ada [2022-12-06 02:28:24,714 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 02:28:24,715 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 02:28:24,717 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 02:28:24,718 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 02:28:24,720 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 02:28:24,720 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 02:28:24" (1/1) ... [2022-12-06 02:28:24,721 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a966e03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:28:24, skipping insertion in model container [2022-12-06 02:28:24,721 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 02:28:24" (1/1) ... [2022-12-06 02:28:24,727 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 02:28:24,754 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 02:28:24,872 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:28:24,873 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:28:24,873 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:28:24,875 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:28:24,876 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:28:24,878 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:28:24,880 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:28:24,883 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:28:24,887 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:28:24,888 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:28:24,888 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:28:24,889 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:28:24,890 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:28:24,891 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:28:24,891 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:28:24,892 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:28:24,898 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-ring-nondet.wvr.c[4085,4098] [2022-12-06 02:28:24,904 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 02:28:24,911 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 02:28:24,925 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:28:24,926 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:28:24,926 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:28:24,926 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:28:24,927 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:28:24,928 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:28:24,928 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:28:24,928 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:28:24,929 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:28:24,930 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:28:24,930 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:28:24,930 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:28:24,931 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:28:24,932 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:28:24,932 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 02:28:24,932 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 02:28:24,936 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-ring-nondet.wvr.c[4085,4098] [2022-12-06 02:28:24,938 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 02:28:24,950 INFO L208 MainTranslator]: Completed translation [2022-12-06 02:28:24,950 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:28:24 WrapperNode [2022-12-06 02:28:24,950 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 02:28:24,951 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 02:28:24,951 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 02:28:24,951 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 02:28:24,957 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:28:24" (1/1) ... [2022-12-06 02:28:24,973 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:28:24" (1/1) ... [2022-12-06 02:28:25,001 INFO L138 Inliner]: procedures = 25, calls = 63, calls flagged for inlining = 16, calls inlined = 20, statements flattened = 317 [2022-12-06 02:28:25,002 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 02:28:25,002 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 02:28:25,002 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 02:28:25,003 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 02:28:25,010 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:28:24" (1/1) ... [2022-12-06 02:28:25,010 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:28:24" (1/1) ... [2022-12-06 02:28:25,013 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:28:24" (1/1) ... [2022-12-06 02:28:25,013 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:28:24" (1/1) ... [2022-12-06 02:28:25,026 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:28:24" (1/1) ... [2022-12-06 02:28:25,030 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:28:24" (1/1) ... [2022-12-06 02:28:25,038 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:28:24" (1/1) ... [2022-12-06 02:28:25,040 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:28:24" (1/1) ... [2022-12-06 02:28:25,042 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 02:28:25,043 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 02:28:25,043 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 02:28:25,043 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 02:28:25,044 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:28:24" (1/1) ... [2022-12-06 02:28:25,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 02:28:25,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:28:25,068 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 02:28:25,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 02:28:25,118 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 02:28:25,119 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 02:28:25,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 02:28:25,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 02:28:25,119 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 02:28:25,119 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 02:28:25,119 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 02:28:25,119 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 02:28:25,119 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 02:28:25,119 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 02:28:25,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 02:28:25,119 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 02:28:25,119 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 02:28:25,120 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 02:28:25,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 02:28:25,120 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 02:28:25,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 02:28:25,122 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 02:28:25,232 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 02:28:25,234 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 02:28:25,585 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 02:28:25,697 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 02:28:25,697 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2022-12-06 02:28:25,699 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 02:28:25 BoogieIcfgContainer [2022-12-06 02:28:25,699 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 02:28:25,700 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 02:28:25,700 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 02:28:25,703 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 02:28:25,703 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 02:28:24" (1/3) ... [2022-12-06 02:28:25,704 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@178249d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 02:28:25, skipping insertion in model container [2022-12-06 02:28:25,704 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 02:28:24" (2/3) ... [2022-12-06 02:28:25,704 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@178249d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 02:28:25, skipping insertion in model container [2022-12-06 02:28:25,704 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 02:28:25" (3/3) ... [2022-12-06 02:28:25,706 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-ring-nondet.wvr.c [2022-12-06 02:28:25,720 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 02:28:25,720 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 02:28:25,720 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 02:28:25,841 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-06 02:28:25,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 241 places, 256 transitions, 536 flow [2022-12-06 02:28:26,013 INFO L130 PetriNetUnfolder]: 25/253 cut-off events. [2022-12-06 02:28:26,013 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 02:28:26,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 266 conditions, 253 events. 25/253 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 206 event pairs, 0 based on Foata normal form. 0/227 useless extension candidates. Maximal degree in co-relation 215. Up to 4 conditions per place. [2022-12-06 02:28:26,019 INFO L82 GeneralOperation]: Start removeDead. Operand has 241 places, 256 transitions, 536 flow [2022-12-06 02:28:26,024 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 228 places, 243 transitions, 504 flow [2022-12-06 02:28:26,026 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:28:26,049 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 228 places, 243 transitions, 504 flow [2022-12-06 02:28:26,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 228 places, 243 transitions, 504 flow [2022-12-06 02:28:26,103 INFO L130 PetriNetUnfolder]: 25/243 cut-off events. [2022-12-06 02:28:26,103 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 02:28:26,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 256 conditions, 243 events. 25/243 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 204 event pairs, 0 based on Foata normal form. 0/218 useless extension candidates. Maximal degree in co-relation 215. Up to 4 conditions per place. [2022-12-06 02:28:26,110 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 228 places, 243 transitions, 504 flow [2022-12-06 02:28:26,110 INFO L188 LiptonReduction]: Number of co-enabled transitions 2820 [2022-12-06 02:28:35,012 INFO L203 LiptonReduction]: Total number of compositions: 210 [2022-12-06 02:28:35,024 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 02:28:35,028 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;@3087a12b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 02:28:35,029 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 02:28:35,034 INFO L130 PetriNetUnfolder]: 8/32 cut-off events. [2022-12-06 02:28:35,034 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 02:28:35,034 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:28:35,034 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:28:35,035 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:28:35,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:28:35,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1935456720, now seen corresponding path program 1 times [2022-12-06 02:28:35,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:28:35,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385499126] [2022-12-06 02:28:35,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:28:35,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:28:35,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:28:35,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:28:35,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:28:35,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385499126] [2022-12-06 02:28:35,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385499126] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:28:35,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:28:35,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 02:28:35,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838247319] [2022-12-06 02:28:35,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:28:35,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 02:28:35,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:28:35,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 02:28:35,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 02:28:35,434 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 33 [2022-12-06 02:28:35,435 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 33 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:28:35,435 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:28:35,435 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 33 [2022-12-06 02:28:35,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:28:35,578 INFO L130 PetriNetUnfolder]: 472/693 cut-off events. [2022-12-06 02:28:35,578 INFO L131 PetriNetUnfolder]: For 58/58 co-relation queries the response was YES. [2022-12-06 02:28:35,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1465 conditions, 693 events. 472/693 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2150 event pairs, 135 based on Foata normal form. 30/576 useless extension candidates. Maximal degree in co-relation 1219. Up to 449 conditions per place. [2022-12-06 02:28:35,583 INFO L137 encePairwiseOnDemand]: 26/33 looper letters, 40 selfloop transitions, 3 changer transitions 0/44 dead transitions. [2022-12-06 02:28:35,583 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 44 transitions, 198 flow [2022-12-06 02:28:35,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 02:28:35,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 02:28:35,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2022-12-06 02:28:35,592 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5252525252525253 [2022-12-06 02:28:35,594 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 2 predicate places. [2022-12-06 02:28:35,595 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:28:35,595 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 44 transitions, 198 flow [2022-12-06 02:28:35,599 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 44 transitions, 198 flow [2022-12-06 02:28:35,599 INFO L188 LiptonReduction]: Number of co-enabled transitions 38 [2022-12-06 02:28:35,637 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 02:28:35,639 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 45 [2022-12-06 02:28:35,639 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 44 transitions, 198 flow [2022-12-06 02:28:35,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:28:35,639 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:28:35,639 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:28:35,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 02:28:35,640 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:28:35,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:28:35,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1141673692, now seen corresponding path program 1 times [2022-12-06 02:28:35,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:28:35,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114286916] [2022-12-06 02:28:35,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:28:35,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:28:35,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:28:35,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:28:35,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:28:35,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114286916] [2022-12-06 02:28:35,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114286916] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:28:35,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:28:35,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 02:28:35,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092108156] [2022-12-06 02:28:35,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:28:35,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 02:28:35,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:28:35,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 02:28:35,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 02:28:35,804 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 32 [2022-12-06 02:28:35,804 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 44 transitions, 198 flow. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:28:35,804 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:28:35,804 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 32 [2022-12-06 02:28:35,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:28:36,002 INFO L130 PetriNetUnfolder]: 558/835 cut-off events. [2022-12-06 02:28:36,002 INFO L131 PetriNetUnfolder]: For 79/85 co-relation queries the response was YES. [2022-12-06 02:28:36,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2602 conditions, 835 events. 558/835 cut-off events. For 79/85 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2679 event pairs, 176 based on Foata normal form. 26/697 useless extension candidates. Maximal degree in co-relation 2048. Up to 772 conditions per place. [2022-12-06 02:28:36,008 INFO L137 encePairwiseOnDemand]: 26/32 looper letters, 42 selfloop transitions, 2 changer transitions 14/59 dead transitions. [2022-12-06 02:28:36,008 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 59 transitions, 383 flow [2022-12-06 02:28:36,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 02:28:36,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 02:28:36,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 53 transitions. [2022-12-06 02:28:36,010 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4140625 [2022-12-06 02:28:36,010 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 5 predicate places. [2022-12-06 02:28:36,011 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:28:36,012 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 59 transitions, 383 flow [2022-12-06 02:28:36,015 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 59 transitions, 383 flow [2022-12-06 02:28:36,015 INFO L188 LiptonReduction]: Number of co-enabled transitions 38 [2022-12-06 02:28:39,808 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 02:28:39,809 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3799 [2022-12-06 02:28:39,809 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 58 transitions, 377 flow [2022-12-06 02:28:39,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:28:39,809 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:28:39,809 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:28:39,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 02:28:39,809 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:28:39,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:28:39,810 INFO L85 PathProgramCache]: Analyzing trace with hash -781661740, now seen corresponding path program 1 times [2022-12-06 02:28:39,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:28:39,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392757913] [2022-12-06 02:28:39,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:28:39,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:28:39,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:28:39,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 02:28:39,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:28:39,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392757913] [2022-12-06 02:28:39,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392757913] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:28:39,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:28:39,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 02:28:39,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581025772] [2022-12-06 02:28:39,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:28:39,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 02:28:39,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:28:39,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 02:28:39,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 02:28:39,931 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 33 [2022-12-06 02:28:39,931 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 58 transitions, 377 flow. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:28:39,931 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:28:39,931 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 33 [2022-12-06 02:28:39,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:28:40,152 INFO L130 PetriNetUnfolder]: 900/1429 cut-off events. [2022-12-06 02:28:40,152 INFO L131 PetriNetUnfolder]: For 117/121 co-relation queries the response was YES. [2022-12-06 02:28:40,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5910 conditions, 1429 events. 900/1429 cut-off events. For 117/121 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 5780 event pairs, 476 based on Foata normal form. 56/1276 useless extension candidates. Maximal degree in co-relation 2708. Up to 1248 conditions per place. [2022-12-06 02:28:40,160 INFO L137 encePairwiseOnDemand]: 26/33 looper letters, 42 selfloop transitions, 2 changer transitions 73/118 dead transitions. [2022-12-06 02:28:40,160 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 118 transitions, 1013 flow [2022-12-06 02:28:40,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 02:28:40,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 02:28:40,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2022-12-06 02:28:40,162 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2022-12-06 02:28:40,162 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 8 predicate places. [2022-12-06 02:28:40,163 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:28:40,163 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 118 transitions, 1013 flow [2022-12-06 02:28:40,171 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 118 transitions, 1013 flow [2022-12-06 02:28:40,171 INFO L188 LiptonReduction]: Number of co-enabled transitions 70 [2022-12-06 02:28:40,174 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:28:40,176 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 14 [2022-12-06 02:28:40,176 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 118 transitions, 1013 flow [2022-12-06 02:28:40,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:28:40,176 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:28:40,176 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 02:28:40,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 02:28:40,176 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:28:40,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:28:40,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1120135627, now seen corresponding path program 1 times [2022-12-06 02:28:40,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:28:40,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269284460] [2022-12-06 02:28:40,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:28:40,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:28:40,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:28:40,308 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:28:40,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:28:40,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269284460] [2022-12-06 02:28:40,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269284460] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:28:40,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:28:40,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 02:28:40,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751404704] [2022-12-06 02:28:40,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:28:40,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 02:28:40,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:28:40,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 02:28:40,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 02:28:40,310 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 33 [2022-12-06 02:28:40,310 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 118 transitions, 1013 flow. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:28:40,310 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:28:40,310 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 33 [2022-12-06 02:28:40,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:28:40,579 INFO L130 PetriNetUnfolder]: 1326/2088 cut-off events. [2022-12-06 02:28:40,581 INFO L131 PetriNetUnfolder]: For 219/225 co-relation queries the response was YES. [2022-12-06 02:28:40,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10709 conditions, 2088 events. 1326/2088 cut-off events. For 219/225 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 9106 event pairs, 632 based on Foata normal form. 38/1815 useless extension candidates. Maximal degree in co-relation 3369. Up to 1847 conditions per place. [2022-12-06 02:28:40,597 INFO L137 encePairwiseOnDemand]: 28/33 looper letters, 43 selfloop transitions, 2 changer transitions 117/163 dead transitions. [2022-12-06 02:28:40,597 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 163 transitions, 1727 flow [2022-12-06 02:28:40,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 02:28:40,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 02:28:40,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2022-12-06 02:28:40,600 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2022-12-06 02:28:40,601 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 11 predicate places. [2022-12-06 02:28:40,602 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:28:40,602 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 163 transitions, 1727 flow [2022-12-06 02:28:40,619 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 163 transitions, 1727 flow [2022-12-06 02:28:40,619 INFO L188 LiptonReduction]: Number of co-enabled transitions 104 [2022-12-06 02:28:40,621 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:28:40,625 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 24 [2022-12-06 02:28:40,626 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 163 transitions, 1727 flow [2022-12-06 02:28:40,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:28:40,626 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:28:40,626 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] [2022-12-06 02:28:40,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 02:28:40,626 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:28:40,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:28:40,627 INFO L85 PathProgramCache]: Analyzing trace with hash -216674171, now seen corresponding path program 1 times [2022-12-06 02:28:40,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:28:40,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268853032] [2022-12-06 02:28:40,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:28:40,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:28:40,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:28:40,828 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 02:28:40,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:28:40,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268853032] [2022-12-06 02:28:40,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268853032] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:28:40,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:28:40,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 02:28:40,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978724277] [2022-12-06 02:28:40,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:28:40,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 02:28:40,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:28:40,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 02:28:40,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 02:28:40,830 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 1 out of 33 [2022-12-06 02:28:40,830 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 163 transitions, 1727 flow. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:28:40,830 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:28:40,830 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1 of 33 [2022-12-06 02:28:40,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:28:41,234 INFO L130 PetriNetUnfolder]: 2288/3627 cut-off events. [2022-12-06 02:28:41,234 INFO L131 PetriNetUnfolder]: For 1174/1182 co-relation queries the response was YES. [2022-12-06 02:28:41,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21812 conditions, 3627 events. 2288/3627 cut-off events. For 1174/1182 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 18519 event pairs, 634 based on Foata normal form. 1/3053 useless extension candidates. Maximal degree in co-relation 7237. Up to 3306 conditions per place. [2022-12-06 02:28:41,248 INFO L137 encePairwiseOnDemand]: 29/33 looper letters, 65 selfloop transitions, 3 changer transitions 181/250 dead transitions. [2022-12-06 02:28:41,248 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 250 transitions, 3152 flow [2022-12-06 02:28:41,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 02:28:41,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 02:28:41,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2022-12-06 02:28:41,251 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5757575757575758 [2022-12-06 02:28:41,253 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 13 predicate places. [2022-12-06 02:28:41,254 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:28:41,254 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 250 transitions, 3152 flow [2022-12-06 02:28:41,274 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 250 transitions, 3152 flow [2022-12-06 02:28:41,274 INFO L188 LiptonReduction]: Number of co-enabled transitions 208 [2022-12-06 02:28:41,278 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:28:41,280 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 27 [2022-12-06 02:28:41,280 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 250 transitions, 3152 flow [2022-12-06 02:28:41,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:28:41,280 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:28:41,280 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:28:41,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 02:28:41,280 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:28:41,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:28:41,281 INFO L85 PathProgramCache]: Analyzing trace with hash -72086362, now seen corresponding path program 1 times [2022-12-06 02:28:41,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:28:41,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676520560] [2022-12-06 02:28:41,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:28:41,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:28:41,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:28:41,512 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 02:28:41,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:28:41,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676520560] [2022-12-06 02:28:41,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676520560] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 02:28:41,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 02:28:41,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 02:28:41,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223616016] [2022-12-06 02:28:41,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 02:28:41,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 02:28:41,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:28:41,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 02:28:41,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 02:28:41,514 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 02:28:41,514 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 250 transitions, 3152 flow. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:28:41,514 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:28:41,515 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 02:28:41,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:28:41,936 INFO L130 PetriNetUnfolder]: 1866/3012 cut-off events. [2022-12-06 02:28:41,936 INFO L131 PetriNetUnfolder]: For 2976/2976 co-relation queries the response was YES. [2022-12-06 02:28:41,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20674 conditions, 3012 events. 1866/3012 cut-off events. For 2976/2976 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 14833 event pairs, 516 based on Foata normal form. 96/2704 useless extension candidates. Maximal degree in co-relation 5621. Up to 2602 conditions per place. [2022-12-06 02:28:41,949 INFO L137 encePairwiseOnDemand]: 28/33 looper letters, 53 selfloop transitions, 2 changer transitions 216/271 dead transitions. [2022-12-06 02:28:41,950 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 271 transitions, 3960 flow [2022-12-06 02:28:41,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 02:28:41,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 02:28:41,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2022-12-06 02:28:41,951 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45454545454545453 [2022-12-06 02:28:41,953 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 15 predicate places. [2022-12-06 02:28:41,953 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:28:41,953 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 271 transitions, 3960 flow [2022-12-06 02:28:41,968 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 271 transitions, 3960 flow [2022-12-06 02:28:41,968 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:28:41,969 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:28:41,970 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-06 02:28:41,970 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 271 transitions, 3960 flow [2022-12-06 02:28:41,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:28:41,970 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:28:41,970 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:28:41,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 02:28:41,971 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:28:41,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:28:41,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1756633390, now seen corresponding path program 1 times [2022-12-06 02:28:41,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:28:41,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435333202] [2022-12-06 02:28:41,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:28:41,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:28:42,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:28:42,414 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 02:28:42,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:28:42,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435333202] [2022-12-06 02:28:42,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435333202] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:28:42,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1996789430] [2022-12-06 02:28:42,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:28:42,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:28:42,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:28:42,441 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:28:42,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-06 02:28:42,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:28:42,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-06 02:28:42,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:28:42,718 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 144 [2022-12-06 02:28:42,809 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 02:28:42,809 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:28:42,903 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 174 [2022-12-06 02:28:42,973 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 02:28:42,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1996789430] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:28:42,974 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:28:42,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 13 [2022-12-06 02:28:42,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828704432] [2022-12-06 02:28:42,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:28:42,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 02:28:42,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:28:42,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 02:28:42,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-12-06 02:28:42,975 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 33 [2022-12-06 02:28:42,975 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 271 transitions, 3960 flow. Second operand has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:28:42,975 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:28:42,975 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 33 [2022-12-06 02:28:42,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:28:44,201 INFO L130 PetriNetUnfolder]: 3989/6388 cut-off events. [2022-12-06 02:28:44,201 INFO L131 PetriNetUnfolder]: For 9451/9451 co-relation queries the response was YES. [2022-12-06 02:28:44,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50373 conditions, 6388 events. 3989/6388 cut-off events. For 9451/9451 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 36686 event pairs, 288 based on Foata normal form. 77/5616 useless extension candidates. Maximal degree in co-relation 13172. Up to 5814 conditions per place. [2022-12-06 02:28:44,220 INFO L137 encePairwiseOnDemand]: 21/33 looper letters, 76 selfloop transitions, 8 changer transitions 733/817 dead transitions. [2022-12-06 02:28:44,220 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 817 transitions, 13584 flow [2022-12-06 02:28:44,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 02:28:44,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-06 02:28:44,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 192 transitions. [2022-12-06 02:28:44,221 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3878787878787879 [2022-12-06 02:28:44,222 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 29 predicate places. [2022-12-06 02:28:44,222 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:28:44,222 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 817 transitions, 13584 flow [2022-12-06 02:28:44,258 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 817 transitions, 13584 flow [2022-12-06 02:28:44,258 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:28:48,035 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 02:28:48,036 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3814 [2022-12-06 02:28:48,036 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 816 transitions, 13568 flow [2022-12-06 02:28:48,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:28:48,036 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:28:48,037 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:28:48,054 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-06 02:28:48,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:28:48,243 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:28:48,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:28:48,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1414963427, now seen corresponding path program 1 times [2022-12-06 02:28:48,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:28:48,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252155120] [2022-12-06 02:28:48,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:28:48,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:28:48,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:28:48,930 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 02:28:48,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:28:48,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252155120] [2022-12-06 02:28:48,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252155120] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:28:48,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [58208362] [2022-12-06 02:28:48,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:28:48,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:28:48,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:28:48,933 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:28:48,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-06 02:28:49,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:28:49,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-06 02:28:49,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:28:49,269 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 144 [2022-12-06 02:28:49,312 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 02:28:49,313 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:28:49,575 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 174 [2022-12-06 02:28:49,697 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 02:28:49,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [58208362] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:28:49,697 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:28:49,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 18 [2022-12-06 02:28:49,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610678908] [2022-12-06 02:28:49,698 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:28:49,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-06 02:28:49,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:28:49,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-06 02:28:49,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2022-12-06 02:28:49,700 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 34 [2022-12-06 02:28:49,700 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 816 transitions, 13568 flow. Second operand has 19 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 19 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:28:49,700 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:28:49,700 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 34 [2022-12-06 02:28:49,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:28:52,944 INFO L130 PetriNetUnfolder]: 7073/11121 cut-off events. [2022-12-06 02:28:52,945 INFO L131 PetriNetUnfolder]: For 15983/15983 co-relation queries the response was YES. [2022-12-06 02:28:52,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98026 conditions, 11121 events. 7073/11121 cut-off events. For 15983/15983 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 65376 event pairs, 212 based on Foata normal form. 229/9504 useless extension candidates. Maximal degree in co-relation 29942. Up to 10185 conditions per place. [2022-12-06 02:28:52,986 INFO L137 encePairwiseOnDemand]: 21/34 looper letters, 223 selfloop transitions, 61 changer transitions 1465/1749 dead transitions. [2022-12-06 02:28:52,987 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 1749 transitions, 32355 flow [2022-12-06 02:28:52,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-06 02:28:52,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2022-12-06 02:28:52,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 311 transitions. [2022-12-06 02:28:52,988 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.32668067226890757 [2022-12-06 02:28:52,988 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 55 predicate places. [2022-12-06 02:28:52,989 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:28:52,989 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 90 places, 1749 transitions, 32355 flow [2022-12-06 02:28:53,089 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 90 places, 1749 transitions, 32355 flow [2022-12-06 02:28:53,090 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:28:57,408 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 02:28:57,415 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4426 [2022-12-06 02:28:57,415 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 1748 transitions, 32337 flow [2022-12-06 02:28:57,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 19 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:28:57,415 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:28:57,415 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:28:57,421 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-06 02:28:57,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-12-06 02:28:57,621 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:28:57,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:28:57,622 INFO L85 PathProgramCache]: Analyzing trace with hash -195804192, now seen corresponding path program 1 times [2022-12-06 02:28:57,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:28:57,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264948675] [2022-12-06 02:28:57,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:28:57,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:28:57,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:28:59,094 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 02:28:59,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:28:59,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264948675] [2022-12-06 02:28:59,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264948675] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:28:59,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [355262441] [2022-12-06 02:28:59,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:28:59,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:28:59,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:28:59,116 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:28:59,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-06 02:28:59,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:28:59,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-06 02:28:59,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:28:59,846 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:28:59,846 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 208 treesize of output 191 [2022-12-06 02:29:00,121 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 02:29:00,121 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:29:00,636 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:29:00,637 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 220 treesize of output 216 [2022-12-06 02:29:00,912 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 02:29:00,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [355262441] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:29:00,912 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:29:00,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 8] total 28 [2022-12-06 02:29:00,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254806795] [2022-12-06 02:29:00,913 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:29:00,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-12-06 02:29:00,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:29:00,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-12-06 02:29:00,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=641, Unknown=0, NotChecked=0, Total=812 [2022-12-06 02:29:00,914 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 02:29:00,914 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 1748 transitions, 32337 flow. Second operand has 29 states, 29 states have (on average 2.8275862068965516) internal successors, (82), 28 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:29:00,915 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:29:00,915 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 02:29:00,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:29:27,685 INFO L130 PetriNetUnfolder]: 41886/62775 cut-off events. [2022-12-06 02:29:27,686 INFO L131 PetriNetUnfolder]: For 44271/44271 co-relation queries the response was YES. [2022-12-06 02:29:27,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 619304 conditions, 62775 events. 41886/62775 cut-off events. For 44271/44271 co-relation queries the response was YES. Maximal size of possible extension queue 1864. Compared 438730 event pairs, 576 based on Foata normal form. 316/49995 useless extension candidates. Maximal degree in co-relation 152223. Up to 60406 conditions per place. [2022-12-06 02:29:28,124 INFO L137 encePairwiseOnDemand]: 16/35 looper letters, 2865 selfloop transitions, 747 changer transitions 6052/9664 dead transitions. [2022-12-06 02:29:28,125 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 9664 transitions, 196441 flow [2022-12-06 02:29:28,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 160 states. [2022-12-06 02:29:28,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2022-12-06 02:29:28,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 1739 transitions. [2022-12-06 02:29:28,140 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3105357142857143 [2022-12-06 02:29:28,141 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 213 predicate places. [2022-12-06 02:29:28,142 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:29:28,142 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 248 places, 9664 transitions, 196441 flow [2022-12-06 02:29:28,760 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 248 places, 9664 transitions, 196441 flow [2022-12-06 02:29:28,760 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:29:28,792 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 02:29:28,793 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 652 [2022-12-06 02:29:28,793 INFO L495 AbstractCegarLoop]: Abstraction has has 248 places, 9664 transitions, 196441 flow [2022-12-06 02:29:28,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.8275862068965516) internal successors, (82), 28 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:29:28,793 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 02:29:28,793 INFO L213 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:29:28,798 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-06 02:29:28,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:29:28,998 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 02:29:28,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 02:29:28,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1681212414, now seen corresponding path program 1 times [2022-12-06 02:29:28,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 02:29:28,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320886959] [2022-12-06 02:29:28,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:29:28,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 02:29:29,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:29:30,386 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 02:29:30,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 02:29:30,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320886959] [2022-12-06 02:29:30,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320886959] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 02:29:30,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [626013170] [2022-12-06 02:29:30,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 02:29:30,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 02:29:30,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 02:29:30,400 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 02:29:30,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-06 02:29:30,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 02:29:30,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-06 02:29:30,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 02:29:31,293 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:29:31,294 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 281 treesize of output 443 [2022-12-06 02:31:26,543 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 02:31:26,544 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 02:31:27,181 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 02:31:27,182 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 208 treesize of output 222 [2022-12-06 02:31:27,453 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 02:31:27,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [626013170] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 02:31:27,454 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 02:31:27,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 10] total 31 [2022-12-06 02:31:27,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162541141] [2022-12-06 02:31:27,455 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 02:31:27,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-12-06 02:31:27,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 02:31:27,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-12-06 02:31:27,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=736, Unknown=0, NotChecked=0, Total=930 [2022-12-06 02:31:27,458 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 35 [2022-12-06 02:31:27,458 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 9664 transitions, 196441 flow. Second operand has 31 states, 31 states have (on average 2.774193548387097) internal successors, (86), 31 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 02:31:27,458 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 02:31:27,458 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 35 [2022-12-06 02:31:27,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 02:31:48,250 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 02:34:06,068 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-06 02:39:49,364 INFO L130 PetriNetUnfolder]: 143776/210013 cut-off events. [2022-12-06 02:39:49,365 INFO L131 PetriNetUnfolder]: For 136584/136584 co-relation queries the response was YES. [2022-12-06 02:39:49,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2287499 conditions, 210013 events. 143776/210013 cut-off events. For 136584/136584 co-relation queries the response was YES. Maximal size of possible extension queue 6527. Compared 1639028 event pairs, 2283 based on Foata normal form. 6/163315 useless extension candidates. Maximal degree in co-relation 490847. Up to 206758 conditions per place. [2022-12-06 02:39:50,224 INFO L137 encePairwiseOnDemand]: 9/35 looper letters, 2557 selfloop transitions, 1079 changer transitions 30809/34445 dead transitions. [2022-12-06 02:39:50,224 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 461 places, 34445 transitions, 767412 flow [2022-12-06 02:39:50,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 214 states. [2022-12-06 02:39:50,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2022-12-06 02:39:50,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 2070 transitions. [2022-12-06 02:39:50,267 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.27636849132176233 [2022-12-06 02:39:50,268 INFO L294 CegarLoopForPetriNet]: 35 programPoint places, 426 predicate places. [2022-12-06 02:39:50,268 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 02:39:50,269 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 461 places, 34445 transitions, 767412 flow Received shutdown request... [2022-12-06 02:39:51,992 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 02:39:51,992 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 02:39:52,946 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 461 places, 34445 transitions, 767412 flow [2022-12-06 02:39:52,947 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 02:39:53,016 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-06 02:39:53,052 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 [2022-12-06 02:39:53,092 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-06 02:39:53,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 02:39:53,093 WARN L619 AbstractCegarLoop]: Verification canceled: while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. [2022-12-06 02:39:53,094 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-06 02:39:53,094 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-06 02:39:53,095 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-06 02:39:53,095 INFO L458 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 02:39:53,098 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 02:39:53,098 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 02:39:53,100 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 02:39:53 BasicIcfg [2022-12-06 02:39:53,100 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 02:39:53,101 INFO L158 Benchmark]: Toolchain (without parser) took 688385.52ms. Allocated memory was 163.6MB in the beginning and 3.2GB in the end (delta: 3.1GB). Free memory was 140.0MB in the beginning and 1.0GB in the end (delta: -877.2MB). Peak memory consumption was 2.2GB. Max. memory is 8.0GB. [2022-12-06 02:39:53,102 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 163.6MB. Free memory is still 140.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 02:39:53,102 INFO L158 Benchmark]: CACSL2BoogieTranslator took 232.95ms. Allocated memory is still 163.6MB. Free memory was 140.0MB in the beginning and 125.3MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-12-06 02:39:53,103 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.65ms. Allocated memory is still 163.6MB. Free memory was 125.3MB in the beginning and 122.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 02:39:53,103 INFO L158 Benchmark]: Boogie Preprocessor took 40.14ms. Allocated memory is still 163.6MB. Free memory was 122.7MB in the beginning and 120.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 02:39:53,103 INFO L158 Benchmark]: RCFGBuilder took 655.83ms. Allocated memory is still 163.6MB. Free memory was 120.6MB in the beginning and 81.2MB in the end (delta: 39.3MB). Peak memory consumption was 39.8MB. Max. memory is 8.0GB. [2022-12-06 02:39:53,103 INFO L158 Benchmark]: TraceAbstraction took 687399.89ms. Allocated memory was 163.6MB in the beginning and 3.2GB in the end (delta: 3.1GB). Free memory was 80.7MB in the beginning and 1.0GB in the end (delta: -936.5MB). Peak memory consumption was 2.1GB. Max. memory is 8.0GB. [2022-12-06 02:39:53,106 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 163.6MB. Free memory is still 140.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 232.95ms. Allocated memory is still 163.6MB. Free memory was 140.0MB in the beginning and 125.3MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 50.65ms. Allocated memory is still 163.6MB. Free memory was 125.3MB in the beginning and 122.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 40.14ms. Allocated memory is still 163.6MB. Free memory was 122.7MB in the beginning and 120.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 655.83ms. Allocated memory is still 163.6MB. Free memory was 120.6MB in the beginning and 81.2MB in the end (delta: 39.3MB). Peak memory consumption was 39.8MB. Max. memory is 8.0GB. * TraceAbstraction took 687399.89ms. Allocated memory was 163.6MB in the beginning and 3.2GB in the end (delta: 3.1GB). Free memory was 80.7MB in the beginning and 1.0GB in the end (delta: -936.5MB). Peak memory consumption was 2.1GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.9s, 228 PlacesBefore, 35 PlacesAfterwards, 243 TransitionsBefore, 33 TransitionsAfterwards, 2820 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 151 TrivialYvCompositions, 42 ConcurrentYvCompositions, 15 ChoiceCompositions, 210 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1998, independent: 1968, independent conditional: 1968, independent unconditional: 0, dependent: 30, dependent conditional: 30, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1998, independent: 1968, independent conditional: 0, independent unconditional: 1968, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1998, independent: 1968, independent conditional: 0, independent unconditional: 1968, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1998, independent: 1968, independent conditional: 0, independent unconditional: 1968, dependent: 30, dependent conditional: 0, dependent unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1666, independent: 1651, independent conditional: 0, independent unconditional: 1651, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1666, independent: 1643, independent conditional: 0, independent unconditional: 1643, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 23, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 83, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1998, independent: 317, independent conditional: 0, independent unconditional: 317, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 1666, unknown conditional: 0, unknown unconditional: 1666] , Statistics on independence cache: Total cache size (in pairs): 2751, Positive cache size: 2736, Positive conditional cache size: 0, Positive unconditional cache size: 2736, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, 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, 37 PlacesBefore, 37 PlacesAfterwards, 44 TransitionsBefore, 44 TransitionsAfterwards, 38 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.8s, 40 PlacesBefore, 39 PlacesAfterwards, 59 TransitionsBefore, 58 TransitionsAfterwards, 38 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 43 PlacesBefore, 43 PlacesAfterwards, 118 TransitionsBefore, 118 TransitionsAfterwards, 70 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 46 PlacesBefore, 46 PlacesAfterwards, 163 TransitionsBefore, 163 TransitionsAfterwards, 104 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 48 PlacesBefore, 48 PlacesAfterwards, 250 TransitionsBefore, 250 TransitionsAfterwards, 208 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 50 PlacesBefore, 50 PlacesAfterwards, 271 TransitionsBefore, 271 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.8s, 64 PlacesBefore, 63 PlacesAfterwards, 817 TransitionsBefore, 816 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.3s, 90 PlacesBefore, 89 PlacesAfterwards, 1749 TransitionsBefore, 1748 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 248 PlacesBefore, 248 PlacesAfterwards, 9664 TransitionsBefore, 9664 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - TimeoutResultAtElement [Line: 156]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 148]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 150]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 149]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 277 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 687.2s, OverallIterations: 10, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 536.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.1s, HoareTripleCheckerStatistics: 3 mSolverCounterUnknown, 5499 SdHoareTripleChecker+Valid, 11.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5499 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 10.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 997 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7471 IncrementalHoareTripleChecker+Invalid, 8471 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 997 mSolverCounterUnsat, 0 mSDtfsCounter, 7471 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 697 GetRequests, 202 SyntacticMatches, 8 SemanticMatches, 487 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 35533 ImplicationChecksByTransitivity, 61.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=767412occurred in iteration=10, InterpolantAutomatonStates: 439, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 123.9s InterpolantComputationTime, 386 NumberOfCodeBlocks, 386 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 489 ConstructedInterpolants, 4 QuantifiedInterpolants, 5008 SizeOfPredicates, 174 NumberOfNonLiveVariables, 1616 ConjunctsInSsa, 77 ConjunctsInUnsatCore, 18 InterpolantComputations, 6 PerfectInterpolantSequences, 29/99 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown !ENTRY org.eclipse.osgi 4 0 2022-12-06 02:39:53.179 !MESSAGE Application error !STACK 1 org.eclipse.core.internal.resources.ResourceException(/)[568]: java.io.FileNotFoundException: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37dec20ed/.metadata/.plugins/org.eclipse.core.resources/.root/1.tree (No such file or directory) at java.base/java.io.FileOutputStream.open0(Native Method) at java.base/java.io.FileOutputStream.open(FileOutputStream.java:298) at java.base/java.io.FileOutputStream.(FileOutputStream.java:237) at java.base/java.io.FileOutputStream.(FileOutputStream.java:187) at org.eclipse.core.internal.localstore.SafeFileOutputStream.(SafeFileOutputStream.java:55) at org.eclipse.core.internal.resources.SaveManager.saveTree(SaveManager.java:1381) at org.eclipse.core.internal.resources.SaveManager.save(SaveManager.java:1168) at org.eclipse.core.internal.resources.Workspace.save(Workspace.java:2333) at org.eclipse.core.internal.resources.Workspace.save(Workspace.java:2322) at de.uni_freiburg.informatik.ultimate.core.coreplugin.UltimateCore.start(UltimateCore.java:191) at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203) at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134) at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104) at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401) at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255) at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method) at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62) at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43) at java.base/java.lang.reflect.Method.invoke(Method.java:566) at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:657) at org.eclipse.equinox.launcher.Main.basicRun(Main.java:594) at org.eclipse.equinox.launcher.Main.run(Main.java:1465) at org.eclipse.equinox.launcher.Main.main(Main.java:1438) An error has occurred. See the log file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37dec20ed/.metadata/.log.