/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/weaver/parallel-min-max-1.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 07:27:42,300 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 07:27:42,301 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 07:27:42,348 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 07:27:42,349 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 07:27:42,352 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 07:27:42,356 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 07:27:42,361 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 07:27:42,365 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 07:27:42,371 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 07:27:42,372 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 07:27:42,373 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 07:27:42,373 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 07:27:42,374 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 07:27:42,375 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 07:27:42,375 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 07:27:42,376 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 07:27:42,376 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 07:27:42,378 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 07:27:42,379 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 07:27:42,380 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 07:27:42,381 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 07:27:42,391 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 07:27:42,392 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 07:27:42,397 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 07:27:42,397 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 07:27:42,397 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 07:27:42,398 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 07:27:42,399 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 07:27:42,399 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 07:27:42,399 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 07:27:42,400 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 07:27:42,401 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 07:27:42,401 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 07:27:42,402 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 07:27:42,402 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 07:27:42,403 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 07:27:42,410 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 07:27:42,411 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 07:27:42,412 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 07:27:42,413 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 07:27:42,414 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 07:27:42,436 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 07:27:42,436 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 07:27:42,438 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 07:27:42,438 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 07:27:42,438 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 07:27:42,439 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 07:27:42,439 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 07:27:42,439 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 07:27:42,439 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 07:27:42,439 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 07:27:42,440 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 07:27:42,440 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 07:27:42,440 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 07:27:42,440 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 07:27:42,441 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 07:27:42,441 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 07:27:42,441 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 07:27:42,441 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 07:27:42,441 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 07:27:42,441 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 07:27:42,441 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 07:27:42,441 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 07:27:42,441 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 07:27:42,442 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 07:27:42,442 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 07:27:42,442 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 07:27:42,442 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 07:27:42,442 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 07:27:42,442 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 07:27:42,705 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 07:27:42,723 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 07:27:42,724 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 07:27:42,725 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 07:27:42,725 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 07:27:42,726 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-min-max-1.wvr.c [2022-12-06 07:27:43,808 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 07:27:43,982 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 07:27:43,984 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-min-max-1.wvr.c [2022-12-06 07:27:43,997 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4838248c/b90a0a6cb1074f3ba851b86a1009d263/FLAGc20160b03 [2022-12-06 07:27:44,009 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4838248c/b90a0a6cb1074f3ba851b86a1009d263 [2022-12-06 07:27:44,011 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 07:27:44,012 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 07:27:44,013 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 07:27:44,016 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 07:27:44,018 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 07:27:44,019 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:27:44" (1/1) ... [2022-12-06 07:27:44,019 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e848905 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:27:44, skipping insertion in model container [2022-12-06 07:27:44,019 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:27:44" (1/1) ... [2022-12-06 07:27:44,024 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 07:27:44,039 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 07:27:44,152 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:27:44,152 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:27:44,153 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:27:44,153 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:27:44,154 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:27:44,155 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:27:44,157 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:27:44,157 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:27:44,157 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:27:44,157 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:27:44,158 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:27:44,159 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:27:44,159 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:27:44,160 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:27:44,166 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-min-max-1.wvr.c[3057,3070] [2022-12-06 07:27:44,172 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 07:27:44,177 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 07:27:44,185 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:27:44,186 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:27:44,186 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:27:44,186 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:27:44,187 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:27:44,187 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:27:44,188 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:27:44,188 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:27:44,188 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:27:44,189 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:27:44,189 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:27:44,190 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:27:44,190 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 07:27:44,190 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 07:27:44,194 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-min-max-1.wvr.c[3057,3070] [2022-12-06 07:27:44,197 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 07:27:44,206 INFO L208 MainTranslator]: Completed translation [2022-12-06 07:27:44,207 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:27:44 WrapperNode [2022-12-06 07:27:44,207 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 07:27:44,208 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 07:27:44,208 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 07:27:44,208 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 07:27:44,212 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:27:44" (1/1) ... [2022-12-06 07:27:44,218 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:27:44" (1/1) ... [2022-12-06 07:27:44,232 INFO L138 Inliner]: procedures = 25, calls = 53, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 122 [2022-12-06 07:27:44,232 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 07:27:44,233 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 07:27:44,233 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 07:27:44,233 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 07:27:44,238 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:27:44" (1/1) ... [2022-12-06 07:27:44,238 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:27:44" (1/1) ... [2022-12-06 07:27:44,241 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:27:44" (1/1) ... [2022-12-06 07:27:44,241 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:27:44" (1/1) ... [2022-12-06 07:27:44,247 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:27:44" (1/1) ... [2022-12-06 07:27:44,254 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:27:44" (1/1) ... [2022-12-06 07:27:44,255 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:27:44" (1/1) ... [2022-12-06 07:27:44,256 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:27:44" (1/1) ... [2022-12-06 07:27:44,258 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 07:27:44,259 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 07:27:44,259 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 07:27:44,259 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 07:27:44,262 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:27:44" (1/1) ... [2022-12-06 07:27:44,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 07:27:44,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:27:44,284 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 07:27:44,285 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 07:27:44,310 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 07:27:44,310 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 07:27:44,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 07:27:44,310 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 07:27:44,310 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 07:27:44,310 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 07:27:44,310 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 07:27:44,311 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 07:27:44,311 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 07:27:44,311 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 07:27:44,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 07:27:44,311 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 07:27:44,311 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 07:27:44,311 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 07:27:44,311 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 07:27:44,311 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 07:27:44,311 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 07:27:44,312 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 07:27:44,394 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 07:27:44,395 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 07:27:44,589 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 07:27:44,631 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 07:27:44,631 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-06 07:27:44,633 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:27:44 BoogieIcfgContainer [2022-12-06 07:27:44,633 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 07:27:44,635 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 07:27:44,635 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 07:27:44,637 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 07:27:44,637 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 07:27:44" (1/3) ... [2022-12-06 07:27:44,638 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bd174de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:27:44, skipping insertion in model container [2022-12-06 07:27:44,638 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:27:44" (2/3) ... [2022-12-06 07:27:44,638 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bd174de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:27:44, skipping insertion in model container [2022-12-06 07:27:44,638 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:27:44" (3/3) ... [2022-12-06 07:27:44,639 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-min-max-1.wvr.c [2022-12-06 07:27:44,653 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 07:27:44,654 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 07:27:44,654 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 07:27:44,740 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-06 07:27:44,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 160 places, 162 transitions, 348 flow [2022-12-06 07:27:44,820 INFO L130 PetriNetUnfolder]: 12/159 cut-off events. [2022-12-06 07:27:44,820 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 07:27:44,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 159 events. 12/159 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 98 event pairs, 0 based on Foata normal form. 0/146 useless extension candidates. Maximal degree in co-relation 130. Up to 2 conditions per place. [2022-12-06 07:27:44,823 INFO L82 GeneralOperation]: Start removeDead. Operand has 160 places, 162 transitions, 348 flow [2022-12-06 07:27:44,827 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 147 places, 149 transitions, 316 flow [2022-12-06 07:27:44,828 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:44,839 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 149 transitions, 316 flow [2022-12-06 07:27:44,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 149 transitions, 316 flow [2022-12-06 07:27:44,870 INFO L130 PetriNetUnfolder]: 12/149 cut-off events. [2022-12-06 07:27:44,870 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 07:27:44,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162 conditions, 149 events. 12/149 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 98 event pairs, 0 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 130. Up to 2 conditions per place. [2022-12-06 07:27:44,873 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 147 places, 149 transitions, 316 flow [2022-12-06 07:27:44,873 INFO L188 LiptonReduction]: Number of co-enabled transitions 1134 [2022-12-06 07:27:49,809 INFO L203 LiptonReduction]: Total number of compositions: 125 [2022-12-06 07:27:49,819 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 07:27:49,823 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;@bacff60, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 07:27:49,823 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 07:27:49,834 INFO L130 PetriNetUnfolder]: 3/23 cut-off events. [2022-12-06 07:27:49,834 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 07:27:49,834 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:49,835 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:49,835 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:49,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:49,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1666952016, now seen corresponding path program 1 times [2022-12-06 07:27:49,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:49,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133001704] [2022-12-06 07:27:49,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:49,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:49,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:50,063 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 07:27:50,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:50,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133001704] [2022-12-06 07:27:50,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133001704] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:50,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:50,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:27:50,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11585728] [2022-12-06 07:27:50,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:50,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:50,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:50,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:50,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:50,083 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 07:27:50,083 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 24 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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 07:27:50,084 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:50,084 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 07:27:50,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:50,189 INFO L130 PetriNetUnfolder]: 282/438 cut-off events. [2022-12-06 07:27:50,189 INFO L131 PetriNetUnfolder]: For 44/44 co-relation queries the response was YES. [2022-12-06 07:27:50,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 944 conditions, 438 events. 282/438 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1302 event pairs, 173 based on Foata normal form. 0/377 useless extension candidates. Maximal degree in co-relation 800. Up to 356 conditions per place. [2022-12-06 07:27:50,196 INFO L137 encePairwiseOnDemand]: 20/24 looper letters, 32 selfloop transitions, 3 changer transitions 0/35 dead transitions. [2022-12-06 07:27:50,196 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 35 transitions, 164 flow [2022-12-06 07:27:50,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:50,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:50,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2022-12-06 07:27:50,205 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.375 [2022-12-06 07:27:50,206 INFO L175 Difference]: Start difference. First operand has 31 places, 24 transitions, 66 flow. Second operand 4 states and 36 transitions. [2022-12-06 07:27:50,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 35 transitions, 164 flow [2022-12-06 07:27:50,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 35 transitions, 148 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-12-06 07:27:50,211 INFO L231 Difference]: Finished difference. Result has 29 places, 25 transitions, 68 flow [2022-12-06 07:27:50,212 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=68, PETRI_PLACES=29, PETRI_TRANSITIONS=25} [2022-12-06 07:27:50,215 INFO L294 CegarLoopForPetriNet]: 31 programPoint places, -2 predicate places. [2022-12-06 07:27:50,216 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:50,218 INFO L89 Accepts]: Start accepts. Operand has 29 places, 25 transitions, 68 flow [2022-12-06 07:27:50,224 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:50,224 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:50,224 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 29 places, 25 transitions, 68 flow [2022-12-06 07:27:50,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 25 transitions, 68 flow [2022-12-06 07:27:50,230 INFO L130 PetriNetUnfolder]: 3/25 cut-off events. [2022-12-06 07:27:50,230 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 07:27:50,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 25 events. 3/25 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 23 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 21. Up to 4 conditions per place. [2022-12-06 07:27:50,230 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 29 places, 25 transitions, 68 flow [2022-12-06 07:27:50,231 INFO L188 LiptonReduction]: Number of co-enabled transitions 158 [2022-12-06 07:27:50,245 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:27:50,247 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 32 [2022-12-06 07:27:50,247 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 25 transitions, 68 flow [2022-12-06 07:27:50,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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 07:27:50,247 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:50,247 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:50,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 07:27:50,250 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:50,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:50,250 INFO L85 PathProgramCache]: Analyzing trace with hash -525137310, now seen corresponding path program 1 times [2022-12-06 07:27:50,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:50,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810158783] [2022-12-06 07:27:50,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:50,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:50,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:50,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:27:50,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:50,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810158783] [2022-12-06 07:27:50,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810158783] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:50,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:50,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:27:50,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106411854] [2022-12-06 07:27:50,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:50,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:27:50,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:50,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:27:50,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:27:50,346 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 07:27:50,346 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 25 transitions, 68 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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 07:27:50,346 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:50,346 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 07:27:50,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:50,429 INFO L130 PetriNetUnfolder]: 344/532 cut-off events. [2022-12-06 07:27:50,429 INFO L131 PetriNetUnfolder]: For 152/152 co-relation queries the response was YES. [2022-12-06 07:27:50,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1270 conditions, 532 events. 344/532 cut-off events. For 152/152 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1701 event pairs, 221 based on Foata normal form. 0/465 useless extension candidates. Maximal degree in co-relation 397. Up to 438 conditions per place. [2022-12-06 07:27:50,431 INFO L137 encePairwiseOnDemand]: 20/24 looper letters, 34 selfloop transitions, 3 changer transitions 0/37 dead transitions. [2022-12-06 07:27:50,432 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 37 transitions, 178 flow [2022-12-06 07:27:50,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 07:27:50,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 07:27:50,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2022-12-06 07:27:50,432 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.375 [2022-12-06 07:27:50,433 INFO L175 Difference]: Start difference. First operand has 29 places, 25 transitions, 68 flow. Second operand 4 states and 36 transitions. [2022-12-06 07:27:50,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 37 transitions, 178 flow [2022-12-06 07:27:50,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 37 transitions, 168 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-06 07:27:50,434 INFO L231 Difference]: Finished difference. Result has 31 places, 26 transitions, 76 flow [2022-12-06 07:27:50,434 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=76, PETRI_PLACES=31, PETRI_TRANSITIONS=26} [2022-12-06 07:27:50,434 INFO L294 CegarLoopForPetriNet]: 31 programPoint places, 0 predicate places. [2022-12-06 07:27:50,434 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:50,435 INFO L89 Accepts]: Start accepts. Operand has 31 places, 26 transitions, 76 flow [2022-12-06 07:27:50,435 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:50,435 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:50,435 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 26 transitions, 76 flow [2022-12-06 07:27:50,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 26 transitions, 76 flow [2022-12-06 07:27:50,438 INFO L130 PetriNetUnfolder]: 3/26 cut-off events. [2022-12-06 07:27:50,438 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 07:27:50,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 26 events. 3/26 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 28 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 27. Up to 4 conditions per place. [2022-12-06 07:27:50,439 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 26 transitions, 76 flow [2022-12-06 07:27:50,439 INFO L188 LiptonReduction]: Number of co-enabled transitions 180 [2022-12-06 07:27:50,448 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:27:50,449 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 15 [2022-12-06 07:27:50,449 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 26 transitions, 76 flow [2022-12-06 07:27:50,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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 07:27:50,449 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:50,449 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:50,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 07:27:50,449 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:50,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:50,450 INFO L85 PathProgramCache]: Analyzing trace with hash -876665139, now seen corresponding path program 1 times [2022-12-06 07:27:50,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:50,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652644372] [2022-12-06 07:27:50,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:50,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:50,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:50,580 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 07:27:50,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:50,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652644372] [2022-12-06 07:27:50,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652644372] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:27:50,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:27:50,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 07:27:50,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091581176] [2022-12-06 07:27:50,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:27:50,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 07:27:50,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:27:50,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 07:27:50,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 07:27:50,581 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 07:27:50,581 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 26 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 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 07:27:50,581 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:27:50,582 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 07:27:50,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:27:50,648 INFO L130 PetriNetUnfolder]: 344/533 cut-off events. [2022-12-06 07:27:50,648 INFO L131 PetriNetUnfolder]: For 203/203 co-relation queries the response was YES. [2022-12-06 07:27:50,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1365 conditions, 533 events. 344/533 cut-off events. For 203/203 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1624 event pairs, 277 based on Foata normal form. 0/466 useless extension candidates. Maximal degree in co-relation 469. Up to 533 conditions per place. [2022-12-06 07:27:50,650 INFO L137 encePairwiseOnDemand]: 21/24 looper letters, 25 selfloop transitions, 2 changer transitions 0/27 dead transitions. [2022-12-06 07:27:50,651 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 27 transitions, 132 flow [2022-12-06 07:27:50,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 07:27:50,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 07:27:50,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2022-12-06 07:27:50,652 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3611111111111111 [2022-12-06 07:27:50,652 INFO L175 Difference]: Start difference. First operand has 31 places, 26 transitions, 76 flow. Second operand 3 states and 26 transitions. [2022-12-06 07:27:50,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 27 transitions, 132 flow [2022-12-06 07:27:50,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 27 transitions, 126 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-06 07:27:50,654 INFO L231 Difference]: Finished difference. Result has 32 places, 27 transitions, 82 flow [2022-12-06 07:27:50,654 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=32, PETRI_TRANSITIONS=27} [2022-12-06 07:27:50,655 INFO L294 CegarLoopForPetriNet]: 31 programPoint places, 1 predicate places. [2022-12-06 07:27:50,655 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:27:50,655 INFO L89 Accepts]: Start accepts. Operand has 32 places, 27 transitions, 82 flow [2022-12-06 07:27:50,656 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:27:50,656 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:27:50,657 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 27 transitions, 82 flow [2022-12-06 07:27:50,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 27 transitions, 82 flow [2022-12-06 07:27:50,661 INFO L130 PetriNetUnfolder]: 3/27 cut-off events. [2022-12-06 07:27:50,661 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 07:27:50,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 27 events. 3/27 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 28 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 36. Up to 4 conditions per place. [2022-12-06 07:27:50,662 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 27 transitions, 82 flow [2022-12-06 07:27:50,662 INFO L188 LiptonReduction]: Number of co-enabled transitions 180 [2022-12-06 07:27:51,604 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:27:51,605 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 950 [2022-12-06 07:27:51,605 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 26 transitions, 78 flow [2022-12-06 07:27:51,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 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 07:27:51,606 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:27:51,606 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:27:51,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 07:27:51,606 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:27:51,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:27:51,606 INFO L85 PathProgramCache]: Analyzing trace with hash 693898068, now seen corresponding path program 1 times [2022-12-06 07:27:51,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:27:51,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181875646] [2022-12-06 07:27:51,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:51,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:27:51,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:52,231 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:27:52,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:27:52,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181875646] [2022-12-06 07:27:52,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181875646] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:27:52,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2007801555] [2022-12-06 07:27:52,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:27:52,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:27:52,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:27:52,234 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 07:27:52,238 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 07:27:52,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:27:52,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 36 conjunts are in the unsatisfiable core [2022-12-06 07:27:52,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:27:52,400 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-06 07:27:52,423 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 07:27:52,443 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 07:27:52,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:27:52,558 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-12-06 07:27:52,633 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-06 07:27:52,651 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:27:52,651 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:28:01,112 WARN L233 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 34 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-06 07:28:01,157 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:28:01,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2007801555] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:28:01,157 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:28:01,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 8] total 23 [2022-12-06 07:28:01,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845872408] [2022-12-06 07:28:01,157 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:28:01,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-12-06 07:28:01,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:01,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-06 07:28:01,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=434, Unknown=2, NotChecked=0, Total=552 [2022-12-06 07:28:01,159 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 07:28:01,159 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 26 transitions, 78 flow. Second operand has 24 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 24 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:01,159 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:01,159 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 07:28:01,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:03,316 INFO L130 PetriNetUnfolder]: 996/1577 cut-off events. [2022-12-06 07:28:03,316 INFO L131 PetriNetUnfolder]: For 320/320 co-relation queries the response was YES. [2022-12-06 07:28:03,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3945 conditions, 1577 events. 996/1577 cut-off events. For 320/320 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 6884 event pairs, 117 based on Foata normal form. 5/1295 useless extension candidates. Maximal degree in co-relation 3935. Up to 385 conditions per place. [2022-12-06 07:28:03,321 INFO L137 encePairwiseOnDemand]: 15/24 looper letters, 66 selfloop transitions, 9 changer transitions 146/221 dead transitions. [2022-12-06 07:28:03,321 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 221 transitions, 1082 flow [2022-12-06 07:28:03,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-06 07:28:03,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-12-06 07:28:03,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 220 transitions. [2022-12-06 07:28:03,323 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.39855072463768115 [2022-12-06 07:28:03,324 INFO L175 Difference]: Start difference. First operand has 31 places, 26 transitions, 78 flow. Second operand 23 states and 220 transitions. [2022-12-06 07:28:03,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 221 transitions, 1082 flow [2022-12-06 07:28:03,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 221 transitions, 1074 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-06 07:28:03,328 INFO L231 Difference]: Finished difference. Result has 70 places, 30 transitions, 189 flow [2022-12-06 07:28:03,328 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=189, PETRI_PLACES=70, PETRI_TRANSITIONS=30} [2022-12-06 07:28:03,329 INFO L294 CegarLoopForPetriNet]: 31 programPoint places, 39 predicate places. [2022-12-06 07:28:03,329 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:03,329 INFO L89 Accepts]: Start accepts. Operand has 70 places, 30 transitions, 189 flow [2022-12-06 07:28:03,330 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:03,330 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:03,330 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 30 transitions, 189 flow [2022-12-06 07:28:03,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 56 places, 30 transitions, 189 flow [2022-12-06 07:28:03,338 INFO L130 PetriNetUnfolder]: 21/86 cut-off events. [2022-12-06 07:28:03,338 INFO L131 PetriNetUnfolder]: For 534/576 co-relation queries the response was YES. [2022-12-06 07:28:03,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 356 conditions, 86 events. 21/86 cut-off events. For 534/576 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 263 event pairs, 4 based on Foata normal form. 6/90 useless extension candidates. Maximal degree in co-relation 315. Up to 27 conditions per place. [2022-12-06 07:28:03,339 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 30 transitions, 189 flow [2022-12-06 07:28:03,339 INFO L188 LiptonReduction]: Number of co-enabled transitions 180 [2022-12-06 07:28:03,444 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [560] L74-4-->L74-4: Formula: (and (let ((.cse0 (select (select |v_#memory_int_113| v_~A~0.base_62) (+ v_~A~0.offset_62 (* 4 v_thread2Thread1of1ForFork2_~i~1_38))))) (let ((.cse1 (< .cse0 v_~max~0_77))) (or (and (= |v_thread2_#t~mem9_37| v_~max~0_76) (= .cse0 |v_thread2_#t~mem9_37|) (not .cse1)) (and (= v_~max~0_77 v_~max~0_76) .cse1 (= |v_thread2_#t~mem9_37| |v_thread2Thread1of1ForFork2_#t~mem9_22|))))) (< v_thread2Thread1of1ForFork2_~i~1_38 v_~N~0_49) (= (+ v_thread2Thread1of1ForFork2_~i~1_38 1) v_thread2Thread1of1ForFork2_~i~1_37)) InVars {~A~0.base=v_~A~0.base_62, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_38, ~A~0.offset=v_~A~0.offset_62, thread2Thread1of1ForFork2_#t~mem9=|v_thread2Thread1of1ForFork2_#t~mem9_22|, #memory_int=|v_#memory_int_113|, ~max~0=v_~max~0_77, ~N~0=v_~N~0_49} OutVars{~A~0.base=v_~A~0.base_62, thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_37, ~A~0.offset=v_~A~0.offset_62, thread2Thread1of1ForFork2_#t~ite10=|v_thread2Thread1of1ForFork2_#t~ite10_13|, thread2Thread1of1ForFork2_#t~post7=|v_thread2Thread1of1ForFork2_#t~post7_19|, thread2Thread1of1ForFork2_#t~mem8=|v_thread2Thread1of1ForFork2_#t~mem8_13|, #memory_int=|v_#memory_int_113|, ~max~0=v_~max~0_76, ~N~0=v_~N~0_49} AuxVars[|v_thread2_#t~mem9_37|] AssignedVars[thread2Thread1of1ForFork2_~i~1, thread2Thread1of1ForFork2_#t~ite10, thread2Thread1of1ForFork2_#t~post7, thread2Thread1of1ForFork2_#t~mem8, thread2Thread1of1ForFork2_#t~mem9, ~max~0] and [436] $Ultimate##0-->L68: Formula: (= (select (select |v_#memory_int_31| v_~A~0.base_20) v_~A~0.offset_20) v_~max~0_18) InVars {#memory_int=|v_#memory_int_31|, ~A~0.base=v_~A~0.base_20, ~A~0.offset=v_~A~0.offset_20} OutVars{thread2Thread1of1ForFork2_#t~mem6=|v_thread2Thread1of1ForFork2_#t~mem6_1|, #memory_int=|v_#memory_int_31|, ~A~0.base=v_~A~0.base_20, ~max~0=v_~max~0_18, ~A~0.offset=v_~A~0.offset_20} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~mem6, ~max~0] [2022-12-06 07:28:03,526 INFO L203 LiptonReduction]: Total number of compositions: 3 [2022-12-06 07:28:03,527 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 198 [2022-12-06 07:28:03,527 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 28 transitions, 185 flow [2022-12-06 07:28:03,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 24 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:03,527 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:03,527 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:03,539 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 07:28:03,728 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 07:28:03,728 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:03,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:03,729 INFO L85 PathProgramCache]: Analyzing trace with hash -2058719388, now seen corresponding path program 1 times [2022-12-06 07:28:03,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:03,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427902014] [2022-12-06 07:28:03,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:03,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:03,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:03,869 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:28:03,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:03,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427902014] [2022-12-06 07:28:03,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427902014] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:28:03,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:28:03,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:28:03,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100913847] [2022-12-06 07:28:03,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:28:03,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:28:03,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:03,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:28:03,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:28:03,871 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 24 [2022-12-06 07:28:03,871 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 28 transitions, 185 flow. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 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 07:28:03,871 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:03,871 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 24 [2022-12-06 07:28:03,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:03,997 INFO L130 PetriNetUnfolder]: 305/519 cut-off events. [2022-12-06 07:28:03,997 INFO L131 PetriNetUnfolder]: For 4198/4198 co-relation queries the response was YES. [2022-12-06 07:28:03,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2603 conditions, 519 events. 305/519 cut-off events. For 4198/4198 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1758 event pairs, 226 based on Foata normal form. 6/525 useless extension candidates. Maximal degree in co-relation 2565. Up to 488 conditions per place. [2022-12-06 07:28:04,001 INFO L137 encePairwiseOnDemand]: 19/24 looper letters, 25 selfloop transitions, 2 changer transitions 17/44 dead transitions. [2022-12-06 07:28:04,001 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 44 transitions, 314 flow [2022-12-06 07:28:04,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:28:04,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:28:04,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-12-06 07:28:04,002 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3416666666666667 [2022-12-06 07:28:04,002 INFO L175 Difference]: Start difference. First operand has 53 places, 28 transitions, 185 flow. Second operand 5 states and 41 transitions. [2022-12-06 07:28:04,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 44 transitions, 314 flow [2022-12-06 07:28:04,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 44 transitions, 244 flow, removed 33 selfloop flow, removed 15 redundant places. [2022-12-06 07:28:04,010 INFO L231 Difference]: Finished difference. Result has 45 places, 27 transitions, 122 flow [2022-12-06 07:28:04,010 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=122, PETRI_PLACES=45, PETRI_TRANSITIONS=27} [2022-12-06 07:28:04,012 INFO L294 CegarLoopForPetriNet]: 31 programPoint places, 14 predicate places. [2022-12-06 07:28:04,012 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:04,012 INFO L89 Accepts]: Start accepts. Operand has 45 places, 27 transitions, 122 flow [2022-12-06 07:28:04,015 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:04,016 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:04,016 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 27 transitions, 122 flow [2022-12-06 07:28:04,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 27 transitions, 122 flow [2022-12-06 07:28:04,023 INFO L130 PetriNetUnfolder]: 17/78 cut-off events. [2022-12-06 07:28:04,023 INFO L131 PetriNetUnfolder]: For 77/83 co-relation queries the response was YES. [2022-12-06 07:28:04,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 78 events. 17/78 cut-off events. For 77/83 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 239 event pairs, 3 based on Foata normal form. 1/78 useless extension candidates. Maximal degree in co-relation 172. Up to 22 conditions per place. [2022-12-06 07:28:04,024 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 27 transitions, 122 flow [2022-12-06 07:28:04,024 INFO L188 LiptonReduction]: Number of co-enabled transitions 130 [2022-12-06 07:28:05,205 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:28:05,206 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1194 [2022-12-06 07:28:05,206 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 26 transitions, 118 flow [2022-12-06 07:28:05,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 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 07:28:05,206 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:05,206 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:05,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 07:28:05,206 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:05,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:05,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1250957130, now seen corresponding path program 1 times [2022-12-06 07:28:05,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:05,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976419771] [2022-12-06 07:28:05,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:05,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:05,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:05,267 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:28:05,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:05,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976419771] [2022-12-06 07:28:05,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976419771] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:28:05,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1595979114] [2022-12-06 07:28:05,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:05,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:28:05,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:28:05,272 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:28:05,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-06 07:28:05,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:05,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-06 07:28:05,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:28:05,380 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:28:05,380 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:28:05,403 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:28:05,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1595979114] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:28:05,403 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:28:05,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-12-06 07:28:05,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589951069] [2022-12-06 07:28:05,403 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:28:05,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 07:28:05,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:28:05,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 07:28:05,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-12-06 07:28:05,404 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 07:28:05,404 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 26 transitions, 118 flow. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:05,404 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:28:05,404 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 07:28:05,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:28:05,511 INFO L130 PetriNetUnfolder]: 325/533 cut-off events. [2022-12-06 07:28:05,511 INFO L131 PetriNetUnfolder]: For 1083/1083 co-relation queries the response was YES. [2022-12-06 07:28:05,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1908 conditions, 533 events. 325/533 cut-off events. For 1083/1083 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1813 event pairs, 148 based on Foata normal form. 32/565 useless extension candidates. Maximal degree in co-relation 1890. Up to 365 conditions per place. [2022-12-06 07:28:05,514 INFO L137 encePairwiseOnDemand]: 19/23 looper letters, 41 selfloop transitions, 4 changer transitions 0/45 dead transitions. [2022-12-06 07:28:05,514 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 45 transitions, 292 flow [2022-12-06 07:28:05,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:28:05,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:28:05,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2022-12-06 07:28:05,516 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3652173913043478 [2022-12-06 07:28:05,516 INFO L175 Difference]: Start difference. First operand has 41 places, 26 transitions, 118 flow. Second operand 5 states and 42 transitions. [2022-12-06 07:28:05,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 45 transitions, 292 flow [2022-12-06 07:28:05,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 45 transitions, 266 flow, removed 13 selfloop flow, removed 6 redundant places. [2022-12-06 07:28:05,518 INFO L231 Difference]: Finished difference. Result has 40 places, 27 transitions, 118 flow [2022-12-06 07:28:05,518 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=118, PETRI_PLACES=40, PETRI_TRANSITIONS=27} [2022-12-06 07:28:05,520 INFO L294 CegarLoopForPetriNet]: 31 programPoint places, 9 predicate places. [2022-12-06 07:28:05,520 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:28:05,520 INFO L89 Accepts]: Start accepts. Operand has 40 places, 27 transitions, 118 flow [2022-12-06 07:28:05,522 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:28:05,522 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:28:05,522 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 27 transitions, 118 flow [2022-12-06 07:28:05,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 27 transitions, 118 flow [2022-12-06 07:28:05,530 INFO L130 PetriNetUnfolder]: 23/89 cut-off events. [2022-12-06 07:28:05,530 INFO L131 PetriNetUnfolder]: For 75/81 co-relation queries the response was YES. [2022-12-06 07:28:05,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 89 events. 23/89 cut-off events. For 75/81 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 309 event pairs, 7 based on Foata normal form. 1/89 useless extension candidates. Maximal degree in co-relation 168. Up to 32 conditions per place. [2022-12-06 07:28:05,531 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 27 transitions, 118 flow [2022-12-06 07:28:05,531 INFO L188 LiptonReduction]: Number of co-enabled transitions 144 [2022-12-06 07:28:05,535 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:28:05,536 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 16 [2022-12-06 07:28:05,536 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 27 transitions, 118 flow [2022-12-06 07:28:05,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:28:05,536 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:28:05,536 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:28:05,546 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-06 07:28:05,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-12-06 07:28:05,741 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 07:28:05,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:28:05,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1914245726, now seen corresponding path program 2 times [2022-12-06 07:28:05,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:28:05,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144346262] [2022-12-06 07:28:05,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:28:05,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:28:05,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:28:06,228 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 07:28:06,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:28:06,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144346262] [2022-12-06 07:28:06,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144346262] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 07:28:06,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [27010216] [2022-12-06 07:28:06,229 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 07:28:06,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:28:06,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:28:06,230 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 07:28:06,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-06 07:28:06,343 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 07:28:06,344 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 07:28:06,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 39 conjunts are in the unsatisfiable core [2022-12-06 07:28:06,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 07:28:06,387 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-06 07:28:06,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:28:06,427 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-06 07:28:06,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 07:28:06,503 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 45 [2022-12-06 07:28:06,723 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:28:06,723 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 33 [2022-12-06 07:28:06,751 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:28:06,751 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 07:28:07,220 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~A~0.offset 4)) (.cse4 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork1_~i~0 4)))) (and (forall ((v_ArrVal_225 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_225))) (or (forall ((v_ArrVal_226 (Array Int Int))) (let ((.cse1 (select (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_226) c_~A~0.base))) (let ((.cse0 (select .cse1 .cse2))) (or (<= c_~min~0 .cse0) (< .cse0 (select .cse1 c_~A~0.offset)))))) (not (< c_~min~0 (select (select .cse3 c_~A~0.base) .cse4)))))) (forall ((v_ArrVal_225 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_225))) (or (forall ((v_ArrVal_226 (Array Int Int))) (let ((.cse5 (select (store .cse7 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_226) c_~A~0.base))) (let ((.cse6 (select .cse5 c_~A~0.offset))) (or (not (< (select .cse5 .cse2) .cse6)) (<= c_~min~0 .cse6))))) (not (< c_~min~0 (select (select .cse7 c_~A~0.base) .cse4)))))) (forall ((v_ArrVal_225 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_225))) (let ((.cse8 (select (select .cse11 c_~A~0.base) .cse4))) (or (forall ((v_ArrVal_226 (Array Int Int))) (let ((.cse10 (select (store .cse11 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_226) c_~A~0.base))) (let ((.cse9 (select .cse10 .cse2))) (or (<= .cse8 .cse9) (< .cse9 (select .cse10 c_~A~0.offset)))))) (< c_~min~0 .cse8))))) (forall ((v_ArrVal_225 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_225))) (let ((.cse14 (select (select .cse15 c_~A~0.base) .cse4))) (or (forall ((v_ArrVal_226 (Array Int Int))) (let ((.cse12 (select (store .cse15 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_226) c_~A~0.base))) (let ((.cse13 (select .cse12 c_~A~0.offset))) (or (not (< (select .cse12 .cse2) .cse13)) (<= .cse14 .cse13))))) (< c_~min~0 .cse14))))))) is different from false [2022-12-06 07:28:07,262 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset 4)) (.cse5 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset))) (and (forall ((v_ArrVal_225 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_225))) (let ((.cse3 (select (select .cse4 c_~A~0.base) .cse1))) (or (forall ((v_ArrVal_226 (Array Int Int))) (let ((.cse0 (select (store .cse4 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_226) c_~A~0.base))) (let ((.cse2 (select .cse0 c_~A~0.offset))) (or (not (< (select .cse0 .cse1) .cse2)) (<= .cse3 .cse2))))) (< .cse5 .cse3))))) (forall ((v_ArrVal_225 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_225))) (or (not (< .cse5 (select (select .cse6 c_~A~0.base) .cse1))) (forall ((v_ArrVal_226 (Array Int Int))) (let ((.cse8 (select (store .cse6 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_226) c_~A~0.base))) (let ((.cse7 (select .cse8 .cse1))) (or (<= .cse5 .cse7) (< .cse7 (select .cse8 c_~A~0.offset))))))))) (forall ((v_ArrVal_225 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_225))) (let ((.cse9 (select (select .cse12 c_~A~0.base) .cse1))) (or (forall ((v_ArrVal_226 (Array Int Int))) (let ((.cse11 (select (store .cse12 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_226) c_~A~0.base))) (let ((.cse10 (select .cse11 .cse1))) (or (<= .cse9 .cse10) (< .cse10 (select .cse11 c_~A~0.offset)))))) (< .cse5 .cse9))))) (forall ((v_ArrVal_225 (Array Int Int))) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_225))) (or (not (< .cse5 (select (select .cse13 c_~A~0.base) .cse1))) (forall ((v_ArrVal_226 (Array Int Int))) (let ((.cse14 (select (store .cse13 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_226) c_~A~0.base))) (let ((.cse15 (select .cse14 c_~A~0.offset))) (or (not (< (select .cse14 .cse1) .cse15)) (<= .cse5 .cse15)))))))))) is different from false [2022-12-06 07:28:07,367 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:28:07,368 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 10817 treesize of output 9681 [2022-12-06 07:28:07,732 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:28:07,733 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 9261 treesize of output 9181 [2022-12-06 07:28:07,790 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:28:07,791 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 9181 treesize of output 9109 [2022-12-06 07:28:07,880 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:28:07,881 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 9109 treesize of output 8413 [2022-12-06 07:28:07,936 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:28:07,937 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 8413 treesize of output 8213 [2022-12-06 07:28:07,992 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:28:07,993 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 8213 treesize of output 8101 [2022-12-06 07:28:08,052 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:28:08,053 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 8101 treesize of output 7973 [2022-12-06 07:28:08,131 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:28:08,132 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 7973 treesize of output 7749 [2022-12-06 07:28:08,187 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:28:08,188 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 7749 treesize of output 7173 [2022-12-06 07:28:08,244 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 07:28:08,245 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 7173 treesize of output 6613 [2022-12-06 07:28:08,278 INFO L208 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2022-12-06 07:29:11,223 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 07:29:11,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [27010216] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 07:29:11,223 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 07:29:11,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 11] total 28 [2022-12-06 07:29:11,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331040693] [2022-12-06 07:29:11,223 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 07:29:11,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-12-06 07:29:11,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:29:11,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-12-06 07:29:11,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=619, Unknown=8, NotChecked=106, Total=870 [2022-12-06 07:29:11,224 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 23 [2022-12-06 07:29:11,225 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 27 transitions, 118 flow. Second operand has 30 states, 29 states have (on average 2.3448275862068964) internal successors, (68), 29 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:11,225 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:29:11,225 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 23 [2022-12-06 07:29:11,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:29:12,239 INFO L130 PetriNetUnfolder]: 497/802 cut-off events. [2022-12-06 07:29:12,239 INFO L131 PetriNetUnfolder]: For 1446/1446 co-relation queries the response was YES. [2022-12-06 07:29:12,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2903 conditions, 802 events. 497/802 cut-off events. For 1446/1446 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3067 event pairs, 42 based on Foata normal form. 3/805 useless extension candidates. Maximal degree in co-relation 1075. Up to 314 conditions per place. [2022-12-06 07:29:12,241 INFO L137 encePairwiseOnDemand]: 14/23 looper letters, 0 selfloop transitions, 0 changer transitions 123/123 dead transitions. [2022-12-06 07:29:12,241 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 123 transitions, 745 flow [2022-12-06 07:29:12,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-06 07:29:12,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-06 07:29:12,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 118 transitions. [2022-12-06 07:29:12,243 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.34202898550724636 [2022-12-06 07:29:12,243 INFO L175 Difference]: Start difference. First operand has 40 places, 27 transitions, 118 flow. Second operand 15 states and 118 transitions. [2022-12-06 07:29:12,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 123 transitions, 745 flow [2022-12-06 07:29:12,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 123 transitions, 711 flow, removed 8 selfloop flow, removed 3 redundant places. [2022-12-06 07:29:12,247 INFO L231 Difference]: Finished difference. Result has 50 places, 0 transitions, 0 flow [2022-12-06 07:29:12,247 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=0, PETRI_PLACES=50, PETRI_TRANSITIONS=0} [2022-12-06 07:29:12,247 INFO L294 CegarLoopForPetriNet]: 31 programPoint places, 19 predicate places. [2022-12-06 07:29:12,247 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:29:12,247 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 0 transitions, 0 flow [2022-12-06 07:29:12,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 0 places, 0 transitions, 0 flow [2022-12-06 07:29:12,248 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-06 07:29:12,248 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 07:29:12,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 0 conditions, 0 events. 0/0 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 0. Compared 0 event pairs, 0 based on Foata normal form. 0/0 useless extension candidates. Maximal degree in co-relation 0. Up to 0 conditions per place. [2022-12-06 07:29:12,248 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-06 07:29:12,248 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 07:29:12,248 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:29:12,248 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1 [2022-12-06 07:29:12,248 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-06 07:29:12,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.3448275862068964) internal successors, (68), 29 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:29:12,250 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-06 07:29:12,250 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-06 07:29:12,251 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-06 07:29:12,251 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-06 07:29:12,255 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-06 07:29:12,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 07:29:12,455 INFO L458 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2022-12-06 07:29:12,458 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 07:29:12,458 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 07:29:12,460 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 07:29:12 BasicIcfg [2022-12-06 07:29:12,460 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 07:29:12,461 INFO L158 Benchmark]: Toolchain (without parser) took 88448.88ms. Allocated memory was 208.7MB in the beginning and 714.1MB in the end (delta: 505.4MB). Free memory was 186.0MB in the beginning and 674.6MB in the end (delta: -488.6MB). Peak memory consumption was 17.3MB. Max. memory is 8.0GB. [2022-12-06 07:29:12,461 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 208.7MB. Free memory was 186.6MB in the beginning and 186.5MB in the end (delta: 73.2kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 07:29:12,461 INFO L158 Benchmark]: CACSL2BoogieTranslator took 194.33ms. Allocated memory is still 208.7MB. Free memory was 186.0MB in the beginning and 172.3MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-12-06 07:29:12,461 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.74ms. Allocated memory is still 208.7MB. Free memory was 172.3MB in the beginning and 170.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 07:29:12,461 INFO L158 Benchmark]: Boogie Preprocessor took 25.19ms. Allocated memory is still 208.7MB. Free memory was 170.8MB in the beginning and 169.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 07:29:12,462 INFO L158 Benchmark]: RCFGBuilder took 374.84ms. Allocated memory is still 208.7MB. Free memory was 168.7MB in the beginning and 147.2MB in the end (delta: 21.5MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2022-12-06 07:29:12,462 INFO L158 Benchmark]: TraceAbstraction took 87825.59ms. Allocated memory was 208.7MB in the beginning and 714.1MB in the end (delta: 505.4MB). Free memory was 146.7MB in the beginning and 674.6MB in the end (delta: -528.0MB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 07:29:12,466 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.09ms. Allocated memory is still 208.7MB. Free memory was 186.6MB in the beginning and 186.5MB in the end (delta: 73.2kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 194.33ms. Allocated memory is still 208.7MB. Free memory was 186.0MB in the beginning and 172.3MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 24.74ms. Allocated memory is still 208.7MB. Free memory was 172.3MB in the beginning and 170.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.19ms. Allocated memory is still 208.7MB. Free memory was 170.8MB in the beginning and 169.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 374.84ms. Allocated memory is still 208.7MB. Free memory was 168.7MB in the beginning and 147.2MB in the end (delta: 21.5MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * TraceAbstraction took 87825.59ms. Allocated memory was 208.7MB in the beginning and 714.1MB in the end (delta: 505.4MB). Free memory was 146.7MB in the beginning and 674.6MB in the end (delta: -528.0MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.9s, 147 PlacesBefore, 31 PlacesAfterwards, 149 TransitionsBefore, 24 TransitionsAfterwards, 1134 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 88 TrivialYvCompositions, 28 ConcurrentYvCompositions, 9 ChoiceCompositions, 125 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 688, independent: 669, independent conditional: 669, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 688, independent: 669, independent conditional: 0, independent unconditional: 669, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 688, independent: 669, independent conditional: 0, independent unconditional: 669, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 688, independent: 669, independent conditional: 0, independent unconditional: 669, dependent: 19, dependent conditional: 0, dependent unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 635, independent: 622, independent conditional: 0, independent unconditional: 622, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 635, independent: 622, independent conditional: 0, independent unconditional: 622, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 13, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 56, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 688, independent: 47, independent conditional: 0, independent unconditional: 47, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 635, unknown conditional: 0, unknown unconditional: 635] , Statistics on independence cache: Total cache size (in pairs): 958, Positive cache size: 945, Positive conditional cache size: 0, Positive unconditional cache size: 945, Negative cache size: 13, Negative conditional cache size: 0, 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: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 29 PlacesBefore, 29 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 158 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, independent: 8, independent conditional: 8, independent unconditional: 0, dependent: 8, dependent conditional: 8, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 16, independent: 8, independent conditional: 5, independent unconditional: 3, dependent: 8, dependent conditional: 5, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 16, independent: 8, independent conditional: 2, independent unconditional: 6, dependent: 8, dependent conditional: 2, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 16, independent: 8, independent conditional: 2, independent unconditional: 6, dependent: 8, dependent conditional: 2, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, independent: 7, independent conditional: 2, independent unconditional: 5, dependent: 7, dependent conditional: 2, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, independent: 7, independent conditional: 0, independent unconditional: 7, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 7, dependent conditional: 2, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 13, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 13, dependent conditional: 7, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 16, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 14, unknown conditional: 4, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 14, Positive cache size: 7, Positive conditional cache size: 2, Positive unconditional cache size: 5, Negative cache size: 7, Negative conditional cache size: 2, Negative unconditional cache size: 5, 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.0s, 31 PlacesBefore, 31 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 180 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 20, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 10, dependent conditional: 10, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 20, independent: 10, independent conditional: 6, independent unconditional: 4, dependent: 10, dependent conditional: 6, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 20, independent: 10, independent conditional: 3, independent unconditional: 7, dependent: 10, dependent conditional: 3, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 20, independent: 10, independent conditional: 3, independent unconditional: 7, dependent: 10, dependent conditional: 3, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 3, independent conditional: 2, independent unconditional: 1, dependent: 3, dependent conditional: 2, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 2, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 8, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 8, dependent conditional: 7, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 20, independent: 7, independent conditional: 1, independent unconditional: 6, dependent: 7, dependent conditional: 1, dependent unconditional: 6, unknown: 6, unknown conditional: 4, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 20, Positive cache size: 10, Positive conditional cache size: 4, Positive unconditional cache size: 6, Negative cache size: 10, Negative conditional cache size: 4, Negative unconditional cache size: 6, 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.9s, 32 PlacesBefore, 31 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 180 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 40, independent: 24, independent conditional: 24, 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: 40, independent: 24, independent conditional: 12, independent unconditional: 12, dependent: 16, dependent conditional: 4, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 40, independent: 24, independent conditional: 12, independent unconditional: 12, dependent: 16, dependent conditional: 4, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 40, independent: 24, independent conditional: 12, independent unconditional: 12, dependent: 16, dependent conditional: 4, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 4, independent conditional: 4, 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: 4, independent: 4, independent conditional: 0, independent unconditional: 4, 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: 40, independent: 20, independent conditional: 8, independent unconditional: 12, dependent: 16, dependent conditional: 4, dependent unconditional: 12, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 24, Positive cache size: 14, Positive conditional cache size: 8, Positive unconditional cache size: 6, Negative cache size: 10, Negative conditional cache size: 4, Negative unconditional cache size: 6, 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.2s, 56 PlacesBefore, 53 PlacesAfterwards, 30 TransitionsBefore, 28 TransitionsAfterwards, 180 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 26, independent: 23, independent conditional: 23, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 26, independent: 23, independent conditional: 23, independent unconditional: 0, dependent: 3, dependent conditional: 2, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 26, independent: 23, independent conditional: 21, independent unconditional: 2, dependent: 3, dependent conditional: 2, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 26, independent: 23, independent conditional: 21, independent unconditional: 2, dependent: 3, dependent conditional: 2, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 19, independent: 17, independent conditional: 15, independent unconditional: 2, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 19, independent: 14, independent conditional: 0, independent unconditional: 14, dependent: 5, dependent conditional: 0, dependent unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 2, dependent conditional: 1, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 16, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 6, dependent conditional: 4, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 26, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 19, unknown conditional: 16, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 45, Positive cache size: 33, Positive conditional cache size: 24, Positive unconditional cache size: 9, Negative cache size: 12, Negative conditional cache size: 5, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 2, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.2s, 42 PlacesBefore, 41 PlacesAfterwards, 27 TransitionsBefore, 26 TransitionsAfterwards, 130 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 45, Positive cache size: 33, Positive conditional cache size: 24, Positive unconditional cache size: 9, Negative cache size: 12, Negative conditional cache size: 5, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 40 PlacesBefore, 40 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 144 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 3, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 3, independent unconditional: 0, 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: 4, independent: 3, independent conditional: 0, independent unconditional: 3, 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: 3, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 3, dependent conditional: 3, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 49, Positive cache size: 36, Positive conditional cache size: 27, Positive unconditional cache size: 9, Negative cache size: 13, Negative conditional cache size: 6, Negative unconditional cache size: 7, 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, 0 PlacesBefore, 0 PlacesAfterwards, 0 TransitionsBefore, 0 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 49, Positive cache size: 36, Positive conditional cache size: 27, Positive unconditional cache size: 9, Negative cache size: 13, Negative conditional cache size: 6, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - PositiveResult [Line: 115]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 180 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 87.7s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1051 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1051 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 107 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 171 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1470 IncrementalHoareTripleChecker+Invalid, 1748 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 171 mSolverCounterUnsat, 0 mSDtfsCounter, 1470 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 211 GetRequests, 107 SyntacticMatches, 4 SemanticMatches, 100 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 840 ImplicationChecksByTransitivity, 10.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=189occurred in iteration=4, InterpolantAutomatonStates: 59, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 75.2s InterpolantComputationTime, 224 NumberOfCodeBlocks, 224 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 279 ConstructedInterpolants, 9 QuantifiedInterpolants, 3857 SizeOfPredicates, 48 NumberOfNonLiveVariables, 689 ConjunctsInSsa, 81 ConjunctsInUnsatCore, 13 InterpolantComputations, 4 PerfectInterpolantSequences, 11/29 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-12-06 07:29:12,508 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...