/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-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/stack_longer-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 06:15:24,442 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 06:15:24,444 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 06:15:24,487 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 06:15:24,487 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 06:15:24,488 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 06:15:24,489 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 06:15:24,490 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 06:15:24,492 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 06:15:24,492 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 06:15:24,493 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 06:15:24,494 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 06:15:24,494 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 06:15:24,496 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 06:15:24,497 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 06:15:24,498 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 06:15:24,499 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 06:15:24,499 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 06:15:24,529 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 06:15:24,530 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 06:15:24,531 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 06:15:24,547 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 06:15:24,547 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 06:15:24,548 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 06:15:24,551 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 06:15:24,555 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 06:15:24,555 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 06:15:24,557 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 06:15:24,557 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 06:15:24,558 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 06:15:24,558 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 06:15:24,559 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 06:15:24,560 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 06:15:24,561 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 06:15:24,562 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 06:15:24,562 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 06:15:24,562 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 06:15:24,563 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 06:15:24,563 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 06:15:24,563 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 06:15:24,564 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 06:15:24,565 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-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-06 06:15:24,597 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 06:15:24,598 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 06:15:24,600 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 06:15:24,600 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 06:15:24,600 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 06:15:24,600 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 06:15:24,601 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 06:15:24,601 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 06:15:24,601 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 06:15:24,601 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 06:15:24,602 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 06:15:24,602 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 06:15:24,602 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 06:15:24,602 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 06:15:24,602 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 06:15:24,602 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 06:15:24,602 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 06:15:24,602 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 06:15:24,602 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 06:15:24,603 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 06:15:24,603 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 06:15:24,603 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:15:24,603 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 06:15:24,603 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 06:15:24,603 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 06:15:24,603 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 06:15:24,603 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 06:15:24,603 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 06:15:24,604 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 06:15:24,881 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 06:15:24,899 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 06:15:24,901 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 06:15:24,902 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 06:15:24,903 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 06:15:24,905 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/stack_longer-1.i [2022-12-06 06:15:26,037 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 06:15:26,330 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 06:15:26,330 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack_longer-1.i [2022-12-06 06:15:26,356 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/891f215d2/e7cb45ad544c4af3bd9b8f3e6bdbb827/FLAGbf75d0fa5 [2022-12-06 06:15:26,371 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/891f215d2/e7cb45ad544c4af3bd9b8f3e6bdbb827 [2022-12-06 06:15:26,373 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 06:15:26,374 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 06:15:26,376 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 06:15:26,376 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 06:15:26,379 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 06:15:26,379 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:15:26" (1/1) ... [2022-12-06 06:15:26,380 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c27b434 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:15:26, skipping insertion in model container [2022-12-06 06:15:26,381 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 06:15:26" (1/1) ... [2022-12-06 06:15:26,386 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 06:15:26,433 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 06:15:26,828 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack_longer-1.i[41527,41540] [2022-12-06 06:15:26,860 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:15:26,869 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 06:15:26,902 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack_longer-1.i[41527,41540] [2022-12-06 06:15:26,924 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 06:15:26,979 INFO L208 MainTranslator]: Completed translation [2022-12-06 06:15:26,979 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:15:26 WrapperNode [2022-12-06 06:15:26,980 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 06:15:26,981 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 06:15:26,981 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 06:15:26,982 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 06:15:26,987 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:15:26" (1/1) ... [2022-12-06 06:15:27,016 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:15:26" (1/1) ... [2022-12-06 06:15:27,041 INFO L138 Inliner]: procedures = 277, calls = 39, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 155 [2022-12-06 06:15:27,042 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 06:15:27,043 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 06:15:27,043 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 06:15:27,043 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 06:15:27,050 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:15:26" (1/1) ... [2022-12-06 06:15:27,050 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:15:26" (1/1) ... [2022-12-06 06:15:27,064 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:15:26" (1/1) ... [2022-12-06 06:15:27,065 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:15:26" (1/1) ... [2022-12-06 06:15:27,070 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:15:26" (1/1) ... [2022-12-06 06:15:27,072 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:15:26" (1/1) ... [2022-12-06 06:15:27,074 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:15:26" (1/1) ... [2022-12-06 06:15:27,075 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:15:26" (1/1) ... [2022-12-06 06:15:27,088 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 06:15:27,089 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 06:15:27,089 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 06:15:27,090 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 06:15:27,090 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:15:26" (1/1) ... [2022-12-06 06:15:27,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 06:15:27,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:15:27,115 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 06:15:27,134 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 06:15:27,148 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-12-06 06:15:27,148 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-12-06 06:15:27,149 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-12-06 06:15:27,149 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-12-06 06:15:27,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 06:15:27,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 06:15:27,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 06:15:27,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 06:15:27,149 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-12-06 06:15:27,150 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 06:15:27,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 06:15:27,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 06:15:27,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 06:15:27,151 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 06:15:27,331 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 06:15:27,333 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 06:15:27,541 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 06:15:27,547 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 06:15:27,547 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-06 06:15:27,549 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:15:27 BoogieIcfgContainer [2022-12-06 06:15:27,549 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 06:15:27,551 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 06:15:27,551 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 06:15:27,553 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 06:15:27,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 06:15:26" (1/3) ... [2022-12-06 06:15:27,554 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@713554c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:15:27, skipping insertion in model container [2022-12-06 06:15:27,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 06:15:26" (2/3) ... [2022-12-06 06:15:27,554 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@713554c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 06:15:27, skipping insertion in model container [2022-12-06 06:15:27,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 06:15:27" (3/3) ... [2022-12-06 06:15:27,563 INFO L112 eAbstractionObserver]: Analyzing ICFG stack_longer-1.i [2022-12-06 06:15:27,580 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 06:15:27,580 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-06 06:15:27,581 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 06:15:27,686 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-06 06:15:27,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 154 places, 157 transitions, 330 flow [2022-12-06 06:15:27,818 INFO L130 PetriNetUnfolder]: 10/155 cut-off events. [2022-12-06 06:15:27,819 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 06:15:27,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 164 conditions, 155 events. 10/155 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 368 event pairs, 0 based on Foata normal form. 0/143 useless extension candidates. Maximal degree in co-relation 117. Up to 3 conditions per place. [2022-12-06 06:15:27,828 INFO L82 GeneralOperation]: Start removeDead. Operand has 154 places, 157 transitions, 330 flow [2022-12-06 06:15:27,834 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 143 places, 146 transitions, 301 flow [2022-12-06 06:15:27,836 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:15:27,873 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 143 places, 146 transitions, 301 flow [2022-12-06 06:15:27,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 143 places, 146 transitions, 301 flow [2022-12-06 06:15:27,923 INFO L130 PetriNetUnfolder]: 10/146 cut-off events. [2022-12-06 06:15:27,923 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 06:15:27,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 146 events. 10/146 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 297 event pairs, 0 based on Foata normal form. 0/134 useless extension candidates. Maximal degree in co-relation 117. Up to 3 conditions per place. [2022-12-06 06:15:27,932 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 143 places, 146 transitions, 301 flow [2022-12-06 06:15:27,932 INFO L188 LiptonReduction]: Number of co-enabled transitions 7212 [2022-12-06 06:15:32,013 INFO L203 LiptonReduction]: Total number of compositions: 118 [2022-12-06 06:15:32,024 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 06:15:32,029 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;@20d89c39, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 06:15:32,029 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-06 06:15:32,033 INFO L130 PetriNetUnfolder]: 3/24 cut-off events. [2022-12-06 06:15:32,033 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 06:15:32,033 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:15:32,034 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-06 06:15:32,034 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:15:32,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:15:32,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1883113372, now seen corresponding path program 1 times [2022-12-06 06:15:32,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:15:32,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698532357] [2022-12-06 06:15:32,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:15:32,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:15:32,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:15:32,286 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 06:15:32,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:15:32,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698532357] [2022-12-06 06:15:32,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698532357] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:15:32,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:15:32,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:15:32,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653025892] [2022-12-06 06:15:32,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:15:32,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:15:32,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:15:32,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:15:32,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:15:32,319 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 40 [2022-12-06 06:15:32,321 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 40 transitions, 89 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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 06:15:32,321 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:15:32,322 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 40 [2022-12-06 06:15:32,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:15:32,528 INFO L130 PetriNetUnfolder]: 1032/1696 cut-off events. [2022-12-06 06:15:32,528 INFO L131 PetriNetUnfolder]: For 78/78 co-relation queries the response was YES. [2022-12-06 06:15:32,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3424 conditions, 1696 events. 1032/1696 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 7763 event pairs, 303 based on Foata normal form. 0/1238 useless extension candidates. Maximal degree in co-relation 3207. Up to 974 conditions per place. [2022-12-06 06:15:32,538 INFO L137 encePairwiseOnDemand]: 32/40 looper letters, 60 selfloop transitions, 4 changer transitions 0/66 dead transitions. [2022-12-06 06:15:32,538 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 66 transitions, 275 flow [2022-12-06 06:15:32,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:15:32,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:15:32,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2022-12-06 06:15:32,547 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6416666666666667 [2022-12-06 06:15:32,548 INFO L175 Difference]: Start difference. First operand has 41 places, 40 transitions, 89 flow. Second operand 3 states and 77 transitions. [2022-12-06 06:15:32,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 66 transitions, 275 flow [2022-12-06 06:15:32,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 66 transitions, 267 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-06 06:15:32,552 INFO L231 Difference]: Finished difference. Result has 40 places, 40 transitions, 108 flow [2022-12-06 06:15:32,554 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=40, PETRI_TRANSITIONS=40} [2022-12-06 06:15:32,556 INFO L294 CegarLoopForPetriNet]: 41 programPoint places, -1 predicate places. [2022-12-06 06:15:32,556 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:15:32,557 INFO L89 Accepts]: Start accepts. Operand has 40 places, 40 transitions, 108 flow [2022-12-06 06:15:32,559 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:15:32,559 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:15:32,559 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 40 transitions, 108 flow [2022-12-06 06:15:32,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 40 transitions, 108 flow [2022-12-06 06:15:32,568 INFO L130 PetriNetUnfolder]: 19/111 cut-off events. [2022-12-06 06:15:32,568 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-12-06 06:15:32,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148 conditions, 111 events. 19/111 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 418 event pairs, 0 based on Foata normal form. 0/76 useless extension candidates. Maximal degree in co-relation 136. Up to 17 conditions per place. [2022-12-06 06:15:32,570 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 40 transitions, 108 flow [2022-12-06 06:15:32,570 INFO L188 LiptonReduction]: Number of co-enabled transitions 712 [2022-12-06 06:15:32,631 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:15:32,633 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 77 [2022-12-06 06:15:32,633 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 40 transitions, 108 flow [2022-12-06 06:15:32,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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 06:15:32,633 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:15:32,633 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:15:32,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 06:15:32,633 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:15:32,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:15:32,634 INFO L85 PathProgramCache]: Analyzing trace with hash 576850360, now seen corresponding path program 1 times [2022-12-06 06:15:32,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:15:32,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385980496] [2022-12-06 06:15:32,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:15:32,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:15:32,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:15:32,738 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 06:15:32,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:15:32,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385980496] [2022-12-06 06:15:32,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385980496] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:15:32,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:15:32,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:15:32,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920802301] [2022-12-06 06:15:32,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:15:32,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:15:32,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:15:32,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:15:32,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:15:32,741 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2022-12-06 06:15:32,741 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 40 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:15:32,741 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:15:32,742 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2022-12-06 06:15:32,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:15:32,918 INFO L130 PetriNetUnfolder]: 1089/1825 cut-off events. [2022-12-06 06:15:32,918 INFO L131 PetriNetUnfolder]: For 181/183 co-relation queries the response was YES. [2022-12-06 06:15:32,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3872 conditions, 1825 events. 1089/1825 cut-off events. For 181/183 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 8390 event pairs, 499 based on Foata normal form. 52/1432 useless extension candidates. Maximal degree in co-relation 3555. Up to 1383 conditions per place. [2022-12-06 06:15:32,926 INFO L137 encePairwiseOnDemand]: 33/37 looper letters, 50 selfloop transitions, 2 changer transitions 5/61 dead transitions. [2022-12-06 06:15:32,926 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 61 transitions, 271 flow [2022-12-06 06:15:32,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:15:32,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:15:32,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2022-12-06 06:15:32,929 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5945945945945946 [2022-12-06 06:15:32,929 INFO L175 Difference]: Start difference. First operand has 40 places, 40 transitions, 108 flow. Second operand 3 states and 66 transitions. [2022-12-06 06:15:32,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 61 transitions, 271 flow [2022-12-06 06:15:32,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 61 transitions, 261 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-06 06:15:32,931 INFO L231 Difference]: Finished difference. Result has 41 places, 41 transitions, 116 flow [2022-12-06 06:15:32,931 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=41, PETRI_TRANSITIONS=41} [2022-12-06 06:15:32,932 INFO L294 CegarLoopForPetriNet]: 41 programPoint places, 0 predicate places. [2022-12-06 06:15:32,932 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:15:32,932 INFO L89 Accepts]: Start accepts. Operand has 41 places, 41 transitions, 116 flow [2022-12-06 06:15:32,933 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:15:32,933 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:15:32,933 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 41 transitions, 116 flow [2022-12-06 06:15:32,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 41 transitions, 116 flow [2022-12-06 06:15:32,939 INFO L130 PetriNetUnfolder]: 22/96 cut-off events. [2022-12-06 06:15:32,939 INFO L131 PetriNetUnfolder]: For 6/7 co-relation queries the response was YES. [2022-12-06 06:15:32,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 96 events. 22/96 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 286 event pairs, 1 based on Foata normal form. 0/69 useless extension candidates. Maximal degree in co-relation 127. Up to 18 conditions per place. [2022-12-06 06:15:32,940 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 41 transitions, 116 flow [2022-12-06 06:15:32,940 INFO L188 LiptonReduction]: Number of co-enabled transitions 702 [2022-12-06 06:15:32,952 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:15:32,953 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 21 [2022-12-06 06:15:32,953 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 41 transitions, 116 flow [2022-12-06 06:15:32,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:15:32,954 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:15:32,954 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:15:32,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 06:15:32,954 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:15:32,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:15:32,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1906802682, now seen corresponding path program 1 times [2022-12-06 06:15:32,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:15:32,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895207848] [2022-12-06 06:15:32,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:15:32,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:15:32,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:15:33,036 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 06:15:33,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:15:33,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895207848] [2022-12-06 06:15:33,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895207848] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:15:33,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:15:33,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 06:15:33,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125614074] [2022-12-06 06:15:33,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:15:33,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:15:33,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:15:33,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:15:33,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:15:33,040 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 37 [2022-12-06 06:15:33,040 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 41 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 06:15:33,040 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:15:33,040 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 37 [2022-12-06 06:15:33,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:15:33,260 INFO L130 PetriNetUnfolder]: 1146/1922 cut-off events. [2022-12-06 06:15:33,261 INFO L131 PetriNetUnfolder]: For 219/219 co-relation queries the response was YES. [2022-12-06 06:15:33,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4207 conditions, 1922 events. 1146/1922 cut-off events. For 219/219 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 9068 event pairs, 827 based on Foata normal form. 54/1576 useless extension candidates. Maximal degree in co-relation 3883. Up to 1683 conditions per place. [2022-12-06 06:15:33,270 INFO L137 encePairwiseOnDemand]: 34/37 looper letters, 51 selfloop transitions, 4 changer transitions 0/59 dead transitions. [2022-12-06 06:15:33,270 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 59 transitions, 276 flow [2022-12-06 06:15:33,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:15:33,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:15:33,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2022-12-06 06:15:33,271 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5495495495495496 [2022-12-06 06:15:33,271 INFO L175 Difference]: Start difference. First operand has 41 places, 41 transitions, 116 flow. Second operand 3 states and 61 transitions. [2022-12-06 06:15:33,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 59 transitions, 276 flow [2022-12-06 06:15:33,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 59 transitions, 274 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 06:15:33,273 INFO L231 Difference]: Finished difference. Result has 43 places, 42 transitions, 134 flow [2022-12-06 06:15:33,273 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=134, PETRI_PLACES=43, PETRI_TRANSITIONS=42} [2022-12-06 06:15:33,274 INFO L294 CegarLoopForPetriNet]: 41 programPoint places, 2 predicate places. [2022-12-06 06:15:33,274 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:15:33,274 INFO L89 Accepts]: Start accepts. Operand has 43 places, 42 transitions, 134 flow [2022-12-06 06:15:33,274 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:15:33,275 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:15:33,275 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 42 transitions, 134 flow [2022-12-06 06:15:33,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 42 transitions, 134 flow [2022-12-06 06:15:33,284 INFO L130 PetriNetUnfolder]: 32/126 cut-off events. [2022-12-06 06:15:33,284 INFO L131 PetriNetUnfolder]: For 28/34 co-relation queries the response was YES. [2022-12-06 06:15:33,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 210 conditions, 126 events. 32/126 cut-off events. For 28/34 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 416 event pairs, 2 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 196. Up to 28 conditions per place. [2022-12-06 06:15:33,286 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 42 transitions, 134 flow [2022-12-06 06:15:33,286 INFO L188 LiptonReduction]: Number of co-enabled transitions 736 [2022-12-06 06:15:33,289 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 06:15:33,290 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16 [2022-12-06 06:15:33,290 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 42 transitions, 134 flow [2022-12-06 06:15:33,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 06:15:33,290 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:15:33,291 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:15:33,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 06:15:33,291 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:15:33,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:15:33,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1379022029, now seen corresponding path program 1 times [2022-12-06 06:15:33,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:15:33,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833652334] [2022-12-06 06:15:33,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:15:33,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:15:33,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:15:33,379 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:15:33,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:15:33,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833652334] [2022-12-06 06:15:33,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833652334] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 06:15:33,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2026665257] [2022-12-06 06:15:33,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:15:33,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 06:15:33,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 06:15:33,395 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 06:15:33,427 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 06:15:33,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:15:33,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-06 06:15:33,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 06:15:33,560 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:15:33,561 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 06:15:33,613 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 06:15:33,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2026665257] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 06:15:33,614 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 06:15:33,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2022-12-06 06:15:33,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000887120] [2022-12-06 06:15:33,614 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 06:15:33,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 06:15:33,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:15:33,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 06:15:33,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-12-06 06:15:33,616 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 37 [2022-12-06 06:15:33,616 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 42 transitions, 134 flow. Second operand has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 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 06:15:33,616 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:15:33,616 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 37 [2022-12-06 06:15:33,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:15:34,156 INFO L130 PetriNetUnfolder]: 2287/3825 cut-off events. [2022-12-06 06:15:34,157 INFO L131 PetriNetUnfolder]: For 1309/1309 co-relation queries the response was YES. [2022-12-06 06:15:34,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8902 conditions, 3825 events. 2287/3825 cut-off events. For 1309/1309 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 19680 event pairs, 444 based on Foata normal form. 52/3095 useless extension candidates. Maximal degree in co-relation 8335. Up to 1051 conditions per place. [2022-12-06 06:15:34,174 INFO L137 encePairwiseOnDemand]: 31/37 looper letters, 178 selfloop transitions, 22 changer transitions 0/202 dead transitions. [2022-12-06 06:15:34,174 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 202 transitions, 976 flow [2022-12-06 06:15:34,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 06:15:34,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 06:15:34,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 219 transitions. [2022-12-06 06:15:34,176 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5918918918918918 [2022-12-06 06:15:34,176 INFO L175 Difference]: Start difference. First operand has 43 places, 42 transitions, 134 flow. Second operand 10 states and 219 transitions. [2022-12-06 06:15:34,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 202 transitions, 976 flow [2022-12-06 06:15:34,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 202 transitions, 963 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 06:15:34,181 INFO L231 Difference]: Finished difference. Result has 55 places, 60 transitions, 302 flow [2022-12-06 06:15:34,181 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=302, PETRI_PLACES=55, PETRI_TRANSITIONS=60} [2022-12-06 06:15:34,182 INFO L294 CegarLoopForPetriNet]: 41 programPoint places, 14 predicate places. [2022-12-06 06:15:34,182 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:15:34,182 INFO L89 Accepts]: Start accepts. Operand has 55 places, 60 transitions, 302 flow [2022-12-06 06:15:34,183 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:15:34,183 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:15:34,183 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 60 transitions, 302 flow [2022-12-06 06:15:34,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 60 transitions, 302 flow [2022-12-06 06:15:34,199 INFO L130 PetriNetUnfolder]: 80/303 cut-off events. [2022-12-06 06:15:34,200 INFO L131 PetriNetUnfolder]: For 276/308 co-relation queries the response was YES. [2022-12-06 06:15:34,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 629 conditions, 303 events. 80/303 cut-off events. For 276/308 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1454 event pairs, 1 based on Foata normal form. 5/223 useless extension candidates. Maximal degree in co-relation 610. Up to 70 conditions per place. [2022-12-06 06:15:34,202 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 60 transitions, 302 flow [2022-12-06 06:15:34,203 INFO L188 LiptonReduction]: Number of co-enabled transitions 1058 [2022-12-06 06:15:34,218 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [575] L968-->L944-1: Formula: (= v_~top~0_74 |v_t1Thread1of1ForFork1_inc_top_#t~post31#1_43|) InVars {~top~0=v_~top~0_74} OutVars{~top~0=v_~top~0_74, t1Thread1of1ForFork1_inc_top_#t~post31#1=|v_t1Thread1of1ForFork1_inc_top_#t~post31#1_43|} AuxVars[] AssignedVars[t1Thread1of1ForFork1_inc_top_#t~post31#1] and [607] L1008-->L1010-3: Formula: (and (not (= (mod v_~flag~0_75 256) 0)) (= |v_t2Thread1of1ForFork0_pop_~stack#1.offset_51| |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_33|) (= |v_t2Thread1of1ForFork0_get_top_#res#1_65| v_~top~0_111) (= |v_~#arr~0.offset_36| |v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_33|) (= |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_33| |v_~#arr~0.base_39|) (= |v_t2Thread1of1ForFork0_get_top_#res#1_65| 0) (= |v_t2Thread1of1ForFork0_pop_#res#1_41| |v_t2Thread1of1ForFork0_#t~ret45#1_61|) (= |v_t2Thread1of1ForFork0_pop_#in~stack#1.base_33| |v_t2Thread1of1ForFork0_pop_~stack#1.base_51|) (= (+ 2 |v_t2Thread1of1ForFork0_pop_#res#1_41|) 0)) InVars {~#arr~0.offset=|v_~#arr~0.offset_36|, ~flag~0=v_~flag~0_75, ~top~0=v_~top~0_111, ~#arr~0.base=|v_~#arr~0.base_39|} OutVars{~#arr~0.offset=|v_~#arr~0.offset_36|, t2Thread1of1ForFork0_pop_#t~ret35#1=|v_t2Thread1of1ForFork0_pop_#t~ret35#1_65|, t2Thread1of1ForFork0_get_top_#res#1=|v_t2Thread1of1ForFork0_get_top_#res#1_65|, ~flag~0=v_~flag~0_75, t2Thread1of1ForFork0_#t~ret45#1=|v_t2Thread1of1ForFork0_#t~ret45#1_61|, t2Thread1of1ForFork0_pop_#t~nondet36#1=|v_t2Thread1of1ForFork0_pop_#t~nondet36#1_25|, t2Thread1of1ForFork0_pop_#res#1=|v_t2Thread1of1ForFork0_pop_#res#1_41|, ~top~0=v_~top~0_111, t2Thread1of1ForFork0_pop_~stack#1.offset=|v_t2Thread1of1ForFork0_pop_~stack#1.offset_51|, t2Thread1of1ForFork0_pop_~stack#1.base=|v_t2Thread1of1ForFork0_pop_~stack#1.base_51|, t2Thread1of1ForFork0_pop_#t~mem38#1=|v_t2Thread1of1ForFork0_pop_#t~mem38#1_47|, t2Thread1of1ForFork0_pop_#in~stack#1.offset=|v_t2Thread1of1ForFork0_pop_#in~stack#1.offset_33|, t2Thread1of1ForFork0_pop_#t~ret37#1=|v_t2Thread1of1ForFork0_pop_#t~ret37#1_55|, ~#arr~0.base=|v_~#arr~0.base_39|, t2Thread1of1ForFork0_pop_#in~stack#1.base=|v_t2Thread1of1ForFork0_pop_#in~stack#1.base_33|} AuxVars[] AssignedVars[t2Thread1of1ForFork0_pop_~stack#1.base, t2Thread1of1ForFork0_pop_#t~mem38#1, t2Thread1of1ForFork0_pop_#t~ret35#1, t2Thread1of1ForFork0_get_top_#res#1, t2Thread1of1ForFork0_pop_#in~stack#1.offset, t2Thread1of1ForFork0_pop_#t~ret37#1, t2Thread1of1ForFork0_#t~ret45#1, t2Thread1of1ForFork0_pop_#t~nondet36#1, t2Thread1of1ForFork0_pop_#res#1, t2Thread1of1ForFork0_pop_~stack#1.offset, t2Thread1of1ForFork0_pop_#in~stack#1.base] [2022-12-06 06:15:34,260 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [575] L968-->L944-1: Formula: (= v_~top~0_74 |v_t1Thread1of1ForFork1_inc_top_#t~post31#1_43|) InVars {~top~0=v_~top~0_74} OutVars{~top~0=v_~top~0_74, t1Thread1of1ForFork1_inc_top_#t~post31#1=|v_t1Thread1of1ForFork1_inc_top_#t~post31#1_43|} AuxVars[] AssignedVars[t1Thread1of1ForFork1_inc_top_#t~post31#1] and [450] L948-1-->L948-2: Formula: (= |v_t2Thread1of1ForFork0_dec_top_#t~post32#1_5| (+ 1 v_~top~0_9)) InVars {t2Thread1of1ForFork0_dec_top_#t~post32#1=|v_t2Thread1of1ForFork0_dec_top_#t~post32#1_5|} OutVars{t2Thread1of1ForFork0_dec_top_#t~post32#1=|v_t2Thread1of1ForFork0_dec_top_#t~post32#1_5|, ~top~0=v_~top~0_9} AuxVars[] AssignedVars[~top~0] [2022-12-06 06:15:34,292 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:15:34,293 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 111 [2022-12-06 06:15:34,293 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 59 transitions, 306 flow [2022-12-06 06:15:34,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 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 06:15:34,293 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:15:34,293 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:15:34,301 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 06:15:34,499 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 06:15:34,501 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:15:34,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:15:34,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1763564082, now seen corresponding path program 1 times [2022-12-06 06:15:34,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:15:34,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284028117] [2022-12-06 06:15:34,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:15:34,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:15:34,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:15:34,569 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 06:15:34,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:15:34,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284028117] [2022-12-06 06:15:34,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284028117] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:15:34,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:15:34,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 06:15:34,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710135961] [2022-12-06 06:15:34,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:15:34,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 06:15:34,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:15:34,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 06:15:34,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 06:15:34,572 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 40 [2022-12-06 06:15:34,572 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 59 transitions, 306 flow. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:15:34,572 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:15:34,572 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 40 [2022-12-06 06:15:34,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:15:34,687 INFO L130 PetriNetUnfolder]: 693/1294 cut-off events. [2022-12-06 06:15:34,688 INFO L131 PetriNetUnfolder]: For 411/411 co-relation queries the response was YES. [2022-12-06 06:15:34,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3112 conditions, 1294 events. 693/1294 cut-off events. For 411/411 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 5889 event pairs, 98 based on Foata normal form. 0/1104 useless extension candidates. Maximal degree in co-relation 2526. Up to 995 conditions per place. [2022-12-06 06:15:34,694 INFO L137 encePairwiseOnDemand]: 33/40 looper letters, 43 selfloop transitions, 6 changer transitions 3/58 dead transitions. [2022-12-06 06:15:34,694 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 58 transitions, 343 flow [2022-12-06 06:15:34,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 06:15:34,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 06:15:34,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2022-12-06 06:15:34,696 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.475 [2022-12-06 06:15:34,696 INFO L175 Difference]: Start difference. First operand has 54 places, 59 transitions, 306 flow. Second operand 3 states and 57 transitions. [2022-12-06 06:15:34,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 58 transitions, 343 flow [2022-12-06 06:15:34,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 58 transitions, 331 flow, removed 6 selfloop flow, removed 1 redundant places. [2022-12-06 06:15:34,700 INFO L231 Difference]: Finished difference. Result has 52 places, 46 transitions, 212 flow [2022-12-06 06:15:34,700 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=212, PETRI_PLACES=52, PETRI_TRANSITIONS=46} [2022-12-06 06:15:34,701 INFO L294 CegarLoopForPetriNet]: 41 programPoint places, 11 predicate places. [2022-12-06 06:15:34,701 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:15:34,701 INFO L89 Accepts]: Start accepts. Operand has 52 places, 46 transitions, 212 flow [2022-12-06 06:15:34,702 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:15:34,702 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:15:34,702 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 46 transitions, 212 flow [2022-12-06 06:15:34,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 46 transitions, 212 flow [2022-12-06 06:15:34,727 INFO L130 PetriNetUnfolder]: 22/140 cut-off events. [2022-12-06 06:15:34,727 INFO L131 PetriNetUnfolder]: For 55/55 co-relation queries the response was YES. [2022-12-06 06:15:34,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 279 conditions, 140 events. 22/140 cut-off events. For 55/55 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 482 event pairs, 1 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 260. Up to 24 conditions per place. [2022-12-06 06:15:34,729 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 46 transitions, 212 flow [2022-12-06 06:15:34,729 INFO L188 LiptonReduction]: Number of co-enabled transitions 422 [2022-12-06 06:15:36,191 INFO L203 LiptonReduction]: Total number of compositions: 10 [2022-12-06 06:15:36,192 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1491 [2022-12-06 06:15:36,192 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 40 transitions, 222 flow [2022-12-06 06:15:36,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 06:15:36,193 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:15:36,193 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:15:36,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 06:15:36,193 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:15:36,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:15:36,193 INFO L85 PathProgramCache]: Analyzing trace with hash -768131889, now seen corresponding path program 1 times [2022-12-06 06:15:36,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:15:36,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288736279] [2022-12-06 06:15:36,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:15:36,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:15:36,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:15:36,262 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 06:15:36,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:15:36,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288736279] [2022-12-06 06:15:36,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288736279] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:15:36,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:15:36,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:15:36,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071628564] [2022-12-06 06:15:36,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:15:36,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 06:15:36,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:15:36,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 06:15:36,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 06:15:36,264 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 36 [2022-12-06 06:15:36,265 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 40 transitions, 222 flow. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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 06:15:36,265 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:15:36,267 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 36 [2022-12-06 06:15:36,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:15:36,418 INFO L130 PetriNetUnfolder]: 521/977 cut-off events. [2022-12-06 06:15:36,419 INFO L131 PetriNetUnfolder]: For 740/740 co-relation queries the response was YES. [2022-12-06 06:15:36,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2719 conditions, 977 events. 521/977 cut-off events. For 740/740 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4388 event pairs, 133 based on Foata normal form. 24/919 useless extension candidates. Maximal degree in co-relation 2205. Up to 480 conditions per place. [2022-12-06 06:15:36,423 INFO L137 encePairwiseOnDemand]: 25/36 looper letters, 58 selfloop transitions, 10 changer transitions 5/75 dead transitions. [2022-12-06 06:15:36,423 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 75 transitions, 475 flow [2022-12-06 06:15:36,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:15:36,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:15:36,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 85 transitions. [2022-12-06 06:15:36,425 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2022-12-06 06:15:36,426 INFO L175 Difference]: Start difference. First operand has 43 places, 40 transitions, 222 flow. Second operand 5 states and 85 transitions. [2022-12-06 06:15:36,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 75 transitions, 475 flow [2022-12-06 06:15:36,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 75 transitions, 454 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 06:15:36,430 INFO L231 Difference]: Finished difference. Result has 48 places, 39 transitions, 243 flow [2022-12-06 06:15:36,430 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=36, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=243, PETRI_PLACES=48, PETRI_TRANSITIONS=39} [2022-12-06 06:15:36,432 INFO L294 CegarLoopForPetriNet]: 41 programPoint places, 7 predicate places. [2022-12-06 06:15:36,432 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:15:36,432 INFO L89 Accepts]: Start accepts. Operand has 48 places, 39 transitions, 243 flow [2022-12-06 06:15:36,433 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:15:36,433 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:15:36,433 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 39 transitions, 243 flow [2022-12-06 06:15:36,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 39 transitions, 243 flow [2022-12-06 06:15:36,449 INFO L130 PetriNetUnfolder]: 29/133 cut-off events. [2022-12-06 06:15:36,449 INFO L131 PetriNetUnfolder]: For 202/202 co-relation queries the response was YES. [2022-12-06 06:15:36,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 317 conditions, 133 events. 29/133 cut-off events. For 202/202 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 489 event pairs, 1 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 294. Up to 21 conditions per place. [2022-12-06 06:15:36,450 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 39 transitions, 243 flow [2022-12-06 06:15:36,450 INFO L188 LiptonReduction]: Number of co-enabled transitions 350 [2022-12-06 06:15:36,713 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 06:15:36,714 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 282 [2022-12-06 06:15:36,714 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 37 transitions, 241 flow [2022-12-06 06:15:36,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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 06:15:36,715 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:15:36,715 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:15:36,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 06:15:36,715 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:15:36,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:15:36,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1720082693, now seen corresponding path program 1 times [2022-12-06 06:15:36,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:15:36,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110192201] [2022-12-06 06:15:36,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:15:36,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:15:36,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:15:37,136 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 06:15:37,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:15:37,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110192201] [2022-12-06 06:15:37,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110192201] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:15:37,137 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:15:37,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:15:37,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944104194] [2022-12-06 06:15:37,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:15:37,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:15:37,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:15:37,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:15:37,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:15:37,138 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 32 [2022-12-06 06:15:37,138 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 37 transitions, 241 flow. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 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 06:15:37,138 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:15:37,138 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 32 [2022-12-06 06:15:37,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:15:37,343 INFO L130 PetriNetUnfolder]: 613/1121 cut-off events. [2022-12-06 06:15:37,343 INFO L131 PetriNetUnfolder]: For 1622/1622 co-relation queries the response was YES. [2022-12-06 06:15:37,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3239 conditions, 1121 events. 613/1121 cut-off events. For 1622/1622 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 5329 event pairs, 151 based on Foata normal form. 0/1040 useless extension candidates. Maximal degree in co-relation 1804. Up to 681 conditions per place. [2022-12-06 06:15:37,348 INFO L137 encePairwiseOnDemand]: 25/32 looper letters, 64 selfloop transitions, 8 changer transitions 4/78 dead transitions. [2022-12-06 06:15:37,348 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 78 transitions, 588 flow [2022-12-06 06:15:37,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:15:37,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:15:37,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2022-12-06 06:15:37,349 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.50625 [2022-12-06 06:15:37,350 INFO L175 Difference]: Start difference. First operand has 45 places, 37 transitions, 241 flow. Second operand 5 states and 81 transitions. [2022-12-06 06:15:37,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 78 transitions, 588 flow [2022-12-06 06:15:37,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 78 transitions, 571 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-06 06:15:37,354 INFO L231 Difference]: Finished difference. Result has 49 places, 44 transitions, 322 flow [2022-12-06 06:15:37,355 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=322, PETRI_PLACES=49, PETRI_TRANSITIONS=44} [2022-12-06 06:15:37,355 INFO L294 CegarLoopForPetriNet]: 41 programPoint places, 8 predicate places. [2022-12-06 06:15:37,355 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:15:37,355 INFO L89 Accepts]: Start accepts. Operand has 49 places, 44 transitions, 322 flow [2022-12-06 06:15:37,356 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:15:37,356 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:15:37,356 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 44 transitions, 322 flow [2022-12-06 06:15:37,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 49 places, 44 transitions, 322 flow [2022-12-06 06:15:37,371 INFO L130 PetriNetUnfolder]: 44/197 cut-off events. [2022-12-06 06:15:37,371 INFO L131 PetriNetUnfolder]: For 366/367 co-relation queries the response was YES. [2022-12-06 06:15:37,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 530 conditions, 197 events. 44/197 cut-off events. For 366/367 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 950 event pairs, 1 based on Foata normal form. 1/174 useless extension candidates. Maximal degree in co-relation 321. Up to 33 conditions per place. [2022-12-06 06:15:37,373 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 44 transitions, 322 flow [2022-12-06 06:15:37,373 INFO L188 LiptonReduction]: Number of co-enabled transitions 392 [2022-12-06 06:15:37,975 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:15:37,976 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 621 [2022-12-06 06:15:37,976 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 43 transitions, 318 flow [2022-12-06 06:15:37,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 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 06:15:37,976 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:15:37,976 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:15:37,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 06:15:37,977 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:15:37,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:15:37,977 INFO L85 PathProgramCache]: Analyzing trace with hash -32056929, now seen corresponding path program 2 times [2022-12-06 06:15:37,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:15:37,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706539178] [2022-12-06 06:15:37,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:15:37,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:15:38,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 06:15:38,373 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 06:15:38,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 06:15:38,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706539178] [2022-12-06 06:15:38,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706539178] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 06:15:38,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 06:15:38,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 06:15:38,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323645150] [2022-12-06 06:15:38,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 06:15:38,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 06:15:38,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 06:15:38,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 06:15:38,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 06:15:38,392 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 35 [2022-12-06 06:15:38,392 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 43 transitions, 318 flow. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 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 06:15:38,392 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 06:15:38,392 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 35 [2022-12-06 06:15:38,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 06:15:38,631 INFO L130 PetriNetUnfolder]: 751/1363 cut-off events. [2022-12-06 06:15:38,632 INFO L131 PetriNetUnfolder]: For 2327/2327 co-relation queries the response was YES. [2022-12-06 06:15:38,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4134 conditions, 1363 events. 751/1363 cut-off events. For 2327/2327 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 6620 event pairs, 220 based on Foata normal form. 0/1339 useless extension candidates. Maximal degree in co-relation 2642. Up to 624 conditions per place. [2022-12-06 06:15:38,639 INFO L137 encePairwiseOnDemand]: 29/35 looper letters, 67 selfloop transitions, 8 changer transitions 4/81 dead transitions. [2022-12-06 06:15:38,640 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 81 transitions, 667 flow [2022-12-06 06:15:38,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 06:15:38,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 06:15:38,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 83 transitions. [2022-12-06 06:15:38,641 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4742857142857143 [2022-12-06 06:15:38,642 INFO L175 Difference]: Start difference. First operand has 48 places, 43 transitions, 318 flow. Second operand 5 states and 83 transitions. [2022-12-06 06:15:38,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 81 transitions, 667 flow [2022-12-06 06:15:38,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 81 transitions, 651 flow, removed 8 selfloop flow, removed 1 redundant places. [2022-12-06 06:15:38,649 INFO L231 Difference]: Finished difference. Result has 53 places, 48 transitions, 399 flow [2022-12-06 06:15:38,649 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=399, PETRI_PLACES=53, PETRI_TRANSITIONS=48} [2022-12-06 06:15:38,651 INFO L294 CegarLoopForPetriNet]: 41 programPoint places, 12 predicate places. [2022-12-06 06:15:38,651 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 06:15:38,651 INFO L89 Accepts]: Start accepts. Operand has 53 places, 48 transitions, 399 flow [2022-12-06 06:15:38,652 INFO L95 Accepts]: Finished accepts. [2022-12-06 06:15:38,652 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 06:15:38,653 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 48 transitions, 399 flow [2022-12-06 06:15:38,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 48 transitions, 399 flow [2022-12-06 06:15:38,667 INFO L130 PetriNetUnfolder]: 52/210 cut-off events. [2022-12-06 06:15:38,667 INFO L131 PetriNetUnfolder]: For 501/509 co-relation queries the response was YES. [2022-12-06 06:15:38,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 590 conditions, 210 events. 52/210 cut-off events. For 501/509 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1015 event pairs, 1 based on Foata normal form. 3/186 useless extension candidates. Maximal degree in co-relation 352. Up to 39 conditions per place. [2022-12-06 06:15:38,669 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 48 transitions, 399 flow [2022-12-06 06:15:38,669 INFO L188 LiptonReduction]: Number of co-enabled transitions 432 [2022-12-06 06:15:39,350 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 06:15:39,351 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 700 [2022-12-06 06:15:39,351 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 47 transitions, 395 flow [2022-12-06 06:15:39,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 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 06:15:39,352 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 06:15:39,352 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:15:39,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 06:15:39,352 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-06 06:15:39,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 06:15:39,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1395833559, now seen corresponding path program 1 times [2022-12-06 06:15:39,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 06:15:39,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800329389] [2022-12-06 06:15:39,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 06:15:39,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 06:15:39,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:15:39,393 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-06 06:15:39,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-06 06:15:39,430 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-06 06:15:39,430 INFO L373 BasicCegarLoop]: Counterexample is feasible [2022-12-06 06:15:39,431 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-06 06:15:39,432 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 6 remaining) [2022-12-06 06:15:39,433 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-06 06:15:39,433 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2022-12-06 06:15:39,433 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2022-12-06 06:15:39,433 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-06 06:15:39,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 06:15:39,434 INFO L458 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 06:15:39,438 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 06:15:39,438 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 06:15:39,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 06:15:39 BasicIcfg [2022-12-06 06:15:39,468 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 06:15:39,469 INFO L158 Benchmark]: Toolchain (without parser) took 13094.18ms. Allocated memory was 185.6MB in the beginning and 445.6MB in the end (delta: 260.0MB). Free memory was 160.8MB in the beginning and 220.1MB in the end (delta: -59.3MB). Peak memory consumption was 201.9MB. Max. memory is 8.0GB. [2022-12-06 06:15:39,469 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 185.6MB. Free memory is still 163.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 06:15:39,469 INFO L158 Benchmark]: CACSL2BoogieTranslator took 603.51ms. Allocated memory is still 185.6MB. Free memory was 160.4MB in the beginning and 131.2MB in the end (delta: 29.2MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2022-12-06 06:15:39,469 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.31ms. Allocated memory is still 185.6MB. Free memory was 131.2MB in the beginning and 128.5MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-12-06 06:15:39,469 INFO L158 Benchmark]: Boogie Preprocessor took 45.86ms. Allocated memory is still 185.6MB. Free memory was 128.5MB in the beginning and 126.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 06:15:39,469 INFO L158 Benchmark]: RCFGBuilder took 459.68ms. Allocated memory is still 185.6MB. Free memory was 126.9MB in the beginning and 109.6MB in the end (delta: 17.2MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2022-12-06 06:15:39,470 INFO L158 Benchmark]: TraceAbstraction took 11917.47ms. Allocated memory was 185.6MB in the beginning and 445.6MB in the end (delta: 260.0MB). Free memory was 109.1MB in the beginning and 220.1MB in the end (delta: -111.1MB). Peak memory consumption was 150.5MB. Max. memory is 8.0GB. [2022-12-06 06:15:39,470 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 185.6MB. Free memory is still 163.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 603.51ms. Allocated memory is still 185.6MB. Free memory was 160.4MB in the beginning and 131.2MB in the end (delta: 29.2MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 61.31ms. Allocated memory is still 185.6MB. Free memory was 131.2MB in the beginning and 128.5MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 45.86ms. Allocated memory is still 185.6MB. Free memory was 128.5MB in the beginning and 126.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 459.68ms. Allocated memory is still 185.6MB. Free memory was 126.9MB in the beginning and 109.6MB in the end (delta: 17.2MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 11917.47ms. Allocated memory was 185.6MB in the beginning and 445.6MB in the end (delta: 260.0MB). Free memory was 109.1MB in the beginning and 220.1MB in the end (delta: -111.1MB). Peak memory consumption was 150.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.1s, 143 PlacesBefore, 41 PlacesAfterwards, 146 TransitionsBefore, 40 TransitionsAfterwards, 7212 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 26 TrivialYvCompositions, 83 ConcurrentYvCompositions, 4 ChoiceCompositions, 118 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5586, independent: 5507, independent conditional: 5507, independent unconditional: 0, dependent: 79, dependent conditional: 79, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 5586, independent: 5507, independent conditional: 0, independent unconditional: 5507, dependent: 79, dependent conditional: 0, dependent unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5586, independent: 5507, independent conditional: 0, independent unconditional: 5507, dependent: 79, dependent conditional: 0, dependent unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5586, independent: 5507, independent conditional: 0, independent unconditional: 5507, dependent: 79, dependent conditional: 0, dependent unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4561, independent: 4509, independent conditional: 0, independent unconditional: 4509, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4561, independent: 4481, independent conditional: 0, independent unconditional: 4481, dependent: 80, dependent conditional: 0, dependent unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 80, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 114, independent: 33, independent conditional: 0, independent unconditional: 33, dependent: 81, dependent conditional: 0, dependent unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5586, independent: 998, independent conditional: 0, independent unconditional: 998, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 4561, unknown conditional: 0, unknown unconditional: 4561] , Statistics on independence cache: Total cache size (in pairs): 8726, Positive cache size: 8674, Positive conditional cache size: 0, Positive unconditional cache size: 8674, Negative cache size: 52, Negative conditional cache size: 0, Negative unconditional cache size: 52, 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.1s, 40 PlacesBefore, 40 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 712 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 217, independent: 196, independent conditional: 196, independent unconditional: 0, dependent: 21, dependent conditional: 21, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 217, independent: 196, independent conditional: 1, independent unconditional: 195, dependent: 21, dependent conditional: 6, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 217, independent: 196, independent conditional: 1, independent unconditional: 195, dependent: 21, dependent conditional: 6, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 217, independent: 196, independent conditional: 1, independent unconditional: 195, dependent: 21, dependent conditional: 6, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 179, independent: 161, independent conditional: 1, independent unconditional: 160, dependent: 18, dependent conditional: 5, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 179, independent: 156, independent conditional: 0, independent unconditional: 156, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 23, independent: 5, independent conditional: 1, independent unconditional: 4, dependent: 18, dependent conditional: 5, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 58, independent: 4, independent conditional: 1, independent unconditional: 3, dependent: 54, dependent conditional: 5, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 217, independent: 35, independent conditional: 0, independent unconditional: 35, dependent: 3, dependent conditional: 1, dependent unconditional: 2, unknown: 179, unknown conditional: 6, unknown unconditional: 173] , Statistics on independence cache: Total cache size (in pairs): 179, Positive cache size: 161, Positive conditional cache size: 1, Positive unconditional cache size: 160, Negative cache size: 18, Negative conditional cache size: 5, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 41 PlacesBefore, 41 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 702 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 95, independent: 79, independent conditional: 79, independent unconditional: 0, dependent: 16, dependent conditional: 16, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 95, independent: 79, independent conditional: 0, independent unconditional: 79, dependent: 16, dependent conditional: 1, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 95, independent: 79, independent conditional: 0, independent unconditional: 79, dependent: 16, dependent conditional: 1, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 95, independent: 79, independent conditional: 0, independent unconditional: 79, dependent: 16, dependent conditional: 1, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 23, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 7, dependent conditional: 1, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 23, independent: 13, independent conditional: 0, independent unconditional: 13, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 10, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 7, dependent conditional: 1, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 10, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 7, dependent conditional: 1, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 95, independent: 63, independent conditional: 0, independent unconditional: 63, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 23, unknown conditional: 1, unknown unconditional: 22] , Statistics on independence cache: Total cache size (in pairs): 202, Positive cache size: 177, Positive conditional cache size: 1, Positive unconditional cache size: 176, Negative cache size: 25, Negative conditional cache size: 6, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 43 PlacesBefore, 43 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 736 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 119, independent: 102, independent conditional: 102, independent unconditional: 0, dependent: 17, dependent conditional: 17, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 119, independent: 102, independent conditional: 0, independent unconditional: 102, dependent: 17, dependent conditional: 1, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 120, independent: 102, independent conditional: 0, independent unconditional: 102, dependent: 18, dependent conditional: 2, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 120, independent: 102, independent conditional: 0, independent unconditional: 102, dependent: 18, dependent conditional: 2, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2, dependent conditional: 2, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 120, independent: 100, independent conditional: 0, independent unconditional: 100, dependent: 17, dependent conditional: 1, dependent unconditional: 16, unknown: 3, unknown conditional: 1, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 205, Positive cache size: 179, Positive conditional cache size: 1, Positive unconditional cache size: 178, Negative cache size: 26, Negative conditional cache size: 7, Negative unconditional cache size: 19, 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.1s, 55 PlacesBefore, 54 PlacesAfterwards, 60 TransitionsBefore, 59 TransitionsAfterwards, 1058 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 361, independent: 330, independent conditional: 330, independent unconditional: 0, dependent: 31, dependent conditional: 31, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 361, independent: 330, independent conditional: 124, independent unconditional: 206, dependent: 31, dependent conditional: 15, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 363, independent: 330, independent conditional: 108, independent unconditional: 222, dependent: 33, dependent conditional: 17, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 363, independent: 330, independent conditional: 108, independent unconditional: 222, dependent: 33, dependent conditional: 17, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 38, independent: 31, independent conditional: 19, independent unconditional: 12, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 38, independent: 29, independent conditional: 0, independent unconditional: 29, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 9, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 9, independent: 2, independent conditional: 2, independent unconditional: 0, dependent: 7, dependent conditional: 7, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 363, independent: 299, independent conditional: 89, independent unconditional: 210, dependent: 26, dependent conditional: 10, dependent unconditional: 16, unknown: 38, unknown conditional: 26, unknown unconditional: 12] , Statistics on independence cache: Total cache size (in pairs): 245, Positive cache size: 212, Positive conditional cache size: 20, Positive unconditional cache size: 192, Negative cache size: 33, Negative conditional cache size: 14, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 16, Maximal queried relation: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.5s, 49 PlacesBefore, 43 PlacesAfterwards, 46 TransitionsBefore, 40 TransitionsAfterwards, 422 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 0 ChoiceCompositions, 10 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 114, independent: 114, independent conditional: 114, 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: 114, independent: 114, independent conditional: 30, independent unconditional: 84, 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: 114, independent: 114, independent conditional: 0, independent unconditional: 114, 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: 114, independent: 114, independent conditional: 0, independent unconditional: 114, 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: 22, independent: 22, independent conditional: 0, independent unconditional: 22, 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: 22, independent: 22, independent conditional: 0, independent unconditional: 22, 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: 114, independent: 92, independent conditional: 0, independent unconditional: 92, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 22, unknown conditional: 0, unknown unconditional: 22] , Statistics on independence cache: Total cache size (in pairs): 372, Positive cache size: 339, Positive conditional cache size: 23, Positive unconditional cache size: 316, Negative cache size: 33, Negative conditional cache size: 14, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 30, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.3s, 47 PlacesBefore, 45 PlacesAfterwards, 39 TransitionsBefore, 37 TransitionsAfterwards, 350 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 24, independent: 24, independent conditional: 24, 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: 24, independent: 24, independent conditional: 12, independent unconditional: 12, 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: 24, independent: 24, independent conditional: 6, independent unconditional: 18, 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: 24, independent: 24, independent conditional: 6, independent unconditional: 18, 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: 24, independent: 24, independent conditional: 6, independent unconditional: 18, 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): 383, Positive cache size: 350, Positive conditional cache size: 23, Positive unconditional cache size: 327, Negative cache size: 33, Negative conditional cache size: 14, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 6, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 49 PlacesBefore, 48 PlacesAfterwards, 44 TransitionsBefore, 43 TransitionsAfterwards, 392 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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: 15, 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: 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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 15, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 393, Positive cache size: 360, Positive conditional cache size: 33, Positive unconditional cache size: 327, Negative cache size: 33, Negative conditional cache size: 14, Negative unconditional cache size: 19, 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.7s, 53 PlacesBefore, 52 PlacesAfterwards, 48 TransitionsBefore, 47 TransitionsAfterwards, 432 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 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: 15, 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: 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] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 0, independent unconditional: 15, 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: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 15, unknown conditional: 15, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 408, Positive cache size: 375, Positive conditional cache size: 48, Positive unconditional cache size: 327, Negative cache size: 33, Negative conditional cache size: 14, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - CounterExampleResult [Line: 940]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L935] 0 static int top=0; [L936] 0 static unsigned int arr[(400)]; [L937] 0 pthread_mutex_t m; [L938] 0 _Bool flag=(0); [L1019] 0 pthread_t id1, id2; [L1021] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [arr={3:0}, flag=0, id1={6:0}, id2={5:0}, m={4:0}, pthread_create(&id1, ((void *)0), t1, ((void *)0))=9, top=0] [L988] 1 int i; [L989] 1 unsigned int tmp; [L990] 1 i=0 VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L1022] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [arr={3:0}, flag=0, id1={6:0}, id2={5:0}, m={4:0}, pthread_create(&id2, ((void *)0), t2, ((void *)0))=10, top=0] [L1004] 2 int i; [L1005] 2 i=0 VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L990] COND TRUE 1 i<(400) [L993] 1 tmp = __VERIFIER_nondet_uint() [L994] CALL 1 assume_abort_if_not(tmp < (400)) [L23] COND FALSE 1 !(!cond) [L994] RET 1 assume_abort_if_not(tmp < (400)) [L995] CALL, EXPR 1 push(arr,tmp) [L960] COND FALSE 1 !(top==(400)) [L967] CALL, EXPR 1 get_top() [L952] 1 return top; [L967] RET, EXPR 1 get_top() [L967] 1 stack[get_top()] = x [L968] CALL 1 inc_top() [L944] 1 top++ [L968] RET 1 inc_top() [L970] 1 return 0; [L995] RET, EXPR 1 push(arr,tmp) [L995] COND FALSE 1 !(push(arr,tmp)==(-1)) [L997] 1 flag=(1) [L990] 1 i++ VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=1, m={4:0}, tmp=399, top=1] [L1005] COND TRUE 2 i<(400) [L1008] COND TRUE 2 \read(flag) [L1010] CALL, EXPR 2 pop(arr) [L974] CALL, EXPR 2 get_top() [L952] 2 return top; [L974] RET, EXPR 2 get_top() [L974] COND FALSE 2 !(get_top()==0) [L981] CALL 2 dec_top() [L948] 2 top-- [L981] RET 2 dec_top() [L982] CALL, EXPR 2 get_top() [L952] 2 return top; [L982] RET, EXPR 2 get_top() [L982] EXPR 2 stack[get_top()] [L982] 2 return stack[get_top()]; [L1010] RET, EXPR 2 pop(arr) [L1010] COND FALSE 2 !(!(pop(arr)!=(-2))) [L1005] 2 i++ VAL [arg={0:0}, arg={0:0}, arr={3:0}, flag=1, i=1, m={4:0}, top=0] [L1005] COND TRUE 2 i<(400) [L1008] COND TRUE 2 \read(flag) [L1010] CALL, EXPR 2 pop(arr) [L974] CALL, EXPR 2 get_top() [L952] 2 return top; [L974] RET, EXPR 2 get_top() [L974] COND TRUE 2 get_top()==0 [L977] 2 return (-2); [L1010] RET, EXPR 2 pop(arr) [L1010] COND TRUE 2 !(pop(arr)!=(-2)) [L1011] CALL 2 error() [L940] 2 reach_error() VAL [arr={3:0}, flag=1, m={4:0}, top=0] - UnprovableResult [Line: 1021]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 1022]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 940]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 248 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 11.7s, OverallIterations: 9, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 346 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 346 mSDsluCounter, 13 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8 mSDsCounter, 30 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1259 IncrementalHoareTripleChecker+Invalid, 1289 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 30 mSolverCounterUnsat, 5 mSDtfsCounter, 1259 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=399occurred in iteration=8, InterpolantAutomatonStates: 37, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 118 NumberOfCodeBlocks, 118 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 109 ConstructedInterpolants, 0 QuantifiedInterpolants, 809 SizeOfPredicates, 1 NumberOfNonLiveVariables, 192 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 10 InterpolantComputations, 7 PerfectInterpolantSequences, 3/9 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-06 06:15:39,493 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...