/usr/bin/java -Xmx16000000000 -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-NoLbe-After.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/parallel-bakery-4.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bf34d27 [2022-01-19 13:30:27,956 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-19 13:30:27,957 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-19 13:30:28,014 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-19 13:30:28,015 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-19 13:30:28,017 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-19 13:30:28,019 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-19 13:30:28,022 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-19 13:30:28,023 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-19 13:30:28,026 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-19 13:30:28,026 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-19 13:30:28,027 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-19 13:30:28,027 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-19 13:30:28,029 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-19 13:30:28,030 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-19 13:30:28,030 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-19 13:30:28,031 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-19 13:30:28,031 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-19 13:30:28,034 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-19 13:30:28,038 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-19 13:30:28,038 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-19 13:30:28,039 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-19 13:30:28,040 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-19 13:30:28,041 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-19 13:30:28,045 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-19 13:30:28,045 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-19 13:30:28,045 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-19 13:30:28,046 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-19 13:30:28,046 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-19 13:30:28,047 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-19 13:30:28,047 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-19 13:30:28,047 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-19 13:30:28,048 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-19 13:30:28,049 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-19 13:30:28,050 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-19 13:30:28,050 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-19 13:30:28,050 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-19 13:30:28,050 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-19 13:30:28,050 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-19 13:30:28,051 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-19 13:30:28,051 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-19 13:30:28,052 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-NoLbe-After.epf [2022-01-19 13:30:28,074 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-19 13:30:28,074 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-19 13:30:28,075 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-19 13:30:28,075 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-19 13:30:28,076 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-19 13:30:28,076 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-19 13:30:28,076 INFO L138 SettingsManager]: * Use SBE=true [2022-01-19 13:30:28,076 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-19 13:30:28,076 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-19 13:30:28,076 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-19 13:30:28,077 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-19 13:30:28,077 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-19 13:30:28,077 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-19 13:30:28,077 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-19 13:30:28,077 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-19 13:30:28,077 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-19 13:30:28,077 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-19 13:30:28,077 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-19 13:30:28,077 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-19 13:30:28,077 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-19 13:30:28,078 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-19 13:30:28,078 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-19 13:30:28,078 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-19 13:30:28,078 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 13:30:28,078 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-19 13:30:28,078 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-19 13:30:28,078 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-19 13:30:28,079 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-19 13:30:28,079 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-19 13:30:28,079 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-19 13:30:28,079 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-19 13:30:28,079 INFO L138 SettingsManager]: * When to check the insufficient erros location relative to the other error locations=AFTER [2022-01-19 13:30:28,079 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-01-19 13:30:28,254 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-19 13:30:28,276 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-19 13:30:28,278 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-19 13:30:28,278 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-19 13:30:28,279 INFO L275 PluginConnector]: CDTParser initialized [2022-01-19 13:30:28,280 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-bakery-4.wvr.c [2022-01-19 13:30:28,313 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/870dd6822/c6ae34dd45be48acb20cf5050b87919c/FLAG6a53ab1fa [2022-01-19 13:30:28,674 INFO L306 CDTParser]: Found 1 translation units. [2022-01-19 13:30:28,674 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-bakery-4.wvr.c [2022-01-19 13:30:28,693 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/870dd6822/c6ae34dd45be48acb20cf5050b87919c/FLAG6a53ab1fa [2022-01-19 13:30:29,092 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/870dd6822/c6ae34dd45be48acb20cf5050b87919c [2022-01-19 13:30:29,093 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-19 13:30:29,094 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-19 13:30:29,097 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-19 13:30:29,098 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-19 13:30:29,099 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-19 13:30:29,100 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 01:30:29" (1/1) ... [2022-01-19 13:30:29,100 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41e0f35f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:30:29, skipping insertion in model container [2022-01-19 13:30:29,100 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 01:30:29" (1/1) ... [2022-01-19 13:30:29,105 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-19 13:30:29,133 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-19 13:30:29,329 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-bakery-4.wvr.c[7978,7991] [2022-01-19 13:30:29,333 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 13:30:29,343 INFO L203 MainTranslator]: Completed pre-run [2022-01-19 13:30:29,391 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-bakery-4.wvr.c[7978,7991] [2022-01-19 13:30:29,394 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 13:30:29,405 INFO L208 MainTranslator]: Completed translation [2022-01-19 13:30:29,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:30:29 WrapperNode [2022-01-19 13:30:29,405 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-19 13:30:29,406 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-19 13:30:29,406 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-19 13:30:29,406 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-19 13:30:29,412 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:30:29" (1/1) ... [2022-01-19 13:30:29,431 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:30:29" (1/1) ... [2022-01-19 13:30:29,464 INFO L137 Inliner]: procedures = 23, calls = 176, calls flagged for inlining = 28, calls inlined = 28, statements flattened = 440 [2022-01-19 13:30:29,464 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-19 13:30:29,465 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-19 13:30:29,465 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-19 13:30:29,465 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-19 13:30:29,473 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:30:29" (1/1) ... [2022-01-19 13:30:29,474 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:30:29" (1/1) ... [2022-01-19 13:30:29,480 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:30:29" (1/1) ... [2022-01-19 13:30:29,480 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:30:29" (1/1) ... [2022-01-19 13:30:29,491 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:30:29" (1/1) ... [2022-01-19 13:30:29,493 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:30:29" (1/1) ... [2022-01-19 13:30:29,494 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:30:29" (1/1) ... [2022-01-19 13:30:29,496 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-19 13:30:29,497 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-19 13:30:29,497 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-19 13:30:29,497 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-19 13:30:29,504 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:30:29" (1/1) ... [2022-01-19 13:30:29,508 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 13:30:29,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 13:30:29,538 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-01-19 13:30:29,554 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-01-19 13:30:29,568 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-19 13:30:29,569 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-01-19 13:30:29,569 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-01-19 13:30:29,569 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-01-19 13:30:29,569 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-01-19 13:30:29,569 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-01-19 13:30:29,569 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-01-19 13:30:29,569 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-01-19 13:30:29,569 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-01-19 13:30:29,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-19 13:30:29,569 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-19 13:30:29,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-19 13:30:29,570 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-01-19 13:30:29,570 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-01-19 13:30:29,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-19 13:30:29,570 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-19 13:30:29,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-19 13:30:29,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-19 13:30:29,571 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-19 13:30:29,658 INFO L234 CfgBuilder]: Building ICFG [2022-01-19 13:30:29,659 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-19 13:30:29,989 INFO L275 CfgBuilder]: Performing block encoding [2022-01-19 13:30:30,144 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-19 13:30:30,144 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-01-19 13:30:30,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 01:30:30 BoogieIcfgContainer [2022-01-19 13:30:30,146 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-19 13:30:30,147 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-19 13:30:30,147 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-19 13:30:30,149 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-19 13:30:30,150 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.01 01:30:29" (1/3) ... [2022-01-19 13:30:30,150 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13d6338a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 01:30:30, skipping insertion in model container [2022-01-19 13:30:30,150 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:30:29" (2/3) ... [2022-01-19 13:30:30,150 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13d6338a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 01:30:30, skipping insertion in model container [2022-01-19 13:30:30,150 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 01:30:30" (3/3) ... [2022-01-19 13:30:30,151 INFO L111 eAbstractionObserver]: Analyzing ICFG parallel-bakery-4.wvr.c [2022-01-19 13:30:30,154 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-19 13:30:30,154 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-19 13:30:30,154 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-19 13:30:30,182 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,183 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,183 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,183 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,183 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,183 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,183 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,183 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,184 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,184 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,184 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,184 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,184 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,184 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,184 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,184 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,185 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,185 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,185 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,185 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,185 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,185 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,185 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,185 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,186 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,186 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,186 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,186 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,186 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,186 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,186 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,186 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,187 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,187 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,187 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,187 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,187 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,187 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,188 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,188 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,188 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,188 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,188 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,188 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,189 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,189 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,189 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,189 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,189 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,189 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,189 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,189 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,190 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,190 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,190 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,190 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,190 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,190 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,190 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,191 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,191 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,191 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,191 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,191 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,191 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,191 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,192 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,192 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,192 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,192 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,192 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,192 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,193 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,193 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,193 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,193 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,193 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,193 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,193 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,194 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,194 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,194 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,194 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,194 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,194 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,194 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,194 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,195 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,195 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,195 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,195 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,195 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,195 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,195 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,196 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,196 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,196 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,196 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,197 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,197 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,197 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,197 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,197 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,197 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,197 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,198 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,198 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,198 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,198 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,198 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,198 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,199 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,199 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#t~ite15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,199 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#t~ite15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,199 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#t~post16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,199 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#t~post16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,199 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,199 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,199 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,200 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,200 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,200 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,200 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,200 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,200 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,200 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,201 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,201 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,201 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,201 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,201 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,201 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,201 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,201 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,202 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,202 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,202 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,202 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,202 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,202 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,202 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,203 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,203 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,203 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,205 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,205 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,205 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,205 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,205 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,205 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,205 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,205 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,206 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,206 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,206 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#t~ite14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,206 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,206 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#t~ite15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,206 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#t~post16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,206 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,207 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork1_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,207 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,207 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,207 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,207 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,207 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,207 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,207 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,208 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,208 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,208 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,208 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,208 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~post12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,208 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,208 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,208 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,209 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:30:30,211 INFO L148 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-01-19 13:30:30,241 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 13:30:30,245 INFO L339 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=PETRI_NET, 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, mLoopAccelerationTechnique=FAST_UPR [2022-01-19 13:30:30,245 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-01-19 13:30:30,253 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 213 places, 202 transitions, 436 flow [2022-01-19 13:30:30,335 INFO L129 PetriNetUnfolder]: 2/198 cut-off events. [2022-01-19 13:30:30,335 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-01-19 13:30:30,338 INFO L84 FinitePrefix]: Finished finitePrefix Result has 215 conditions, 198 events. 2/198 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 205 event pairs, 0 based on Foata normal form. 0/195 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2022-01-19 13:30:30,338 INFO L82 GeneralOperation]: Start removeDead. Operand has 213 places, 202 transitions, 436 flow [2022-01-19 13:30:30,347 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 196 places, 185 transitions, 394 flow [2022-01-19 13:30:30,387 INFO L129 PetriNetUnfolder]: 2/184 cut-off events. [2022-01-19 13:30:30,387 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-01-19 13:30:30,388 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:30:30,389 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:30:30,389 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-19 13:30:30,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:30:30,395 INFO L85 PathProgramCache]: Analyzing trace with hash -945693717, now seen corresponding path program 1 times [2022-01-19 13:30:30,401 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:30:30,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299224682] [2022-01-19 13:30:30,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:30:30,402 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:30:30,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:30:31,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:30:31,071 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:30:31,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299224682] [2022-01-19 13:30:31,072 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299224682] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:30:31,072 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:30:31,072 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-01-19 13:30:31,073 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872108870] [2022-01-19 13:30:31,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:30:31,080 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-19 13:30:31,080 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:30:31,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-19 13:30:31,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-01-19 13:30:31,124 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 202 [2022-01-19 13:30:31,145 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 185 transitions, 394 flow. Second operand has 15 states, 15 states have (on average 127.93333333333334) internal successors, (1919), 15 states have internal predecessors, (1919), 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-01-19 13:30:31,145 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:30:31,145 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 202 [2022-01-19 13:30:31,147 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:30:45,824 INFO L129 PetriNetUnfolder]: 93240/165958 cut-off events. [2022-01-19 13:30:45,824 INFO L130 PetriNetUnfolder]: For 11533/11533 co-relation queries the response was YES. [2022-01-19 13:30:46,333 INFO L84 FinitePrefix]: Finished finitePrefix Result has 302885 conditions, 165958 events. 93240/165958 cut-off events. For 11533/11533 co-relation queries the response was YES. Maximal size of possible extension queue 3498. Compared 1710226 event pairs, 56436 based on Foata normal form. 9/165022 useless extension candidates. Maximal degree in co-relation 301046. Up to 76469 conditions per place. [2022-01-19 13:30:46,832 INFO L132 encePairwiseOnDemand]: 180/202 looper letters, 341 selfloop transitions, 31 changer transitions 30/509 dead transitions. [2022-01-19 13:30:46,832 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 509 transitions, 1948 flow [2022-01-19 13:30:46,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-01-19 13:30:46,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-01-19 13:30:46,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 3610 transitions. [2022-01-19 13:30:46,850 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6873571972581873 [2022-01-19 13:30:46,852 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 3610 transitions. [2022-01-19 13:30:46,852 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 3610 transitions. [2022-01-19 13:30:46,855 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:30:46,857 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 3610 transitions. [2022-01-19 13:30:46,865 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 138.84615384615384) internal successors, (3610), 26 states have internal predecessors, (3610), 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-01-19 13:30:46,877 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 202.0) internal successors, (5454), 27 states have internal predecessors, (5454), 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-01-19 13:30:46,879 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 202.0) internal successors, (5454), 27 states have internal predecessors, (5454), 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-01-19 13:30:46,880 INFO L186 Difference]: Start difference. First operand has 196 places, 185 transitions, 394 flow. Second operand 26 states and 3610 transitions. [2022-01-19 13:30:46,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 509 transitions, 1948 flow [2022-01-19 13:30:46,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 509 transitions, 1864 flow, removed 0 selfloop flow, removed 8 redundant places. [2022-01-19 13:30:47,006 INFO L242 Difference]: Finished difference. Result has 220 places, 210 transitions, 543 flow [2022-01-19 13:30:47,007 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=543, PETRI_PLACES=220, PETRI_TRANSITIONS=210} [2022-01-19 13:30:47,010 INFO L334 CegarLoopForPetriNet]: 196 programPoint places, 24 predicate places. [2022-01-19 13:30:47,011 INFO L470 AbstractCegarLoop]: Abstraction has has 220 places, 210 transitions, 543 flow [2022-01-19 13:30:47,012 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 127.93333333333334) internal successors, (1919), 15 states have internal predecessors, (1919), 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-01-19 13:30:47,012 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:30:47,012 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:30:47,012 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-19 13:30:47,013 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-19 13:30:47,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:30:47,013 INFO L85 PathProgramCache]: Analyzing trace with hash 2131695185, now seen corresponding path program 2 times [2022-01-19 13:30:47,013 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:30:47,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334128381] [2022-01-19 13:30:47,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:30:47,014 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:30:47,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:30:47,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:30:47,129 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:30:47,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334128381] [2022-01-19 13:30:47,129 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334128381] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:30:47,129 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:30:47,130 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 13:30:47,130 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586395329] [2022-01-19 13:30:47,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:30:47,131 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 13:30:47,131 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:30:47,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 13:30:47,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 13:30:47,133 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 202 [2022-01-19 13:30:47,134 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 210 transitions, 543 flow. Second operand has 3 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 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-01-19 13:30:47,134 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:30:47,134 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 202 [2022-01-19 13:30:47,134 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:30:55,045 INFO L129 PetriNetUnfolder]: 54028/98174 cut-off events. [2022-01-19 13:30:55,045 INFO L130 PetriNetUnfolder]: For 2539/2539 co-relation queries the response was YES. [2022-01-19 13:30:55,433 INFO L84 FinitePrefix]: Finished finitePrefix Result has 183907 conditions, 98174 events. 54028/98174 cut-off events. For 2539/2539 co-relation queries the response was YES. Maximal size of possible extension queue 2270. Compared 973780 event pairs, 36143 based on Foata normal form. 2050/99506 useless extension candidates. Maximal degree in co-relation 183869. Up to 46800 conditions per place. [2022-01-19 13:30:55,726 INFO L132 encePairwiseOnDemand]: 197/202 looper letters, 81 selfloop transitions, 2 changer transitions 0/240 dead transitions. [2022-01-19 13:30:55,727 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 240 transitions, 772 flow [2022-01-19 13:30:55,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 13:30:55,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 13:30:55,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 524 transitions. [2022-01-19 13:30:55,729 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8646864686468647 [2022-01-19 13:30:55,729 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 524 transitions. [2022-01-19 13:30:55,729 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 524 transitions. [2022-01-19 13:30:55,729 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:30:55,729 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 524 transitions. [2022-01-19 13:30:55,730 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 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-01-19 13:30:55,731 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 states have internal predecessors, (808), 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-01-19 13:30:55,731 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 states have internal predecessors, (808), 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-01-19 13:30:55,731 INFO L186 Difference]: Start difference. First operand has 220 places, 210 transitions, 543 flow. Second operand 3 states and 524 transitions. [2022-01-19 13:30:55,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 240 transitions, 772 flow [2022-01-19 13:30:55,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 240 transitions, 762 flow, removed 3 selfloop flow, removed 5 redundant places. [2022-01-19 13:30:55,764 INFO L242 Difference]: Finished difference. Result has 204 places, 210 transitions, 545 flow [2022-01-19 13:30:55,764 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=533, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=545, PETRI_PLACES=204, PETRI_TRANSITIONS=210} [2022-01-19 13:30:55,765 INFO L334 CegarLoopForPetriNet]: 196 programPoint places, 8 predicate places. [2022-01-19 13:30:55,765 INFO L470 AbstractCegarLoop]: Abstraction has has 204 places, 210 transitions, 545 flow [2022-01-19 13:30:55,765 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 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-01-19 13:30:55,765 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:30:55,765 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:30:55,765 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-19 13:30:55,765 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-19 13:30:55,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:30:55,766 INFO L85 PathProgramCache]: Analyzing trace with hash -2038968719, now seen corresponding path program 3 times [2022-01-19 13:30:55,766 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:30:55,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231015879] [2022-01-19 13:30:55,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:30:55,766 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:30:55,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:30:55,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:30:55,849 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:30:55,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231015879] [2022-01-19 13:30:55,849 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231015879] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:30:55,849 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:30:55,849 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 13:30:55,850 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649691282] [2022-01-19 13:30:55,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:30:55,850 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 13:30:55,851 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:30:55,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 13:30:55,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 13:30:55,851 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 202 [2022-01-19 13:30:55,852 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 210 transitions, 545 flow. Second operand has 3 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 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-01-19 13:30:55,852 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:30:55,852 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 202 [2022-01-19 13:30:55,852 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:31:03,210 INFO L129 PetriNetUnfolder]: 55191/98675 cut-off events. [2022-01-19 13:31:03,211 INFO L130 PetriNetUnfolder]: For 5735/5735 co-relation queries the response was YES. [2022-01-19 13:31:03,506 INFO L84 FinitePrefix]: Finished finitePrefix Result has 191783 conditions, 98675 events. 55191/98675 cut-off events. For 5735/5735 co-relation queries the response was YES. Maximal size of possible extension queue 2386. Compared 986243 event pairs, 34563 based on Foata normal form. 2085/99988 useless extension candidates. Maximal degree in co-relation 181397. Up to 48071 conditions per place. [2022-01-19 13:31:03,928 INFO L132 encePairwiseOnDemand]: 197/202 looper letters, 81 selfloop transitions, 2 changer transitions 0/240 dead transitions. [2022-01-19 13:31:03,929 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 240 transitions, 778 flow [2022-01-19 13:31:03,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 13:31:03,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 13:31:03,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 524 transitions. [2022-01-19 13:31:03,930 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8646864686468647 [2022-01-19 13:31:03,930 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 524 transitions. [2022-01-19 13:31:03,930 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 524 transitions. [2022-01-19 13:31:03,931 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:31:03,931 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 524 transitions. [2022-01-19 13:31:03,931 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 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-01-19 13:31:03,932 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 states have internal predecessors, (808), 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-01-19 13:31:03,932 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 states have internal predecessors, (808), 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-01-19 13:31:03,933 INFO L186 Difference]: Start difference. First operand has 204 places, 210 transitions, 545 flow. Second operand 3 states and 524 transitions. [2022-01-19 13:31:03,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 240 transitions, 778 flow [2022-01-19 13:31:04,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 240 transitions, 774 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-01-19 13:31:04,018 INFO L242 Difference]: Finished difference. Result has 205 places, 210 transitions, 553 flow [2022-01-19 13:31:04,018 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=541, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=553, PETRI_PLACES=205, PETRI_TRANSITIONS=210} [2022-01-19 13:31:04,019 INFO L334 CegarLoopForPetriNet]: 196 programPoint places, 9 predicate places. [2022-01-19 13:31:04,019 INFO L470 AbstractCegarLoop]: Abstraction has has 205 places, 210 transitions, 553 flow [2022-01-19 13:31:04,019 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 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-01-19 13:31:04,019 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:31:04,020 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:31:04,020 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-19 13:31:04,020 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-19 13:31:04,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:31:04,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1746802641, now seen corresponding path program 4 times [2022-01-19 13:31:04,020 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:31:04,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147443666] [2022-01-19 13:31:04,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:31:04,021 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:31:04,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:31:04,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:31:04,214 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:31:04,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147443666] [2022-01-19 13:31:04,214 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147443666] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:31:04,214 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:31:04,214 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-01-19 13:31:04,215 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048148388] [2022-01-19 13:31:04,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:31:04,215 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-19 13:31:04,215 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:31:04,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-19 13:31:04,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-01-19 13:31:04,216 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 202 [2022-01-19 13:31:04,218 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 210 transitions, 553 flow. Second operand has 15 states, 15 states have (on average 127.93333333333334) internal successors, (1919), 15 states have internal predecessors, (1919), 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-01-19 13:31:04,218 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:31:04,218 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 202 [2022-01-19 13:31:04,218 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:31:20,744 INFO L129 PetriNetUnfolder]: 104434/199523 cut-off events. [2022-01-19 13:31:20,744 INFO L130 PetriNetUnfolder]: For 29461/29461 co-relation queries the response was YES. [2022-01-19 13:31:21,618 INFO L84 FinitePrefix]: Finished finitePrefix Result has 400283 conditions, 199523 events. 104434/199523 cut-off events. For 29461/29461 co-relation queries the response was YES. Maximal size of possible extension queue 4240. Compared 2262667 event pairs, 57711 based on Foata normal form. 1/198689 useless extension candidates. Maximal degree in co-relation 321341. Up to 79470 conditions per place. [2022-01-19 13:31:22,152 INFO L132 encePairwiseOnDemand]: 184/202 looper letters, 389 selfloop transitions, 57 changer transitions 23/576 dead transitions. [2022-01-19 13:31:22,152 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 576 transitions, 2515 flow [2022-01-19 13:31:22,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-19 13:31:22,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-01-19 13:31:22,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2625 transitions. [2022-01-19 13:31:22,157 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.721947194719472 [2022-01-19 13:31:22,157 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 2625 transitions. [2022-01-19 13:31:22,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 2625 transitions. [2022-01-19 13:31:22,158 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:31:22,158 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 2625 transitions. [2022-01-19 13:31:22,161 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 145.83333333333334) internal successors, (2625), 18 states have internal predecessors, (2625), 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-01-19 13:31:22,165 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 202.0) internal successors, (3838), 19 states have internal predecessors, (3838), 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-01-19 13:31:22,166 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 202.0) internal successors, (3838), 19 states have internal predecessors, (3838), 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-01-19 13:31:22,166 INFO L186 Difference]: Start difference. First operand has 205 places, 210 transitions, 553 flow. Second operand 18 states and 2625 transitions. [2022-01-19 13:31:22,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 576 transitions, 2515 flow [2022-01-19 13:31:22,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 576 transitions, 2511 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-01-19 13:31:22,472 INFO L242 Difference]: Finished difference. Result has 230 places, 262 transitions, 1030 flow [2022-01-19 13:31:22,473 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=549, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1030, PETRI_PLACES=230, PETRI_TRANSITIONS=262} [2022-01-19 13:31:22,473 INFO L334 CegarLoopForPetriNet]: 196 programPoint places, 34 predicate places. [2022-01-19 13:31:22,473 INFO L470 AbstractCegarLoop]: Abstraction has has 230 places, 262 transitions, 1030 flow [2022-01-19 13:31:22,474 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 127.93333333333334) internal successors, (1919), 15 states have internal predecessors, (1919), 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-01-19 13:31:22,474 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:31:22,474 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:31:22,474 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-19 13:31:22,474 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-19 13:31:22,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:31:22,475 INFO L85 PathProgramCache]: Analyzing trace with hash -38579269, now seen corresponding path program 5 times [2022-01-19 13:31:22,475 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:31:22,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734392997] [2022-01-19 13:31:22,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:31:22,475 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:31:22,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:31:22,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:31:22,548 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:31:22,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734392997] [2022-01-19 13:31:22,548 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734392997] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:31:22,548 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:31:22,548 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 13:31:22,548 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009865254] [2022-01-19 13:31:22,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:31:22,549 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 13:31:22,549 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:31:22,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 13:31:22,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 13:31:22,550 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 202 [2022-01-19 13:31:22,550 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 262 transitions, 1030 flow. Second operand has 3 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 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-01-19 13:31:22,550 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:31:22,551 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 202 [2022-01-19 13:31:22,551 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:31:32,413 INFO L129 PetriNetUnfolder]: 58018/114203 cut-off events. [2022-01-19 13:31:32,419 INFO L130 PetriNetUnfolder]: For 19850/20472 co-relation queries the response was YES. [2022-01-19 13:31:33,134 INFO L84 FinitePrefix]: Finished finitePrefix Result has 231925 conditions, 114203 events. 58018/114203 cut-off events. For 19850/20472 co-relation queries the response was YES. Maximal size of possible extension queue 2991. Compared 1270744 event pairs, 37252 based on Foata normal form. 2205/115037 useless extension candidates. Maximal degree in co-relation 231809. Up to 53881 conditions per place. [2022-01-19 13:31:33,626 INFO L132 encePairwiseOnDemand]: 197/202 looper letters, 81 selfloop transitions, 2 changer transitions 0/292 dead transitions. [2022-01-19 13:31:33,627 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 292 transitions, 1267 flow [2022-01-19 13:31:33,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 13:31:33,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 13:31:33,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 524 transitions. [2022-01-19 13:31:33,628 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8646864686468647 [2022-01-19 13:31:33,628 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 524 transitions. [2022-01-19 13:31:33,628 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 524 transitions. [2022-01-19 13:31:33,629 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:31:33,629 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 524 transitions. [2022-01-19 13:31:33,630 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 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-01-19 13:31:33,630 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 states have internal predecessors, (808), 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-01-19 13:31:33,631 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 states have internal predecessors, (808), 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-01-19 13:31:33,631 INFO L186 Difference]: Start difference. First operand has 230 places, 262 transitions, 1030 flow. Second operand 3 states and 524 transitions. [2022-01-19 13:31:33,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 292 transitions, 1267 flow [2022-01-19 13:31:34,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 292 transitions, 1251 flow, removed 6 selfloop flow, removed 5 redundant places. [2022-01-19 13:31:34,324 INFO L242 Difference]: Finished difference. Result has 224 places, 262 transitions, 1026 flow [2022-01-19 13:31:34,325 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=1014, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1026, PETRI_PLACES=224, PETRI_TRANSITIONS=262} [2022-01-19 13:31:34,325 INFO L334 CegarLoopForPetriNet]: 196 programPoint places, 28 predicate places. [2022-01-19 13:31:34,326 INFO L470 AbstractCegarLoop]: Abstraction has has 224 places, 262 transitions, 1026 flow [2022-01-19 13:31:34,326 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 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-01-19 13:31:34,326 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:31:34,326 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:31:34,326 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-19 13:31:34,326 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-19 13:31:34,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:31:34,327 INFO L85 PathProgramCache]: Analyzing trace with hash -795314103, now seen corresponding path program 6 times [2022-01-19 13:31:34,327 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:31:34,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889270931] [2022-01-19 13:31:34,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:31:34,327 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:31:34,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:31:34,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:31:34,600 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:31:34,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889270931] [2022-01-19 13:31:34,600 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889270931] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:31:34,600 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:31:34,600 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 13:31:34,600 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072693688] [2022-01-19 13:31:34,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:31:34,601 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 13:31:34,601 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:31:34,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 13:31:34,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-01-19 13:31:34,602 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 202 [2022-01-19 13:31:34,603 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 262 transitions, 1026 flow. Second operand has 10 states, 10 states have (on average 138.5) internal successors, (1385), 10 states have internal predecessors, (1385), 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-01-19 13:31:34,604 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:31:34,607 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 202 [2022-01-19 13:31:34,607 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:31:52,746 INFO L129 PetriNetUnfolder]: 105161/194528 cut-off events. [2022-01-19 13:31:52,747 INFO L130 PetriNetUnfolder]: For 38729/39619 co-relation queries the response was YES. [2022-01-19 13:31:53,888 INFO L84 FinitePrefix]: Finished finitePrefix Result has 408740 conditions, 194528 events. 105161/194528 cut-off events. For 38729/39619 co-relation queries the response was YES. Maximal size of possible extension queue 4696. Compared 2176402 event pairs, 38274 based on Foata normal form. 1724/191510 useless extension candidates. Maximal degree in co-relation 405065. Up to 108707 conditions per place. [2022-01-19 13:31:54,526 INFO L132 encePairwiseOnDemand]: 185/202 looper letters, 310 selfloop transitions, 47 changer transitions 0/554 dead transitions. [2022-01-19 13:31:54,526 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 554 transitions, 2450 flow [2022-01-19 13:31:54,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-19 13:31:54,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-01-19 13:31:54,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2340 transitions. [2022-01-19 13:31:54,530 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7722772277227723 [2022-01-19 13:31:54,530 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2340 transitions. [2022-01-19 13:31:54,530 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2340 transitions. [2022-01-19 13:31:54,531 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:31:54,532 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2340 transitions. [2022-01-19 13:31:54,535 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 156.0) internal successors, (2340), 15 states have internal predecessors, (2340), 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-01-19 13:31:54,538 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 202.0) internal successors, (3232), 16 states have internal predecessors, (3232), 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-01-19 13:31:54,539 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 202.0) internal successors, (3232), 16 states have internal predecessors, (3232), 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-01-19 13:31:54,539 INFO L186 Difference]: Start difference. First operand has 224 places, 262 transitions, 1026 flow. Second operand 15 states and 2340 transitions. [2022-01-19 13:31:54,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 554 transitions, 2450 flow [2022-01-19 13:31:55,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 554 transitions, 2446 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-01-19 13:31:55,962 INFO L242 Difference]: Finished difference. Result has 246 places, 311 transitions, 1339 flow [2022-01-19 13:31:55,962 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=1022, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1339, PETRI_PLACES=246, PETRI_TRANSITIONS=311} [2022-01-19 13:31:55,963 INFO L334 CegarLoopForPetriNet]: 196 programPoint places, 50 predicate places. [2022-01-19 13:31:55,963 INFO L470 AbstractCegarLoop]: Abstraction has has 246 places, 311 transitions, 1339 flow [2022-01-19 13:31:55,963 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 138.5) internal successors, (1385), 10 states have internal predecessors, (1385), 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-01-19 13:31:55,963 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:31:55,963 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:31:55,964 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-19 13:31:55,964 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-19 13:31:55,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:31:55,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1317823375, now seen corresponding path program 7 times [2022-01-19 13:31:55,964 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:31:55,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243557811] [2022-01-19 13:31:55,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:31:55,964 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:31:56,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:31:56,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:31:56,201 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:31:56,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243557811] [2022-01-19 13:31:56,201 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243557811] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:31:56,201 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:31:56,201 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 13:31:56,201 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556478397] [2022-01-19 13:31:56,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:31:56,204 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 13:31:56,204 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:31:56,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 13:31:56,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=46, Unknown=0, NotChecked=0, Total=90 [2022-01-19 13:31:56,205 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 202 [2022-01-19 13:31:56,206 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 311 transitions, 1339 flow. Second operand has 10 states, 10 states have (on average 135.8) internal successors, (1358), 10 states have internal predecessors, (1358), 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-01-19 13:31:56,206 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:31:56,206 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 202 [2022-01-19 13:31:56,207 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:32:28,483 INFO L129 PetriNetUnfolder]: 150519/284522 cut-off events. [2022-01-19 13:32:28,483 INFO L130 PetriNetUnfolder]: For 195596/198230 co-relation queries the response was YES. [2022-01-19 13:32:30,481 INFO L84 FinitePrefix]: Finished finitePrefix Result has 699804 conditions, 284522 events. 150519/284522 cut-off events. For 195596/198230 co-relation queries the response was YES. Maximal size of possible extension queue 8146. Compared 3404357 event pairs, 86327 based on Foata normal form. 379/278091 useless extension candidates. Maximal degree in co-relation 691423. Up to 120344 conditions per place. [2022-01-19 13:32:31,510 INFO L132 encePairwiseOnDemand]: 186/202 looper letters, 239 selfloop transitions, 45 changer transitions 0/478 dead transitions. [2022-01-19 13:32:31,510 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 478 transitions, 2512 flow [2022-01-19 13:32:31,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-19 13:32:31,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-19 13:32:31,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1503 transitions. [2022-01-19 13:32:31,517 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.744059405940594 [2022-01-19 13:32:31,517 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1503 transitions. [2022-01-19 13:32:31,517 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1503 transitions. [2022-01-19 13:32:31,518 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:32:31,518 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1503 transitions. [2022-01-19 13:32:31,520 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 150.3) internal successors, (1503), 10 states have internal predecessors, (1503), 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-01-19 13:32:31,522 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 202.0) internal successors, (2222), 11 states have internal predecessors, (2222), 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-01-19 13:32:31,522 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 202.0) internal successors, (2222), 11 states have internal predecessors, (2222), 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-01-19 13:32:31,522 INFO L186 Difference]: Start difference. First operand has 246 places, 311 transitions, 1339 flow. Second operand 10 states and 1503 transitions. [2022-01-19 13:32:31,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 478 transitions, 2512 flow [2022-01-19 13:32:36,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 478 transitions, 2508 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-01-19 13:32:36,247 INFO L242 Difference]: Finished difference. Result has 258 places, 343 transitions, 1677 flow [2022-01-19 13:32:36,247 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=1335, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=311, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1677, PETRI_PLACES=258, PETRI_TRANSITIONS=343} [2022-01-19 13:32:36,248 INFO L334 CegarLoopForPetriNet]: 196 programPoint places, 62 predicate places. [2022-01-19 13:32:36,248 INFO L470 AbstractCegarLoop]: Abstraction has has 258 places, 343 transitions, 1677 flow [2022-01-19 13:32:36,248 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 135.8) internal successors, (1358), 10 states have internal predecessors, (1358), 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-01-19 13:32:36,248 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:32:36,249 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:32:36,249 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-19 13:32:36,249 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-19 13:32:36,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:32:36,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1615208473, now seen corresponding path program 8 times [2022-01-19 13:32:36,249 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:32:36,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909259737] [2022-01-19 13:32:36,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:32:36,250 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:32:36,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:32:36,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:32:36,295 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:32:36,295 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909259737] [2022-01-19 13:32:36,295 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909259737] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:32:36,295 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:32:36,296 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 13:32:36,296 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166274991] [2022-01-19 13:32:36,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:32:36,296 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 13:32:36,296 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:32:36,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 13:32:36,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 13:32:36,297 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 202 [2022-01-19 13:32:36,297 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 343 transitions, 1677 flow. Second operand has 3 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 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-01-19 13:32:36,297 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:32:36,297 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 202 [2022-01-19 13:32:36,297 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:32:59,062 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1063] L167-->L170: Formula: (and (not (= |v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_3| 0)) (= (ite (not (and (not (= v_~n1~0_114 0)) (or (= v_~n1~0_114 v_~n3~0_118) (< v_~n1~0_114 v_~n3~0_118)))) 1 0) |v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_3|) (= |v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_3| |v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_3|)) InVars {~n3~0=v_~n3~0_118, ~n1~0=v_~n1~0_114} OutVars{thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1_3|, ~n3~0=v_~n3~0_118, ~n1~0=v_~n1~0_114, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[thread3Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork3_assume_abort_if_not_#in~cond#1][167], [111#L228true, Black: 390#(and (<= (+ ~n4~0 1) ~n2~0) (<= 0 ~n3~0) (<= (+ ~n3~0 1) ~n4~0) (= ~n1~0 0)), 290#true, Black: 389#(and (<= 0 ~n3~0) (<= (+ ~n3~0 1) ~n4~0) (<= ~n4~0 ~n2~0) (= ~n1~0 0)), Black: 387#(and (<= ~n3~0 ~n4~0) (<= 0 ~n3~0) (= ~n1~0 0)), 348#true, Black: 323#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i1~0 0) (<= 2 ~i3~0) (<= 1 ~i2~0) (<= ~i3~0 2)), Black: 388#(and (<= 0 ~n3~0) (<= (+ ~n3~0 1) ~n4~0) (= ~n1~0 0)), 167#L170true, Black: 317#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i1~0 0) (<= 1 ~i2~0)), Black: 294#(and (<= ~i~0 0) (<= 0 ~i~0)), Black: 220#(and (<= ~i~0 0) (<= 0 ~i~0)), Black: 315#(and (<= ~i~0 2) (<= 0 ~i1~0) (<= ~i2~0 1) (<= ~i1~0 0) (<= 1 ~i2~0) (<= 2 ~i~0)), Black: 321#(and (<= 0 ~i1~0) (<= ~i2~0 1) (<= 3 ~i~0) (<= ~i1~0 0) (<= 2 ~i3~0) (<= 1 ~i2~0) (<= ~i3~0 2) (<= ~i~0 3)), Black: 243#(and (<= ~i~0 2) (<= 0 ~i4~0) (<= ~i2~0 1) (<= ~i4~0 0) (<= 1 ~i2~0) (<= 2 ~i~0)), 15#L88true, Black: 295#(and (<= 0 ~i1~0) (<= ~i1~0 0)), Black: 249#(and (<= 0 ~i4~0) (<= 2 ~i1~0) (<= ~i2~0 1) (<= ~i4~0 0) (<= 3 ~i~0) (<= 1 ~i2~0) (<= ~i1~0 2) (<= ~i~0 3)), Black: 311#(and (<= 1 ~i~0) (<= 0 ~i1~0) (<= ~i~0 1) (<= ~i1~0 0)), Black: 239#(and (<= 1 ~i~0) (<= 0 ~i4~0) (<= ~i~0 1) (<= ~i4~0 0)), Black: 345#(= (+ (- 1) ~e4~0) 0), Black: 282#(= (+ (- 1) ~e3~0) 0), Black: 287#(= (+ (- 1) ~e2~0) 0), 399#true, 386#(and (<= 0 ~n3~0) (= ~n1~0 0)), Black: 369#(and (<= 1 ~n1~0) (<= ~n3~0 ~n2~0) (<= (+ ~n1~0 1) ~n2~0)), Black: 353#(and (<= ~n3~0 ~n2~0) (<= 0 ~n2~0) (<= ~n2~0 ~n1~0)), Black: 365#(and (<= 1 ~n1~0) (<= ~n3~0 ~n2~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 ~n1~0)), Black: 361#(and (<= 1 ~n1~0) (<= (+ ~n3~0 1) ~n2~0) (<= ~n1~0 ~n2~0) (<= ~n2~0 ~n1~0)), Black: 354#(and (<= ~n3~0 ~n2~0) (<= 0 ~n2~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 352#(and (<= ~n3~0 ~n2~0) (<= 0 ~n2~0)), 135#L140true, Black: 357#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0)), Black: 356#(and (<= 1 ~n1~0) (<= ~n1~0 ~n2~0)), Black: 367#(and (<= 1 ~n1~0) (<= ~n3~0 ~n2~0) (<= ~n1~0 ~n2~0)), 176#L273-4true, Black: 363#(and (<= 1 ~n1~0) (<= (+ ~n1~0 1) ~n2~0) (<= (+ ~n3~0 1) ~n2~0)), 216#true]) [2022-01-19 13:32:59,063 INFO L384 tUnfolder$Statistics]: this new event has 140 ancestors and is cut-off event [2022-01-19 13:32:59,063 INFO L387 tUnfolder$Statistics]: existing Event has 140 ancestors and is cut-off event [2022-01-19 13:32:59,063 INFO L387 tUnfolder$Statistics]: existing Event has 140 ancestors and is cut-off event [2022-01-19 13:32:59,063 INFO L387 tUnfolder$Statistics]: existing Event has 140 ancestors and is cut-off event [2022-01-19 13:33:04,689 INFO L129 PetriNetUnfolder]: 114816/223773 cut-off events. [2022-01-19 13:33:04,689 INFO L130 PetriNetUnfolder]: For 252933/256073 co-relation queries the response was YES. [2022-01-19 13:33:06,552 INFO L84 FinitePrefix]: Finished finitePrefix Result has 610339 conditions, 223773 events. 114816/223773 cut-off events. For 252933/256073 co-relation queries the response was YES. Maximal size of possible extension queue 6257. Compared 2707884 event pairs, 77924 based on Foata normal form. 2962/222049 useless extension candidates. Maximal degree in co-relation 607270. Up to 129634 conditions per place. [2022-01-19 13:33:07,428 INFO L132 encePairwiseOnDemand]: 197/202 looper letters, 166 selfloop transitions, 2 changer transitions 0/396 dead transitions. [2022-01-19 13:33:07,428 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 396 transitions, 2274 flow [2022-01-19 13:33:07,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 13:33:07,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 13:33:07,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 524 transitions. [2022-01-19 13:33:07,429 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8646864686468647 [2022-01-19 13:33:07,429 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 524 transitions. [2022-01-19 13:33:07,429 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 524 transitions. [2022-01-19 13:33:07,429 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:33:07,430 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 524 transitions. [2022-01-19 13:33:07,430 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 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-01-19 13:33:07,431 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 states have internal predecessors, (808), 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-01-19 13:33:07,431 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 202.0) internal successors, (808), 4 states have internal predecessors, (808), 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-01-19 13:33:07,431 INFO L186 Difference]: Start difference. First operand has 258 places, 343 transitions, 1677 flow. Second operand 3 states and 524 transitions. [2022-01-19 13:33:07,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 396 transitions, 2274 flow [2022-01-19 13:33:13,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 396 transitions, 2247 flow, removed 10 selfloop flow, removed 3 redundant places. [2022-01-19 13:33:13,543 INFO L242 Difference]: Finished difference. Result has 258 places, 343 transitions, 1662 flow [2022-01-19 13:33:13,543 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=1650, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=343, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=341, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1662, PETRI_PLACES=258, PETRI_TRANSITIONS=343} [2022-01-19 13:33:13,544 INFO L334 CegarLoopForPetriNet]: 196 programPoint places, 62 predicate places. [2022-01-19 13:33:13,544 INFO L470 AbstractCegarLoop]: Abstraction has has 258 places, 343 transitions, 1662 flow [2022-01-19 13:33:13,544 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 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-01-19 13:33:13,544 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:33:13,544 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:33:13,544 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-19 13:33:13,544 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-19 13:33:13,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:33:13,545 INFO L85 PathProgramCache]: Analyzing trace with hash 2129835675, now seen corresponding path program 9 times [2022-01-19 13:33:13,545 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:33:13,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014873936] [2022-01-19 13:33:13,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:33:13,545 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:33:13,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:33:13,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:33:13,657 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:33:13,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014873936] [2022-01-19 13:33:13,657 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014873936] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:33:13,657 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:33:13,657 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 13:33:13,657 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734453126] [2022-01-19 13:33:13,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:33:13,658 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 13:33:13,658 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:33:13,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 13:33:13,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-01-19 13:33:13,659 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 202 [2022-01-19 13:33:13,660 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 343 transitions, 1662 flow. Second operand has 10 states, 10 states have (on average 138.5) internal successors, (1385), 10 states have internal predecessors, (1385), 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-01-19 13:33:13,660 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:33:13,660 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 202 [2022-01-19 13:33:13,660 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:34:17,813 INFO L129 PetriNetUnfolder]: 264895/478937 cut-off events. [2022-01-19 13:34:17,813 INFO L130 PetriNetUnfolder]: For 602415/610687 co-relation queries the response was YES. [2022-01-19 13:34:22,030 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1376808 conditions, 478937 events. 264895/478937 cut-off events. For 602415/610687 co-relation queries the response was YES. Maximal size of possible extension queue 13097. Compared 5760252 event pairs, 63345 based on Foata normal form. 2701/473240 useless extension candidates. Maximal degree in co-relation 1367465. Up to 74772 conditions per place. [2022-01-19 13:34:23,919 INFO L132 encePairwiseOnDemand]: 182/202 looper letters, 668 selfloop transitions, 130 changer transitions 0/995 dead transitions. [2022-01-19 13:34:23,919 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 995 transitions, 6743 flow [2022-01-19 13:34:23,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-19 13:34:23,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-01-19 13:34:23,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2380 transitions. [2022-01-19 13:34:23,922 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7854785478547854 [2022-01-19 13:34:23,923 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2380 transitions. [2022-01-19 13:34:23,923 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2380 transitions. [2022-01-19 13:34:23,923 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:34:23,923 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2380 transitions. [2022-01-19 13:34:23,943 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 158.66666666666666) internal successors, (2380), 15 states have internal predecessors, (2380), 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-01-19 13:34:23,946 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 202.0) internal successors, (3232), 16 states have internal predecessors, (3232), 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-01-19 13:34:23,946 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 202.0) internal successors, (3232), 16 states have internal predecessors, (3232), 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-01-19 13:34:23,946 INFO L186 Difference]: Start difference. First operand has 258 places, 343 transitions, 1662 flow. Second operand 15 states and 2380 transitions. [2022-01-19 13:34:23,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 995 transitions, 6743 flow [2022-01-19 13:34:43,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 995 transitions, 6739 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-01-19 13:34:43,818 INFO L242 Difference]: Finished difference. Result has 281 places, 471 transitions, 3079 flow [2022-01-19 13:34:43,818 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=1658, PETRI_DIFFERENCE_MINUEND_PLACES=256, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=343, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=3079, PETRI_PLACES=281, PETRI_TRANSITIONS=471} [2022-01-19 13:34:43,819 INFO L334 CegarLoopForPetriNet]: 196 programPoint places, 85 predicate places. [2022-01-19 13:34:43,819 INFO L470 AbstractCegarLoop]: Abstraction has has 281 places, 471 transitions, 3079 flow [2022-01-19 13:34:43,819 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 138.5) internal successors, (1385), 10 states have internal predecessors, (1385), 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-01-19 13:34:43,820 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:34:43,820 INFO L254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:34:43,820 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-19 13:34:43,820 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-19 13:34:43,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:34:43,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1257316795, now seen corresponding path program 10 times [2022-01-19 13:34:43,820 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:34:43,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457800356] [2022-01-19 13:34:43,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:34:43,821 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:34:43,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:34:44,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:34:44,048 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:34:44,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457800356] [2022-01-19 13:34:44,048 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457800356] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:34:44,051 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:34:44,051 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 13:34:44,051 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744534480] [2022-01-19 13:34:44,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:34:44,052 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 13:34:44,053 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:34:44,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 13:34:44,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-01-19 13:34:44,054 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 202 [2022-01-19 13:34:44,059 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 471 transitions, 3079 flow. Second operand has 10 states, 10 states have (on average 146.8) internal successors, (1468), 10 states have internal predecessors, (1468), 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-01-19 13:34:44,059 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:34:44,059 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 202 [2022-01-19 13:34:44,059 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand