/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-simple-queue.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 05:41:23,070 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 05:41:23,072 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 05:41:23,099 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 05:41:23,100 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 05:41:23,101 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 05:41:23,103 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 05:41:23,106 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 05:41:23,110 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 05:41:23,113 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 05:41:23,114 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 05:41:23,115 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 05:41:23,115 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 05:41:23,117 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 05:41:23,118 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 05:41:23,120 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 05:41:23,120 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 05:41:23,121 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 05:41:23,123 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 05:41:23,126 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 05:41:23,127 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 05:41:23,128 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 05:41:23,128 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 05:41:23,129 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 05:41:23,134 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 05:41:23,134 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 05:41:23,135 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 05:41:23,136 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 05:41:23,136 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 05:41:23,137 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 05:41:23,137 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 05:41:23,138 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 05:41:23,139 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 05:41:23,140 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 05:41:23,140 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 05:41:23,140 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 05:41:23,141 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 05:41:23,141 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 05:41:23,141 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 05:41:23,141 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 05:41:23,142 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 05:41:23,143 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-06 05:41:23,169 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 05:41:23,170 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 05:41:23,171 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 05:41:23,171 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 05:41:23,171 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 05:41:23,172 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 05:41:23,172 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 05:41:23,172 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 05:41:23,172 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 05:41:23,172 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 05:41:23,173 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 05:41:23,173 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 05:41:23,173 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 05:41:23,173 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 05:41:23,173 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 05:41:23,174 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 05:41:23,174 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 05:41:23,174 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 05:41:23,174 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 05:41:23,174 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 05:41:23,174 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 05:41:23,174 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:41:23,174 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 05:41:23,175 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 05:41:23,175 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 05:41:23,175 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 05:41:23,175 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 05:41:23,175 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 05:41:23,175 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-12-06 05:41:23,457 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 05:41:23,497 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 05:41:23,499 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 05:41:23,500 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 05:41:23,500 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 05:41:23,501 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-simple-queue.wvr.c [2022-12-06 05:41:24,546 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 05:41:24,763 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 05:41:24,763 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-simple-queue.wvr.c [2022-12-06 05:41:24,770 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/894e391b0/74d6b6bb02c64a4e9932931324f0e660/FLAG6950ee146 [2022-12-06 05:41:24,785 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/894e391b0/74d6b6bb02c64a4e9932931324f0e660 [2022-12-06 05:41:24,787 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 05:41:24,788 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 05:41:24,790 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 05:41:24,790 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 05:41:24,792 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 05:41:24,793 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:41:24" (1/1) ... [2022-12-06 05:41:24,794 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1db5869a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:41:24, skipping insertion in model container [2022-12-06 05:41:24,794 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:41:24" (1/1) ... [2022-12-06 05:41:24,800 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 05:41:24,819 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 05:41:24,945 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:41:24,949 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:41:24,952 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:41:24,953 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:41:24,961 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-simple-queue.wvr.c[2438,2451] [2022-12-06 05:41:24,973 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:41:24,980 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 05:41:24,992 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:41:24,994 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:41:24,995 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 05:41:24,997 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 05:41:25,006 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-simple-queue.wvr.c[2438,2451] [2022-12-06 05:41:25,012 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:41:25,022 INFO L208 MainTranslator]: Completed translation [2022-12-06 05:41:25,023 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:41:25 WrapperNode [2022-12-06 05:41:25,023 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 05:41:25,024 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 05:41:25,024 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 05:41:25,024 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 05:41:25,029 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:41:25" (1/1) ... [2022-12-06 05:41:25,041 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:41:25" (1/1) ... [2022-12-06 05:41:25,064 INFO L138 Inliner]: procedures = 24, calls = 33, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 128 [2022-12-06 05:41:25,064 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 05:41:25,065 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 05:41:25,065 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 05:41:25,065 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 05:41:25,071 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:41:25" (1/1) ... [2022-12-06 05:41:25,071 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:41:25" (1/1) ... [2022-12-06 05:41:25,080 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:41:25" (1/1) ... [2022-12-06 05:41:25,081 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:41:25" (1/1) ... [2022-12-06 05:41:25,090 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:41:25" (1/1) ... [2022-12-06 05:41:25,092 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:41:25" (1/1) ... [2022-12-06 05:41:25,093 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:41:25" (1/1) ... [2022-12-06 05:41:25,094 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:41:25" (1/1) ... [2022-12-06 05:41:25,095 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 05:41:25,096 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 05:41:25,096 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 05:41:25,096 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 05:41:25,097 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:41:25" (1/1) ... [2022-12-06 05:41:25,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:41:25,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:41:25,124 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-06 05:41:25,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-06 05:41:25,166 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 05:41:25,167 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 05:41:25,167 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 05:41:25,168 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 05:41:25,168 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 05:41:25,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 05:41:25,168 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 05:41:25,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 05:41:25,168 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 05:41:25,168 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 05:41:25,168 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 05:41:25,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 05:41:25,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 05:41:25,168 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 05:41:25,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 05:41:25,169 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 05:41:25,305 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 05:41:25,320 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 05:41:25,556 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 05:41:25,638 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 05:41:25,639 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-06 05:41:25,641 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:41:25 BoogieIcfgContainer [2022-12-06 05:41:25,641 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 05:41:25,643 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 05:41:25,643 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 05:41:25,646 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 05:41:25,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 05:41:24" (1/3) ... [2022-12-06 05:41:25,647 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dd396a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:41:25, skipping insertion in model container [2022-12-06 05:41:25,648 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:41:25" (2/3) ... [2022-12-06 05:41:25,648 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dd396a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:41:25, skipping insertion in model container [2022-12-06 05:41:25,648 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:41:25" (3/3) ... [2022-12-06 05:41:25,649 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-simple-queue.wvr.c [2022-12-06 05:41:25,666 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 05:41:25,666 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 05:41:25,666 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 05:41:25,726 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-06 05:41:25,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 108 places, 110 transitions, 236 flow [2022-12-06 05:41:25,836 INFO L130 PetriNetUnfolder]: 9/108 cut-off events. [2022-12-06 05:41:25,836 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 05:41:25,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 108 events. 9/108 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 61 event pairs, 0 based on Foata normal form. 0/98 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2022-12-06 05:41:25,843 INFO L82 GeneralOperation]: Start removeDead. Operand has 108 places, 110 transitions, 236 flow [2022-12-06 05:41:25,848 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 98 places, 100 transitions, 212 flow [2022-12-06 05:41:25,850 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:41:25,867 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 100 transitions, 212 flow [2022-12-06 05:41:25,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 100 transitions, 212 flow [2022-12-06 05:41:25,911 INFO L130 PetriNetUnfolder]: 9/100 cut-off events. [2022-12-06 05:41:25,911 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 05:41:25,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 100 events. 9/100 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 60 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2022-12-06 05:41:25,915 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 100 transitions, 212 flow [2022-12-06 05:41:25,915 INFO L188 LiptonReduction]: Number of co-enabled transitions 368 [2022-12-06 05:41:29,839 INFO L203 LiptonReduction]: Total number of compositions: 85 [2022-12-06 05:41:29,849 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 05:41:29,853 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;@7db81c40, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 05:41:29,854 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-06 05:41:29,856 INFO L130 PetriNetUnfolder]: 3/14 cut-off events. [2022-12-06 05:41:29,857 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 05:41:29,857 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:41:29,857 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:41:29,857 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:41:29,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:41:29,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1143381871, now seen corresponding path program 1 times [2022-12-06 05:41:29,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:41:29,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617476497] [2022-12-06 05:41:29,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:41:29,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:41:29,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:41:30,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:41:30,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:41:30,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617476497] [2022-12-06 05:41:30,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617476497] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:41:30,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:41:30,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-06 05:41:30,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466149899] [2022-12-06 05:41:30,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:41:30,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:41:30,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:41:30,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:41:30,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:41:30,140 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 05:41:30,142 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 19 places, 15 transitions, 42 flow. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:41:30,143 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:41:30,143 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 05:41:30,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:41:30,209 INFO L130 PetriNetUnfolder]: 38/71 cut-off events. [2022-12-06 05:41:30,209 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-12-06 05:41:30,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158 conditions, 71 events. 38/71 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 135 event pairs, 9 based on Foata normal form. 1/49 useless extension candidates. Maximal degree in co-relation 100. Up to 37 conditions per place. [2022-12-06 05:41:30,211 INFO L137 encePairwiseOnDemand]: 12/15 looper letters, 19 selfloop transitions, 2 changer transitions 2/23 dead transitions. [2022-12-06 05:41:30,212 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 23 transitions, 110 flow [2022-12-06 05:41:30,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:41:30,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:41:30,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2022-12-06 05:41:30,220 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2022-12-06 05:41:30,221 INFO L175 Difference]: Start difference. First operand has 19 places, 15 transitions, 42 flow. Second operand 3 states and 24 transitions. [2022-12-06 05:41:30,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 21 places, 23 transitions, 110 flow [2022-12-06 05:41:30,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 17 places, 23 transitions, 98 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-06 05:41:30,224 INFO L231 Difference]: Finished difference. Result has 18 places, 16 transitions, 46 flow [2022-12-06 05:41:30,226 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=34, PETRI_DIFFERENCE_MINUEND_PLACES=15, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=46, PETRI_PLACES=18, PETRI_TRANSITIONS=16} [2022-12-06 05:41:30,229 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, -1 predicate places. [2022-12-06 05:41:30,229 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:41:30,229 INFO L89 Accepts]: Start accepts. Operand has 18 places, 16 transitions, 46 flow [2022-12-06 05:41:30,231 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:41:30,231 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:41:30,232 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 18 places, 16 transitions, 46 flow [2022-12-06 05:41:30,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 18 places, 16 transitions, 46 flow [2022-12-06 05:41:30,244 INFO L130 PetriNetUnfolder]: 3/18 cut-off events. [2022-12-06 05:41:30,245 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 05:41:30,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28 conditions, 18 events. 3/18 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/15 useless extension candidates. Maximal degree in co-relation 14. Up to 4 conditions per place. [2022-12-06 05:41:30,245 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 18 places, 16 transitions, 46 flow [2022-12-06 05:41:30,245 INFO L188 LiptonReduction]: Number of co-enabled transitions 42 [2022-12-06 05:41:30,246 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:41:30,248 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 19 [2022-12-06 05:41:30,248 INFO L495 AbstractCegarLoop]: Abstraction has has 18 places, 16 transitions, 46 flow [2022-12-06 05:41:30,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:41:30,248 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:41:30,248 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:41:30,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 05:41:30,251 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:41:30,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:41:30,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1742405358, now seen corresponding path program 1 times [2022-12-06 05:41:30,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:41:30,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582373285] [2022-12-06 05:41:30,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:41:30,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:41:30,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:41:30,446 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:41:30,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:41:30,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582373285] [2022-12-06 05:41:30,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582373285] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:41:30,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:41:30,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 05:41:30,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402239232] [2022-12-06 05:41:30,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:41:30,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:41:30,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:41:30,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:41:30,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:41:30,450 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 05:41:30,450 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 18 places, 16 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:41:30,450 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:41:30,450 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 05:41:30,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:41:30,498 INFO L130 PetriNetUnfolder]: 52/102 cut-off events. [2022-12-06 05:41:30,498 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-12-06 05:41:30,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 233 conditions, 102 events. 52/102 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 246 event pairs, 17 based on Foata normal form. 6/91 useless extension candidates. Maximal degree in co-relation 135. Up to 74 conditions per place. [2022-12-06 05:41:30,500 INFO L137 encePairwiseOnDemand]: 12/15 looper letters, 18 selfloop transitions, 2 changer transitions 5/25 dead transitions. [2022-12-06 05:41:30,501 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 20 places, 25 transitions, 117 flow [2022-12-06 05:41:30,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:41:30,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:41:30,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2022-12-06 05:41:30,502 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2022-12-06 05:41:30,502 INFO L175 Difference]: Start difference. First operand has 18 places, 16 transitions, 46 flow. Second operand 3 states and 25 transitions. [2022-12-06 05:41:30,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 20 places, 25 transitions, 117 flow [2022-12-06 05:41:30,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 19 places, 25 transitions, 115 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 05:41:30,503 INFO L231 Difference]: Finished difference. Result has 20 places, 17 transitions, 56 flow [2022-12-06 05:41:30,503 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=20, PETRI_TRANSITIONS=17} [2022-12-06 05:41:30,504 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 1 predicate places. [2022-12-06 05:41:30,504 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:41:30,504 INFO L89 Accepts]: Start accepts. Operand has 20 places, 17 transitions, 56 flow [2022-12-06 05:41:30,505 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:41:30,505 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:41:30,505 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 20 places, 17 transitions, 56 flow [2022-12-06 05:41:30,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 20 places, 17 transitions, 56 flow [2022-12-06 05:41:30,509 INFO L130 PetriNetUnfolder]: 4/24 cut-off events. [2022-12-06 05:41:30,509 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 05:41:30,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 24 events. 4/24 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 29 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 22. Up to 5 conditions per place. [2022-12-06 05:41:30,509 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 20 places, 17 transitions, 56 flow [2022-12-06 05:41:30,509 INFO L188 LiptonReduction]: Number of co-enabled transitions 48 [2022-12-06 05:41:30,510 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:41:30,511 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 7 [2022-12-06 05:41:30,512 INFO L495 AbstractCegarLoop]: Abstraction has has 20 places, 17 transitions, 56 flow [2022-12-06 05:41:30,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:41:30,512 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:41:30,512 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:41:30,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 05:41:30,513 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:41:30,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:41:30,514 INFO L85 PathProgramCache]: Analyzing trace with hash 253712065, now seen corresponding path program 1 times [2022-12-06 05:41:30,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:41:30,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975787666] [2022-12-06 05:41:30,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:41:30,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:41:30,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:41:30,658 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 05:41:30,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:41:30,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975787666] [2022-12-06 05:41:30,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975787666] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:41:30,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:41:30,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:41:30,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638166594] [2022-12-06 05:41:30,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:41:30,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:41:30,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:41:30,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:41:30,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:41:30,663 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 05:41:30,664 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 17 transitions, 56 flow. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:41:30,664 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:41:30,664 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 05:41:30,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:41:30,729 INFO L130 PetriNetUnfolder]: 61/130 cut-off events. [2022-12-06 05:41:30,729 INFO L131 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2022-12-06 05:41:30,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 316 conditions, 130 events. 61/130 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 354 event pairs, 44 based on Foata normal form. 6/134 useless extension candidates. Maximal degree in co-relation 212. Up to 103 conditions per place. [2022-12-06 05:41:30,731 INFO L137 encePairwiseOnDemand]: 11/15 looper letters, 16 selfloop transitions, 2 changer transitions 10/28 dead transitions. [2022-12-06 05:41:30,731 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 28 transitions, 138 flow [2022-12-06 05:41:30,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:41:30,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:41:30,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2022-12-06 05:41:30,734 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45 [2022-12-06 05:41:30,734 INFO L175 Difference]: Start difference. First operand has 20 places, 17 transitions, 56 flow. Second operand 4 states and 27 transitions. [2022-12-06 05:41:30,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 28 transitions, 138 flow [2022-12-06 05:41:30,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 28 transitions, 136 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 05:41:30,736 INFO L231 Difference]: Finished difference. Result has 24 places, 18 transitions, 68 flow [2022-12-06 05:41:30,736 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=68, PETRI_PLACES=24, PETRI_TRANSITIONS=18} [2022-12-06 05:41:30,737 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 5 predicate places. [2022-12-06 05:41:30,737 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:41:30,737 INFO L89 Accepts]: Start accepts. Operand has 24 places, 18 transitions, 68 flow [2022-12-06 05:41:30,738 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:41:30,738 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:41:30,739 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 24 places, 18 transitions, 68 flow [2022-12-06 05:41:30,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 18 transitions, 68 flow [2022-12-06 05:41:30,743 INFO L130 PetriNetUnfolder]: 4/25 cut-off events. [2022-12-06 05:41:30,743 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 05:41:30,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 25 events. 4/25 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 29 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 35. Up to 5 conditions per place. [2022-12-06 05:41:30,746 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 23 places, 18 transitions, 68 flow [2022-12-06 05:41:30,746 INFO L188 LiptonReduction]: Number of co-enabled transitions 48 [2022-12-06 05:41:31,490 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:41:31,490 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 753 [2022-12-06 05:41:31,490 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 17 transitions, 64 flow [2022-12-06 05:41:31,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:41:31,491 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:41:31,491 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:41:31,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 05:41:31,491 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:41:31,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:41:31,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1524411168, now seen corresponding path program 1 times [2022-12-06 05:41:31,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:41:31,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696306709] [2022-12-06 05:41:31,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:41:31,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:41:31,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:41:31,777 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:41:31,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:41:31,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696306709] [2022-12-06 05:41:31,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696306709] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:41:31,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445876968] [2022-12-06 05:41:31,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:41:31,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:41:31,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:41:31,814 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:41:31,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-06 05:41:31,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:41:31,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 37 conjunts are in the unsatisfiable core [2022-12-06 05:41:31,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:41:31,996 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-06 05:41:32,033 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 05:41:32,060 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 05:41:32,109 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-12-06 05:41:32,116 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:41:32,116 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:41:32,230 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:41:32,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [445876968] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:41:32,230 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:41:32,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 11 [2022-12-06 05:41:32,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979129263] [2022-12-06 05:41:32,230 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:41:32,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-06 05:41:32,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:41:32,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-06 05:41:32,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=111, Unknown=1, NotChecked=0, Total=156 [2022-12-06 05:41:32,233 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 15 [2022-12-06 05:41:32,233 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 17 transitions, 64 flow. Second operand has 13 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:41:32,233 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:41:32,233 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 15 [2022-12-06 05:41:32,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:41:34,521 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 05:41:34,737 INFO L130 PetriNetUnfolder]: 176/343 cut-off events. [2022-12-06 05:41:34,737 INFO L131 PetriNetUnfolder]: For 136/136 co-relation queries the response was YES. [2022-12-06 05:41:34,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 868 conditions, 343 events. 176/343 cut-off events. For 136/136 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1434 event pairs, 30 based on Foata normal form. 1/341 useless extension candidates. Maximal degree in co-relation 855. Up to 111 conditions per place. [2022-12-06 05:41:34,739 INFO L137 encePairwiseOnDemand]: 8/15 looper letters, 47 selfloop transitions, 20 changer transitions 16/83 dead transitions. [2022-12-06 05:41:34,739 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 83 transitions, 429 flow [2022-12-06 05:41:34,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-06 05:41:34,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-06 05:41:34,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 81 transitions. [2022-12-06 05:41:34,740 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4909090909090909 [2022-12-06 05:41:34,740 INFO L175 Difference]: Start difference. First operand has 22 places, 17 transitions, 64 flow. Second operand 11 states and 81 transitions. [2022-12-06 05:41:34,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 83 transitions, 429 flow [2022-12-06 05:41:34,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 83 transitions, 405 flow, removed 12 selfloop flow, removed 3 redundant places. [2022-12-06 05:41:34,742 INFO L231 Difference]: Finished difference. Result has 32 places, 36 transitions, 195 flow [2022-12-06 05:41:34,742 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=15, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=195, PETRI_PLACES=32, PETRI_TRANSITIONS=36} [2022-12-06 05:41:34,743 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 13 predicate places. [2022-12-06 05:41:34,743 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:41:34,743 INFO L89 Accepts]: Start accepts. Operand has 32 places, 36 transitions, 195 flow [2022-12-06 05:41:34,743 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:41:34,743 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:41:34,744 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 36 transitions, 195 flow [2022-12-06 05:41:34,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 36 transitions, 195 flow [2022-12-06 05:41:34,758 INFO L130 PetriNetUnfolder]: 17/94 cut-off events. [2022-12-06 05:41:34,758 INFO L131 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2022-12-06 05:41:34,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 194 conditions, 94 events. 17/94 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 422 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 138. Up to 22 conditions per place. [2022-12-06 05:41:34,769 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 36 transitions, 195 flow [2022-12-06 05:41:34,769 INFO L188 LiptonReduction]: Number of co-enabled transitions 126 [2022-12-06 05:41:38,426 WARN L322 ript$VariableManager]: TermVariable LBE202 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:41:38,426 WARN L322 ript$VariableManager]: TermVariable LBE30 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:41:38,426 WARN L322 ript$VariableManager]: TermVariable LBE196 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:41:38,426 WARN L322 ript$VariableManager]: TermVariable LBE18 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:41:38,514 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 05:41:38,515 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 3772 [2022-12-06 05:41:38,515 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 35 transitions, 204 flow [2022-12-06 05:41:38,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:41:38,515 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:41:38,515 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:41:38,522 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-06 05:41:38,716 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 05:41:38,716 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:41:38,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:41:38,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1639294692, now seen corresponding path program 1 times [2022-12-06 05:41:38,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:41:38,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725052837] [2022-12-06 05:41:38,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:41:38,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:41:38,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:41:39,070 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:41:39,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:41:39,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725052837] [2022-12-06 05:41:39,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725052837] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:41:39,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1085231729] [2022-12-06 05:41:39,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:41:39,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:41:39,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:41:39,079 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:41:39,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-06 05:41:39,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:41:39,136 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 33 conjunts are in the unsatisfiable core [2022-12-06 05:41:39,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:41:39,151 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2022-12-06 05:41:39,156 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 05:41:39,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:41:39,203 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 05:41:39,235 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-12-06 05:41:39,239 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:41:39,240 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:41:39,262 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_111 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_111) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))) 5)) is different from false [2022-12-06 05:41:39,299 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-06 05:41:39,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1085231729] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:41:39,299 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:41:39,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2022-12-06 05:41:39,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669403930] [2022-12-06 05:41:39,299 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:41:39,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-06 05:41:39,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:41:39,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-06 05:41:39,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=80, Unknown=1, NotChecked=18, Total=132 [2022-12-06 05:41:39,300 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 19 [2022-12-06 05:41:39,300 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 35 transitions, 204 flow. Second operand has 12 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:41:39,300 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:41:39,300 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 19 [2022-12-06 05:41:39,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:41:39,459 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_111 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_111) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))) 5)))) (and .cse0 (= 5 c_~x~0) (or (not (= 5 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4))))) .cse0 (not (< c_~back~0 c_~n~0)) (not (<= 0 c_~back~0))))) is different from false [2022-12-06 05:41:39,818 INFO L130 PetriNetUnfolder]: 377/709 cut-off events. [2022-12-06 05:41:39,818 INFO L131 PetriNetUnfolder]: For 847/847 co-relation queries the response was YES. [2022-12-06 05:41:39,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2119 conditions, 709 events. 377/709 cut-off events. For 847/847 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 3452 event pairs, 85 based on Foata normal form. 3/708 useless extension candidates. Maximal degree in co-relation 781. Up to 207 conditions per place. [2022-12-06 05:41:39,821 INFO L137 encePairwiseOnDemand]: 3/19 looper letters, 74 selfloop transitions, 44 changer transitions 23/141 dead transitions. [2022-12-06 05:41:39,821 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 141 transitions, 875 flow [2022-12-06 05:41:39,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-06 05:41:39,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-06 05:41:39,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 134 transitions. [2022-12-06 05:41:39,823 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4148606811145511 [2022-12-06 05:41:39,823 INFO L175 Difference]: Start difference. First operand has 31 places, 35 transitions, 204 flow. Second operand 17 states and 134 transitions. [2022-12-06 05:41:39,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 141 transitions, 875 flow [2022-12-06 05:41:39,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 141 transitions, 858 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-06 05:41:39,827 INFO L231 Difference]: Finished difference. Result has 56 places, 65 transitions, 567 flow [2022-12-06 05:41:39,827 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=567, PETRI_PLACES=56, PETRI_TRANSITIONS=65} [2022-12-06 05:41:39,828 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 37 predicate places. [2022-12-06 05:41:39,828 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:41:39,828 INFO L89 Accepts]: Start accepts. Operand has 56 places, 65 transitions, 567 flow [2022-12-06 05:41:39,829 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:41:39,829 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:41:39,829 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 65 transitions, 567 flow [2022-12-06 05:41:39,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 65 transitions, 567 flow [2022-12-06 05:41:39,882 INFO L130 PetriNetUnfolder]: 126/365 cut-off events. [2022-12-06 05:41:39,883 INFO L131 PetriNetUnfolder]: For 1127/1182 co-relation queries the response was YES. [2022-12-06 05:41:39,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1462 conditions, 365 events. 126/365 cut-off events. For 1127/1182 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2179 event pairs, 42 based on Foata normal form. 0/338 useless extension candidates. Maximal degree in co-relation 1090. Up to 154 conditions per place. [2022-12-06 05:41:39,885 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 65 transitions, 567 flow [2022-12-06 05:41:39,885 INFO L188 LiptonReduction]: Number of co-enabled transitions 210 [2022-12-06 05:41:39,896 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [375] L52-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| (ite (= 5 (select (select |v_#memory_int_63| v_~queue~0.base_41) (+ (* 4 v_~back~0_53) v_~queue~0.offset_41))) 1 0)) (not (= (mod |v_thread1Thread1of1ForFork0_#t~nondet1#1_16| 256) 0)) (not (= (ite (and (< v_~back~0_53 v_~n~0_32) (<= 0 v_~back~0_53)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5| 0)) (= (+ v_~back~0_53 1) v_~back~0_52) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|)) InVars {~queue~0.offset=v_~queue~0.offset_41, ~back~0=v_~back~0_53, #memory_int=|v_#memory_int_63|, thread1Thread1of1ForFork0_#t~nondet1#1=|v_thread1Thread1of1ForFork0_#t~nondet1#1_16|, ~queue~0.base=v_~queue~0.base_41, ~n~0=v_~n~0_32} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~queue~0.offset=v_~queue~0.offset_41, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_5|, ~back~0=v_~back~0_52, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, #memory_int=|v_#memory_int_63|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_5|, ~queue~0.base=v_~queue~0.base_41, ~n~0=v_~n~0_32} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post3#1, ~back~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_#t~nondet1#1] and [385] L80-4-->L81-3: Formula: (and (= (store |v_#memory_int_68| |v_ULTIMATE.start_main_~#t2~0#1.base_11| (store (select |v_#memory_int_68| |v_ULTIMATE.start_main_~#t2~0#1.base_11|) |v_ULTIMATE.start_main_~#t2~0#1.offset_11| |v_ULTIMATE.start_main_#t~pre12#1_17|)) |v_#memory_int_67|) (= |v_ULTIMATE.start_main_#t~pre12#1_17| |v_#pthreadsForks_24|) (= |v_#pthreadsForks_23| (+ |v_#pthreadsForks_24| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_11|, #memory_int=|v_#memory_int_68|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_11|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_17|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_9|, #pthreadsForks=|v_#pthreadsForks_23|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_11|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_17|, #memory_int=|v_#memory_int_67|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, #pthreadsForks, ULTIMATE.start_main_#t~pre10#1, #memory_int] [2022-12-06 05:41:39,959 WARN L322 ript$VariableManager]: TermVariable LBE202 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:41:39,959 WARN L322 ript$VariableManager]: TermVariable LBE30 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:41:39,960 WARN L322 ript$VariableManager]: TermVariable LBE196 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:41:39,960 WARN L322 ript$VariableManager]: TermVariable LBE18 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:41:40,139 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [375] L52-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| (ite (= 5 (select (select |v_#memory_int_63| v_~queue~0.base_41) (+ (* 4 v_~back~0_53) v_~queue~0.offset_41))) 1 0)) (not (= (mod |v_thread1Thread1of1ForFork0_#t~nondet1#1_16| 256) 0)) (not (= (ite (and (< v_~back~0_53 v_~n~0_32) (<= 0 v_~back~0_53)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5| 0)) (= (+ v_~back~0_53 1) v_~back~0_52) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|)) InVars {~queue~0.offset=v_~queue~0.offset_41, ~back~0=v_~back~0_53, #memory_int=|v_#memory_int_63|, thread1Thread1of1ForFork0_#t~nondet1#1=|v_thread1Thread1of1ForFork0_#t~nondet1#1_16|, ~queue~0.base=v_~queue~0.base_41, ~n~0=v_~n~0_32} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~queue~0.offset=v_~queue~0.offset_41, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_5|, ~back~0=v_~back~0_52, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, #memory_int=|v_#memory_int_63|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_5|, ~queue~0.base=v_~queue~0.base_41, ~n~0=v_~n~0_32} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post3#1, ~back~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_#t~nondet1#1] and [385] L80-4-->L81-3: Formula: (and (= (store |v_#memory_int_68| |v_ULTIMATE.start_main_~#t2~0#1.base_11| (store (select |v_#memory_int_68| |v_ULTIMATE.start_main_~#t2~0#1.base_11|) |v_ULTIMATE.start_main_~#t2~0#1.offset_11| |v_ULTIMATE.start_main_#t~pre12#1_17|)) |v_#memory_int_67|) (= |v_ULTIMATE.start_main_#t~pre12#1_17| |v_#pthreadsForks_24|) (= |v_#pthreadsForks_23| (+ |v_#pthreadsForks_24| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_11|, #memory_int=|v_#memory_int_68|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_11|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_17|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_9|, #pthreadsForks=|v_#pthreadsForks_23|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_11|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_17|, #memory_int=|v_#memory_int_67|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, #pthreadsForks, ULTIMATE.start_main_#t~pre10#1, #memory_int] [2022-12-06 05:41:40,212 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [375] L52-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| (ite (= 5 (select (select |v_#memory_int_63| v_~queue~0.base_41) (+ (* 4 v_~back~0_53) v_~queue~0.offset_41))) 1 0)) (not (= (mod |v_thread1Thread1of1ForFork0_#t~nondet1#1_16| 256) 0)) (not (= (ite (and (< v_~back~0_53 v_~n~0_32) (<= 0 v_~back~0_53)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5| 0)) (= (+ v_~back~0_53 1) v_~back~0_52) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|)) InVars {~queue~0.offset=v_~queue~0.offset_41, ~back~0=v_~back~0_53, #memory_int=|v_#memory_int_63|, thread1Thread1of1ForFork0_#t~nondet1#1=|v_thread1Thread1of1ForFork0_#t~nondet1#1_16|, ~queue~0.base=v_~queue~0.base_41, ~n~0=v_~n~0_32} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~queue~0.offset=v_~queue~0.offset_41, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_5|, ~back~0=v_~back~0_52, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, #memory_int=|v_#memory_int_63|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_5|, ~queue~0.base=v_~queue~0.base_41, ~n~0=v_~n~0_32} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post3#1, ~back~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_#t~nondet1#1] and [367] L64-->L64: Formula: (and (= v_~x~0_21 (select (select |v_#memory_int_57| v_~queue~0.base_39) (+ (* v_~front~0_41 4) v_~queue~0.offset_39))) (not (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4#1_18| 256) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|) (= (ite (and (< v_~front~0_41 v_~back~0_50) (<= 0 v_~front~0_41) (< v_~front~0_41 v_~n~0_30)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|) (= v_~front~0_40 (+ v_~front~0_41 1))) InVars {~queue~0.offset=v_~queue~0.offset_39, #memory_int=|v_#memory_int_57|, ~back~0=v_~back~0_50, ~queue~0.base=v_~queue~0.base_39, ~n~0=v_~n~0_30, thread2Thread1of1ForFork1_#t~nondet4#1=|v_thread2Thread1of1ForFork1_#t~nondet4#1_18|, ~front~0=v_~front~0_41} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, ~queue~0.offset=v_~queue~0.offset_39, #memory_int=|v_#memory_int_57|, ~back~0=v_~back~0_50, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_5|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, ~queue~0.base=v_~queue~0.base_39, ~n~0=v_~n~0_30, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_5|, ~x~0=v_~x~0_21, ~front~0=v_~front~0_40} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post6#1, ~x~0, thread2Thread1of1ForFork1_#t~nondet4#1, ~front~0] [2022-12-06 05:41:40,307 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [375] L52-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| (ite (= 5 (select (select |v_#memory_int_63| v_~queue~0.base_41) (+ (* 4 v_~back~0_53) v_~queue~0.offset_41))) 1 0)) (not (= (mod |v_thread1Thread1of1ForFork0_#t~nondet1#1_16| 256) 0)) (not (= (ite (and (< v_~back~0_53 v_~n~0_32) (<= 0 v_~back~0_53)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5| 0)) (= (+ v_~back~0_53 1) v_~back~0_52) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|)) InVars {~queue~0.offset=v_~queue~0.offset_41, ~back~0=v_~back~0_53, #memory_int=|v_#memory_int_63|, thread1Thread1of1ForFork0_#t~nondet1#1=|v_thread1Thread1of1ForFork0_#t~nondet1#1_16|, ~queue~0.base=v_~queue~0.base_41, ~n~0=v_~n~0_32} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~queue~0.offset=v_~queue~0.offset_41, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_5|, ~back~0=v_~back~0_52, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, #memory_int=|v_#memory_int_63|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_5|, ~queue~0.base=v_~queue~0.base_41, ~n~0=v_~n~0_32} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post3#1, ~back~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_#t~nondet1#1] and [379] L81-4-->L82-1: Formula: (= (select (select |v_#memory_int_65| |v_ULTIMATE.start_main_~#t1~0#1.base_11|) |v_ULTIMATE.start_main_~#t1~0#1.offset_11|) |v_ULTIMATE.start_main_#t~mem14#1_10|) InVars {#memory_int=|v_#memory_int_65|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_11|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_11|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_15|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_10|, #memory_int=|v_#memory_int_65|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_11|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_main_#t~nondet13#1] [2022-12-06 05:41:40,360 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [464] L52-->L82-1: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_27| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_27|) (= (ite (= 5 (select (select |v_#memory_int_163| v_~queue~0.base_96) (+ (* v_~back~0_123 4) v_~queue~0.offset_96))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_27|) (not (= (ite (and (<= 0 v_~back~0_123) (< v_~back~0_123 v_~n~0_88)) 1 0) 0)) (= (select (select |v_#memory_int_163| |v_ULTIMATE.start_main_~#t1~0#1.base_53|) |v_ULTIMATE.start_main_~#t1~0#1.offset_53|) |v_ULTIMATE.start_main_#t~mem14#1_48|) (not (= (mod |v_thread1Thread1of1ForFork0_#t~nondet1#1_64| 256) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_27| 0)) (= v_~back~0_122 (+ v_~back~0_123 1))) InVars {~queue~0.offset=v_~queue~0.offset_96, #memory_int=|v_#memory_int_163|, ~back~0=v_~back~0_123, thread1Thread1of1ForFork0_#t~nondet1#1=|v_thread1Thread1of1ForFork0_#t~nondet1#1_64|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_53|, ~queue~0.base=v_~queue~0.base_96, ~n~0=v_~n~0_88, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_53|} OutVars{~queue~0.offset=v_~queue~0.offset_96, ~back~0=v_~back~0_122, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_27|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_53|, ~queue~0.base=v_~queue~0.base_96, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_53|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_59|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_27|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_48|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_27|, #memory_int=|v_#memory_int_163|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_43|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_27|, ~n~0=v_~n~0_88} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~mem14#1, thread1Thread1of1ForFork0_#t~post3#1, ~back~0, ULTIMATE.start_main_#t~nondet13#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_#t~nondet1#1] and [367] L64-->L64: Formula: (and (= v_~x~0_21 (select (select |v_#memory_int_57| v_~queue~0.base_39) (+ (* v_~front~0_41 4) v_~queue~0.offset_39))) (not (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4#1_18| 256) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|) (= (ite (and (< v_~front~0_41 v_~back~0_50) (<= 0 v_~front~0_41) (< v_~front~0_41 v_~n~0_30)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|) (= v_~front~0_40 (+ v_~front~0_41 1))) InVars {~queue~0.offset=v_~queue~0.offset_39, #memory_int=|v_#memory_int_57|, ~back~0=v_~back~0_50, ~queue~0.base=v_~queue~0.base_39, ~n~0=v_~n~0_30, thread2Thread1of1ForFork1_#t~nondet4#1=|v_thread2Thread1of1ForFork1_#t~nondet4#1_18|, ~front~0=v_~front~0_41} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, ~queue~0.offset=v_~queue~0.offset_39, #memory_int=|v_#memory_int_57|, ~back~0=v_~back~0_50, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_5|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, ~queue~0.base=v_~queue~0.base_39, ~n~0=v_~n~0_30, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_5|, ~x~0=v_~x~0_21, ~front~0=v_~front~0_40} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post6#1, ~x~0, thread2Thread1of1ForFork1_#t~nondet4#1, ~front~0] [2022-12-06 05:41:40,462 INFO L203 LiptonReduction]: Total number of compositions: 4 [2022-12-06 05:41:40,462 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 634 [2022-12-06 05:41:40,462 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 64 transitions, 600 flow [2022-12-06 05:41:40,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.0) internal successors, (33), 11 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:41:40,463 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:41:40,463 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:41:40,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-06 05:41:40,663 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 05:41:40,663 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:41:40,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:41:40,664 INFO L85 PathProgramCache]: Analyzing trace with hash 911938125, now seen corresponding path program 1 times [2022-12-06 05:41:40,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:41:40,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263060718] [2022-12-06 05:41:40,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:41:40,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:41:40,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:41:41,423 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:41:41,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:41:41,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263060718] [2022-12-06 05:41:41,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263060718] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:41:41,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1131192328] [2022-12-06 05:41:41,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:41:41,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:41:41,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:41:41,426 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:41:41,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-06 05:41:41,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:41:41,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-06 05:41:41,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:41:41,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 05:41:41,588 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 05:41:41,615 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-12-06 05:41:41,620 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:41:41,620 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:41:41,641 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_146 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_146) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))) 5)) is different from false [2022-12-06 05:41:41,662 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:41:41,662 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 38 [2022-12-06 05:41:41,666 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-12-06 05:41:41,709 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-06 05:41:41,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1131192328] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:41:41,710 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:41:41,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2022-12-06 05:41:41,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094490819] [2022-12-06 05:41:41,710 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:41:41,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-06 05:41:41,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:41:41,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-06 05:41:41,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=128, Unknown=1, NotChecked=22, Total=182 [2022-12-06 05:41:41,712 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 05:41:41,712 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 64 transitions, 600 flow. Second operand has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:41:41,712 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:41:41,712 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 05:41:41,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:41:42,145 INFO L130 PetriNetUnfolder]: 463/892 cut-off events. [2022-12-06 05:41:42,146 INFO L131 PetriNetUnfolder]: For 4931/4931 co-relation queries the response was YES. [2022-12-06 05:41:42,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4590 conditions, 892 events. 463/892 cut-off events. For 4931/4931 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 4805 event pairs, 121 based on Foata normal form. 7/897 useless extension candidates. Maximal degree in co-relation 3511. Up to 339 conditions per place. [2022-12-06 05:41:42,153 INFO L137 encePairwiseOnDemand]: 4/23 looper letters, 63 selfloop transitions, 43 changer transitions 22/128 dead transitions. [2022-12-06 05:41:42,153 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 128 transitions, 1318 flow [2022-12-06 05:41:42,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 05:41:42,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 05:41:42,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 87 transitions. [2022-12-06 05:41:42,154 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.42028985507246375 [2022-12-06 05:41:42,154 INFO L175 Difference]: Start difference. First operand has 54 places, 64 transitions, 600 flow. Second operand 9 states and 87 transitions. [2022-12-06 05:41:42,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 128 transitions, 1318 flow [2022-12-06 05:41:42,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 128 transitions, 1199 flow, removed 57 selfloop flow, removed 2 redundant places. [2022-12-06 05:41:42,172 INFO L231 Difference]: Finished difference. Result has 63 places, 77 transitions, 772 flow [2022-12-06 05:41:42,173 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=519, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=772, PETRI_PLACES=63, PETRI_TRANSITIONS=77} [2022-12-06 05:41:42,173 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 44 predicate places. [2022-12-06 05:41:42,173 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:41:42,173 INFO L89 Accepts]: Start accepts. Operand has 63 places, 77 transitions, 772 flow [2022-12-06 05:41:42,175 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:41:42,175 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:41:42,175 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 77 transitions, 772 flow [2022-12-06 05:41:42,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 77 transitions, 772 flow [2022-12-06 05:41:42,251 INFO L130 PetriNetUnfolder]: 207/526 cut-off events. [2022-12-06 05:41:42,251 INFO L131 PetriNetUnfolder]: For 3596/3644 co-relation queries the response was YES. [2022-12-06 05:41:42,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2556 conditions, 526 events. 207/526 cut-off events. For 3596/3644 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3263 event pairs, 57 based on Foata normal form. 0/499 useless extension candidates. Maximal degree in co-relation 1703. Up to 280 conditions per place. [2022-12-06 05:41:42,255 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 77 transitions, 772 flow [2022-12-06 05:41:42,255 INFO L188 LiptonReduction]: Number of co-enabled transitions 242 [2022-12-06 05:41:42,257 WARN L322 ript$VariableManager]: TermVariable LBE202 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:41:42,257 WARN L322 ript$VariableManager]: TermVariable LBE30 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:41:42,257 WARN L322 ript$VariableManager]: TermVariable LBE196 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:41:42,257 WARN L322 ript$VariableManager]: TermVariable LBE18 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:41:42,346 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [375] L52-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| (ite (= 5 (select (select |v_#memory_int_63| v_~queue~0.base_41) (+ (* 4 v_~back~0_53) v_~queue~0.offset_41))) 1 0)) (not (= (mod |v_thread1Thread1of1ForFork0_#t~nondet1#1_16| 256) 0)) (not (= (ite (and (< v_~back~0_53 v_~n~0_32) (<= 0 v_~back~0_53)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5| 0)) (= (+ v_~back~0_53 1) v_~back~0_52) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|)) InVars {~queue~0.offset=v_~queue~0.offset_41, ~back~0=v_~back~0_53, #memory_int=|v_#memory_int_63|, thread1Thread1of1ForFork0_#t~nondet1#1=|v_thread1Thread1of1ForFork0_#t~nondet1#1_16|, ~queue~0.base=v_~queue~0.base_41, ~n~0=v_~n~0_32} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~queue~0.offset=v_~queue~0.offset_41, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_5|, ~back~0=v_~back~0_52, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, #memory_int=|v_#memory_int_63|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_5|, ~queue~0.base=v_~queue~0.base_41, ~n~0=v_~n~0_32} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post3#1, ~back~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_#t~nondet1#1] and [385] L80-4-->L81-3: Formula: (and (= (store |v_#memory_int_68| |v_ULTIMATE.start_main_~#t2~0#1.base_11| (store (select |v_#memory_int_68| |v_ULTIMATE.start_main_~#t2~0#1.base_11|) |v_ULTIMATE.start_main_~#t2~0#1.offset_11| |v_ULTIMATE.start_main_#t~pre12#1_17|)) |v_#memory_int_67|) (= |v_ULTIMATE.start_main_#t~pre12#1_17| |v_#pthreadsForks_24|) (= |v_#pthreadsForks_23| (+ |v_#pthreadsForks_24| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_11|, #memory_int=|v_#memory_int_68|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_11|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_17|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_9|, #pthreadsForks=|v_#pthreadsForks_23|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_11|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_17|, #memory_int=|v_#memory_int_67|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, #pthreadsForks, ULTIMATE.start_main_#t~pre10#1, #memory_int] [2022-12-06 05:41:42,411 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [375] L52-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| (ite (= 5 (select (select |v_#memory_int_63| v_~queue~0.base_41) (+ (* 4 v_~back~0_53) v_~queue~0.offset_41))) 1 0)) (not (= (mod |v_thread1Thread1of1ForFork0_#t~nondet1#1_16| 256) 0)) (not (= (ite (and (< v_~back~0_53 v_~n~0_32) (<= 0 v_~back~0_53)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5| 0)) (= (+ v_~back~0_53 1) v_~back~0_52) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|)) InVars {~queue~0.offset=v_~queue~0.offset_41, ~back~0=v_~back~0_53, #memory_int=|v_#memory_int_63|, thread1Thread1of1ForFork0_#t~nondet1#1=|v_thread1Thread1of1ForFork0_#t~nondet1#1_16|, ~queue~0.base=v_~queue~0.base_41, ~n~0=v_~n~0_32} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~queue~0.offset=v_~queue~0.offset_41, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_5|, ~back~0=v_~back~0_52, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, #memory_int=|v_#memory_int_63|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_5|, ~queue~0.base=v_~queue~0.base_41, ~n~0=v_~n~0_32} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post3#1, ~back~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_#t~nondet1#1] and [367] L64-->L64: Formula: (and (= v_~x~0_21 (select (select |v_#memory_int_57| v_~queue~0.base_39) (+ (* v_~front~0_41 4) v_~queue~0.offset_39))) (not (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4#1_18| 256) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|) (= (ite (and (< v_~front~0_41 v_~back~0_50) (<= 0 v_~front~0_41) (< v_~front~0_41 v_~n~0_30)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|) (= v_~front~0_40 (+ v_~front~0_41 1))) InVars {~queue~0.offset=v_~queue~0.offset_39, #memory_int=|v_#memory_int_57|, ~back~0=v_~back~0_50, ~queue~0.base=v_~queue~0.base_39, ~n~0=v_~n~0_30, thread2Thread1of1ForFork1_#t~nondet4#1=|v_thread2Thread1of1ForFork1_#t~nondet4#1_18|, ~front~0=v_~front~0_41} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, ~queue~0.offset=v_~queue~0.offset_39, #memory_int=|v_#memory_int_57|, ~back~0=v_~back~0_50, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_5|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, ~queue~0.base=v_~queue~0.base_39, ~n~0=v_~n~0_30, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_5|, ~x~0=v_~x~0_21, ~front~0=v_~front~0_40} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post6#1, ~x~0, thread2Thread1of1ForFork1_#t~nondet4#1, ~front~0] [2022-12-06 05:41:42,507 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [375] L52-->L52: Formula: (and (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| (ite (= 5 (select (select |v_#memory_int_63| v_~queue~0.base_41) (+ (* 4 v_~back~0_53) v_~queue~0.offset_41))) 1 0)) (not (= (mod |v_thread1Thread1of1ForFork0_#t~nondet1#1_16| 256) 0)) (not (= (ite (and (< v_~back~0_53 v_~n~0_32) (<= 0 v_~back~0_53)) 1 0) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5| 0)) (= (+ v_~back~0_53 1) v_~back~0_52) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5| |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|)) InVars {~queue~0.offset=v_~queue~0.offset_41, ~back~0=v_~back~0_53, #memory_int=|v_#memory_int_63|, thread1Thread1of1ForFork0_#t~nondet1#1=|v_thread1Thread1of1ForFork0_#t~nondet1#1_16|, ~queue~0.base=v_~queue~0.base_41, ~n~0=v_~n~0_32} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~queue~0.offset=v_~queue~0.offset_41, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_5|, ~back~0=v_~back~0_52, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, #memory_int=|v_#memory_int_63|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_5|, ~queue~0.base=v_~queue~0.base_41, ~n~0=v_~n~0_32} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post3#1, ~back~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_#t~nondet1#1] and [379] L81-4-->L82-1: Formula: (= (select (select |v_#memory_int_65| |v_ULTIMATE.start_main_~#t1~0#1.base_11|) |v_ULTIMATE.start_main_~#t1~0#1.offset_11|) |v_ULTIMATE.start_main_#t~mem14#1_10|) InVars {#memory_int=|v_#memory_int_65|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_11|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_11|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_15|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_10|, #memory_int=|v_#memory_int_65|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_11|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~mem14#1, ULTIMATE.start_main_#t~nondet13#1] [2022-12-06 05:41:42,559 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [385] L80-4-->L81-3: Formula: (and (= (store |v_#memory_int_68| |v_ULTIMATE.start_main_~#t2~0#1.base_11| (store (select |v_#memory_int_68| |v_ULTIMATE.start_main_~#t2~0#1.base_11|) |v_ULTIMATE.start_main_~#t2~0#1.offset_11| |v_ULTIMATE.start_main_#t~pre12#1_17|)) |v_#memory_int_67|) (= |v_ULTIMATE.start_main_#t~pre12#1_17| |v_#pthreadsForks_24|) (= |v_#pthreadsForks_23| (+ |v_#pthreadsForks_24| 1))) InVars {#pthreadsForks=|v_#pthreadsForks_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_11|, #memory_int=|v_#memory_int_68|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_11|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_17|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_9|, #pthreadsForks=|v_#pthreadsForks_23|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_11|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_17|, #memory_int=|v_#memory_int_67|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, ULTIMATE.start_main_#t~nondet11#1, #pthreadsForks, ULTIMATE.start_main_#t~pre10#1, #memory_int] and [367] L64-->L64: Formula: (and (= v_~x~0_21 (select (select |v_#memory_int_57| v_~queue~0.base_39) (+ (* v_~front~0_41 4) v_~queue~0.offset_39))) (not (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4#1_18| 256) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|) (= (ite (and (< v_~front~0_41 v_~back~0_50) (<= 0 v_~front~0_41) (< v_~front~0_41 v_~n~0_30)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|) (= v_~front~0_40 (+ v_~front~0_41 1))) InVars {~queue~0.offset=v_~queue~0.offset_39, #memory_int=|v_#memory_int_57|, ~back~0=v_~back~0_50, ~queue~0.base=v_~queue~0.base_39, ~n~0=v_~n~0_30, thread2Thread1of1ForFork1_#t~nondet4#1=|v_thread2Thread1of1ForFork1_#t~nondet4#1_18|, ~front~0=v_~front~0_41} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, ~queue~0.offset=v_~queue~0.offset_39, #memory_int=|v_#memory_int_57|, ~back~0=v_~back~0_50, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_5|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, ~queue~0.base=v_~queue~0.base_39, ~n~0=v_~n~0_30, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_5|, ~x~0=v_~x~0_21, ~front~0=v_~front~0_40} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post6#1, ~x~0, thread2Thread1of1ForFork1_#t~nondet4#1, ~front~0] [2022-12-06 05:41:42,618 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [470] L52-->L82-1: Formula: (and (= (ite (= 5 (select (select |v_#memory_int_178| v_~queue~0.base_107) (+ v_~queue~0.offset_107 (* v_~back~0_146 4)))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_41|) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_41| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_41|) (not (= (mod |v_thread1Thread1of1ForFork0_#t~nondet1#1_87| 256) 0)) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_41| 0)) (not (= (ite (and (<= 0 v_~back~0_146) (< v_~back~0_146 v_~n~0_98)) 1 0) 0)) (= (select (select |v_#memory_int_178| |v_ULTIMATE.start_main_~#t1~0#1.base_57|) |v_ULTIMATE.start_main_~#t1~0#1.offset_57|) |v_ULTIMATE.start_main_#t~mem14#1_54|) (= v_~back~0_145 (+ v_~back~0_146 1))) InVars {~queue~0.offset=v_~queue~0.offset_107, #memory_int=|v_#memory_int_178|, ~back~0=v_~back~0_146, thread1Thread1of1ForFork0_#t~nondet1#1=|v_thread1Thread1of1ForFork0_#t~nondet1#1_87|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_57|, ~queue~0.base=v_~queue~0.base_107, ~n~0=v_~n~0_98, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_57|} OutVars{~queue~0.offset=v_~queue~0.offset_107, ~back~0=v_~back~0_145, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_41|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_57|, ~queue~0.base=v_~queue~0.base_107, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_57|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_67|, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_41|, ULTIMATE.start_main_#t~mem14#1=|v_ULTIMATE.start_main_#t~mem14#1_54|, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_41|, #memory_int=|v_#memory_int_178|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_48|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_41|, ~n~0=v_~n~0_98} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~mem14#1, thread1Thread1of1ForFork0_#t~post3#1, ~back~0, ULTIMATE.start_main_#t~nondet13#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_#t~nondet1#1] and [367] L64-->L64: Formula: (and (= v_~x~0_21 (select (select |v_#memory_int_57| v_~queue~0.base_39) (+ (* v_~front~0_41 4) v_~queue~0.offset_39))) (not (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4#1_18| 256) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|) (= (ite (and (< v_~front~0_41 v_~back~0_50) (<= 0 v_~front~0_41) (< v_~front~0_41 v_~n~0_30)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|) (= v_~front~0_40 (+ v_~front~0_41 1))) InVars {~queue~0.offset=v_~queue~0.offset_39, #memory_int=|v_#memory_int_57|, ~back~0=v_~back~0_50, ~queue~0.base=v_~queue~0.base_39, ~n~0=v_~n~0_30, thread2Thread1of1ForFork1_#t~nondet4#1=|v_thread2Thread1of1ForFork1_#t~nondet4#1_18|, ~front~0=v_~front~0_41} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, ~queue~0.offset=v_~queue~0.offset_39, #memory_int=|v_#memory_int_57|, ~back~0=v_~back~0_50, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_5|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, ~queue~0.base=v_~queue~0.base_39, ~n~0=v_~n~0_30, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_5|, ~x~0=v_~x~0_21, ~front~0=v_~front~0_40} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post6#1, ~x~0, thread2Thread1of1ForFork1_#t~nondet4#1, ~front~0] [2022-12-06 05:41:42,717 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [467] L52-->L52: Formula: (let ((.cse0 (select |v_#memory_int_170| v_~queue~0.base_101))) (and (not (= 0 (mod |v_thread1Thread1of1ForFork0_#t~nondet1#1_74| 256))) (not (= (ite (and (<= 1 v_~back~0_131) (< v_~back~0_131 (+ v_~n~0_92 1))) 1 0) 0)) (not (= 0 (ite (= (select .cse0 (+ (* v_~back~0_133 4) v_~queue~0.offset_101)) 5) 1 0))) (not (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_33| 0)) (= (ite (= 5 (select .cse0 (+ (* v_~back~0_131 4) (- 4) v_~queue~0.offset_101))) 1 0) |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_33|) (not (= (ite (and (< v_~back~0_133 v_~n~0_92) (<= 0 v_~back~0_133)) 1 0) 0)) (not (= (mod |v_thread1Thread1of1ForFork0_#t~nondet1#1_73| 256) 0)) (= |v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_33| |v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_33|) (= v_~back~0_131 (+ v_~back~0_133 2)))) InVars {~queue~0.offset=v_~queue~0.offset_101, ~back~0=v_~back~0_133, #memory_int=|v_#memory_int_170|, thread1Thread1of1ForFork0_#t~nondet1#1=|v_thread1Thread1of1ForFork0_#t~nondet1#1_74|, ~queue~0.base=v_~queue~0.base_101, ~n~0=v_~n~0_92} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_33|, ~queue~0.offset=v_~queue~0.offset_101, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_33|, ~back~0=v_~back~0_131, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_33|, #memory_int=|v_#memory_int_170|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_33|, ~queue~0.base=v_~queue~0.base_101, ~n~0=v_~n~0_92} AuxVars[|v_thread1Thread1of1ForFork0_#t~nondet1#1_73|] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork0_#t~post3#1, ~back~0, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1, thread1Thread1of1ForFork0_#t~nondet1#1] and [367] L64-->L64: Formula: (and (= v_~x~0_21 (select (select |v_#memory_int_57| v_~queue~0.base_39) (+ (* v_~front~0_41 4) v_~queue~0.offset_39))) (not (= (mod |v_thread2Thread1of1ForFork1_#t~nondet4#1_18| 256) 0)) (not (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5| 0)) (= |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5| |v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|) (= (ite (and (< v_~front~0_41 v_~back~0_50) (<= 0 v_~front~0_41) (< v_~front~0_41 v_~n~0_30)) 1 0) |v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|) (= v_~front~0_40 (+ v_~front~0_41 1))) InVars {~queue~0.offset=v_~queue~0.offset_39, #memory_int=|v_#memory_int_57|, ~back~0=v_~back~0_50, ~queue~0.base=v_~queue~0.base_39, ~n~0=v_~n~0_30, thread2Thread1of1ForFork1_#t~nondet4#1=|v_thread2Thread1of1ForFork1_#t~nondet4#1_18|, ~front~0=v_~front~0_41} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, ~queue~0.offset=v_~queue~0.offset_39, #memory_int=|v_#memory_int_57|, ~back~0=v_~back~0_50, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_5|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, ~queue~0.base=v_~queue~0.base_39, ~n~0=v_~n~0_30, thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_5|, ~x~0=v_~x~0_21, ~front~0=v_~front~0_40} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_#t~mem5#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~post6#1, ~x~0, thread2Thread1of1ForFork1_#t~nondet4#1, ~front~0] [2022-12-06 05:41:42,860 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 05:41:42,861 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 688 [2022-12-06 05:41:42,861 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 78 transitions, 840 flow [2022-12-06 05:41:42,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 13 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:41:42,861 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:41:42,861 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:41:42,869 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-06 05:41:43,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:41:43,062 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 05:41:43,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:41:43,062 INFO L85 PathProgramCache]: Analyzing trace with hash -934974852, now seen corresponding path program 1 times [2022-12-06 05:41:43,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:41:43,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694377999] [2022-12-06 05:41:43,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:41:43,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:41:43,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:41:43,145 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:41:43,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:41:43,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694377999] [2022-12-06 05:41:43,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694377999] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:41:43,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [110900646] [2022-12-06 05:41:43,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:41:43,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:41:43,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:41:43,147 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:41:43,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-06 05:41:43,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:41:43,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 05:41:43,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:41:43,220 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:41:43,220 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:41:43,262 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 05:41:43,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [110900646] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:41:43,262 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:41:43,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 7 [2022-12-06 05:41:43,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509772034] [2022-12-06 05:41:43,262 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:41:43,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 05:41:43,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:41:43,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 05:41:43,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-12-06 05:41:43,263 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 29 [2022-12-06 05:41:43,263 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 78 transitions, 840 flow. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 05:41:43,263 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:41:43,263 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 29 [2022-12-06 05:41:43,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:41:43,440 INFO L130 PetriNetUnfolder]: 678/1340 cut-off events. [2022-12-06 05:41:43,440 INFO L131 PetriNetUnfolder]: For 9616/9616 co-relation queries the response was YES. [2022-12-06 05:41:43,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7530 conditions, 1340 events. 678/1340 cut-off events. For 9616/9616 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 8214 event pairs, 230 based on Foata normal form. 42/1381 useless extension candidates. Maximal degree in co-relation 4585. Up to 672 conditions per place. [2022-12-06 05:41:43,446 INFO L137 encePairwiseOnDemand]: 17/29 looper letters, 70 selfloop transitions, 35 changer transitions 5/110 dead transitions. [2022-12-06 05:41:43,446 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 110 transitions, 1369 flow [2022-12-06 05:41:43,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:41:43,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:41:43,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-12-06 05:41:43,447 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.43103448275862066 [2022-12-06 05:41:43,447 INFO L175 Difference]: Start difference. First operand has 64 places, 78 transitions, 840 flow. Second operand 4 states and 50 transitions. [2022-12-06 05:41:43,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 110 transitions, 1369 flow [2022-12-06 05:41:43,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 110 transitions, 1275 flow, removed 29 selfloop flow, removed 3 redundant places. [2022-12-06 05:41:43,499 INFO L231 Difference]: Finished difference. Result has 64 places, 86 transitions, 1053 flow [2022-12-06 05:41:43,499 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=701, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1053, PETRI_PLACES=64, PETRI_TRANSITIONS=86} [2022-12-06 05:41:43,499 INFO L294 CegarLoopForPetriNet]: 19 programPoint places, 45 predicate places. [2022-12-06 05:41:43,499 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:41:43,499 INFO L89 Accepts]: Start accepts. Operand has 64 places, 86 transitions, 1053 flow [2022-12-06 05:41:43,501 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:41:43,501 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:41:43,501 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 86 transitions, 1053 flow [2022-12-06 05:41:43,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 63 places, 86 transitions, 1053 flow [2022-12-06 05:41:43,550 INFO L130 PetriNetUnfolder]: 293/769 cut-off events. [2022-12-06 05:41:43,550 INFO L131 PetriNetUnfolder]: For 5834/5914 co-relation queries the response was YES. [2022-12-06 05:41:43,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4004 conditions, 769 events. 293/769 cut-off events. For 5834/5914 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 5411 event pairs, 112 based on Foata normal form. 8/741 useless extension candidates. Maximal degree in co-relation 2259. Up to 426 conditions per place. [2022-12-06 05:41:43,555 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 86 transitions, 1053 flow [2022-12-06 05:41:43,555 INFO L188 LiptonReduction]: Number of co-enabled transitions 292 [2022-12-06 05:41:43,562 WARN L322 ript$VariableManager]: TermVariable LBE202 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:41:43,562 WARN L322 ript$VariableManager]: TermVariable LBE30 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:41:43,562 WARN L322 ript$VariableManager]: TermVariable LBE196 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:41:43,562 WARN L322 ript$VariableManager]: TermVariable LBE18 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-12-06 05:41:43,571 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-06 05:41:43,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:41:43,767 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Function c_aux_v_thread1Thread1of1ForFork0_#t~nondet1#1_47 is already defined. at de.uni_freiburg.informatik.ultimate.logic.NoopScript.declareFun(NoopScript.java:229) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.declareFun(Scriptor.java:115) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.declareFun(WrapperScript.java:137) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.declareFun(WrapperScript.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.declareFun(HistoryRecordingScript.java:95) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.declareFun(ManagedScript.java:172) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.variables.ProgramVarUtils.constructConstantForAuxVar(ProgramVarUtils.java:117) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.computeClosedFormula(UnmodifiableTransFormula.java:135) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.(UnmodifiableTransFormula.java:90) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaBuilder.finishConstruction(TransFormulaBuilder.java:324) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.BranchEncoderRenaming.applyToTransFormula(BranchEncoderRenaming.java:114) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.BranchEncoderRenaming.applyToIcfgEdge(BranchEncoderRenaming.java:134) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.IcfgCompositionFactory.composeSequential(IcfgCompositionFactory.java:119) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.IcfgCompositionFactory.composeSequential(IcfgCompositionFactory.java:1) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.CompositionFactoryWithCacheUpdate.composeSequential(CompositionFactoryWithCacheUpdate.java:67) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.CompositionFactoryWithCacheUpdate.composeSequential(CompositionFactoryWithCacheUpdate.java:1) at de.uni_freiburg.informatik.ultimate.automata.partialorder.SequenceRule.executeComposition(SequenceRule.java:724) at de.uni_freiburg.informatik.ultimate.automata.partialorder.SequenceRule.applyInternal(SequenceRule.java:150) at de.uni_freiburg.informatik.ultimate.automata.partialorder.ReductionRule.apply(ReductionRule.java:80) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.sequenceRuleWrapper(LiptonReduction.java:252) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.performReduction(LiptonReduction.java:199) at de.uni_freiburg.informatik.ultimate.automata.partialorder.LiptonReduction.(LiptonReduction.java:143) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.petrinetlbe.PetriNetLargeBlockEncoding.(PetriNetLargeBlockEncoding.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.applyLargeBlockEncoding(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNetWithRepeatedLiptonReduction.refineAbstraction(CegarLoopForPetriNetWithRepeatedLiptonReduction.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-12-06 05:41:43,771 INFO L158 Benchmark]: Toolchain (without parser) took 18982.80ms. Allocated memory was 223.3MB in the beginning and 394.3MB in the end (delta: 170.9MB). Free memory was 199.0MB in the beginning and 301.7MB in the end (delta: -102.7MB). Peak memory consumption was 68.2MB. Max. memory is 8.0GB. [2022-12-06 05:41:43,771 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 223.3MB. Free memory is still 199.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 05:41:43,772 INFO L158 Benchmark]: CACSL2BoogieTranslator took 233.13ms. Allocated memory is still 223.3MB. Free memory was 199.0MB in the beginning and 187.4MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-06 05:41:43,772 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.07ms. Allocated memory is still 223.3MB. Free memory was 187.4MB in the beginning and 185.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 05:41:43,773 INFO L158 Benchmark]: Boogie Preprocessor took 30.83ms. Allocated memory is still 223.3MB. Free memory was 185.3MB in the beginning and 183.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 05:41:43,773 INFO L158 Benchmark]: RCFGBuilder took 544.95ms. Allocated memory is still 223.3MB. Free memory was 183.7MB in the beginning and 162.7MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2022-12-06 05:41:43,773 INFO L158 Benchmark]: TraceAbstraction took 18127.07ms. Allocated memory was 223.3MB in the beginning and 394.3MB in the end (delta: 170.9MB). Free memory was 162.2MB in the beginning and 301.7MB in the end (delta: -139.5MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. [2022-12-06 05:41:43,774 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 223.3MB. Free memory is still 199.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 233.13ms. Allocated memory is still 223.3MB. Free memory was 199.0MB in the beginning and 187.4MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 40.07ms. Allocated memory is still 223.3MB. Free memory was 187.4MB in the beginning and 185.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.83ms. Allocated memory is still 223.3MB. Free memory was 185.3MB in the beginning and 183.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 544.95ms. Allocated memory is still 223.3MB. Free memory was 183.7MB in the beginning and 162.7MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 18127.07ms. Allocated memory was 223.3MB in the beginning and 394.3MB in the end (delta: 170.9MB). Free memory was 162.2MB in the beginning and 301.7MB in the end (delta: -139.5MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.9s, 98 PlacesBefore, 19 PlacesAfterwards, 100 TransitionsBefore, 15 TransitionsAfterwards, 368 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 62 TrivialYvCompositions, 17 ConcurrentYvCompositions, 6 ChoiceCompositions, 85 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 191, independent: 191, independent conditional: 191, 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: 191, independent: 191, independent conditional: 0, independent unconditional: 191, 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: 191, independent: 191, independent conditional: 0, independent unconditional: 191, 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: 191, independent: 191, independent conditional: 0, independent unconditional: 191, 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: 191, independent: 191, independent conditional: 0, independent unconditional: 191, 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: 191, independent: 191, independent conditional: 0, independent unconditional: 191, 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: 191, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 191, unknown conditional: 0, unknown unconditional: 191] , Statistics on independence cache: Total cache size (in pairs): 326, Positive cache size: 326, Positive conditional cache size: 0, Positive unconditional cache size: 326, 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, 18 PlacesBefore, 18 PlacesAfterwards, 16 TransitionsBefore, 16 TransitionsAfterwards, 42 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 20 PlacesBefore, 20 PlacesAfterwards, 17 TransitionsBefore, 17 TransitionsAfterwards, 48 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.7s, 23 PlacesBefore, 22 PlacesAfterwards, 18 TransitionsBefore, 17 TransitionsAfterwards, 48 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.7s, 32 PlacesBefore, 31 PlacesAfterwards, 36 TransitionsBefore, 35 TransitionsAfterwards, 126 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 3, 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: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 6, Positive cache size: 6, Positive conditional cache size: 6, 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: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 55 PlacesBefore, 54 PlacesAfterwards, 65 TransitionsBefore, 64 TransitionsAfterwards, 210 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, independent: 7, independent conditional: 7, 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: 7, independent: 7, independent conditional: 7, 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: 7, independent: 7, independent conditional: 2, independent unconditional: 5, 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: 7, independent: 7, independent conditional: 2, independent unconditional: 5, 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: 6, independent: 6, independent conditional: 2, independent unconditional: 4, 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: 6, independent: 6, independent conditional: 0, independent unconditional: 6, 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: 7, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 2, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 15, Positive cache size: 15, Positive conditional cache size: 11, Positive unconditional cache size: 4, 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: 5, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 63 PlacesBefore, 64 PlacesAfterwards, 77 TransitionsBefore, 78 TransitionsAfterwards, 242 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, 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: 15, independent: 15, independent conditional: 15, 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: 15, independent: 15, independent conditional: 1, independent unconditional: 14, 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: 15, independent: 15, independent conditional: 1, independent unconditional: 14, 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: 2, independent: 2, independent conditional: 1, independent unconditional: 1, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 15, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2, unknown conditional: 1, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 21, Positive cache size: 21, Positive conditional cache size: 15, Positive unconditional cache size: 6, 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: 14, Maximal queried relation: 0 - ExceptionOrErrorResult: SMTLIBException: Function c_aux_v_thread1Thread1of1ForFork0_#t~nondet1#1_47 is already defined. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Function c_aux_v_thread1Thread1of1ForFork0_#t~nondet1#1_47 is already defined.: de.uni_freiburg.informatik.ultimate.logic.NoopScript.declareFun(NoopScript.java:229) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-12-06 05:41:43,802 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...