/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/parallel-misc-3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 05:18:20,668 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 05:18:20,669 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 05:18:20,692 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 05:18:20,692 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 05:18:20,694 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 05:18:20,697 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 05:18:20,700 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 05:18:20,705 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 05:18:20,707 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 05:18:20,707 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 05:18:20,708 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 05:18:20,708 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 05:18:20,709 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 05:18:20,709 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 05:18:20,710 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 05:18:20,711 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 05:18:20,711 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 05:18:20,712 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 05:18:20,713 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 05:18:20,714 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 05:18:20,719 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 05:18:20,720 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 05:18:20,721 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 05:18:20,730 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 05:18:20,730 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 05:18:20,731 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 05:18:20,732 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 05:18:20,732 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 05:18:20,733 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 05:18:20,734 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 05:18:20,735 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 05:18:20,736 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 05:18:20,737 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 05:18:20,737 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 05:18:20,737 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 05:18:20,738 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 05:18:20,738 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 05:18:20,738 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 05:18:20,739 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 05:18:20,739 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 05:18:20,743 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 05:18:20,773 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 05:18:20,773 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 05:18:20,775 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 05:18:20,775 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 05:18:20,775 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 05:18:20,776 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 05:18:20,776 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 05:18:20,776 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 05:18:20,776 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 05:18:20,776 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 05:18:20,777 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 05:18:20,777 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 05:18:20,777 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 05:18:20,777 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 05:18:20,777 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 05:18:20,777 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 05:18:20,777 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 05:18:20,778 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 05:18:20,778 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 05:18:20,778 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 05:18:20,778 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 05:18:20,778 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:18:20,778 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 05:18:20,778 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 05:18:20,778 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 05:18:20,779 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 05:18:20,779 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 05:18:20,779 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 05:18:20,779 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 05:18:21,079 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 05:18:21,097 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 05:18:21,100 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 05:18:21,101 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 05:18:21,101 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 05:18:21,102 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-misc-3.wvr.c [2022-12-06 05:18:22,287 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 05:18:22,553 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 05:18:22,554 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-3.wvr.c [2022-12-06 05:18:22,560 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78e4301a6/0def38bf65304b5685328a605fe5e9e1/FLAG1a8677c95 [2022-12-06 05:18:22,577 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78e4301a6/0def38bf65304b5685328a605fe5e9e1 [2022-12-06 05:18:22,579 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 05:18:22,580 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 05:18:22,584 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 05:18:22,584 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 05:18:22,586 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 05:18:22,587 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:18:22" (1/1) ... [2022-12-06 05:18:22,588 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b11a4b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:18:22, skipping insertion in model container [2022-12-06 05:18:22,588 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:18:22" (1/1) ... [2022-12-06 05:18:22,595 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 05:18:22,612 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 05:18:22,751 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:18:22,752 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:18:22,752 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:18:22,753 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:18:22,758 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:18:22,759 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:18:22,759 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:18:22,760 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:18:22,772 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/parallel-misc-3.wvr.c[2410,2423] [2022-12-06 05:18:22,776 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:18:22,784 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 05:18:22,796 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:18:22,797 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:18:22,797 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:18:22,797 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:18:22,802 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:18:22,803 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:18:22,803 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:18:22,803 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:18:22,815 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/parallel-misc-3.wvr.c[2410,2423] [2022-12-06 05:18:22,817 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:18:22,827 INFO L208 MainTranslator]: Completed translation [2022-12-06 05:18:22,828 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:18:22 WrapperNode [2022-12-06 05:18:22,828 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 05:18:22,829 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 05:18:22,829 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 05:18:22,830 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 05:18:22,834 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:18:22" (1/1) ... [2022-12-06 05:18:22,846 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:18:22" (1/1) ... [2022-12-06 05:18:22,862 INFO L138 Inliner]: procedures = 21, calls = 27, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 53 [2022-12-06 05:18:22,863 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 05:18:22,864 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 05:18:22,864 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 05:18:22,864 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 05:18:22,871 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:18:22" (1/1) ... [2022-12-06 05:18:22,872 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:18:22" (1/1) ... [2022-12-06 05:18:22,875 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:18:22" (1/1) ... [2022-12-06 05:18:22,877 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:18:22" (1/1) ... [2022-12-06 05:18:22,890 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:18:22" (1/1) ... [2022-12-06 05:18:22,892 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:18:22" (1/1) ... [2022-12-06 05:18:22,899 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:18:22" (1/1) ... [2022-12-06 05:18:22,899 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:18:22" (1/1) ... [2022-12-06 05:18:22,901 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 05:18:22,901 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 05:18:22,901 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 05:18:22,902 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 05:18:22,902 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:18:22" (1/1) ... [2022-12-06 05:18:22,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:18:22,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:18:22,937 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 05:18:22,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 05:18:22,981 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 05:18:22,981 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 05:18:22,982 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 05:18:22,982 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 05:18:22,982 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 05:18:22,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 05:18:22,982 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 05:18:22,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 05:18:22,982 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 05:18:22,982 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 05:18:22,983 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 05:18:22,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 05:18:22,983 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 05:18:22,983 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 05:18:22,984 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 05:18:23,075 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 05:18:23,076 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 05:18:23,266 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 05:18:23,304 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 05:18:23,305 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-06 05:18:23,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:18:23 BoogieIcfgContainer [2022-12-06 05:18:23,307 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 05:18:23,309 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 05:18:23,309 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 05:18:23,312 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 05:18:23,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 05:18:22" (1/3) ... [2022-12-06 05:18:23,313 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e65493c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:18:23, skipping insertion in model container [2022-12-06 05:18:23,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:18:22" (2/3) ... [2022-12-06 05:18:23,313 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e65493c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:18:23, skipping insertion in model container [2022-12-06 05:18:23,313 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:18:23" (3/3) ... [2022-12-06 05:18:23,314 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-misc-3.wvr.c [2022-12-06 05:18:23,367 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 05:18:23,367 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 05:18:23,367 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 05:18:23,456 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-06 05:18:23,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 86 places, 90 transitions, 196 flow [2022-12-06 05:18:23,573 INFO L130 PetriNetUnfolder]: 11/88 cut-off events. [2022-12-06 05:18:23,574 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 05:18:23,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 88 events. 11/88 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 91 event pairs, 0 based on Foata normal form. 0/76 useless extension candidates. Maximal degree in co-relation 48. Up to 4 conditions per place. [2022-12-06 05:18:23,579 INFO L82 GeneralOperation]: Start removeDead. Operand has 86 places, 90 transitions, 196 flow [2022-12-06 05:18:23,582 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 76 places, 80 transitions, 172 flow [2022-12-06 05:18:23,587 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:23,607 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 80 transitions, 172 flow [2022-12-06 05:18:23,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 80 transitions, 172 flow [2022-12-06 05:18:23,653 INFO L130 PetriNetUnfolder]: 11/80 cut-off events. [2022-12-06 05:18:23,653 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 05:18:23,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89 conditions, 80 events. 11/80 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 90 event pairs, 0 based on Foata normal form. 0/69 useless extension candidates. Maximal degree in co-relation 48. Up to 4 conditions per place. [2022-12-06 05:18:23,658 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 80 transitions, 172 flow [2022-12-06 05:18:23,658 INFO L188 LiptonReduction]: Number of co-enabled transitions 1088 [2022-12-06 05:18:26,363 INFO L203 LiptonReduction]: Total number of compositions: 65 [2022-12-06 05:18:26,374 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 05:18:26,378 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;@4cdb26f5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 05:18:26,379 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-06 05:18:26,381 INFO L130 PetriNetUnfolder]: 2/12 cut-off events. [2022-12-06 05:18:26,381 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 05:18:26,381 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:26,382 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:18:26,382 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:18:26,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:26,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1161558226, now seen corresponding path program 1 times [2022-12-06 05:18:26,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:26,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961565582] [2022-12-06 05:18:26,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:26,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:26,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:26,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:18:26,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:26,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961565582] [2022-12-06 05:18:26,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961565582] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:26,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:26,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 05:18:26,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78105977] [2022-12-06 05:18:26,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:26,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:18:26,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:26,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:18:26,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:18:26,580 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 13 [2022-12-06 05:18:26,581 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 18 places, 13 transitions, 38 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:18:26,582 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:26,582 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 13 [2022-12-06 05:18:26,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:26,618 INFO L130 PetriNetUnfolder]: 29/54 cut-off events. [2022-12-06 05:18:26,618 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-12-06 05:18:26,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 54 events. 29/54 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 93 event pairs, 1 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 90. Up to 45 conditions per place. [2022-12-06 05:18:26,620 INFO L137 encePairwiseOnDemand]: 10/13 looper letters, 17 selfloop transitions, 2 changer transitions 0/19 dead transitions. [2022-12-06 05:18:26,620 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 20 places, 19 transitions, 91 flow [2022-12-06 05:18:26,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:18:26,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:18:26,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 20 transitions. [2022-12-06 05:18:26,629 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5128205128205128 [2022-12-06 05:18:26,630 INFO L175 Difference]: Start difference. First operand has 18 places, 13 transitions, 38 flow. Second operand 3 states and 20 transitions. [2022-12-06 05:18:26,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 20 places, 19 transitions, 91 flow [2022-12-06 05:18:26,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 16 places, 19 transitions, 81 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 05:18:26,635 INFO L231 Difference]: Finished difference. Result has 17 places, 14 transitions, 42 flow [2022-12-06 05:18:26,637 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=13, PETRI_DIFFERENCE_MINUEND_FLOW=30, PETRI_DIFFERENCE_MINUEND_PLACES=14, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=13, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=42, PETRI_PLACES=17, PETRI_TRANSITIONS=14} [2022-12-06 05:18:26,639 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, -1 predicate places. [2022-12-06 05:18:26,639 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:26,639 INFO L89 Accepts]: Start accepts. Operand has 17 places, 14 transitions, 42 flow [2022-12-06 05:18:26,641 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:26,641 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:26,641 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 17 places, 14 transitions, 42 flow [2022-12-06 05:18:26,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 17 places, 14 transitions, 42 flow [2022-12-06 05:18:26,645 INFO L130 PetriNetUnfolder]: 2/14 cut-off events. [2022-12-06 05:18:26,645 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 05:18:26,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24 conditions, 14 events. 2/14 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 6 event pairs, 0 based on Foata normal form. 0/12 useless extension candidates. Maximal degree in co-relation 14. Up to 4 conditions per place. [2022-12-06 05:18:26,645 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 17 places, 14 transitions, 42 flow [2022-12-06 05:18:26,646 INFO L188 LiptonReduction]: Number of co-enabled transitions 42 [2022-12-06 05:18:26,646 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:18:26,647 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-06 05:18:26,647 INFO L495 AbstractCegarLoop]: Abstraction has has 17 places, 14 transitions, 42 flow [2022-12-06 05:18:26,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:18:26,647 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:26,647 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:18:26,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 05:18:26,648 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:18:26,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:26,648 INFO L85 PathProgramCache]: Analyzing trace with hash -824867760, now seen corresponding path program 1 times [2022-12-06 05:18:26,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:26,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508251525] [2022-12-06 05:18:26,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:26,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:26,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:26,730 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 05:18:26,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:26,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508251525] [2022-12-06 05:18:26,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508251525] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:18:26,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:18:26,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 05:18:26,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581674388] [2022-12-06 05:18:26,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:18:26,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:18:26,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:26,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:18:26,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:18:26,733 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 13 [2022-12-06 05:18:26,733 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 17 places, 14 transitions, 42 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:18:26,733 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:26,734 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 13 [2022-12-06 05:18:26,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:26,763 INFO L130 PetriNetUnfolder]: 40/73 cut-off events. [2022-12-06 05:18:26,764 INFO L131 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2022-12-06 05:18:26,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 73 events. 40/73 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 140 event pairs, 6 based on Foata normal form. 0/57 useless extension candidates. Maximal degree in co-relation 112. Up to 49 conditions per place. [2022-12-06 05:18:26,765 INFO L137 encePairwiseOnDemand]: 10/13 looper letters, 19 selfloop transitions, 2 changer transitions 0/21 dead transitions. [2022-12-06 05:18:26,765 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 19 places, 21 transitions, 106 flow [2022-12-06 05:18:26,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:18:26,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:18:26,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 20 transitions. [2022-12-06 05:18:26,766 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5128205128205128 [2022-12-06 05:18:26,766 INFO L175 Difference]: Start difference. First operand has 17 places, 14 transitions, 42 flow. Second operand 3 states and 20 transitions. [2022-12-06 05:18:26,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 19 places, 21 transitions, 106 flow [2022-12-06 05:18:26,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 18 places, 21 transitions, 103 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 05:18:26,766 INFO L231 Difference]: Finished difference. Result has 19 places, 15 transitions, 52 flow [2022-12-06 05:18:26,767 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=13, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=16, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=19, PETRI_TRANSITIONS=15} [2022-12-06 05:18:26,767 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 1 predicate places. [2022-12-06 05:18:26,767 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:26,767 INFO L89 Accepts]: Start accepts. Operand has 19 places, 15 transitions, 52 flow [2022-12-06 05:18:26,768 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:26,768 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:26,768 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 19 places, 15 transitions, 52 flow [2022-12-06 05:18:26,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 19 places, 15 transitions, 52 flow [2022-12-06 05:18:26,771 INFO L130 PetriNetUnfolder]: 2/15 cut-off events. [2022-12-06 05:18:26,771 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 05:18:26,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30 conditions, 15 events. 2/15 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 10 event pairs, 0 based on Foata normal form. 0/13 useless extension candidates. Maximal degree in co-relation 15. Up to 4 conditions per place. [2022-12-06 05:18:26,772 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 19 places, 15 transitions, 52 flow [2022-12-06 05:18:26,772 INFO L188 LiptonReduction]: Number of co-enabled transitions 54 [2022-12-06 05:18:26,772 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:18:26,773 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6 [2022-12-06 05:18:26,773 INFO L495 AbstractCegarLoop]: Abstraction has has 19 places, 15 transitions, 52 flow [2022-12-06 05:18:26,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:18:26,773 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:26,774 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:18:26,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 05:18:26,774 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:18:26,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:26,774 INFO L85 PathProgramCache]: Analyzing trace with hash 596881523, now seen corresponding path program 1 times [2022-12-06 05:18:26,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:26,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366601403] [2022-12-06 05:18:26,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:26,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:26,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:27,019 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:18:27,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:27,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366601403] [2022-12-06 05:18:27,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366601403] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:18:27,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [931347813] [2022-12-06 05:18:27,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:27,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:18:27,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:18:27,023 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:18:27,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-06 05:18:27,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:27,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-06 05:18:27,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:18:27,299 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:18:27,299 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:18:27,507 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:18:27,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [931347813] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:18:27,507 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:18:27,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 3] total 8 [2022-12-06 05:18:27,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279635853] [2022-12-06 05:18:27,507 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:18:27,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 05:18:27,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:27,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 05:18:27,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-12-06 05:18:27,509 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 13 [2022-12-06 05:18:27,509 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 19 places, 15 transitions, 52 flow. Second operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:18:27,509 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:27,509 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 13 [2022-12-06 05:18:27,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:27,684 INFO L130 PetriNetUnfolder]: 65/116 cut-off events. [2022-12-06 05:18:27,684 INFO L131 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2022-12-06 05:18:27,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 334 conditions, 116 events. 65/116 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 264 event pairs, 0 based on Foata normal form. 0/96 useless extension candidates. Maximal degree in co-relation 100. Up to 41 conditions per place. [2022-12-06 05:18:27,685 INFO L137 encePairwiseOnDemand]: 8/13 looper letters, 40 selfloop transitions, 18 changer transitions 0/58 dead transitions. [2022-12-06 05:18:27,685 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 58 transitions, 305 flow [2022-12-06 05:18:27,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 05:18:27,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 05:18:27,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 65 transitions. [2022-12-06 05:18:27,687 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.38461538461538464 [2022-12-06 05:18:27,687 INFO L175 Difference]: Start difference. First operand has 19 places, 15 transitions, 52 flow. Second operand 13 states and 65 transitions. [2022-12-06 05:18:27,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 58 transitions, 305 flow [2022-12-06 05:18:27,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 58 transitions, 301 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 05:18:27,689 INFO L231 Difference]: Finished difference. Result has 36 places, 29 transitions, 184 flow [2022-12-06 05:18:27,689 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=13, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=18, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=184, PETRI_PLACES=36, PETRI_TRANSITIONS=29} [2022-12-06 05:18:27,689 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 18 predicate places. [2022-12-06 05:18:27,690 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:27,690 INFO L89 Accepts]: Start accepts. Operand has 36 places, 29 transitions, 184 flow [2022-12-06 05:18:27,691 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:27,691 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:27,691 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 29 transitions, 184 flow [2022-12-06 05:18:27,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 29 transitions, 184 flow [2022-12-06 05:18:27,696 INFO L130 PetriNetUnfolder]: 14/42 cut-off events. [2022-12-06 05:18:27,696 INFO L131 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2022-12-06 05:18:27,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153 conditions, 42 events. 14/42 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 88 event pairs, 0 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 125. Up to 16 conditions per place. [2022-12-06 05:18:27,697 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 29 transitions, 184 flow [2022-12-06 05:18:27,697 INFO L188 LiptonReduction]: Number of co-enabled transitions 88 [2022-12-06 05:18:28,333 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [340] L75-1-->thread2EXIT: Formula: (and (= (mod v_~g2~0_In_4 256) 0) (= |v_thread2Thread1of1ForFork1_#res.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res.offset_Out_4| 0)) InVars {~g2~0=v_~g2~0_In_4} OutVars{~g2~0=v_~g2~0_In_4, thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_Out_4|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base] and [344] L53-1-->L53-1: Formula: (let ((.cse4 (= (mod v_~d1~0_60 256) 0))) (and (let ((.cse0 (= (mod v_~d1~0_59 256) 0)) (.cse2 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_28| 256) 0)) (.cse3 (= v_~g1~0_37 v_~g1~0_36)) (.cse1 (= v_~d1~0_59 (ite (= (ite .cse4 1 0) 0) 0 1)))) (or (and (not .cse0) (= v_~g1~0_36 0) .cse1 (not .cse2)) (and .cse0 .cse3 .cse1) (and .cse2 .cse3 .cse1))) (let ((.cse5 (not (= (mod v_~g1~0_37 256) 0)))) (or (and (= |v_thread1Thread1of1ForFork0_#t~post1_14| |v_thread1Thread1of1ForFork0_#t~post1_13|) (= (+ v_~pos~0_67 1) v_~pos~0_68) .cse4 .cse5) (and (not .cse4) (= (+ v_~pos~0_68 1) v_~pos~0_67) .cse5 (= |v_thread1Thread1of1ForFork0_#t~post2_14| |v_thread1Thread1of1ForFork0_#t~post2_13|)))))) InVars {~g1~0=v_~g1~0_37, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_28|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_14|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_14|, ~pos~0=v_~pos~0_68, ~d1~0=v_~d1~0_60} OutVars{~g1~0=v_~g1~0_36, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_13|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_13|, ~pos~0=v_~pos~0_67, ~d1~0=v_~d1~0_59} AuxVars[] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] [2022-12-06 05:18:29,380 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [340] L75-1-->thread2EXIT: Formula: (and (= (mod v_~g2~0_In_4 256) 0) (= |v_thread2Thread1of1ForFork1_#res.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res.offset_Out_4| 0)) InVars {~g2~0=v_~g2~0_In_4} OutVars{~g2~0=v_~g2~0_In_4, thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_Out_4|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base] and [347] L53-1-->L53-1: Formula: (let ((.cse7 (= (mod v_~d1~0_71 256) 0)) (.cse8 (+ v_~pos~0_85 1)) (.cse4 (= (mod v_~d1~0_70 256) 0))) (and (let ((.cse1 (= v_~g1~0_47 v_~g1~0_46)) (.cse0 (= (ite (= 0 (ite .cse4 1 0)) 0 1) v_~d1~0_69)) (.cse2 (= (mod v_~d1~0_69 256) 0)) (.cse3 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_38| 256) 0))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse1 .cse3) (and (= v_~g1~0_46 0) .cse0 (not .cse2) (not .cse3)))) (let ((.cse5 (= v_~g1~0_48 v_~g1~0_47)) (.cse6 (= v_~d1~0_70 (ite (= (ite .cse7 1 0) 0) 0 1)))) (or (and (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_39| 256) 0) .cse5 .cse6) (and .cse4 .cse5 .cse6))) (or (and (= (+ v_~pos~0_86 1) v_~pos~0_85) (not .cse7) (= |v_thread1Thread1of1ForFork0_#t~post2_25| |v_thread1Thread1of1ForFork0_#t~post2_24|)) (and (= .cse8 v_~pos~0_86) (= |v_thread1Thread1of1ForFork0_#t~post1_25| |v_thread1Thread1of1ForFork0_#t~post1_24|) .cse7)) (let ((.cse9 (not (= (mod v_~g1~0_47 256) 0)))) (or (and (= .cse8 v_~pos~0_84) .cse9 (= |v_thread1Thread1of1ForFork0_#t~post2_24| |v_thread1Thread1of1ForFork0_#t~post2_23|) (not .cse4)) (and .cse9 .cse4 (= (+ v_~pos~0_84 1) v_~pos~0_85) (= |v_thread1Thread1of1ForFork0_#t~post1_24| |v_thread1Thread1of1ForFork0_#t~post1_23|)))))) InVars {~g1~0=v_~g1~0_48, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_39|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_25|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_25|, ~pos~0=v_~pos~0_86, ~d1~0=v_~d1~0_71} OutVars{~g1~0=v_~g1~0_46, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_23|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_23|, ~pos~0=v_~pos~0_84, ~d1~0=v_~d1~0_69} AuxVars[v_~pos~0_85, v_~g1~0_47, |v_thread1Thread1of1ForFork0_#t~post1_24|, v_~d1~0_70, |v_thread1Thread1of1ForFork0_#t~nondet3_38|, |v_thread1Thread1of1ForFork0_#t~post2_24|] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] [2022-12-06 05:18:30,561 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [345] L75-1-->L75-1: Formula: (let ((.cse0 (= (mod v_~d2~0_58 256) 0))) (and (let ((.cse1 (not (= (mod v_~g2~0_47 256) 0)))) (or (and .cse0 (= (+ 2 v_~pos~0_77) v_~pos~0_78) .cse1) (and (= (+ 2 v_~pos~0_78) v_~pos~0_77) .cse1 (not .cse0)))) (let ((.cse2 (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_32| 256) 0)) (.cse3 (= v_~d2~0_57 (ite (= 0 (ite .cse0 1 0)) 0 1))) (.cse4 (= v_~g2~0_46 v_~g2~0_47)) (.cse5 (= (mod v_~d2~0_57 256) 0))) (or (and .cse2 .cse3 .cse4) (and (= v_~g2~0_46 0) .cse3 (not .cse2) (not .cse5)) (and .cse3 .cse4 .cse5))))) InVars {~g2~0=v_~g2~0_47, thread2Thread1of1ForFork1_#t~nondet4=|v_thread2Thread1of1ForFork1_#t~nondet4_32|, ~pos~0=v_~pos~0_78, ~d2~0=v_~d2~0_58} OutVars{~g2~0=v_~g2~0_46, ~pos~0=v_~pos~0_77, ~d2~0=v_~d2~0_57} AuxVars[] AssignedVars[~g2~0, thread2Thread1of1ForFork1_#t~nondet4, ~pos~0, ~d2~0] and [344] L53-1-->L53-1: Formula: (let ((.cse4 (= (mod v_~d1~0_60 256) 0))) (and (let ((.cse0 (= (mod v_~d1~0_59 256) 0)) (.cse2 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_28| 256) 0)) (.cse3 (= v_~g1~0_37 v_~g1~0_36)) (.cse1 (= v_~d1~0_59 (ite (= (ite .cse4 1 0) 0) 0 1)))) (or (and (not .cse0) (= v_~g1~0_36 0) .cse1 (not .cse2)) (and .cse0 .cse3 .cse1) (and .cse2 .cse3 .cse1))) (let ((.cse5 (not (= (mod v_~g1~0_37 256) 0)))) (or (and (= |v_thread1Thread1of1ForFork0_#t~post1_14| |v_thread1Thread1of1ForFork0_#t~post1_13|) (= (+ v_~pos~0_67 1) v_~pos~0_68) .cse4 .cse5) (and (not .cse4) (= (+ v_~pos~0_68 1) v_~pos~0_67) .cse5 (= |v_thread1Thread1of1ForFork0_#t~post2_14| |v_thread1Thread1of1ForFork0_#t~post2_13|)))))) InVars {~g1~0=v_~g1~0_37, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_28|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_14|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_14|, ~pos~0=v_~pos~0_68, ~d1~0=v_~d1~0_60} OutVars{~g1~0=v_~g1~0_36, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_13|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_13|, ~pos~0=v_~pos~0_67, ~d1~0=v_~d1~0_59} AuxVars[] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] [2022-12-06 05:18:31,061 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [344] L53-1-->L53-1: Formula: (let ((.cse4 (= (mod v_~d1~0_60 256) 0))) (and (let ((.cse0 (= (mod v_~d1~0_59 256) 0)) (.cse2 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_28| 256) 0)) (.cse3 (= v_~g1~0_37 v_~g1~0_36)) (.cse1 (= v_~d1~0_59 (ite (= (ite .cse4 1 0) 0) 0 1)))) (or (and (not .cse0) (= v_~g1~0_36 0) .cse1 (not .cse2)) (and .cse0 .cse3 .cse1) (and .cse2 .cse3 .cse1))) (let ((.cse5 (not (= (mod v_~g1~0_37 256) 0)))) (or (and (= |v_thread1Thread1of1ForFork0_#t~post1_14| |v_thread1Thread1of1ForFork0_#t~post1_13|) (= (+ v_~pos~0_67 1) v_~pos~0_68) .cse4 .cse5) (and (not .cse4) (= (+ v_~pos~0_68 1) v_~pos~0_67) .cse5 (= |v_thread1Thread1of1ForFork0_#t~post2_14| |v_thread1Thread1of1ForFork0_#t~post2_13|)))))) InVars {~g1~0=v_~g1~0_37, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_28|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_14|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_14|, ~pos~0=v_~pos~0_68, ~d1~0=v_~d1~0_60} OutVars{~g1~0=v_~g1~0_36, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_13|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_13|, ~pos~0=v_~pos~0_67, ~d1~0=v_~d1~0_59} AuxVars[] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] and [345] L75-1-->L75-1: Formula: (let ((.cse0 (= (mod v_~d2~0_58 256) 0))) (and (let ((.cse1 (not (= (mod v_~g2~0_47 256) 0)))) (or (and .cse0 (= (+ 2 v_~pos~0_77) v_~pos~0_78) .cse1) (and (= (+ 2 v_~pos~0_78) v_~pos~0_77) .cse1 (not .cse0)))) (let ((.cse2 (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_32| 256) 0)) (.cse3 (= v_~d2~0_57 (ite (= 0 (ite .cse0 1 0)) 0 1))) (.cse4 (= v_~g2~0_46 v_~g2~0_47)) (.cse5 (= (mod v_~d2~0_57 256) 0))) (or (and .cse2 .cse3 .cse4) (and (= v_~g2~0_46 0) .cse3 (not .cse2) (not .cse5)) (and .cse3 .cse4 .cse5))))) InVars {~g2~0=v_~g2~0_47, thread2Thread1of1ForFork1_#t~nondet4=|v_thread2Thread1of1ForFork1_#t~nondet4_32|, ~pos~0=v_~pos~0_78, ~d2~0=v_~d2~0_58} OutVars{~g2~0=v_~g2~0_46, ~pos~0=v_~pos~0_77, ~d2~0=v_~d2~0_57} AuxVars[] AssignedVars[~g2~0, thread2Thread1of1ForFork1_#t~nondet4, ~pos~0, ~d2~0] [2022-12-06 05:18:32,135 INFO L203 LiptonReduction]: Total number of compositions: 5 [2022-12-06 05:18:32,136 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4446 [2022-12-06 05:18:32,136 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 26 transitions, 187 flow [2022-12-06 05:18:32,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:18:32,136 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:18:32,136 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:18:32,164 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-06 05:18:32,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:18:32,343 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:18:32,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:18:32,344 INFO L85 PathProgramCache]: Analyzing trace with hash -124370473, now seen corresponding path program 1 times [2022-12-06 05:18:32,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:18:32,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964427734] [2022-12-06 05:18:32,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:32,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:18:32,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:32,993 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:18:32,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:18:32,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964427734] [2022-12-06 05:18:32,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964427734] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:18:33,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1369704861] [2022-12-06 05:18:33,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:18:33,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:18:33,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:18:33,010 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 05:18:33,022 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 05:18:33,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:18:33,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 21 conjunts are in the unsatisfiable core [2022-12-06 05:18:33,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:18:33,267 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:18:33,267 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:18:33,617 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:18:33,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1369704861] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:18:33,621 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:18:33,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 3] total 10 [2022-12-06 05:18:33,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102521873] [2022-12-06 05:18:33,622 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:18:33,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 05:18:33,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:18:33,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 05:18:33,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2022-12-06 05:18:33,625 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 20 [2022-12-06 05:18:33,625 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 26 transitions, 187 flow. Second operand has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:18:33,625 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:18:33,625 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 20 [2022-12-06 05:18:33,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:18:33,964 INFO L130 PetriNetUnfolder]: 138/243 cut-off events. [2022-12-06 05:18:33,964 INFO L131 PetriNetUnfolder]: For 461/461 co-relation queries the response was YES. [2022-12-06 05:18:33,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1166 conditions, 243 events. 138/243 cut-off events. For 461/461 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 803 event pairs, 0 based on Foata normal form. 2/215 useless extension candidates. Maximal degree in co-relation 515. Up to 111 conditions per place. [2022-12-06 05:18:33,967 INFO L137 encePairwiseOnDemand]: 8/20 looper letters, 48 selfloop transitions, 31 changer transitions 6/85 dead transitions. [2022-12-06 05:18:33,967 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 85 transitions, 721 flow [2022-12-06 05:18:33,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 05:18:33,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 05:18:33,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 80 transitions. [2022-12-06 05:18:33,969 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2022-12-06 05:18:33,969 INFO L175 Difference]: Start difference. First operand has 33 places, 26 transitions, 187 flow. Second operand 11 states and 80 transitions. [2022-12-06 05:18:33,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 85 transitions, 721 flow [2022-12-06 05:18:33,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 85 transitions, 573 flow, removed 65 selfloop flow, removed 4 redundant places. [2022-12-06 05:18:33,975 INFO L231 Difference]: Finished difference. Result has 41 places, 47 transitions, 360 flow [2022-12-06 05:18:33,975 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=360, PETRI_PLACES=41, PETRI_TRANSITIONS=47} [2022-12-06 05:18:33,975 INFO L294 CegarLoopForPetriNet]: 18 programPoint places, 23 predicate places. [2022-12-06 05:18:33,976 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:18:33,976 INFO L89 Accepts]: Start accepts. Operand has 41 places, 47 transitions, 360 flow [2022-12-06 05:18:33,976 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:18:33,977 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:18:33,977 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 47 transitions, 360 flow [2022-12-06 05:18:33,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 47 transitions, 360 flow [2022-12-06 05:18:33,988 INFO L130 PetriNetUnfolder]: 30/89 cut-off events. [2022-12-06 05:18:33,988 INFO L131 PetriNetUnfolder]: For 112/116 co-relation queries the response was YES. [2022-12-06 05:18:33,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 322 conditions, 89 events. 30/89 cut-off events. For 112/116 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 316 event pairs, 1 based on Foata normal form. 0/87 useless extension candidates. Maximal degree in co-relation 283. Up to 36 conditions per place. [2022-12-06 05:18:33,989 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 47 transitions, 360 flow [2022-12-06 05:18:33,989 INFO L188 LiptonReduction]: Number of co-enabled transitions 152 [2022-12-06 05:18:34,759 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [344] L53-1-->L53-1: Formula: (let ((.cse4 (= (mod v_~d1~0_60 256) 0))) (and (let ((.cse0 (= (mod v_~d1~0_59 256) 0)) (.cse2 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_28| 256) 0)) (.cse3 (= v_~g1~0_37 v_~g1~0_36)) (.cse1 (= v_~d1~0_59 (ite (= (ite .cse4 1 0) 0) 0 1)))) (or (and (not .cse0) (= v_~g1~0_36 0) .cse1 (not .cse2)) (and .cse0 .cse3 .cse1) (and .cse2 .cse3 .cse1))) (let ((.cse5 (not (= (mod v_~g1~0_37 256) 0)))) (or (and (= |v_thread1Thread1of1ForFork0_#t~post1_14| |v_thread1Thread1of1ForFork0_#t~post1_13|) (= (+ v_~pos~0_67 1) v_~pos~0_68) .cse4 .cse5) (and (not .cse4) (= (+ v_~pos~0_68 1) v_~pos~0_67) .cse5 (= |v_thread1Thread1of1ForFork0_#t~post2_14| |v_thread1Thread1of1ForFork0_#t~post2_13|)))))) InVars {~g1~0=v_~g1~0_37, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_28|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_14|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_14|, ~pos~0=v_~pos~0_68, ~d1~0=v_~d1~0_60} OutVars{~g1~0=v_~g1~0_36, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_13|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_13|, ~pos~0=v_~pos~0_67, ~d1~0=v_~d1~0_59} AuxVars[] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] and [345] L75-1-->L75-1: Formula: (let ((.cse0 (= (mod v_~d2~0_58 256) 0))) (and (let ((.cse1 (not (= (mod v_~g2~0_47 256) 0)))) (or (and .cse0 (= (+ 2 v_~pos~0_77) v_~pos~0_78) .cse1) (and (= (+ 2 v_~pos~0_78) v_~pos~0_77) .cse1 (not .cse0)))) (let ((.cse2 (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_32| 256) 0)) (.cse3 (= v_~d2~0_57 (ite (= 0 (ite .cse0 1 0)) 0 1))) (.cse4 (= v_~g2~0_46 v_~g2~0_47)) (.cse5 (= (mod v_~d2~0_57 256) 0))) (or (and .cse2 .cse3 .cse4) (and (= v_~g2~0_46 0) .cse3 (not .cse2) (not .cse5)) (and .cse3 .cse4 .cse5))))) InVars {~g2~0=v_~g2~0_47, thread2Thread1of1ForFork1_#t~nondet4=|v_thread2Thread1of1ForFork1_#t~nondet4_32|, ~pos~0=v_~pos~0_78, ~d2~0=v_~d2~0_58} OutVars{~g2~0=v_~g2~0_46, ~pos~0=v_~pos~0_77, ~d2~0=v_~d2~0_57} AuxVars[] AssignedVars[~g2~0, thread2Thread1of1ForFork1_#t~nondet4, ~pos~0, ~d2~0] [2022-12-06 05:18:35,276 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [344] L53-1-->L53-1: Formula: (let ((.cse4 (= (mod v_~d1~0_60 256) 0))) (and (let ((.cse0 (= (mod v_~d1~0_59 256) 0)) (.cse2 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_28| 256) 0)) (.cse3 (= v_~g1~0_37 v_~g1~0_36)) (.cse1 (= v_~d1~0_59 (ite (= (ite .cse4 1 0) 0) 0 1)))) (or (and (not .cse0) (= v_~g1~0_36 0) .cse1 (not .cse2)) (and .cse0 .cse3 .cse1) (and .cse2 .cse3 .cse1))) (let ((.cse5 (not (= (mod v_~g1~0_37 256) 0)))) (or (and (= |v_thread1Thread1of1ForFork0_#t~post1_14| |v_thread1Thread1of1ForFork0_#t~post1_13|) (= (+ v_~pos~0_67 1) v_~pos~0_68) .cse4 .cse5) (and (not .cse4) (= (+ v_~pos~0_68 1) v_~pos~0_67) .cse5 (= |v_thread1Thread1of1ForFork0_#t~post2_14| |v_thread1Thread1of1ForFork0_#t~post2_13|)))))) InVars {~g1~0=v_~g1~0_37, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_28|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_14|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_14|, ~pos~0=v_~pos~0_68, ~d1~0=v_~d1~0_60} OutVars{~g1~0=v_~g1~0_36, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_13|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_13|, ~pos~0=v_~pos~0_67, ~d1~0=v_~d1~0_59} AuxVars[] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] and [348] L75-1-->L53-1: Formula: (let ((.cse4 (= (mod v_~d1~0_76 256) 0))) (and (= |v_thread2Thread1of1ForFork1_#res.offset_13| 0) (let ((.cse0 (= v_~g1~0_53 v_~g1~0_52)) (.cse3 (= (mod v_~d1~0_75 256) 0)) (.cse1 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_44| 256) 0)) (.cse2 (= v_~d1~0_75 (ite (= (ite .cse4 1 0) 0) 0 1)))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse2 .cse3) (and (not .cse3) (not .cse1) (= v_~g1~0_52 0) .cse2))) (= (mod v_~g2~0_52 256) 0) (let ((.cse5 (not (= (mod v_~g1~0_53 256) 0)))) (or (and (not .cse4) (= (+ v_~pos~0_91 1) v_~pos~0_90) (= |v_thread1Thread1of1ForFork0_#t~post2_30| |v_thread1Thread1of1ForFork0_#t~post2_29|) .cse5) (and (= (+ v_~pos~0_90 1) v_~pos~0_91) (= |v_thread1Thread1of1ForFork0_#t~post1_29| |v_thread1Thread1of1ForFork0_#t~post1_30|) .cse4 .cse5))) (= |v_thread2Thread1of1ForFork1_#res.base_13| 0))) InVars {~g2~0=v_~g2~0_52, ~g1~0=v_~g1~0_53, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_44|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_30|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_30|, ~pos~0=v_~pos~0_91, ~d1~0=v_~d1~0_76} OutVars{~g2~0=v_~g2~0_52, ~g1~0=v_~g1~0_52, thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_13|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_29|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_29|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_13|, ~pos~0=v_~pos~0_90, ~d1~0=v_~d1~0_75} AuxVars[] AssignedVars[~g1~0, thread2Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread2Thread1of1ForFork1_#res.base, ~pos~0, ~d1~0] [2022-12-06 05:18:36,008 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [340] L75-1-->thread2EXIT: Formula: (and (= (mod v_~g2~0_In_4 256) 0) (= |v_thread2Thread1of1ForFork1_#res.base_Out_4| 0) (= |v_thread2Thread1of1ForFork1_#res.offset_Out_4| 0)) InVars {~g2~0=v_~g2~0_In_4} OutVars{~g2~0=v_~g2~0_In_4, thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_Out_4|, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_Out_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base] and [344] L53-1-->L53-1: Formula: (let ((.cse4 (= (mod v_~d1~0_60 256) 0))) (and (let ((.cse0 (= (mod v_~d1~0_59 256) 0)) (.cse2 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_28| 256) 0)) (.cse3 (= v_~g1~0_37 v_~g1~0_36)) (.cse1 (= v_~d1~0_59 (ite (= (ite .cse4 1 0) 0) 0 1)))) (or (and (not .cse0) (= v_~g1~0_36 0) .cse1 (not .cse2)) (and .cse0 .cse3 .cse1) (and .cse2 .cse3 .cse1))) (let ((.cse5 (not (= (mod v_~g1~0_37 256) 0)))) (or (and (= |v_thread1Thread1of1ForFork0_#t~post1_14| |v_thread1Thread1of1ForFork0_#t~post1_13|) (= (+ v_~pos~0_67 1) v_~pos~0_68) .cse4 .cse5) (and (not .cse4) (= (+ v_~pos~0_68 1) v_~pos~0_67) .cse5 (= |v_thread1Thread1of1ForFork0_#t~post2_14| |v_thread1Thread1of1ForFork0_#t~post2_13|)))))) InVars {~g1~0=v_~g1~0_37, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_28|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_14|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_14|, ~pos~0=v_~pos~0_68, ~d1~0=v_~d1~0_60} OutVars{~g1~0=v_~g1~0_36, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_13|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_13|, ~pos~0=v_~pos~0_67, ~d1~0=v_~d1~0_59} AuxVars[] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] [2022-12-06 05:18:36,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-06 05:18:36,545 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,SelfDestructingSolverStorable3 [2022-12-06 05:18:36,547 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Function c_aux_v_thread1Thread1of1ForFork0_#t~post2_80 is already defined. at de.uni_freiburg.informatik.ultimate.logic.NoopScript.declareFun(NoopScript.java:229) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.declareFun(Scriptor.java:115) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.declareFun(WrapperScript.java:137) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.declareFun(WrapperScript.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.declareFun(HistoryRecordingScript.java:95) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.declareFun(ManagedScript.java:172) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.variables.ProgramVarUtils.constructConstantForAuxVar(ProgramVarUtils.java:117) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.computeClosedFormula(UnmodifiableTransFormula.java:135) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.(UnmodifiableTransFormula.java:90) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaBuilder.finishConstruction(TransFormulaBuilder.java:324) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.BranchEncoderRenaming.applyToTransFormula(BranchEncoderRenaming.java:114) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.BranchEncoderRenaming.applyToIcfgEdge(BranchEncoderRenaming.java:134) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.IcfgCompositionFactory.composeSequential(IcfgCompositionFactory.java:119) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.IcfgCompositionFactory.composeSequential(IcfgCompositionFactory.java:1) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.CompositionFactoryWithCacheUpdate.composeSequential(CompositionFactoryWithCacheUpdate.java:67) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.CompositionFactoryWithCacheUpdate.composeSequential(CompositionFactoryWithCacheUpdate.java:1) at de.uni_freiburg.informatik.ultimate.automata.partialorder.SequenceRule.executeComposition(SequenceRule.java:724) at de.uni_freiburg.informatik.ultimate.automata.partialorder.SequenceRule.applyInternal(SequenceRule.java:150) at de.uni_freiburg.informatik.ultimate.automata.partialorder.ReductionRule.apply(ReductionRule.java:80) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.sequenceRuleWrapper(LiptonReduction.java:252) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.performReduction(LiptonReduction.java:199) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.(LiptonReduction.java:143) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.PetriNetLargeBlockEncoding.(PetriNetLargeBlockEncoding.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.refineAbstraction(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-06 05:18:36,551 INFO L158 Benchmark]: Toolchain (without parser) took 13970.16ms. Allocated memory was 168.8MB in the beginning and 293.6MB in the end (delta: 124.8MB). Free memory was 145.8MB in the beginning and 251.0MB in the end (delta: -105.2MB). Peak memory consumption was 140.7MB. Max. memory is 8.0GB. [2022-12-06 05:18:36,551 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 168.8MB. Free memory is still 145.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 05:18:36,551 INFO L158 Benchmark]: CACSL2BoogieTranslator took 244.50ms. Allocated memory is still 168.8MB. Free memory was 145.2MB in the beginning and 133.6MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-06 05:18:36,551 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.60ms. Allocated memory is still 168.8MB. Free memory was 133.6MB in the beginning and 132.1MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 05:18:36,552 INFO L158 Benchmark]: Boogie Preprocessor took 37.06ms. Allocated memory is still 168.8MB. Free memory was 132.1MB in the beginning and 130.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 05:18:36,552 INFO L158 Benchmark]: RCFGBuilder took 405.71ms. Allocated memory is still 168.8MB. Free memory was 130.6MB in the beginning and 116.9MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-12-06 05:18:36,552 INFO L158 Benchmark]: TraceAbstraction took 13241.05ms. Allocated memory was 168.8MB in the beginning and 293.6MB in the end (delta: 124.8MB). Free memory was 116.4MB in the beginning and 251.0MB in the end (delta: -134.6MB). Peak memory consumption was 112.4MB. Max. memory is 8.0GB. [2022-12-06 05:18:36,553 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.12ms. Allocated memory is still 168.8MB. Free memory is still 145.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 244.50ms. Allocated memory is still 168.8MB. Free memory was 145.2MB in the beginning and 133.6MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 33.60ms. Allocated memory is still 168.8MB. Free memory was 133.6MB in the beginning and 132.1MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.06ms. Allocated memory is still 168.8MB. Free memory was 132.1MB in the beginning and 130.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 405.71ms. Allocated memory is still 168.8MB. Free memory was 130.6MB in the beginning and 116.9MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 13241.05ms. Allocated memory was 168.8MB in the beginning and 293.6MB in the end (delta: 124.8MB). Free memory was 116.4MB in the beginning and 251.0MB in the end (delta: -134.6MB). Peak memory consumption was 112.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.7s, 76 PlacesBefore, 18 PlacesAfterwards, 80 TransitionsBefore, 13 TransitionsAfterwards, 1088 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 29 TrivialYvCompositions, 29 ConcurrentYvCompositions, 7 ChoiceCompositions, 65 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 592, independent: 592, independent conditional: 592, 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: 592, independent: 592, independent conditional: 0, independent unconditional: 592, 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: 592, independent: 592, independent conditional: 0, independent unconditional: 592, 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: 592, independent: 592, independent conditional: 0, independent unconditional: 592, 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: 499, independent: 499, independent conditional: 0, independent unconditional: 499, 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: 499, independent: 497, independent conditional: 0, independent unconditional: 497, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 12, independent: 12, independent conditional: 0, independent unconditional: 12, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 592, independent: 93, independent conditional: 0, independent unconditional: 93, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 499, unknown conditional: 0, unknown unconditional: 499] , Statistics on independence cache: Total cache size (in pairs): 901, Positive cache size: 901, Positive conditional cache size: 0, Positive unconditional cache size: 901, 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, 17 PlacesBefore, 17 PlacesAfterwards, 14 TransitionsBefore, 14 TransitionsAfterwards, 42 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, 19 PlacesBefore, 19 PlacesAfterwards, 15 TransitionsBefore, 15 TransitionsAfterwards, 54 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: 4.4s, 36 PlacesBefore, 33 PlacesAfterwards, 29 TransitionsBefore, 26 TransitionsAfterwards, 88 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, independent: 16, independent conditional: 16, 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: 16, independent: 16, independent conditional: 16, 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: 16, independent: 16, independent conditional: 14, independent unconditional: 2, 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: 16, independent: 16, independent conditional: 14, independent unconditional: 2, 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: 11, independent: 11, independent conditional: 10, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 11, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 1, independent conditional: 1, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 16, independent: 5, independent conditional: 4, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 11, unknown conditional: 10, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 31, Positive cache size: 31, Positive conditional cache size: 30, Positive unconditional cache size: 1, 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: 2, Maximal queried relation: 0 - ExceptionOrErrorResult: SMTLIBException: Function c_aux_v_thread1Thread1of1ForFork0_#t~post2_80 is already defined. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Function c_aux_v_thread1Thread1of1ForFork0_#t~post2_80 is already defined.: de.uni_freiburg.informatik.ultimate.logic.NoopScript.declareFun(NoopScript.java:229) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-12-06 05:18:36,574 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...