/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/parallel-misc-3-extended.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 00:03:25,953 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 00:03:25,956 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 00:03:26,005 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 00:03:26,006 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 00:03:26,008 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 00:03:26,011 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 00:03:26,017 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 00:03:26,021 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 00:03:26,026 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 00:03:26,028 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 00:03:26,030 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 00:03:26,030 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 00:03:26,032 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 00:03:26,033 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 00:03:26,036 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 00:03:26,037 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 00:03:26,037 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 00:03:26,040 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 00:03:26,044 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 00:03:26,046 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 00:03:26,047 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 00:03:26,047 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 00:03:26,048 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 00:03:26,055 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 00:03:26,056 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 00:03:26,056 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 00:03:26,058 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 00:03:26,058 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 00:03:26,059 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 00:03:26,059 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 00:03:26,061 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 00:03:26,062 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 00:03:26,063 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 00:03:26,064 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 00:03:26,064 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 00:03:26,064 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 00:03:26,064 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 00:03:26,065 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 00:03:26,065 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 00:03:26,066 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 00:03:26,067 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2022-12-06 00:03:26,100 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 00:03:26,101 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 00:03:26,103 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 00:03:26,103 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 00:03:26,103 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 00:03:26,104 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 00:03:26,104 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 00:03:26,104 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 00:03:26,104 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 00:03:26,104 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 00:03:26,105 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 00:03:26,105 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 00:03:26,105 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 00:03:26,105 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 00:03:26,105 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 00:03:26,106 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 00:03:26,106 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 00:03:26,106 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 00:03:26,106 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 00:03:26,106 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 00:03:26,106 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 00:03:26,106 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 00:03:26,106 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 00:03:26,107 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 00:03:26,107 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 00:03:26,107 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 00:03:26,107 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 00:03:26,107 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 00:03:26,107 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 00:03:26,431 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 00:03:26,450 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 00:03:26,452 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 00:03:26,453 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 00:03:26,454 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 00:03:26,455 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-misc-3-extended.wvr.c [2022-12-06 00:03:28,059 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 00:03:28,314 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 00:03:28,315 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-3-extended.wvr.c [2022-12-06 00:03:28,320 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8594dee43/2e8433deee0e4ac3b3267f98b9dd8cff/FLAG42c6d0b8e [2022-12-06 00:03:28,334 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8594dee43/2e8433deee0e4ac3b3267f98b9dd8cff [2022-12-06 00:03:28,336 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 00:03:28,337 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 00:03:28,338 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 00:03:28,338 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 00:03:28,341 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 00:03:28,341 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 12:03:28" (1/1) ... [2022-12-06 00:03:28,342 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68546735 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:03:28, skipping insertion in model container [2022-12-06 00:03:28,342 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 12:03:28" (1/1) ... [2022-12-06 00:03:28,347 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 00:03:28,360 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 00:03:28,465 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:03:28,467 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:03:28,468 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:03:28,468 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:03:28,472 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:03:28,472 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:03:28,472 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:03:28,473 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:03:28,474 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:03:28,474 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:03:28,475 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:03:28,475 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:03:28,481 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-extended.wvr.c[2856,2869] [2022-12-06 00:03:28,485 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 00:03:28,493 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 00:03:28,502 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:03:28,502 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:03:28,502 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:03:28,503 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:03:28,507 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:03:28,508 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:03:28,508 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:03:28,509 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:03:28,514 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:03:28,515 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:03:28,515 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 00:03:28,516 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 00:03:28,529 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-extended.wvr.c[2856,2869] [2022-12-06 00:03:28,530 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 00:03:28,545 INFO L208 MainTranslator]: Completed translation [2022-12-06 00:03:28,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:03:28 WrapperNode [2022-12-06 00:03:28,546 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 00:03:28,547 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 00:03:28,547 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 00:03:28,547 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 00:03:28,553 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:03:28" (1/1) ... [2022-12-06 00:03:28,566 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:03:28" (1/1) ... [2022-12-06 00:03:28,587 INFO L138 Inliner]: procedures = 22, calls = 37, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 71 [2022-12-06 00:03:28,587 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 00:03:28,588 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 00:03:28,588 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 00:03:28,588 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 00:03:28,595 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:03:28" (1/1) ... [2022-12-06 00:03:28,595 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:03:28" (1/1) ... [2022-12-06 00:03:28,605 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:03:28" (1/1) ... [2022-12-06 00:03:28,606 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:03:28" (1/1) ... [2022-12-06 00:03:28,613 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:03:28" (1/1) ... [2022-12-06 00:03:28,615 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:03:28" (1/1) ... [2022-12-06 00:03:28,616 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:03:28" (1/1) ... [2022-12-06 00:03:28,617 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:03:28" (1/1) ... [2022-12-06 00:03:28,618 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 00:03:28,619 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 00:03:28,619 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 00:03:28,619 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 00:03:28,620 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:03:28" (1/1) ... [2022-12-06 00:03:28,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 00:03:28,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:03:28,652 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 00:03:28,671 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 00:03:28,684 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 00:03:28,684 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 00:03:28,684 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 00:03:28,684 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 00:03:28,684 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 00:03:28,684 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 00:03:28,684 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 00:03:28,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 00:03:28,684 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 00:03:28,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 00:03:28,684 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 00:03:28,684 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 00:03:28,685 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 00:03:28,685 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 00:03:28,685 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 00:03:28,685 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 00:03:28,686 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 00:03:28,781 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 00:03:28,783 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 00:03:29,062 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 00:03:29,085 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 00:03:29,086 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-06 00:03:29,087 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 12:03:29 BoogieIcfgContainer [2022-12-06 00:03:29,088 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 00:03:29,089 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 00:03:29,089 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 00:03:29,094 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 00:03:29,095 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 12:03:28" (1/3) ... [2022-12-06 00:03:29,095 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@447cc4a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 12:03:29, skipping insertion in model container [2022-12-06 00:03:29,096 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 12:03:28" (2/3) ... [2022-12-06 00:03:29,096 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@447cc4a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 12:03:29, skipping insertion in model container [2022-12-06 00:03:29,096 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 12:03:29" (3/3) ... [2022-12-06 00:03:29,097 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-misc-3-extended.wvr.c [2022-12-06 00:03:29,112 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 00:03:29,113 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 00:03:29,113 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 00:03:29,181 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-06 00:03:29,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 124 transitions, 272 flow [2022-12-06 00:03:29,298 INFO L130 PetriNetUnfolder]: 16/121 cut-off events. [2022-12-06 00:03:29,298 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 00:03:29,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 121 events. 16/121 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 128 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 78. Up to 4 conditions per place. [2022-12-06 00:03:29,304 INFO L82 GeneralOperation]: Start removeDead. Operand has 118 places, 124 transitions, 272 flow [2022-12-06 00:03:29,307 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 105 places, 111 transitions, 240 flow [2022-12-06 00:03:29,309 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:03:29,321 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 111 transitions, 240 flow [2022-12-06 00:03:29,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 105 places, 111 transitions, 240 flow [2022-12-06 00:03:29,346 INFO L130 PetriNetUnfolder]: 16/111 cut-off events. [2022-12-06 00:03:29,346 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 00:03:29,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 111 events. 16/111 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 126 event pairs, 0 based on Foata normal form. 0/95 useless extension candidates. Maximal degree in co-relation 78. Up to 4 conditions per place. [2022-12-06 00:03:29,350 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 111 transitions, 240 flow [2022-12-06 00:03:29,350 INFO L188 LiptonReduction]: Number of co-enabled transitions 2958 [2022-12-06 00:03:33,010 INFO L203 LiptonReduction]: Total number of compositions: 89 [2022-12-06 00:03:33,022 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 00:03:33,027 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;@263a41c9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 00:03:33,027 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 00:03:33,031 INFO L130 PetriNetUnfolder]: 3/18 cut-off events. [2022-12-06 00:03:33,031 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 00:03:33,031 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:03:33,032 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:03:33,032 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:03:33,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:03:33,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1291747388, now seen corresponding path program 1 times [2022-12-06 00:03:33,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:03:33,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531461246] [2022-12-06 00:03:33,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:03:33,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:03:33,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:03:33,307 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 00:03:33,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:03:33,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531461246] [2022-12-06 00:03:33,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531461246] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:03:33,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:03:33,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 00:03:33,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441145724] [2022-12-06 00:03:33,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:03:33,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 00:03:33,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:03:33,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 00:03:33,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 00:03:33,334 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 00:03:33,336 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 19 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 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 00:03:33,336 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:03:33,336 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 00:03:33,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:03:33,428 INFO L130 PetriNetUnfolder]: 111/168 cut-off events. [2022-12-06 00:03:33,429 INFO L131 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2022-12-06 00:03:33,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 365 conditions, 168 events. 111/168 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 336 event pairs, 17 based on Foata normal form. 0/114 useless extension candidates. Maximal degree in co-relation 244. Up to 105 conditions per place. [2022-12-06 00:03:33,432 INFO L137 encePairwiseOnDemand]: 16/19 looper letters, 27 selfloop transitions, 2 changer transitions 0/29 dead transitions. [2022-12-06 00:03:33,432 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 29 transitions, 140 flow [2022-12-06 00:03:33,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 00:03:33,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 00:03:33,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2022-12-06 00:03:33,442 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5263157894736842 [2022-12-06 00:03:33,443 INFO L175 Difference]: Start difference. First operand has 26 places, 19 transitions, 56 flow. Second operand 3 states and 30 transitions. [2022-12-06 00:03:33,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 29 transitions, 140 flow [2022-12-06 00:03:33,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 29 transitions, 124 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-12-06 00:03:33,449 INFO L231 Difference]: Finished difference. Result has 23 places, 20 transitions, 56 flow [2022-12-06 00:03:33,451 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=23, PETRI_TRANSITIONS=20} [2022-12-06 00:03:33,455 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, -3 predicate places. [2022-12-06 00:03:33,455 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:03:33,456 INFO L89 Accepts]: Start accepts. Operand has 23 places, 20 transitions, 56 flow [2022-12-06 00:03:33,458 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:03:33,458 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:03:33,458 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 23 places, 20 transitions, 56 flow [2022-12-06 00:03:33,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 20 transitions, 56 flow [2022-12-06 00:03:33,466 INFO L130 PetriNetUnfolder]: 3/20 cut-off events. [2022-12-06 00:03:33,469 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 00:03:33,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31 conditions, 20 events. 3/20 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 9 event pairs, 0 based on Foata normal form. 0/17 useless extension candidates. Maximal degree in co-relation 17. Up to 4 conditions per place. [2022-12-06 00:03:33,469 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 20 transitions, 56 flow [2022-12-06 00:03:33,469 INFO L188 LiptonReduction]: Number of co-enabled transitions 102 [2022-12-06 00:03:33,470 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:03:33,472 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 17 [2022-12-06 00:03:33,472 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 20 transitions, 56 flow [2022-12-06 00:03:33,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 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 00:03:33,472 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:03:33,472 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:03:33,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 00:03:33,475 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:03:33,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:03:33,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1393409920, now seen corresponding path program 1 times [2022-12-06 00:03:33,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:03:33,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951676985] [2022-12-06 00:03:33,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:03:33,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:03:33,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:03:33,620 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 00:03:33,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:03:33,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951676985] [2022-12-06 00:03:33,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951676985] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:03:33,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:03:33,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 00:03:33,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013285734] [2022-12-06 00:03:33,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:03:33,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 00:03:33,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:03:33,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 00:03:33,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 00:03:33,622 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 00:03:33,622 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 20 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 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 00:03:33,623 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:03:33,623 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 00:03:33,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:03:33,680 INFO L130 PetriNetUnfolder]: 151/226 cut-off events. [2022-12-06 00:03:33,680 INFO L131 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2022-12-06 00:03:33,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 539 conditions, 226 events. 151/226 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 542 event pairs, 11 based on Foata normal form. 0/160 useless extension candidates. Maximal degree in co-relation 188. Up to 185 conditions per place. [2022-12-06 00:03:33,683 INFO L137 encePairwiseOnDemand]: 16/19 looper letters, 29 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2022-12-06 00:03:33,683 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 31 transitions, 149 flow [2022-12-06 00:03:33,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 00:03:33,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 00:03:33,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2022-12-06 00:03:33,685 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5263157894736842 [2022-12-06 00:03:33,685 INFO L175 Difference]: Start difference. First operand has 23 places, 20 transitions, 56 flow. Second operand 3 states and 30 transitions. [2022-12-06 00:03:33,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 31 transitions, 149 flow [2022-12-06 00:03:33,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 31 transitions, 146 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 00:03:33,686 INFO L231 Difference]: Finished difference. Result has 25 places, 21 transitions, 66 flow [2022-12-06 00:03:33,687 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=25, PETRI_TRANSITIONS=21} [2022-12-06 00:03:33,687 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, -1 predicate places. [2022-12-06 00:03:33,687 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:03:33,687 INFO L89 Accepts]: Start accepts. Operand has 25 places, 21 transitions, 66 flow [2022-12-06 00:03:33,688 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:03:33,688 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:03:33,689 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 25 places, 21 transitions, 66 flow [2022-12-06 00:03:33,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 21 transitions, 66 flow [2022-12-06 00:03:33,692 INFO L130 PetriNetUnfolder]: 3/21 cut-off events. [2022-12-06 00:03:33,692 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 00:03:33,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 21 events. 3/21 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 12 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 25. Up to 4 conditions per place. [2022-12-06 00:03:33,693 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 25 places, 21 transitions, 66 flow [2022-12-06 00:03:33,693 INFO L188 LiptonReduction]: Number of co-enabled transitions 122 [2022-12-06 00:03:33,694 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:03:33,694 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-06 00:03:33,695 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 21 transitions, 66 flow [2022-12-06 00:03:33,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 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 00:03:33,695 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:03:33,695 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:03:33,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 00:03:33,695 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:03:33,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:03:33,696 INFO L85 PathProgramCache]: Analyzing trace with hash -506728048, now seen corresponding path program 1 times [2022-12-06 00:03:33,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:03:33,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577929926] [2022-12-06 00:03:33,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:03:33,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:03:33,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:03:33,780 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 00:03:33,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:03:33,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577929926] [2022-12-06 00:03:33,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577929926] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 00:03:33,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 00:03:33,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 00:03:33,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608343049] [2022-12-06 00:03:33,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 00:03:33,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 00:03:33,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:03:33,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 00:03:33,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 00:03:33,785 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 00:03:33,785 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 21 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:33,785 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:03:33,785 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 00:03:33,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:03:33,840 INFO L130 PetriNetUnfolder]: 220/325 cut-off events. [2022-12-06 00:03:33,840 INFO L131 PetriNetUnfolder]: For 102/102 co-relation queries the response was YES. [2022-12-06 00:03:33,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 852 conditions, 325 events. 220/325 cut-off events. For 102/102 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 877 event pairs, 28 based on Foata normal form. 0/243 useless extension candidates. Maximal degree in co-relation 586. Up to 243 conditions per place. [2022-12-06 00:03:33,845 INFO L137 encePairwiseOnDemand]: 16/19 looper letters, 31 selfloop transitions, 2 changer transitions 0/33 dead transitions. [2022-12-06 00:03:33,845 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 33 transitions, 171 flow [2022-12-06 00:03:33,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 00:03:33,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 00:03:33,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2022-12-06 00:03:33,847 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5263157894736842 [2022-12-06 00:03:33,847 INFO L175 Difference]: Start difference. First operand has 25 places, 21 transitions, 66 flow. Second operand 3 states and 30 transitions. [2022-12-06 00:03:33,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 33 transitions, 171 flow [2022-12-06 00:03:33,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 33 transitions, 168 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 00:03:33,848 INFO L231 Difference]: Finished difference. Result has 27 places, 22 transitions, 76 flow [2022-12-06 00:03:33,849 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=27, PETRI_TRANSITIONS=22} [2022-12-06 00:03:33,849 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 1 predicate places. [2022-12-06 00:03:33,850 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:03:33,850 INFO L89 Accepts]: Start accepts. Operand has 27 places, 22 transitions, 76 flow [2022-12-06 00:03:33,851 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:03:33,851 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:03:33,851 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 27 places, 22 transitions, 76 flow [2022-12-06 00:03:33,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 22 transitions, 76 flow [2022-12-06 00:03:33,857 INFO L130 PetriNetUnfolder]: 3/22 cut-off events. [2022-12-06 00:03:33,857 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 00:03:33,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 22 events. 3/22 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 14 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 26. Up to 4 conditions per place. [2022-12-06 00:03:33,857 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 22 transitions, 76 flow [2022-12-06 00:03:33,857 INFO L188 LiptonReduction]: Number of co-enabled transitions 144 [2022-12-06 00:03:33,858 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 00:03:33,858 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 8 [2022-12-06 00:03:33,858 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 22 transitions, 76 flow [2022-12-06 00:03:33,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 00:03:33,859 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:03:33,859 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:03:33,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 00:03:33,862 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:03:33,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:03:33,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1812541563, now seen corresponding path program 1 times [2022-12-06 00:03:33,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:03:33,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348093916] [2022-12-06 00:03:33,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:03:33,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:03:33,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:03:34,123 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 00:03:34,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:03:34,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348093916] [2022-12-06 00:03:34,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348093916] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:03:34,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939074701] [2022-12-06 00:03:34,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:03:34,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:03:34,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:03:34,127 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 00:03:34,148 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 00:03:34,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:03:34,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-06 00:03:34,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:03:34,383 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 00:03:34,383 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:03:34,603 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 00:03:34,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [939074701] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:03:34,604 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:03:34,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 8 [2022-12-06 00:03:34,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524615516] [2022-12-06 00:03:34,604 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:03:34,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 00:03:34,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:03:34,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 00:03:34,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=40, Unknown=0, NotChecked=0, Total=72 [2022-12-06 00:03:34,608 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 00:03:34,608 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 22 transitions, 76 flow. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 states have internal predecessors, (48), 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 00:03:34,608 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:03:34,608 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 00:03:34,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:03:34,757 INFO L130 PetriNetUnfolder]: 319/470 cut-off events. [2022-12-06 00:03:34,757 INFO L131 PetriNetUnfolder]: For 188/188 co-relation queries the response was YES. [2022-12-06 00:03:34,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1355 conditions, 470 events. 319/470 cut-off events. For 188/188 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1386 event pairs, 12 based on Foata normal form. 0/360 useless extension candidates. Maximal degree in co-relation 500. Up to 145 conditions per place. [2022-12-06 00:03:34,760 INFO L137 encePairwiseOnDemand]: 14/19 looper letters, 67 selfloop transitions, 11 changer transitions 0/78 dead transitions. [2022-12-06 00:03:34,760 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 78 transitions, 418 flow [2022-12-06 00:03:34,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 00:03:34,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 00:03:34,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 70 transitions. [2022-12-06 00:03:34,761 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4605263157894737 [2022-12-06 00:03:34,761 INFO L175 Difference]: Start difference. First operand has 27 places, 22 transitions, 76 flow. Second operand 8 states and 70 transitions. [2022-12-06 00:03:34,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 78 transitions, 418 flow [2022-12-06 00:03:34,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 78 transitions, 415 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 00:03:34,772 INFO L231 Difference]: Finished difference. Result has 36 places, 30 transitions, 149 flow [2022-12-06 00:03:34,772 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=149, PETRI_PLACES=36, PETRI_TRANSITIONS=30} [2022-12-06 00:03:34,773 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 10 predicate places. [2022-12-06 00:03:34,773 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:03:34,773 INFO L89 Accepts]: Start accepts. Operand has 36 places, 30 transitions, 149 flow [2022-12-06 00:03:34,774 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:03:34,774 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:03:34,774 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 30 transitions, 149 flow [2022-12-06 00:03:34,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 30 transitions, 149 flow [2022-12-06 00:03:34,778 INFO L130 PetriNetUnfolder]: 10/36 cut-off events. [2022-12-06 00:03:34,778 INFO L131 PetriNetUnfolder]: For 18/19 co-relation queries the response was YES. [2022-12-06 00:03:34,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 36 events. 10/36 cut-off events. For 18/19 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 54 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 81. Up to 13 conditions per place. [2022-12-06 00:03:34,778 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 30 transitions, 149 flow [2022-12-06 00:03:34,778 INFO L188 LiptonReduction]: Number of co-enabled transitions 240 [2022-12-06 00:03:34,823 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [476] L97-1-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork2_#res.base_Out_4| 0) (= (mod v_~g3~0_In_6 256) 0)) InVars {~g3~0=v_~g3~0_In_6} OutVars{thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_Out_4|, ~g3~0=v_~g3~0_In_6, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base] and [483] L75-1-->L75-1: Formula: (and (let ((.cse1 (= v_~g2~0_49 v_~g2~0_48)) (.cse2 (= (mod v_~d2~0_83 256) 0)) (.cse0 (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_32| 256) 0))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (not .cse2) (= v_~g2~0_48 0) (not .cse0)))) (let ((.cse5 (= (mod v_~d2~0_84 256) 0))) (let ((.cse3 (not (= (mod v_~g2~0_49 256) 0))) (.cse4 (= v_~d2~0_83 (ite (= (ite .cse5 1 0) 0) 0 1)))) (or (and .cse3 .cse4 .cse5 (= v_~pos~0_174 (+ v_~pos~0_173 2))) (and .cse3 (= v_~pos~0_173 (+ v_~pos~0_174 2)) .cse4 (not .cse5)))))) InVars {~g2~0=v_~g2~0_49, thread2Thread1of1ForFork1_#t~nondet4=|v_thread2Thread1of1ForFork1_#t~nondet4_32|, ~pos~0=v_~pos~0_174, ~d2~0=v_~d2~0_84} OutVars{~g2~0=v_~g2~0_48, ~pos~0=v_~pos~0_173, ~d2~0=v_~d2~0_83} AuxVars[] AssignedVars[~g2~0, thread2Thread1of1ForFork1_#t~nondet4, ~pos~0, ~d2~0] [2022-12-06 00:03:35,220 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [476] L97-1-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork2_#res.base_Out_4| 0) (= (mod v_~g3~0_In_6 256) 0)) InVars {~g3~0=v_~g3~0_In_6} OutVars{thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_Out_4|, ~g3~0=v_~g3~0_In_6, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base] and [473] L75-1-->thread2EXIT: Formula: (and (= |v_thread2Thread1of1ForFork1_#res.base_Out_4| 0) (= (mod v_~g2~0_In_1 256) 0) (= |v_thread2Thread1of1ForFork1_#res.offset_Out_4| 0)) InVars {~g2~0=v_~g2~0_In_1} OutVars{~g2~0=v_~g2~0_In_1, 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] [2022-12-06 00:03:35,277 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [476] L97-1-->thread3EXIT: Formula: (and (= |v_thread3Thread1of1ForFork2_#res.offset_Out_4| 0) (= |v_thread3Thread1of1ForFork2_#res.base_Out_4| 0) (= (mod v_~g3~0_In_6 256) 0)) InVars {~g3~0=v_~g3~0_In_6} OutVars{thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_Out_4|, ~g3~0=v_~g3~0_In_6, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_Out_4|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base] and [483] L75-1-->L75-1: Formula: (and (let ((.cse1 (= v_~g2~0_49 v_~g2~0_48)) (.cse2 (= (mod v_~d2~0_83 256) 0)) (.cse0 (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_32| 256) 0))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (not .cse2) (= v_~g2~0_48 0) (not .cse0)))) (let ((.cse5 (= (mod v_~d2~0_84 256) 0))) (let ((.cse3 (not (= (mod v_~g2~0_49 256) 0))) (.cse4 (= v_~d2~0_83 (ite (= (ite .cse5 1 0) 0) 0 1)))) (or (and .cse3 .cse4 .cse5 (= v_~pos~0_174 (+ v_~pos~0_173 2))) (and .cse3 (= v_~pos~0_173 (+ v_~pos~0_174 2)) .cse4 (not .cse5)))))) InVars {~g2~0=v_~g2~0_49, thread2Thread1of1ForFork1_#t~nondet4=|v_thread2Thread1of1ForFork1_#t~nondet4_32|, ~pos~0=v_~pos~0_174, ~d2~0=v_~d2~0_84} OutVars{~g2~0=v_~g2~0_48, ~pos~0=v_~pos~0_173, ~d2~0=v_~d2~0_83} AuxVars[] AssignedVars[~g2~0, thread2Thread1of1ForFork1_#t~nondet4, ~pos~0, ~d2~0] [2022-12-06 00:03:35,543 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 00:03:35,544 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 771 [2022-12-06 00:03:35,544 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 28 transitions, 148 flow [2022-12-06 00:03:35,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 states have internal predecessors, (48), 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 00:03:35,544 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 00:03:35,544 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 00:03:35,571 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 00:03:35,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:03:35,745 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 00:03:35,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 00:03:35,746 INFO L85 PathProgramCache]: Analyzing trace with hash 2102831478, now seen corresponding path program 2 times [2022-12-06 00:03:35,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 00:03:35,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141220830] [2022-12-06 00:03:35,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 00:03:35,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 00:03:35,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 00:03:35,934 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-06 00:03:35,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 00:03:35,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141220830] [2022-12-06 00:03:35,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141220830] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 00:03:35,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [381452225] [2022-12-06 00:03:35,935 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 00:03:35,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:03:35,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 00:03:35,937 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 00:03:35,939 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 00:03:36,030 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 00:03:36,030 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 00:03:36,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-06 00:03:36,033 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 00:03:36,072 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 00:03:36,073 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 00:03:36,177 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 00:03:36,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [381452225] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 00:03:36,177 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 00:03:36,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2022-12-06 00:03:36,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099928650] [2022-12-06 00:03:36,177 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 00:03:36,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 00:03:36,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 00:03:36,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 00:03:36,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-06 00:03:36,178 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 22 [2022-12-06 00:03:36,178 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 28 transitions, 148 flow. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 7 states have internal predecessors, (51), 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 00:03:36,179 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 00:03:36,179 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 22 [2022-12-06 00:03:36,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 00:03:36,361 INFO L130 PetriNetUnfolder]: 475/686 cut-off events. [2022-12-06 00:03:36,361 INFO L131 PetriNetUnfolder]: For 995/995 co-relation queries the response was YES. [2022-12-06 00:03:36,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2456 conditions, 686 events. 475/686 cut-off events. For 995/995 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2136 event pairs, 9 based on Foata normal form. 42/628 useless extension candidates. Maximal degree in co-relation 892. Up to 223 conditions per place. [2022-12-06 00:03:36,365 INFO L137 encePairwiseOnDemand]: 14/22 looper letters, 102 selfloop transitions, 30 changer transitions 0/132 dead transitions. [2022-12-06 00:03:36,365 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 132 transitions, 967 flow [2022-12-06 00:03:36,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-06 00:03:36,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-06 00:03:36,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 121 transitions. [2022-12-06 00:03:36,366 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4230769230769231 [2022-12-06 00:03:36,367 INFO L175 Difference]: Start difference. First operand has 34 places, 28 transitions, 148 flow. Second operand 13 states and 121 transitions. [2022-12-06 00:03:36,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 132 transitions, 967 flow [2022-12-06 00:03:36,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 132 transitions, 803 flow, removed 69 selfloop flow, removed 2 redundant places. [2022-12-06 00:03:36,371 INFO L231 Difference]: Finished difference. Result has 50 places, 50 transitions, 368 flow [2022-12-06 00:03:36,371 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=368, PETRI_PLACES=50, PETRI_TRANSITIONS=50} [2022-12-06 00:03:36,371 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 24 predicate places. [2022-12-06 00:03:36,372 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 00:03:36,372 INFO L89 Accepts]: Start accepts. Operand has 50 places, 50 transitions, 368 flow [2022-12-06 00:03:36,373 INFO L95 Accepts]: Finished accepts. [2022-12-06 00:03:36,373 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 00:03:36,373 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 50 transitions, 368 flow [2022-12-06 00:03:36,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 50 transitions, 368 flow [2022-12-06 00:03:36,382 INFO L130 PetriNetUnfolder]: 48/99 cut-off events. [2022-12-06 00:03:36,382 INFO L131 PetriNetUnfolder]: For 120/130 co-relation queries the response was YES. [2022-12-06 00:03:36,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 364 conditions, 99 events. 48/99 cut-off events. For 120/130 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 239 event pairs, 0 based on Foata normal form. 0/87 useless extension candidates. Maximal degree in co-relation 327. Up to 43 conditions per place. [2022-12-06 00:03:36,384 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 50 transitions, 368 flow [2022-12-06 00:03:36,384 INFO L188 LiptonReduction]: Number of co-enabled transitions 356 [2022-12-06 00:03:36,422 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [487] L97-1-->L75-1: Formula: (and (= (mod v_~g3~0_62 256) 0) (= |v_thread3Thread1of1ForFork2_#res.base_19| 0) (= |v_thread3Thread1of1ForFork2_#res.offset_19| 0) (let ((.cse0 (= (mod v_~d2~0_98 256) 0))) (let ((.cse1 (= (ite (= (ite .cse0 1 0) 0) 0 1) v_~d2~0_97)) (.cse2 (not (= (mod v_~g2~0_65 256) 0)))) (or (and .cse0 (= v_~pos~0_203 (+ v_~pos~0_202 2)) .cse1 .cse2) (and (= v_~pos~0_202 (+ v_~pos~0_203 2)) (not .cse0) .cse1 .cse2)))) (let ((.cse3 (= v_~g2~0_65 v_~g2~0_64)) (.cse5 (= (mod v_~d2~0_97 256) 0)) (.cse4 (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4_46| 256) 0))) (or (and .cse3 .cse4) (and .cse3 .cse5) (and (not .cse5) (not .cse4) (= v_~g2~0_64 0))))) InVars {~g2~0=v_~g2~0_65, ~g3~0=v_~g3~0_62, thread2Thread1of1ForFork1_#t~nondet4=|v_thread2Thread1of1ForFork1_#t~nondet4_46|, ~pos~0=v_~pos~0_203, ~d2~0=v_~d2~0_98} OutVars{~g2~0=v_~g2~0_64, ~g3~0=v_~g3~0_62, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_19|, ~pos~0=v_~pos~0_202, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_19|, ~d2~0=v_~d2~0_97} AuxVars[] AssignedVars[~g2~0, thread3Thread1of1ForFork2_#res.offset, thread2Thread1of1ForFork1_#t~nondet4, ~pos~0, thread3Thread1of1ForFork2_#res.base, ~d2~0] and [484] L53-1-->L53-1: Formula: (let ((.cse4 (= (mod v_~d1~0_74 256) 0))) (and (let ((.cse1 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_38| 256) 0)) (.cse0 (= (mod v_~d1~0_73 256) 0)) (.cse3 (= v_~g1~0_53 v_~g1~0_52)) (.cse2 (= v_~d1~0_73 (ite (= (ite .cse4 1 0) 0) 0 1)))) (or (and (not .cse0) (= v_~g1~0_52 0) (not .cse1) .cse2) (and .cse3 .cse2 .cse1) (and .cse0 .cse3 .cse2))) (let ((.cse5 (not (= (mod v_~g1~0_53 256) 0)))) (or (and (= v_~pos~0_190 (+ v_~pos~0_189 1)) (= |v_thread1Thread1of1ForFork0_#t~post1_28| |v_thread1Thread1of1ForFork0_#t~post1_27|) .cse4 .cse5) (and (not .cse4) (= |v_thread1Thread1of1ForFork0_#t~post2_28| |v_thread1Thread1of1ForFork0_#t~post2_27|) (= v_~pos~0_189 (+ v_~pos~0_190 1)) .cse5))))) InVars {~g1~0=v_~g1~0_53, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_38|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_28|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_28|, ~pos~0=v_~pos~0_190, ~d1~0=v_~d1~0_74} OutVars{~g1~0=v_~g1~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_27|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_27|, ~pos~0=v_~pos~0_189, ~d1~0=v_~d1~0_73} AuxVars[] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] [2022-12-06 00:03:36,951 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [486] L97-1-->thread2EXIT: Formula: (and (= (mod v_~g2~0_62 256) 0) (= |v_thread3Thread1of1ForFork2_#res.base_17| 0) (= |v_thread2Thread1of1ForFork1_#res.offset_15| 0) (= |v_thread2Thread1of1ForFork1_#res.base_15| 0) (= (mod v_~g3~0_60 256) 0) (= |v_thread3Thread1of1ForFork2_#res.offset_17| 0)) InVars {~g2~0=v_~g2~0_62, ~g3~0=v_~g3~0_60} OutVars{~g2~0=v_~g2~0_62, thread2Thread1of1ForFork1_#res.offset=|v_thread2Thread1of1ForFork1_#res.offset_15|, ~g3~0=v_~g3~0_60, thread2Thread1of1ForFork1_#res.base=|v_thread2Thread1of1ForFork1_#res.base_15|, thread3Thread1of1ForFork2_#res.offset=|v_thread3Thread1of1ForFork2_#res.offset_17|, thread3Thread1of1ForFork2_#res.base=|v_thread3Thread1of1ForFork2_#res.base_17|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#res.offset, thread2Thread1of1ForFork1_#res.base, thread3Thread1of1ForFork2_#res.offset, thread3Thread1of1ForFork2_#res.base] and [484] L53-1-->L53-1: Formula: (let ((.cse4 (= (mod v_~d1~0_74 256) 0))) (and (let ((.cse1 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_38| 256) 0)) (.cse0 (= (mod v_~d1~0_73 256) 0)) (.cse3 (= v_~g1~0_53 v_~g1~0_52)) (.cse2 (= v_~d1~0_73 (ite (= (ite .cse4 1 0) 0) 0 1)))) (or (and (not .cse0) (= v_~g1~0_52 0) (not .cse1) .cse2) (and .cse3 .cse2 .cse1) (and .cse0 .cse3 .cse2))) (let ((.cse5 (not (= (mod v_~g1~0_53 256) 0)))) (or (and (= v_~pos~0_190 (+ v_~pos~0_189 1)) (= |v_thread1Thread1of1ForFork0_#t~post1_28| |v_thread1Thread1of1ForFork0_#t~post1_27|) .cse4 .cse5) (and (not .cse4) (= |v_thread1Thread1of1ForFork0_#t~post2_28| |v_thread1Thread1of1ForFork0_#t~post2_27|) (= v_~pos~0_189 (+ v_~pos~0_190 1)) .cse5))))) InVars {~g1~0=v_~g1~0_53, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_38|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_28|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_28|, ~pos~0=v_~pos~0_190, ~d1~0=v_~d1~0_74} OutVars{~g1~0=v_~g1~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_27|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_27|, ~pos~0=v_~pos~0_189, ~d1~0=v_~d1~0_73} AuxVars[] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] [2022-12-06 00:03:37,248 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [484] L53-1-->L53-1: Formula: (let ((.cse4 (= (mod v_~d1~0_74 256) 0))) (and (let ((.cse1 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_38| 256) 0)) (.cse0 (= (mod v_~d1~0_73 256) 0)) (.cse3 (= v_~g1~0_53 v_~g1~0_52)) (.cse2 (= v_~d1~0_73 (ite (= (ite .cse4 1 0) 0) 0 1)))) (or (and (not .cse0) (= v_~g1~0_52 0) (not .cse1) .cse2) (and .cse3 .cse2 .cse1) (and .cse0 .cse3 .cse2))) (let ((.cse5 (not (= (mod v_~g1~0_53 256) 0)))) (or (and (= v_~pos~0_190 (+ v_~pos~0_189 1)) (= |v_thread1Thread1of1ForFork0_#t~post1_28| |v_thread1Thread1of1ForFork0_#t~post1_27|) .cse4 .cse5) (and (not .cse4) (= |v_thread1Thread1of1ForFork0_#t~post2_28| |v_thread1Thread1of1ForFork0_#t~post2_27|) (= v_~pos~0_189 (+ v_~pos~0_190 1)) .cse5))))) InVars {~g1~0=v_~g1~0_53, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_38|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_28|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_28|, ~pos~0=v_~pos~0_190, ~d1~0=v_~d1~0_74} OutVars{~g1~0=v_~g1~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_27|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_27|, ~pos~0=v_~pos~0_189, ~d1~0=v_~d1~0_73} AuxVars[] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] and [482] L97-1-->L97-1: Formula: (let ((.cse0 (= (mod v_~d3~0_76 256) 0))) (and (let ((.cse1 (not (= (mod v_~g3~0_45 256) 0)))) (or (and (= v_~pos~0_158 (+ v_~pos~0_157 2)) .cse0 .cse1) (and (not .cse0) .cse1 (= v_~pos~0_157 (+ v_~pos~0_158 2))))) (let ((.cse3 (= v_~g3~0_45 v_~g3~0_44)) (.cse5 (= 0 (mod |v_thread3Thread1of1ForFork2_#t~nondet5_36| 256))) (.cse4 (= v_~d3~0_75 (ite (= (ite .cse0 1 0) 0) 0 1))) (.cse2 (= (mod v_~d3~0_75 256) 0))) (or (and .cse2 .cse3 .cse4) (and .cse3 .cse4 .cse5) (and (= v_~g3~0_44 0) (not .cse5) .cse4 (not .cse2)))))) InVars {thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_36|, ~g3~0=v_~g3~0_45, ~pos~0=v_~pos~0_158, ~d3~0=v_~d3~0_76} OutVars{~g3~0=v_~g3~0_44, ~pos~0=v_~pos~0_157, ~d3~0=v_~d3~0_75} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~nondet5, ~g3~0, ~pos~0, ~d3~0] [2022-12-06 00:03:38,256 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [484] L53-1-->L53-1: Formula: (let ((.cse4 (= (mod v_~d1~0_74 256) 0))) (and (let ((.cse1 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_38| 256) 0)) (.cse0 (= (mod v_~d1~0_73 256) 0)) (.cse3 (= v_~g1~0_53 v_~g1~0_52)) (.cse2 (= v_~d1~0_73 (ite (= (ite .cse4 1 0) 0) 0 1)))) (or (and (not .cse0) (= v_~g1~0_52 0) (not .cse1) .cse2) (and .cse3 .cse2 .cse1) (and .cse0 .cse3 .cse2))) (let ((.cse5 (not (= (mod v_~g1~0_53 256) 0)))) (or (and (= v_~pos~0_190 (+ v_~pos~0_189 1)) (= |v_thread1Thread1of1ForFork0_#t~post1_28| |v_thread1Thread1of1ForFork0_#t~post1_27|) .cse4 .cse5) (and (not .cse4) (= |v_thread1Thread1of1ForFork0_#t~post2_28| |v_thread1Thread1of1ForFork0_#t~post2_27|) (= v_~pos~0_189 (+ v_~pos~0_190 1)) .cse5))))) InVars {~g1~0=v_~g1~0_53, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_38|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_28|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_28|, ~pos~0=v_~pos~0_190, ~d1~0=v_~d1~0_74} OutVars{~g1~0=v_~g1~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_27|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_27|, ~pos~0=v_~pos~0_189, ~d1~0=v_~d1~0_73} AuxVars[] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] and [482] L97-1-->L97-1: Formula: (let ((.cse0 (= (mod v_~d3~0_76 256) 0))) (and (let ((.cse1 (not (= (mod v_~g3~0_45 256) 0)))) (or (and (= v_~pos~0_158 (+ v_~pos~0_157 2)) .cse0 .cse1) (and (not .cse0) .cse1 (= v_~pos~0_157 (+ v_~pos~0_158 2))))) (let ((.cse3 (= v_~g3~0_45 v_~g3~0_44)) (.cse5 (= 0 (mod |v_thread3Thread1of1ForFork2_#t~nondet5_36| 256))) (.cse4 (= v_~d3~0_75 (ite (= (ite .cse0 1 0) 0) 0 1))) (.cse2 (= (mod v_~d3~0_75 256) 0))) (or (and .cse2 .cse3 .cse4) (and .cse3 .cse4 .cse5) (and (= v_~g3~0_44 0) (not .cse5) .cse4 (not .cse2)))))) InVars {thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_36|, ~g3~0=v_~g3~0_45, ~pos~0=v_~pos~0_158, ~d3~0=v_~d3~0_76} OutVars{~g3~0=v_~g3~0_44, ~pos~0=v_~pos~0_157, ~d3~0=v_~d3~0_75} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~nondet5, ~g3~0, ~pos~0, ~d3~0] [2022-12-06 00:03:38,767 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [484] L53-1-->L53-1: Formula: (let ((.cse4 (= (mod v_~d1~0_74 256) 0))) (and (let ((.cse1 (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_38| 256) 0)) (.cse0 (= (mod v_~d1~0_73 256) 0)) (.cse3 (= v_~g1~0_53 v_~g1~0_52)) (.cse2 (= v_~d1~0_73 (ite (= (ite .cse4 1 0) 0) 0 1)))) (or (and (not .cse0) (= v_~g1~0_52 0) (not .cse1) .cse2) (and .cse3 .cse2 .cse1) (and .cse0 .cse3 .cse2))) (let ((.cse5 (not (= (mod v_~g1~0_53 256) 0)))) (or (and (= v_~pos~0_190 (+ v_~pos~0_189 1)) (= |v_thread1Thread1of1ForFork0_#t~post1_28| |v_thread1Thread1of1ForFork0_#t~post1_27|) .cse4 .cse5) (and (not .cse4) (= |v_thread1Thread1of1ForFork0_#t~post2_28| |v_thread1Thread1of1ForFork0_#t~post2_27|) (= v_~pos~0_189 (+ v_~pos~0_190 1)) .cse5))))) InVars {~g1~0=v_~g1~0_53, thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_38|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_28|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_28|, ~pos~0=v_~pos~0_190, ~d1~0=v_~d1~0_74} OutVars{~g1~0=v_~g1~0_52, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_27|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_27|, ~pos~0=v_~pos~0_189, ~d1~0=v_~d1~0_73} AuxVars[] AssignedVars[~g1~0, thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, ~pos~0, ~d1~0] and [482] L97-1-->L97-1: Formula: (let ((.cse0 (= (mod v_~d3~0_76 256) 0))) (and (let ((.cse1 (not (= (mod v_~g3~0_45 256) 0)))) (or (and (= v_~pos~0_158 (+ v_~pos~0_157 2)) .cse0 .cse1) (and (not .cse0) .cse1 (= v_~pos~0_157 (+ v_~pos~0_158 2))))) (let ((.cse3 (= v_~g3~0_45 v_~g3~0_44)) (.cse5 (= 0 (mod |v_thread3Thread1of1ForFork2_#t~nondet5_36| 256))) (.cse4 (= v_~d3~0_75 (ite (= (ite .cse0 1 0) 0) 0 1))) (.cse2 (= (mod v_~d3~0_75 256) 0))) (or (and .cse2 .cse3 .cse4) (and .cse3 .cse4 .cse5) (and (= v_~g3~0_44 0) (not .cse5) .cse4 (not .cse2)))))) InVars {thread3Thread1of1ForFork2_#t~nondet5=|v_thread3Thread1of1ForFork2_#t~nondet5_36|, ~g3~0=v_~g3~0_45, ~pos~0=v_~pos~0_158, ~d3~0=v_~d3~0_76} OutVars{~g3~0=v_~g3~0_44, ~pos~0=v_~pos~0_157, ~d3~0=v_~d3~0_75} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~nondet5, ~g3~0, ~pos~0, ~d3~0] [2022-12-06 00:03:39,859 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 00:03:40,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 00:03:40,057 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Function c_aux_v_~pos~0_242 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 00:03:40,060 INFO L158 Benchmark]: Toolchain (without parser) took 11722.72ms. Allocated memory was 172.0MB in the beginning and 260.0MB in the end (delta: 88.1MB). Free memory was 149.6MB in the beginning and 122.4MB in the end (delta: 27.2MB). Peak memory consumption was 151.8MB. Max. memory is 8.0GB. [2022-12-06 00:03:40,060 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 172.0MB. Free memory is still 149.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 00:03:40,060 INFO L158 Benchmark]: CACSL2BoogieTranslator took 207.87ms. Allocated memory is still 172.0MB. Free memory was 149.1MB in the beginning and 136.4MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-06 00:03:40,060 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.63ms. Allocated memory is still 172.0MB. Free memory was 136.4MB in the beginning and 135.0MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 00:03:40,061 INFO L158 Benchmark]: Boogie Preprocessor took 30.32ms. Allocated memory is still 172.0MB. Free memory was 135.0MB in the beginning and 133.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 00:03:40,061 INFO L158 Benchmark]: RCFGBuilder took 468.58ms. Allocated memory is still 172.0MB. Free memory was 133.3MB in the beginning and 118.2MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-12-06 00:03:40,061 INFO L158 Benchmark]: TraceAbstraction took 10970.34ms. Allocated memory was 172.0MB in the beginning and 260.0MB in the end (delta: 88.1MB). Free memory was 117.1MB in the beginning and 122.4MB in the end (delta: -5.2MB). Peak memory consumption was 120.3MB. Max. memory is 8.0GB. [2022-12-06 00:03:40,062 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.14ms. Allocated memory is still 172.0MB. Free memory is still 149.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 207.87ms. Allocated memory is still 172.0MB. Free memory was 149.1MB in the beginning and 136.4MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 40.63ms. Allocated memory is still 172.0MB. Free memory was 136.4MB in the beginning and 135.0MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.32ms. Allocated memory is still 172.0MB. Free memory was 135.0MB in the beginning and 133.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 468.58ms. Allocated memory is still 172.0MB. Free memory was 133.3MB in the beginning and 118.2MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 10970.34ms. Allocated memory was 172.0MB in the beginning and 260.0MB in the end (delta: 88.1MB). Free memory was 117.1MB in the beginning and 122.4MB in the end (delta: -5.2MB). Peak memory consumption was 120.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.7s, 105 PlacesBefore, 26 PlacesAfterwards, 111 TransitionsBefore, 19 TransitionsAfterwards, 2958 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 34 TrivialYvCompositions, 45 ConcurrentYvCompositions, 10 ChoiceCompositions, 89 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1823, independent: 1823, independent conditional: 1823, 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: 1823, independent: 1823, independent conditional: 0, independent unconditional: 1823, 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: 1823, independent: 1823, independent conditional: 0, independent unconditional: 1823, 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: 1823, independent: 1823, independent conditional: 0, independent unconditional: 1823, 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: 1482, independent: 1482, independent conditional: 0, independent unconditional: 1482, 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: 1482, independent: 1468, independent conditional: 0, independent unconditional: 1468, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 14, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 57, independent: 57, independent conditional: 0, independent unconditional: 57, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1823, independent: 341, independent conditional: 0, independent unconditional: 341, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1482, unknown conditional: 0, unknown unconditional: 1482] , Statistics on independence cache: Total cache size (in pairs): 2721, Positive cache size: 2721, Positive conditional cache size: 0, Positive unconditional cache size: 2721, 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, 23 PlacesBefore, 23 PlacesAfterwards, 20 TransitionsBefore, 20 TransitionsAfterwards, 102 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, 25 PlacesBefore, 25 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 122 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, 27 PlacesBefore, 27 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 144 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.8s, 36 PlacesBefore, 34 PlacesAfterwards, 30 TransitionsBefore, 28 TransitionsAfterwards, 240 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, independent: 18, independent conditional: 18, 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: 18, independent: 18, independent conditional: 8, independent unconditional: 10, 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: 18, independent: 18, independent conditional: 2, independent unconditional: 16, 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: 18, independent: 18, independent conditional: 2, independent unconditional: 16, 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: 5, independent: 5, independent conditional: 0, independent unconditional: 5, 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: 5, independent: 5, independent conditional: 0, independent unconditional: 5, 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: 18, independent: 13, independent conditional: 2, independent unconditional: 11, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 5, Positive cache size: 5, Positive conditional cache size: 0, Positive unconditional cache size: 5, 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: 6, Maximal queried relation: 0 - ExceptionOrErrorResult: SMTLIBException: Function c_aux_v_~pos~0_242 is already defined. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Function c_aux_v_~pos~0_242 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 00:03:40,090 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...