/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-Before.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-buffer-mult.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bf34d27 [2022-01-19 08:19:49,913 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-19 08:19:49,914 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-19 08:19:49,975 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-19 08:19:49,976 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-19 08:19:49,978 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-19 08:19:49,981 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-19 08:19:49,983 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-19 08:19:49,984 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-19 08:19:49,984 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-19 08:19:49,985 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-19 08:19:49,986 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-19 08:19:49,986 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-19 08:19:49,990 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-19 08:19:49,991 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-19 08:19:49,994 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-19 08:19:49,995 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-19 08:19:49,995 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-19 08:19:49,996 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-19 08:19:49,997 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-19 08:19:49,997 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-19 08:19:49,999 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-19 08:19:50,000 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-19 08:19:50,001 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-19 08:19:50,003 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-19 08:19:50,003 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-19 08:19:50,003 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-19 08:19:50,004 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-19 08:19:50,004 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-19 08:19:50,005 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-19 08:19:50,005 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-19 08:19:50,005 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-19 08:19:50,006 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-19 08:19:50,006 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-19 08:19:50,007 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-19 08:19:50,007 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-19 08:19:50,007 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-19 08:19:50,007 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-19 08:19:50,007 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-19 08:19:50,008 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-19 08:19:50,008 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-19 08:19:50,010 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-Before.epf [2022-01-19 08:19:50,034 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-19 08:19:50,034 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-19 08:19:50,035 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-19 08:19:50,035 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-19 08:19:50,035 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-19 08:19:50,035 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-19 08:19:50,035 INFO L138 SettingsManager]: * Use SBE=true [2022-01-19 08:19:50,035 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-19 08:19:50,035 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-19 08:19:50,036 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-19 08:19:50,036 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-19 08:19:50,036 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-19 08:19:50,036 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-19 08:19:50,036 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-19 08:19:50,036 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-19 08:19:50,037 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-19 08:19:50,037 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-19 08:19:50,037 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-19 08:19:50,037 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-19 08:19:50,037 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-19 08:19:50,037 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-19 08:19:50,037 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-19 08:19:50,037 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-19 08:19:50,037 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 08:19:50,037 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-19 08:19:50,037 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-19 08:19:50,037 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-19 08:19:50,038 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-19 08:19:50,038 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-19 08:19:50,038 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-19 08:19:50,038 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-19 08:19:50,038 INFO L138 SettingsManager]: * When to check the insufficient erros location relative to the other error locations=BEFORE [2022-01-19 08:19:50,038 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 08:19:50,187 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-19 08:19:50,209 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-19 08:19:50,211 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-19 08:19:50,212 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-19 08:19:50,212 INFO L275 PluginConnector]: CDTParser initialized [2022-01-19 08:19:50,213 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-buffer-mult.wvr.c [2022-01-19 08:19:50,264 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c18bdaa1/a84317669b774e268c44e5e721acbaf6/FLAG7b61bf1b3 [2022-01-19 08:19:50,593 INFO L306 CDTParser]: Found 1 translation units. [2022-01-19 08:19:50,593 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-buffer-mult.wvr.c [2022-01-19 08:19:50,598 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c18bdaa1/a84317669b774e268c44e5e721acbaf6/FLAG7b61bf1b3 [2022-01-19 08:19:50,606 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c18bdaa1/a84317669b774e268c44e5e721acbaf6 [2022-01-19 08:19:50,607 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-19 08:19:50,608 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-19 08:19:50,609 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-19 08:19:50,609 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-19 08:19:50,611 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-19 08:19:50,611 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 08:19:50" (1/1) ... [2022-01-19 08:19:50,612 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38841d7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 08:19:50, skipping insertion in model container [2022-01-19 08:19:50,612 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 08:19:50" (1/1) ... [2022-01-19 08:19:50,616 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-19 08:19:50,631 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-19 08:19:50,787 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/popl20-more-buffer-mult.wvr.c[4218,4231] [2022-01-19 08:19:50,795 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 08:19:50,799 INFO L203 MainTranslator]: Completed pre-run [2022-01-19 08:19:50,817 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/popl20-more-buffer-mult.wvr.c[4218,4231] [2022-01-19 08:19:50,820 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 08:19:50,829 INFO L208 MainTranslator]: Completed translation [2022-01-19 08:19:50,830 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 08:19:50 WrapperNode [2022-01-19 08:19:50,830 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-19 08:19:50,831 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-19 08:19:50,831 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-19 08:19:50,831 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-19 08:19:50,835 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 08:19:50" (1/1) ... [2022-01-19 08:19:50,841 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 08:19:50" (1/1) ... [2022-01-19 08:19:50,867 INFO L137 Inliner]: procedures = 27, calls = 80, calls flagged for inlining = 18, calls inlined = 22, statements flattened = 307 [2022-01-19 08:19:50,867 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-19 08:19:50,867 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-19 08:19:50,868 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-19 08:19:50,868 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-19 08:19:50,873 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 08:19:50" (1/1) ... [2022-01-19 08:19:50,873 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 08:19:50" (1/1) ... [2022-01-19 08:19:50,876 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 08:19:50" (1/1) ... [2022-01-19 08:19:50,876 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 08:19:50" (1/1) ... [2022-01-19 08:19:50,883 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 08:19:50" (1/1) ... [2022-01-19 08:19:50,886 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 08:19:50" (1/1) ... [2022-01-19 08:19:50,888 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 08:19:50" (1/1) ... [2022-01-19 08:19:50,890 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-19 08:19:50,890 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-19 08:19:50,890 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-19 08:19:50,891 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-19 08:19:50,891 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 08:19:50" (1/1) ... [2022-01-19 08:19:50,895 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 08:19:50,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 08:19:50,913 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 08:19:50,931 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 08:19:50,949 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-19 08:19:50,949 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-19 08:19:50,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-19 08:19:50,949 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-19 08:19:50,949 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-01-19 08:19:50,949 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-01-19 08:19:50,949 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-01-19 08:19:50,949 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-01-19 08:19:50,949 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-01-19 08:19:50,951 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-01-19 08:19:50,951 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-01-19 08:19:50,951 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-01-19 08:19:50,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-19 08:19:50,951 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-01-19 08:19:50,951 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-01-19 08:19:50,951 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-19 08:19:50,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-19 08:19:50,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-19 08:19:50,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-19 08:19:50,953 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 08:19:51,023 INFO L234 CfgBuilder]: Building ICFG [2022-01-19 08:19:51,024 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-19 08:19:51,304 INFO L275 CfgBuilder]: Performing block encoding [2022-01-19 08:19:51,382 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-19 08:19:51,382 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-01-19 08:19:51,384 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 08:19:51 BoogieIcfgContainer [2022-01-19 08:19:51,384 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-19 08:19:51,385 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-19 08:19:51,385 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-19 08:19:51,387 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-19 08:19:51,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.01 08:19:50" (1/3) ... [2022-01-19 08:19:51,388 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70c8e653 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 08:19:51, skipping insertion in model container [2022-01-19 08:19:51,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 08:19:50" (2/3) ... [2022-01-19 08:19:51,388 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70c8e653 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 08:19:51, skipping insertion in model container [2022-01-19 08:19:51,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 08:19:51" (3/3) ... [2022-01-19 08:19:51,389 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-mult.wvr.c [2022-01-19 08:19:51,392 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-19 08:19:51,393 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-19 08:19:51,393 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-19 08:19:51,422 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,423 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,423 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,423 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,423 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,424 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,424 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,424 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,424 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,424 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,424 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,424 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,424 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,424 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,425 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,425 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,425 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,425 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,425 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,425 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,425 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,426 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,426 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,426 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,426 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,426 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,426 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,427 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,427 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,427 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,427 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,427 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,427 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,427 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,427 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,427 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,428 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,428 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,428 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,428 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,428 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,428 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,428 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,428 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,429 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,429 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,429 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,429 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,429 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,429 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,430 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,430 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,430 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,430 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,430 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,430 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,430 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,430 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,430 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,430 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,430 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,431 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,431 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,431 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,431 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,431 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,431 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,431 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,432 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,432 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,432 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,432 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,432 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,432 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,432 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,433 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,433 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,433 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,433 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,433 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,433 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,434 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,434 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,434 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,434 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,434 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,434 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~post12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,434 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~ret11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,434 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,434 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,435 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,435 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,435 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,435 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,435 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,435 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,435 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~post12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,436 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~ret11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,436 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,436 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,436 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,436 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,436 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,436 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,436 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,436 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,437 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,437 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,439 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,440 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,440 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,440 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,440 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~post12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,440 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,440 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~ret11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,440 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,440 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,440 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,440 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,441 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,441 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,441 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,441 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,441 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,442 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,442 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,442 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,442 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,442 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,442 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,442 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,442 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,443 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,443 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,443 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,443 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,443 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,443 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,443 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,443 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,443 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,443 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,444 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,444 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~post2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,444 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,444 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,444 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,444 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,444 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,444 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 08:19:51,447 INFO L148 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-01-19 08:19:51,481 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 08:19:51,485 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 08:19:51,486 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-01-19 08:19:51,495 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 226 places, 231 transitions, 494 flow [2022-01-19 08:19:51,590 INFO L129 PetriNetUnfolder]: 18/227 cut-off events. [2022-01-19 08:19:51,591 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-01-19 08:19:51,594 INFO L84 FinitePrefix]: Finished finitePrefix Result has 244 conditions, 227 events. 18/227 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 115 event pairs, 0 based on Foata normal form. 0/208 useless extension candidates. Maximal degree in co-relation 188. Up to 2 conditions per place. [2022-01-19 08:19:51,594 INFO L82 GeneralOperation]: Start removeDead. Operand has 226 places, 231 transitions, 494 flow [2022-01-19 08:19:51,603 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 209 places, 214 transitions, 452 flow [2022-01-19 08:19:51,647 INFO L129 PetriNetUnfolder]: 18/213 cut-off events. [2022-01-19 08:19:51,647 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-01-19 08:19:51,647 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 08:19:51,648 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] [2022-01-19 08:19:51,649 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 08:19:51,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 08:19:51,655 INFO L85 PathProgramCache]: Analyzing trace with hash 438311406, now seen corresponding path program 1 times [2022-01-19 08:19:51,663 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 08:19:51,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756796549] [2022-01-19 08:19:51,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 08:19:51,664 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 08:19:51,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 08:19:51,890 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 08:19:51,891 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 08:19:51,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756796549] [2022-01-19 08:19:51,891 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756796549] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 08:19:51,892 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 08:19:51,892 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-19 08:19:51,893 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298330602] [2022-01-19 08:19:51,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 08:19:51,899 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-19 08:19:51,900 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 08:19:51,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-19 08:19:51,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-19 08:19:51,950 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 204 out of 231 [2022-01-19 08:19:51,955 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 214 transitions, 452 flow. Second operand has 2 states, 2 states have (on average 210.5) internal successors, (421), 2 states have internal predecessors, (421), 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 08:19:51,955 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 08:19:51,955 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 231 [2022-01-19 08:19:51,956 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 08:19:52,119 INFO L129 PetriNetUnfolder]: 226/753 cut-off events. [2022-01-19 08:19:52,119 INFO L130 PetriNetUnfolder]: For 145/146 co-relation queries the response was YES. [2022-01-19 08:19:52,124 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1164 conditions, 753 events. 226/753 cut-off events. For 145/146 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3398 event pairs, 121 based on Foata normal form. 197/864 useless extension candidates. Maximal degree in co-relation 906. Up to 306 conditions per place. [2022-01-19 08:19:52,129 INFO L132 encePairwiseOnDemand]: 219/231 looper letters, 14 selfloop transitions, 0 changer transitions 6/202 dead transitions. [2022-01-19 08:19:52,129 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 202 transitions, 456 flow [2022-01-19 08:19:52,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-19 08:19:52,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-01-19 08:19:52,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 434 transitions. [2022-01-19 08:19:52,146 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9393939393939394 [2022-01-19 08:19:52,146 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 434 transitions. [2022-01-19 08:19:52,147 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 434 transitions. [2022-01-19 08:19:52,149 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 08:19:52,151 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 434 transitions. [2022-01-19 08:19:52,155 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 217.0) internal successors, (434), 2 states have internal predecessors, (434), 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 08:19:52,159 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 231.0) internal successors, (693), 3 states have internal predecessors, (693), 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 08:19:52,159 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 231.0) internal successors, (693), 3 states have internal predecessors, (693), 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 08:19:52,161 INFO L186 Difference]: Start difference. First operand has 209 places, 214 transitions, 452 flow. Second operand 2 states and 434 transitions. [2022-01-19 08:19:52,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 202 transitions, 456 flow [2022-01-19 08:19:52,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 202 transitions, 440 flow, removed 0 selfloop flow, removed 8 redundant places. [2022-01-19 08:19:52,167 INFO L242 Difference]: Finished difference. Result has 202 places, 196 transitions, 400 flow [2022-01-19 08:19:52,169 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=412, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=400, PETRI_PLACES=202, PETRI_TRANSITIONS=196} [2022-01-19 08:19:52,173 INFO L334 CegarLoopForPetriNet]: 209 programPoint places, -7 predicate places. [2022-01-19 08:19:52,173 INFO L470 AbstractCegarLoop]: Abstraction has has 202 places, 196 transitions, 400 flow [2022-01-19 08:19:52,174 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 210.5) internal successors, (421), 2 states have internal predecessors, (421), 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 08:19:52,174 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 08:19:52,175 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] [2022-01-19 08:19:52,177 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-19 08:19:52,180 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 08:19:52,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 08:19:52,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1838195375, now seen corresponding path program 1 times [2022-01-19 08:19:52,182 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 08:19:52,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743383964] [2022-01-19 08:19:52,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 08:19:52,182 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 08:19:52,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 08:19:52,491 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 08:19:52,492 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 08:19:52,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743383964] [2022-01-19 08:19:52,492 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743383964] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 08:19:52,492 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 08:19:52,492 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-19 08:19:52,492 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206833813] [2022-01-19 08:19:52,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 08:19:52,493 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-19 08:19:52,494 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 08:19:52,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-19 08:19:52,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-19 08:19:52,496 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 231 [2022-01-19 08:19:52,497 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 196 transitions, 400 flow. Second operand has 5 states, 5 states have (on average 179.6) internal successors, (898), 5 states have internal predecessors, (898), 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 08:19:52,497 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 08:19:52,497 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 231 [2022-01-19 08:19:52,497 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 08:19:52,700 INFO L129 PetriNetUnfolder]: 251/831 cut-off events. [2022-01-19 08:19:52,700 INFO L130 PetriNetUnfolder]: For 39/40 co-relation queries the response was YES. [2022-01-19 08:19:52,702 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1227 conditions, 831 events. 251/831 cut-off events. For 39/40 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3898 event pairs, 32 based on Foata normal form. 1/747 useless extension candidates. Maximal degree in co-relation 1224. Up to 249 conditions per place. [2022-01-19 08:19:52,706 INFO L132 encePairwiseOnDemand]: 225/231 looper letters, 46 selfloop transitions, 3 changer transitions 4/210 dead transitions. [2022-01-19 08:19:52,706 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 210 transitions, 539 flow [2022-01-19 08:19:52,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 08:19:52,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 08:19:52,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 919 transitions. [2022-01-19 08:19:52,714 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7956709956709956 [2022-01-19 08:19:52,714 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 919 transitions. [2022-01-19 08:19:52,714 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 919 transitions. [2022-01-19 08:19:52,715 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 08:19:52,715 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 919 transitions. [2022-01-19 08:19:52,717 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 183.8) internal successors, (919), 5 states have internal predecessors, (919), 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 08:19:52,720 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 231.0) internal successors, (1386), 6 states have internal predecessors, (1386), 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 08:19:52,721 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 231.0) internal successors, (1386), 6 states have internal predecessors, (1386), 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 08:19:52,721 INFO L186 Difference]: Start difference. First operand has 202 places, 196 transitions, 400 flow. Second operand 5 states and 919 transitions. [2022-01-19 08:19:52,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 210 transitions, 539 flow [2022-01-19 08:19:52,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 210 transitions, 539 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-01-19 08:19:52,725 INFO L242 Difference]: Finished difference. Result has 203 places, 198 transitions, 423 flow [2022-01-19 08:19:52,727 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=400, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=423, PETRI_PLACES=203, PETRI_TRANSITIONS=198} [2022-01-19 08:19:52,728 INFO L334 CegarLoopForPetriNet]: 209 programPoint places, -6 predicate places. [2022-01-19 08:19:52,728 INFO L470 AbstractCegarLoop]: Abstraction has has 203 places, 198 transitions, 423 flow [2022-01-19 08:19:52,728 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 179.6) internal successors, (898), 5 states have internal predecessors, (898), 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 08:19:52,728 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 08:19:52,729 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] [2022-01-19 08:19:52,729 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-19 08:19:52,729 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 08:19:52,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 08:19:52,730 INFO L85 PathProgramCache]: Analyzing trace with hash -751491566, now seen corresponding path program 1 times [2022-01-19 08:19:52,730 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 08:19:52,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277778832] [2022-01-19 08:19:52,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 08:19:52,730 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 08:19:52,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 08:19:52,849 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 08:19:52,850 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 08:19:52,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277778832] [2022-01-19 08:19:52,850 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277778832] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 08:19:52,850 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 08:19:52,850 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 08:19:52,850 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979767727] [2022-01-19 08:19:52,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 08:19:52,851 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 08:19:52,851 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 08:19:52,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 08:19:52,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 08:19:52,852 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 231 [2022-01-19 08:19:52,852 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 198 transitions, 423 flow. Second operand has 3 states, 3 states have (on average 203.0) internal successors, (609), 3 states have internal predecessors, (609), 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 08:19:52,852 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 08:19:52,852 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 231 [2022-01-19 08:19:52,852 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 08:19:52,976 INFO L129 PetriNetUnfolder]: 395/1111 cut-off events. [2022-01-19 08:19:52,977 INFO L130 PetriNetUnfolder]: For 214/216 co-relation queries the response was YES. [2022-01-19 08:19:52,980 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1910 conditions, 1111 events. 395/1111 cut-off events. For 214/216 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 5712 event pairs, 70 based on Foata normal form. 18/1017 useless extension candidates. Maximal degree in co-relation 1903. Up to 431 conditions per place. [2022-01-19 08:19:52,985 INFO L132 encePairwiseOnDemand]: 228/231 looper letters, 33 selfloop transitions, 2 changer transitions 0/211 dead transitions. [2022-01-19 08:19:52,986 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 211 transitions, 531 flow [2022-01-19 08:19:52,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 08:19:52,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 08:19:52,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 627 transitions. [2022-01-19 08:19:52,987 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9047619047619048 [2022-01-19 08:19:52,987 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 627 transitions. [2022-01-19 08:19:52,987 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 627 transitions. [2022-01-19 08:19:52,987 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 08:19:52,988 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 627 transitions. [2022-01-19 08:19:52,988 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 209.0) internal successors, (627), 3 states have internal predecessors, (627), 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 08:19:52,990 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 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 08:19:52,990 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 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 08:19:52,990 INFO L186 Difference]: Start difference. First operand has 203 places, 198 transitions, 423 flow. Second operand 3 states and 627 transitions. [2022-01-19 08:19:52,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 211 transitions, 531 flow [2022-01-19 08:19:52,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 211 transitions, 523 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-01-19 08:19:52,997 INFO L242 Difference]: Finished difference. Result has 201 places, 199 transitions, 430 flow [2022-01-19 08:19:52,997 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=430, PETRI_PLACES=201, PETRI_TRANSITIONS=199} [2022-01-19 08:19:52,998 INFO L334 CegarLoopForPetriNet]: 209 programPoint places, -8 predicate places. [2022-01-19 08:19:52,998 INFO L470 AbstractCegarLoop]: Abstraction has has 201 places, 199 transitions, 430 flow [2022-01-19 08:19:52,999 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 203.0) internal successors, (609), 3 states have internal predecessors, (609), 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 08:19:52,999 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 08:19:52,999 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] [2022-01-19 08:19:52,999 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-19 08:19:52,999 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 08:19:53,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 08:19:53,000 INFO L85 PathProgramCache]: Analyzing trace with hash 952485664, now seen corresponding path program 1 times [2022-01-19 08:19:53,000 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 08:19:53,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877634563] [2022-01-19 08:19:53,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 08:19:53,000 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 08:19:53,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 08:19:53,055 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 08:19:53,055 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 08:19:53,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877634563] [2022-01-19 08:19:53,055 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877634563] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 08:19:53,055 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 08:19:53,055 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 08:19:53,055 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067887348] [2022-01-19 08:19:53,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 08:19:53,056 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 08:19:53,056 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 08:19:53,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 08:19:53,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 08:19:53,057 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 231 [2022-01-19 08:19:53,058 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 199 transitions, 430 flow. Second operand has 3 states, 3 states have (on average 203.0) internal successors, (609), 3 states have internal predecessors, (609), 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 08:19:53,058 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 08:19:53,058 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 231 [2022-01-19 08:19:53,058 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 08:19:53,175 INFO L129 PetriNetUnfolder]: 299/1051 cut-off events. [2022-01-19 08:19:53,175 INFO L130 PetriNetUnfolder]: For 359/360 co-relation queries the response was YES. [2022-01-19 08:19:53,178 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1782 conditions, 1051 events. 299/1051 cut-off events. For 359/360 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 5555 event pairs, 106 based on Foata normal form. 14/916 useless extension candidates. Maximal degree in co-relation 1776. Up to 353 conditions per place. [2022-01-19 08:19:53,182 INFO L132 encePairwiseOnDemand]: 228/231 looper letters, 34 selfloop transitions, 2 changer transitions 0/212 dead transitions. [2022-01-19 08:19:53,182 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 212 transitions, 547 flow [2022-01-19 08:19:53,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 08:19:53,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 08:19:53,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 626 transitions. [2022-01-19 08:19:53,183 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9033189033189033 [2022-01-19 08:19:53,183 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 626 transitions. [2022-01-19 08:19:53,183 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 626 transitions. [2022-01-19 08:19:53,184 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 08:19:53,184 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 626 transitions. [2022-01-19 08:19:53,185 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 208.66666666666666) internal successors, (626), 3 states have internal predecessors, (626), 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 08:19:53,186 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 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 08:19:53,186 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 231.0) internal successors, (924), 4 states have internal predecessors, (924), 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 08:19:53,186 INFO L186 Difference]: Start difference. First operand has 201 places, 199 transitions, 430 flow. Second operand 3 states and 626 transitions. [2022-01-19 08:19:53,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 212 transitions, 547 flow [2022-01-19 08:19:53,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 212 transitions, 544 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 08:19:53,189 INFO L242 Difference]: Finished difference. Result has 203 places, 200 transitions, 442 flow [2022-01-19 08:19:53,190 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=428, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=442, PETRI_PLACES=203, PETRI_TRANSITIONS=200} [2022-01-19 08:19:53,190 INFO L334 CegarLoopForPetriNet]: 209 programPoint places, -6 predicate places. [2022-01-19 08:19:53,190 INFO L470 AbstractCegarLoop]: Abstraction has has 203 places, 200 transitions, 442 flow [2022-01-19 08:19:53,191 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 203.0) internal successors, (609), 3 states have internal predecessors, (609), 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 08:19:53,191 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 08:19:53,191 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] [2022-01-19 08:19:53,191 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-19 08:19:53,191 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 08:19:53,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 08:19:53,192 INFO L85 PathProgramCache]: Analyzing trace with hash -839317713, now seen corresponding path program 1 times [2022-01-19 08:19:53,192 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 08:19:53,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363569464] [2022-01-19 08:19:53,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 08:19:53,192 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 08:19:53,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 08:19:53,250 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 08:19:53,250 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 08:19:53,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363569464] [2022-01-19 08:19:53,250 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363569464] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 08:19:53,250 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 08:19:53,250 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 08:19:53,251 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190818622] [2022-01-19 08:19:53,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 08:19:53,251 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 08:19:53,251 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 08:19:53,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 08:19:53,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-19 08:19:53,252 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 231 [2022-01-19 08:19:53,253 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 200 transitions, 442 flow. Second operand has 6 states, 6 states have (on average 182.83333333333334) internal successors, (1097), 6 states have internal predecessors, (1097), 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 08:19:53,253 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 08:19:53,253 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 231 [2022-01-19 08:19:53,253 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 08:19:53,421 INFO L129 PetriNetUnfolder]: 212/971 cut-off events. [2022-01-19 08:19:53,421 INFO L130 PetriNetUnfolder]: For 388/389 co-relation queries the response was YES. [2022-01-19 08:19:53,423 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1698 conditions, 971 events. 212/971 cut-off events. For 388/389 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 4744 event pairs, 98 based on Foata normal form. 12/882 useless extension candidates. Maximal degree in co-relation 1691. Up to 289 conditions per place. [2022-01-19 08:19:53,427 INFO L132 encePairwiseOnDemand]: 221/231 looper letters, 63 selfloop transitions, 11 changer transitions 0/230 dead transitions. [2022-01-19 08:19:53,427 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 230 transitions, 671 flow [2022-01-19 08:19:53,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 08:19:53,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 08:19:53,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1671 transitions. [2022-01-19 08:19:53,429 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8037518037518038 [2022-01-19 08:19:53,429 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1671 transitions. [2022-01-19 08:19:53,430 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1671 transitions. [2022-01-19 08:19:53,430 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 08:19:53,430 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1671 transitions. [2022-01-19 08:19:53,432 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 185.66666666666666) internal successors, (1671), 9 states have internal predecessors, (1671), 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 08:19:53,457 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 231.0) internal successors, (2310), 10 states have internal predecessors, (2310), 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 08:19:53,458 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 231.0) internal successors, (2310), 10 states have internal predecessors, (2310), 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 08:19:53,458 INFO L186 Difference]: Start difference. First operand has 203 places, 200 transitions, 442 flow. Second operand 9 states and 1671 transitions. [2022-01-19 08:19:53,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 230 transitions, 671 flow [2022-01-19 08:19:53,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 230 transitions, 668 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 08:19:53,462 INFO L242 Difference]: Finished difference. Result has 212 places, 204 transitions, 482 flow [2022-01-19 08:19:53,462 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=482, PETRI_PLACES=212, PETRI_TRANSITIONS=204} [2022-01-19 08:19:53,462 INFO L334 CegarLoopForPetriNet]: 209 programPoint places, 3 predicate places. [2022-01-19 08:19:53,462 INFO L470 AbstractCegarLoop]: Abstraction has has 212 places, 204 transitions, 482 flow [2022-01-19 08:19:53,463 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 182.83333333333334) internal successors, (1097), 6 states have internal predecessors, (1097), 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 08:19:53,463 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 08:19:53,463 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] [2022-01-19 08:19:53,463 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-19 08:19:53,463 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 08:19:53,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 08:19:53,464 INFO L85 PathProgramCache]: Analyzing trace with hash -537616131, now seen corresponding path program 1 times [2022-01-19 08:19:53,464 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 08:19:53,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062272906] [2022-01-19 08:19:53,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 08:19:53,464 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 08:19:53,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 08:19:53,520 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 08:19:53,520 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 08:19:53,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062272906] [2022-01-19 08:19:53,520 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062272906] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 08:19:53,520 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 08:19:53,520 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 08:19:53,520 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569386688] [2022-01-19 08:19:53,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 08:19:53,521 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 08:19:53,521 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 08:19:53,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 08:19:53,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-19 08:19:53,522 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 231 [2022-01-19 08:19:53,523 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 204 transitions, 482 flow. Second operand has 6 states, 6 states have (on average 182.83333333333334) internal successors, (1097), 6 states have internal predecessors, (1097), 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 08:19:53,523 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 08:19:53,523 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 231 [2022-01-19 08:19:53,523 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 08:19:53,703 INFO L129 PetriNetUnfolder]: 236/1235 cut-off events. [2022-01-19 08:19:53,704 INFO L130 PetriNetUnfolder]: For 512/514 co-relation queries the response was YES. [2022-01-19 08:19:53,706 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2097 conditions, 1235 events. 236/1235 cut-off events. For 512/514 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 6850 event pairs, 110 based on Foata normal form. 20/1127 useless extension candidates. Maximal degree in co-relation 2088. Up to 346 conditions per place. [2022-01-19 08:19:53,710 INFO L132 encePairwiseOnDemand]: 223/231 looper letters, 58 selfloop transitions, 8 changer transitions 0/222 dead transitions. [2022-01-19 08:19:53,710 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 222 transitions, 672 flow [2022-01-19 08:19:53,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 08:19:53,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 08:19:53,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1303 transitions. [2022-01-19 08:19:53,712 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8058132343846629 [2022-01-19 08:19:53,713 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1303 transitions. [2022-01-19 08:19:53,713 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1303 transitions. [2022-01-19 08:19:53,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 08:19:53,713 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1303 transitions. [2022-01-19 08:19:53,715 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 186.14285714285714) internal successors, (1303), 7 states have internal predecessors, (1303), 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 08:19:53,716 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 231.0) internal successors, (1848), 8 states have internal predecessors, (1848), 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 08:19:53,717 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 231.0) internal successors, (1848), 8 states have internal predecessors, (1848), 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 08:19:53,717 INFO L186 Difference]: Start difference. First operand has 212 places, 204 transitions, 482 flow. Second operand 7 states and 1303 transitions. [2022-01-19 08:19:53,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 222 transitions, 672 flow [2022-01-19 08:19:53,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 222 transitions, 663 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-01-19 08:19:53,721 INFO L242 Difference]: Finished difference. Result has 217 places, 206 transitions, 503 flow [2022-01-19 08:19:53,721 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=473, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=503, PETRI_PLACES=217, PETRI_TRANSITIONS=206} [2022-01-19 08:19:53,722 INFO L334 CegarLoopForPetriNet]: 209 programPoint places, 8 predicate places. [2022-01-19 08:19:53,722 INFO L470 AbstractCegarLoop]: Abstraction has has 217 places, 206 transitions, 503 flow [2022-01-19 08:19:53,722 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 182.83333333333334) internal successors, (1097), 6 states have internal predecessors, (1097), 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 08:19:53,722 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 08:19:53,722 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, 1] [2022-01-19 08:19:53,722 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-19 08:19:53,723 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 08:19:53,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 08:19:53,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1312788725, now seen corresponding path program 1 times [2022-01-19 08:19:53,723 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 08:19:53,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816645358] [2022-01-19 08:19:53,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 08:19:53,723 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 08:19:53,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 08:19:53,973 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 08:19:53,974 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 08:19:53,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816645358] [2022-01-19 08:19:53,974 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816645358] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 08:19:53,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1409434105] [2022-01-19 08:19:53,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 08:19:53,977 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 08:19:53,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 08:19:53,978 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 08:19:54,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-19 08:19:54,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 08:19:54,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 13 conjunts are in the unsatisfiable core [2022-01-19 08:19:54,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 08:19:54,747 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 08:19:54,747 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 08:19:55,115 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 08:19:55,116 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1409434105] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-19 08:19:55,116 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-01-19 08:19:55,116 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9, 8] total 19 [2022-01-19 08:19:55,116 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801730703] [2022-01-19 08:19:55,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 08:19:55,116 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-19 08:19:55,116 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 08:19:55,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-19 08:19:55,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2022-01-19 08:19:55,119 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 231 [2022-01-19 08:19:55,120 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 206 transitions, 503 flow. Second operand has 9 states, 9 states have (on average 188.0) internal successors, (1692), 9 states have internal predecessors, (1692), 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 08:19:55,120 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 08:19:55,120 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 231 [2022-01-19 08:19:55,120 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 08:19:58,053 INFO L129 PetriNetUnfolder]: 14909/28836 cut-off events. [2022-01-19 08:19:58,053 INFO L130 PetriNetUnfolder]: For 8639/8639 co-relation queries the response was YES. [2022-01-19 08:19:58,131 INFO L84 FinitePrefix]: Finished finitePrefix Result has 57796 conditions, 28836 events. 14909/28836 cut-off events. For 8639/8639 co-relation queries the response was YES. Maximal size of possible extension queue 1164. Compared 267271 event pairs, 1712 based on Foata normal form. 0/24311 useless extension candidates. Maximal degree in co-relation 57785. Up to 4417 conditions per place. [2022-01-19 08:19:58,218 INFO L132 encePairwiseOnDemand]: 220/231 looper letters, 205 selfloop transitions, 32 changer transitions 3/409 dead transitions. [2022-01-19 08:19:58,218 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 409 transitions, 1603 flow [2022-01-19 08:19:58,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-19 08:19:58,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-01-19 08:19:58,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 3178 transitions. [2022-01-19 08:19:58,223 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8598484848484849 [2022-01-19 08:19:58,223 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 3178 transitions. [2022-01-19 08:19:58,223 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 3178 transitions. [2022-01-19 08:19:58,224 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 08:19:58,224 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 3178 transitions. [2022-01-19 08:19:58,229 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 198.625) internal successors, (3178), 16 states have internal predecessors, (3178), 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 08:19:58,233 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 231.0) internal successors, (3927), 17 states have internal predecessors, (3927), 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 08:19:58,234 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 231.0) internal successors, (3927), 17 states have internal predecessors, (3927), 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 08:19:58,234 INFO L186 Difference]: Start difference. First operand has 217 places, 206 transitions, 503 flow. Second operand 16 states and 3178 transitions. [2022-01-19 08:19:58,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 409 transitions, 1603 flow [2022-01-19 08:19:58,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 409 transitions, 1591 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-01-19 08:19:58,245 INFO L242 Difference]: Finished difference. Result has 240 places, 235 transitions, 699 flow [2022-01-19 08:19:58,245 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=491, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=699, PETRI_PLACES=240, PETRI_TRANSITIONS=235} [2022-01-19 08:19:58,246 INFO L334 CegarLoopForPetriNet]: 209 programPoint places, 31 predicate places. [2022-01-19 08:19:58,246 INFO L470 AbstractCegarLoop]: Abstraction has has 240 places, 235 transitions, 699 flow [2022-01-19 08:19:58,246 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 188.0) internal successors, (1692), 9 states have internal predecessors, (1692), 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 08:19:58,246 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 08:19:58,247 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, 1] [2022-01-19 08:19:58,266 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-19 08:19:58,463 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 08:19:58,464 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 08:19:58,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 08:19:58,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1767694281, now seen corresponding path program 2 times [2022-01-19 08:19:58,464 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 08:19:58,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566247327] [2022-01-19 08:19:58,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 08:19:58,465 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 08:19:58,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 08:19:58,695 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-19 08:19:58,696 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 08:19:58,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566247327] [2022-01-19 08:19:58,696 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566247327] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 08:19:58,696 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 08:19:58,696 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-19 08:19:58,696 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033844881] [2022-01-19 08:19:58,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 08:19:58,696 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-19 08:19:58,697 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 08:19:58,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-19 08:19:58,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-01-19 08:19:58,698 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 231 [2022-01-19 08:19:58,699 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 235 transitions, 699 flow. Second operand has 9 states, 9 states have (on average 186.22222222222223) internal successors, (1676), 9 states have internal predecessors, (1676), 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 08:19:58,699 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 08:19:58,700 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 231 [2022-01-19 08:19:58,700 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 08:20:01,497 INFO L129 PetriNetUnfolder]: 12728/25395 cut-off events. [2022-01-19 08:20:01,497 INFO L130 PetriNetUnfolder]: For 24354/24601 co-relation queries the response was YES. [2022-01-19 08:20:01,614 INFO L84 FinitePrefix]: Finished finitePrefix Result has 64833 conditions, 25395 events. 12728/25395 cut-off events. For 24354/24601 co-relation queries the response was YES. Maximal size of possible extension queue 1054. Compared 241038 event pairs, 1816 based on Foata normal form. 63/24438 useless extension candidates. Maximal degree in co-relation 64810. Up to 8595 conditions per place. [2022-01-19 08:20:01,700 INFO L132 encePairwiseOnDemand]: 221/231 looper letters, 137 selfloop transitions, 17 changer transitions 10/337 dead transitions. [2022-01-19 08:20:01,701 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 337 transitions, 1465 flow [2022-01-19 08:20:01,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-19 08:20:01,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-01-19 08:20:01,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1585 transitions. [2022-01-19 08:20:01,703 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8576839826839827 [2022-01-19 08:20:01,703 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1585 transitions. [2022-01-19 08:20:01,704 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1585 transitions. [2022-01-19 08:20:01,704 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 08:20:01,704 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1585 transitions. [2022-01-19 08:20:01,706 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 198.125) internal successors, (1585), 8 states have internal predecessors, (1585), 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 08:20:01,708 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 231.0) internal successors, (2079), 9 states have internal predecessors, (2079), 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 08:20:01,709 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 231.0) internal successors, (2079), 9 states have internal predecessors, (2079), 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 08:20:01,709 INFO L186 Difference]: Start difference. First operand has 240 places, 235 transitions, 699 flow. Second operand 8 states and 1585 transitions. [2022-01-19 08:20:01,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 337 transitions, 1465 flow [2022-01-19 08:20:02,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 337 transitions, 1464 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 08:20:02,106 INFO L242 Difference]: Finished difference. Result has 250 places, 246 transitions, 814 flow [2022-01-19 08:20:02,107 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=698, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=814, PETRI_PLACES=250, PETRI_TRANSITIONS=246} [2022-01-19 08:20:02,107 INFO L334 CegarLoopForPetriNet]: 209 programPoint places, 41 predicate places. [2022-01-19 08:20:02,107 INFO L470 AbstractCegarLoop]: Abstraction has has 250 places, 246 transitions, 814 flow [2022-01-19 08:20:02,108 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 186.22222222222223) internal successors, (1676), 9 states have internal predecessors, (1676), 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 08:20:02,108 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 08:20:02,108 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, 1] [2022-01-19 08:20:02,108 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-19 08:20:02,108 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 08:20:02,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 08:20:02,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1641547521, now seen corresponding path program 3 times [2022-01-19 08:20:02,109 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 08:20:02,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823457546] [2022-01-19 08:20:02,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 08:20:02,109 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 08:20:02,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 08:20:02,241 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 08:20:02,242 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 08:20:02,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823457546] [2022-01-19 08:20:02,242 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823457546] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 08:20:02,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1014472863] [2022-01-19 08:20:02,242 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-19 08:20:02,242 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 08:20:02,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 08:20:02,243 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 08:20:02,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-19 08:20:02,353 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-01-19 08:20:02,354 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 08:20:02,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 14 conjunts are in the unsatisfiable core [2022-01-19 08:20:02,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 08:20:03,537 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-19 08:20:03,537 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-19 08:20:03,537 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1014472863] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 08:20:03,537 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-19 08:20:03,537 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 14 [2022-01-19 08:20:03,537 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614770614] [2022-01-19 08:20:03,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 08:20:03,538 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-19 08:20:03,538 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 08:20:03,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-19 08:20:03,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-01-19 08:20:03,539 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 231 [2022-01-19 08:20:03,540 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 246 transitions, 814 flow. Second operand has 9 states, 9 states have (on average 184.44444444444446) internal successors, (1660), 9 states have internal predecessors, (1660), 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 08:20:03,540 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 08:20:03,540 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 231 [2022-01-19 08:20:03,540 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 08:20:08,047 INFO L129 PetriNetUnfolder]: 21209/39357 cut-off events. [2022-01-19 08:20:08,047 INFO L130 PetriNetUnfolder]: For 60192/60556 co-relation queries the response was YES. [2022-01-19 08:20:08,369 INFO L84 FinitePrefix]: Finished finitePrefix Result has 115647 conditions, 39357 events. 21209/39357 cut-off events. For 60192/60556 co-relation queries the response was YES. Maximal size of possible extension queue 1661. Compared 374321 event pairs, 3314 based on Foata normal form. 766/38376 useless extension candidates. Maximal degree in co-relation 115620. Up to 12058 conditions per place. [2022-01-19 08:20:08,495 INFO L132 encePairwiseOnDemand]: 213/231 looper letters, 286 selfloop transitions, 68 changer transitions 10/529 dead transitions. [2022-01-19 08:20:08,495 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 529 transitions, 2920 flow [2022-01-19 08:20:08,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-19 08:20:08,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-01-19 08:20:08,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3908 transitions. [2022-01-19 08:20:08,500 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8458874458874459 [2022-01-19 08:20:08,500 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 3908 transitions. [2022-01-19 08:20:08,500 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 3908 transitions. [2022-01-19 08:20:08,502 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 08:20:08,502 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 3908 transitions. [2022-01-19 08:20:08,507 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 195.4) internal successors, (3908), 20 states have internal predecessors, (3908), 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 08:20:08,512 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 231.0) internal successors, (4851), 21 states have internal predecessors, (4851), 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 08:20:08,513 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 231.0) internal successors, (4851), 21 states have internal predecessors, (4851), 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 08:20:08,513 INFO L186 Difference]: Start difference. First operand has 250 places, 246 transitions, 814 flow. Second operand 20 states and 3908 transitions. [2022-01-19 08:20:08,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 529 transitions, 2920 flow [2022-01-19 08:20:09,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 529 transitions, 2920 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-01-19 08:20:09,388 INFO L242 Difference]: Finished difference. Result has 283 places, 300 transitions, 1444 flow [2022-01-19 08:20:09,388 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=814, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=1444, PETRI_PLACES=283, PETRI_TRANSITIONS=300} [2022-01-19 08:20:09,389 INFO L334 CegarLoopForPetriNet]: 209 programPoint places, 74 predicate places. [2022-01-19 08:20:09,389 INFO L470 AbstractCegarLoop]: Abstraction has has 283 places, 300 transitions, 1444 flow [2022-01-19 08:20:09,390 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 184.44444444444446) internal successors, (1660), 9 states have internal predecessors, (1660), 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 08:20:09,390 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 08:20:09,390 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, 1] [2022-01-19 08:20:09,406 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-19 08:20:09,595 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-01-19 08:20:09,596 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 08:20:09,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 08:20:09,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1628940191, now seen corresponding path program 4 times [2022-01-19 08:20:09,596 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 08:20:09,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688618686] [2022-01-19 08:20:09,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 08:20:09,596 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 08:20:09,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 08:20:09,673 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 08:20:09,673 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 08:20:09,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688618686] [2022-01-19 08:20:09,673 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688618686] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 08:20:09,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1810452377] [2022-01-19 08:20:09,674 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-19 08:20:09,674 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 08:20:09,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 08:20:09,675 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 08:20:09,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-19 08:20:09,781 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-19 08:20:09,781 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 08:20:09,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 13 conjunts are in the unsatisfiable core [2022-01-19 08:20:09,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 08:20:10,308 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-19 08:20:10,308 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-19 08:20:10,308 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1810452377] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 08:20:10,308 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-19 08:20:10,308 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2022-01-19 08:20:10,308 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121954650] [2022-01-19 08:20:10,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 08:20:10,309 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 08:20:10,309 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 08:20:10,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 08:20:10,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-01-19 08:20:10,310 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 231 [2022-01-19 08:20:10,311 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 300 transitions, 1444 flow. Second operand has 7 states, 7 states have (on average 190.57142857142858) internal successors, (1334), 7 states have internal predecessors, (1334), 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 08:20:10,311 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 08:20:10,311 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 231 [2022-01-19 08:20:10,311 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 08:20:14,834 INFO L129 PetriNetUnfolder]: 15022/31752 cut-off events. [2022-01-19 08:20:14,834 INFO L130 PetriNetUnfolder]: For 105284/106091 co-relation queries the response was YES. [2022-01-19 08:20:15,038 INFO L84 FinitePrefix]: Finished finitePrefix Result has 112361 conditions, 31752 events. 15022/31752 cut-off events. For 105284/106091 co-relation queries the response was YES. Maximal size of possible extension queue 1349. Compared 325475 event pairs, 2927 based on Foata normal form. 159/30152 useless extension candidates. Maximal degree in co-relation 112319. Up to 10067 conditions per place. [2022-01-19 08:20:15,128 INFO L132 encePairwiseOnDemand]: 221/231 looper letters, 166 selfloop transitions, 31 changer transitions 15/390 dead transitions. [2022-01-19 08:20:15,128 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 390 transitions, 2410 flow [2022-01-19 08:20:15,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-19 08:20:15,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-01-19 08:20:15,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1605 transitions. [2022-01-19 08:20:15,132 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8685064935064936 [2022-01-19 08:20:15,132 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1605 transitions. [2022-01-19 08:20:15,132 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1605 transitions. [2022-01-19 08:20:15,132 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 08:20:15,132 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1605 transitions. [2022-01-19 08:20:15,134 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 200.625) internal successors, (1605), 8 states have internal predecessors, (1605), 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 08:20:15,136 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 231.0) internal successors, (2079), 9 states have internal predecessors, (2079), 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 08:20:15,137 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 231.0) internal successors, (2079), 9 states have internal predecessors, (2079), 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 08:20:15,137 INFO L186 Difference]: Start difference. First operand has 283 places, 300 transitions, 1444 flow. Second operand 8 states and 1605 transitions. [2022-01-19 08:20:15,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 390 transitions, 2410 flow [2022-01-19 08:20:15,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 390 transitions, 2355 flow, removed 8 selfloop flow, removed 2 redundant places. [2022-01-19 08:20:15,883 INFO L242 Difference]: Finished difference. Result has 292 places, 306 transitions, 1542 flow [2022-01-19 08:20:15,884 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=1393, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1542, PETRI_PLACES=292, PETRI_TRANSITIONS=306} [2022-01-19 08:20:15,884 INFO L334 CegarLoopForPetriNet]: 209 programPoint places, 83 predicate places. [2022-01-19 08:20:15,884 INFO L470 AbstractCegarLoop]: Abstraction has has 292 places, 306 transitions, 1542 flow [2022-01-19 08:20:15,884 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 190.57142857142858) internal successors, (1334), 7 states have internal predecessors, (1334), 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 08:20:15,884 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 08:20:15,885 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, 1] [2022-01-19 08:20:15,904 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-19 08:20:16,099 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 08:20:16,100 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-19 08:20:16,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 08:20:16,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1343823855, now seen corresponding path program 5 times [2022-01-19 08:20:16,100 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 08:20:16,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352717142] [2022-01-19 08:20:16,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 08:20:16,101 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 08:20:16,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 08:20:16,168 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 08:20:16,168 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 08:20:16,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352717142] [2022-01-19 08:20:16,168 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352717142] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 08:20:16,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [134561547] [2022-01-19 08:20:16,168 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-19 08:20:16,169 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 08:20:16,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 08:20:16,169 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 08:20:16,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-19 08:20:16,264 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 08:20:16,264 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 08:20:16,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-19 08:20:16,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 08:20:16,833 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 08:20:16,833 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 08:20:17,204 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 08:20:17,204 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [134561547] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 08:20:17,204 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 08:20:17,205 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 8] total 17 [2022-01-19 08:20:17,205 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383234133] [2022-01-19 08:20:17,205 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 08:20:17,205 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-01-19 08:20:17,205 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 08:20:17,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-01-19 08:20:17,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2022-01-19 08:20:17,208 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 231 [2022-01-19 08:20:17,210 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 306 transitions, 1542 flow. Second operand has 17 states, 17 states have (on average 187.94117647058823) internal successors, (3195), 17 states have internal predecessors, (3195), 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 08:20:17,210 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 08:20:17,210 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 231 [2022-01-19 08:20:17,210 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 08:20:25,169 INFO L129 PetriNetUnfolder]: 28659/55417 cut-off events. [2022-01-19 08:20:25,170 INFO L130 PetriNetUnfolder]: For 224579/226613 co-relation queries the response was YES. [2022-01-19 08:20:25,696 INFO L84 FinitePrefix]: Finished finitePrefix Result has 200321 conditions, 55417 events. 28659/55417 cut-off events. For 224579/226613 co-relation queries the response was YES. Maximal size of possible extension queue 2436. Compared 574866 event pairs, 2690 based on Foata normal form. 2986/55748 useless extension candidates. Maximal degree in co-relation 200274. Up to 6334 conditions per place. [2022-01-19 08:20:25,897 INFO L132 encePairwiseOnDemand]: 219/231 looper letters, 547 selfloop transitions, 197 changer transitions 3/930 dead transitions. [2022-01-19 08:20:25,897 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 930 transitions, 7374 flow [2022-01-19 08:20:25,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-01-19 08:20:25,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2022-01-19 08:20:25,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 5328 transitions. [2022-01-19 08:20:25,906 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8542568542568543 [2022-01-19 08:20:25,907 INFO L72 ComplementDD]: Start complementDD. Operand 27 states and 5328 transitions. [2022-01-19 08:20:25,907 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 5328 transitions. [2022-01-19 08:20:25,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 08:20:25,909 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 5328 transitions. [2022-01-19 08:20:25,916 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 28 states, 27 states have (on average 197.33333333333334) internal successors, (5328), 27 states have internal predecessors, (5328), 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 08:20:25,922 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 28 states, 28 states have (on average 231.0) internal successors, (6468), 28 states have internal predecessors, (6468), 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 08:20:25,923 INFO L81 ComplementDD]: Finished complementDD. Result has 28 states, 28 states have (on average 231.0) internal successors, (6468), 28 states have internal predecessors, (6468), 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 08:20:25,923 INFO L186 Difference]: Start difference. First operand has 292 places, 306 transitions, 1542 flow. Second operand 27 states and 5328 transitions. [2022-01-19 08:20:25,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 930 transitions, 7374 flow [2022-01-19 08:20:27,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 930 transitions, 7210 flow, removed 29 selfloop flow, removed 4 redundant places. [2022-01-19 08:20:27,439 INFO L242 Difference]: Finished difference. Result has 330 places, 464 transitions, 3564 flow [2022-01-19 08:20:27,440 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=1505, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=246, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=3564, PETRI_PLACES=330, PETRI_TRANSITIONS=464} [2022-01-19 08:20:27,440 INFO L334 CegarLoopForPetriNet]: 209 programPoint places, 121 predicate places. [2022-01-19 08:20:27,440 INFO L470 AbstractCegarLoop]: Abstraction has has 330 places, 464 transitions, 3564 flow [2022-01-19 08:20:27,441 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 187.94117647058823) internal successors, (3195), 17 states have internal predecessors, (3195), 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 08:20:27,441 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 08:20:27,441 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, 1] [2022-01-19 08:20:27,458 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-19 08:20:27,651 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 08:20:27,652 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-19 08:20:27,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 08:20:27,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1857966267, now seen corresponding path program 6 times [2022-01-19 08:20:27,652 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 08:20:27,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896071830] [2022-01-19 08:20:27,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 08:20:27,652 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 08:20:27,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 08:20:27,827 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-19 08:20:27,827 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 08:20:27,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896071830] [2022-01-19 08:20:27,827 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896071830] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 08:20:27,827 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 08:20:27,827 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 08:20:27,828 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967521797] [2022-01-19 08:20:27,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 08:20:27,829 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 08:20:27,829 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 08:20:27,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 08:20:27,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-19 08:20:27,830 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 231 [2022-01-19 08:20:27,831 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 464 transitions, 3564 flow. Second operand has 7 states, 7 states have (on average 190.57142857142858) internal successors, (1334), 7 states have internal predecessors, (1334), 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 08:20:27,831 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 08:20:27,831 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 231 [2022-01-19 08:20:27,831 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 08:20:53,786 INFO L129 PetriNetUnfolder]: 74181/155674 cut-off events. [2022-01-19 08:20:53,787 INFO L130 PetriNetUnfolder]: For 1074147/1080594 co-relation queries the response was YES. [2022-01-19 08:20:56,123 INFO L84 FinitePrefix]: Finished finitePrefix Result has 660690 conditions, 155674 events. 74181/155674 cut-off events. For 1074147/1080594 co-relation queries the response was YES. Maximal size of possible extension queue 6159. Compared 1947967 event pairs, 8647 based on Foata normal form. 1566/147955 useless extension candidates. Maximal degree in co-relation 660628. Up to 33535 conditions per place. [2022-01-19 08:20:56,681 INFO L132 encePairwiseOnDemand]: 222/231 looper letters, 735 selfloop transitions, 285 changer transitions 6/1235 dead transitions. [2022-01-19 08:20:56,681 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 1235 transitions, 12926 flow [2022-01-19 08:20:56,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-19 08:20:56,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-01-19 08:20:56,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2645 transitions. [2022-01-19 08:20:56,685 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8807858807858808 [2022-01-19 08:20:56,685 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2645 transitions. [2022-01-19 08:20:56,685 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2645 transitions. [2022-01-19 08:20:56,686 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 08:20:56,686 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2645 transitions. [2022-01-19 08:20:56,688 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 203.46153846153845) internal successors, (2645), 13 states have internal predecessors, (2645), 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 08:20:56,691 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 231.0) internal successors, (3234), 14 states have internal predecessors, (3234), 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 08:20:56,691 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 231.0) internal successors, (3234), 14 states have internal predecessors, (3234), 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 08:20:56,691 INFO L186 Difference]: Start difference. First operand has 330 places, 464 transitions, 3564 flow. Second operand 13 states and 2645 transitions. [2022-01-19 08:20:56,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 1235 transitions, 12926 flow [2022-01-19 08:21:40,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 342 places, 1235 transitions, 12558 flow, removed 184 selfloop flow, removed 0 redundant places. [2022-01-19 08:21:40,889 INFO L242 Difference]: Finished difference. Result has 351 places, 687 transitions, 6783 flow [2022-01-19 08:21:40,889 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=3466, PETRI_DIFFERENCE_MINUEND_PLACES=330, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=464, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=360, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=6783, PETRI_PLACES=351, PETRI_TRANSITIONS=687} [2022-01-19 08:21:40,890 INFO L334 CegarLoopForPetriNet]: 209 programPoint places, 142 predicate places. [2022-01-19 08:21:40,890 INFO L470 AbstractCegarLoop]: Abstraction has has 351 places, 687 transitions, 6783 flow [2022-01-19 08:21:40,890 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 190.57142857142858) internal successors, (1334), 7 states have internal predecessors, (1334), 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 08:21:40,890 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 08:21:40,890 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, 1] [2022-01-19 08:21:40,890 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-19 08:21:40,890 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-19 08:21:40,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 08:21:40,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1941926755, now seen corresponding path program 7 times [2022-01-19 08:21:40,891 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 08:21:40,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404742913] [2022-01-19 08:21:40,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 08:21:40,891 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 08:21:40,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 08:21:41,017 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-19 08:21:41,017 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 08:21:41,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404742913] [2022-01-19 08:21:41,017 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404742913] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 08:21:41,017 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 08:21:41,017 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 08:21:41,018 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963441525] [2022-01-19 08:21:41,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 08:21:41,018 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 08:21:41,018 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 08:21:41,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 08:21:41,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-01-19 08:21:41,020 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 231 [2022-01-19 08:21:41,021 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 351 places, 687 transitions, 6783 flow. Second operand has 8 states, 8 states have (on average 186.625) internal successors, (1493), 8 states have internal predecessors, (1493), 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 08:21:41,021 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 08:21:41,021 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 231 [2022-01-19 08:21:41,021 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 08:22:15,341 INFO L129 PetriNetUnfolder]: 81775/168790 cut-off events. [2022-01-19 08:22:15,341 INFO L130 PetriNetUnfolder]: For 1270578/1279022 co-relation queries the response was YES. [2022-01-19 08:22:18,270 INFO L84 FinitePrefix]: Finished finitePrefix Result has 762747 conditions, 168790 events. 81775/168790 cut-off events. For 1270578/1279022 co-relation queries the response was YES. Maximal size of possible extension queue 7039. Compared 2119361 event pairs, 18725 based on Foata normal form. 1958/165676 useless extension candidates. Maximal degree in co-relation 762675. Up to 76980 conditions per place. [2022-01-19 08:22:18,920 INFO L132 encePairwiseOnDemand]: 220/231 looper letters, 581 selfloop transitions, 449 changer transitions 43/1278 dead transitions. [2022-01-19 08:22:18,920 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 361 places, 1278 transitions, 16222 flow [2022-01-19 08:22:18,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-19 08:22:18,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-01-19 08:22:18,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2173 transitions. [2022-01-19 08:22:18,922 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8551751279024006 [2022-01-19 08:22:18,922 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2173 transitions. [2022-01-19 08:22:18,922 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2173 transitions. [2022-01-19 08:22:18,923 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 08:22:18,923 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2173 transitions. [2022-01-19 08:22:18,925 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 197.54545454545453) internal successors, (2173), 11 states have internal predecessors, (2173), 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 08:22:18,926 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 231.0) internal successors, (2772), 12 states have internal predecessors, (2772), 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 08:22:18,927 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 231.0) internal successors, (2772), 12 states have internal predecessors, (2772), 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 08:22:18,927 INFO L186 Difference]: Start difference. First operand has 351 places, 687 transitions, 6783 flow. Second operand 11 states and 2173 transitions. [2022-01-19 08:22:18,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 361 places, 1278 transitions, 16222 flow [2022-01-19 08:22:58,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 1278 transitions, 16024 flow, removed 53 selfloop flow, removed 2 redundant places. [2022-01-19 08:22:58,303 INFO L242 Difference]: Finished difference. Result has 366 places, 920 transitions, 11480 flow [2022-01-19 08:22:58,303 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=6675, PETRI_DIFFERENCE_MINUEND_PLACES=349, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=687, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=216, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=464, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=11480, PETRI_PLACES=366, PETRI_TRANSITIONS=920} [2022-01-19 08:22:58,304 INFO L334 CegarLoopForPetriNet]: 209 programPoint places, 157 predicate places. [2022-01-19 08:22:58,304 INFO L470 AbstractCegarLoop]: Abstraction has has 366 places, 920 transitions, 11480 flow [2022-01-19 08:22:58,304 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 186.625) internal successors, (1493), 8 states have internal predecessors, (1493), 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 08:22:58,304 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 08:22:58,304 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, 1] [2022-01-19 08:22:58,304 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-19 08:22:58,304 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-19 08:22:58,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 08:22:58,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1771465723, now seen corresponding path program 8 times [2022-01-19 08:22:58,305 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 08:22:58,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259471561] [2022-01-19 08:22:58,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 08:22:58,305 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 08:22:58,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 08:22:58,507 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 08:22:58,507 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 08:22:58,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259471561] [2022-01-19 08:22:58,507 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259471561] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 08:22:58,507 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 08:22:58,508 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-19 08:22:58,508 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285252207] [2022-01-19 08:22:58,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 08:22:58,508 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-19 08:22:58,508 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 08:22:58,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-19 08:22:58,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-01-19 08:22:58,509 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 231 [2022-01-19 08:22:58,510 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 920 transitions, 11480 flow. Second operand has 9 states, 9 states have (on average 186.22222222222223) internal successors, (1676), 9 states have internal predecessors, (1676), 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 08:22:58,510 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 08:22:58,510 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 231 [2022-01-19 08:22:58,510 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 08:23:32,725 INFO L129 PetriNetUnfolder]: 78191/163232 cut-off events. [2022-01-19 08:23:32,725 INFO L130 PetriNetUnfolder]: For 1610830/1614814 co-relation queries the response was YES. [2022-01-19 08:23:35,671 INFO L84 FinitePrefix]: Finished finitePrefix Result has 806530 conditions, 163232 events. 78191/163232 cut-off events. For 1610830/1614814 co-relation queries the response was YES. Maximal size of possible extension queue 7053. Compared 2068437 event pairs, 15014 based on Foata normal form. 1495/160009 useless extension candidates. Maximal degree in co-relation 806452. Up to 64539 conditions per place. [2022-01-19 08:23:36,330 INFO L132 encePairwiseOnDemand]: 217/231 looper letters, 458 selfloop transitions, 608 changer transitions 34/1329 dead transitions. [2022-01-19 08:23:36,330 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 1329 transitions, 18493 flow [2022-01-19 08:23:36,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-19 08:23:36,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-01-19 08:23:36,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2767 transitions. [2022-01-19 08:23:36,332 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8555967841682127 [2022-01-19 08:23:36,332 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 2767 transitions. [2022-01-19 08:23:36,332 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 2767 transitions. [2022-01-19 08:23:36,333 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 08:23:36,333 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 2767 transitions. [2022-01-19 08:23:36,335 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 197.64285714285714) internal successors, (2767), 14 states have internal predecessors, (2767), 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 08:23:36,337 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 231.0) internal successors, (3465), 15 states have internal predecessors, (3465), 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 08:23:36,338 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 231.0) internal successors, (3465), 15 states have internal predecessors, (3465), 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 08:23:36,338 INFO L186 Difference]: Start difference. First operand has 366 places, 920 transitions, 11480 flow. Second operand 14 states and 2767 transitions. [2022-01-19 08:23:36,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 379 places, 1329 transitions, 18493 flow [2022-01-19 08:24:14,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 377 places, 1329 transitions, 18005 flow, removed 23 selfloop flow, removed 2 redundant places. [2022-01-19 08:24:14,939 INFO L242 Difference]: Finished difference. Result has 385 places, 1054 transitions, 14775 flow [2022-01-19 08:24:14,940 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=11055, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=919, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=473, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=418, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=14775, PETRI_PLACES=385, PETRI_TRANSITIONS=1054} [2022-01-19 08:24:14,940 INFO L334 CegarLoopForPetriNet]: 209 programPoint places, 176 predicate places. [2022-01-19 08:24:14,941 INFO L470 AbstractCegarLoop]: Abstraction has has 385 places, 1054 transitions, 14775 flow [2022-01-19 08:24:14,941 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 186.22222222222223) internal successors, (1676), 9 states have internal predecessors, (1676), 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 08:24:14,941 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 08:24:14,941 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, 1] [2022-01-19 08:24:14,941 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-19 08:24:14,941 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-19 08:24:14,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 08:24:14,942 INFO L85 PathProgramCache]: Analyzing trace with hash -116774603, now seen corresponding path program 9 times [2022-01-19 08:24:14,942 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 08:24:14,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697817213] [2022-01-19 08:24:14,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 08:24:14,942 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 08:24:14,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 08:24:15,144 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-19 08:24:15,145 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 08:24:15,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697817213] [2022-01-19 08:24:15,145 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697817213] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 08:24:15,145 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 08:24:15,145 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 08:24:15,145 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532307581] [2022-01-19 08:24:15,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 08:24:15,145 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 08:24:15,145 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 08:24:15,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 08:24:15,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-01-19 08:24:15,147 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 231 [2022-01-19 08:24:15,147 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 385 places, 1054 transitions, 14775 flow. Second operand has 8 states, 8 states have (on average 190.125) internal successors, (1521), 8 states have internal predecessors, (1521), 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 08:24:15,147 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 08:24:15,148 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 231 [2022-01-19 08:24:15,148 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 08:24:49,260 INFO L129 PetriNetUnfolder]: 68782/145834 cut-off events. [2022-01-19 08:24:49,260 INFO L130 PetriNetUnfolder]: For 1307839/1314935 co-relation queries the response was YES. [2022-01-19 08:24:51,934 INFO L84 FinitePrefix]: Finished finitePrefix Result has 715443 conditions, 145834 events. 68782/145834 cut-off events. For 1307839/1314935 co-relation queries the response was YES. Maximal size of possible extension queue 6142. Compared 1831026 event pairs, 13258 based on Foata normal form. 1545/143280 useless extension candidates. Maximal degree in co-relation 715357. Up to 65851 conditions per place. [2022-01-19 08:24:52,655 INFO L132 encePairwiseOnDemand]: 221/231 looper letters, 397 selfloop transitions, 545 changer transitions 26/1167 dead transitions. [2022-01-19 08:24:52,655 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 392 places, 1167 transitions, 17627 flow [2022-01-19 08:24:52,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-19 08:24:52,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-01-19 08:24:52,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1623 transitions. [2022-01-19 08:24:52,658 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8782467532467533 [2022-01-19 08:24:52,658 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1623 transitions. [2022-01-19 08:24:52,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1623 transitions. [2022-01-19 08:24:52,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 08:24:52,658 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1623 transitions. [2022-01-19 08:24:52,660 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 202.875) internal successors, (1623), 8 states have internal predecessors, (1623), 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 08:24:52,661 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 231.0) internal successors, (2079), 9 states have internal predecessors, (2079), 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 08:24:52,661 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 231.0) internal successors, (2079), 9 states have internal predecessors, (2079), 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 08:24:52,661 INFO L186 Difference]: Start difference. First operand has 385 places, 1054 transitions, 14775 flow. Second operand 8 states and 1623 transitions. [2022-01-19 08:24:52,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 392 places, 1167 transitions, 17627 flow [2022-01-19 08:25:28,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 390 places, 1167 transitions, 17201 flow, removed 28 selfloop flow, removed 2 redundant places. [2022-01-19 08:25:28,876 INFO L242 Difference]: Finished difference. Result has 393 places, 1049 transitions, 15718 flow [2022-01-19 08:25:28,877 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=13089, PETRI_DIFFERENCE_MINUEND_PLACES=383, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=989, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=484, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=504, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=15718, PETRI_PLACES=393, PETRI_TRANSITIONS=1049} [2022-01-19 08:25:28,877 INFO L334 CegarLoopForPetriNet]: 209 programPoint places, 184 predicate places. [2022-01-19 08:25:28,877 INFO L470 AbstractCegarLoop]: Abstraction has has 393 places, 1049 transitions, 15718 flow [2022-01-19 08:25:28,878 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 190.125) internal successors, (1521), 8 states have internal predecessors, (1521), 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 08:25:28,878 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 08:25:28,878 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, 1] [2022-01-19 08:25:28,878 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-19 08:25:28,878 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-19 08:25:28,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 08:25:28,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1879151691, now seen corresponding path program 10 times [2022-01-19 08:25:28,878 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 08:25:28,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240438523] [2022-01-19 08:25:28,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 08:25:28,879 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 08:25:28,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 08:25:29,070 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-19 08:25:29,070 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 08:25:29,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240438523] [2022-01-19 08:25:29,070 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240438523] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 08:25:29,070 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 08:25:29,070 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 08:25:29,071 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285322846] [2022-01-19 08:25:29,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 08:25:29,071 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 08:25:29,071 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 08:25:29,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 08:25:29,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-01-19 08:25:29,072 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 231 [2022-01-19 08:25:29,073 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 393 places, 1049 transitions, 15718 flow. Second operand has 8 states, 8 states have (on average 190.125) internal successors, (1521), 8 states have internal predecessors, (1521), 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 08:25:29,073 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 08:25:29,073 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 231 [2022-01-19 08:25:29,073 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 08:26:03,816 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([833] L56-->L59: Formula: (= v_~i~0_10 (+ v_~i~0_11 1)) InVars {~i~0=v_~i~0_11} OutVars{~i~0=v_~i~0_10, thread1Thread1of1ForFork3_#t~post3#1=|v_thread1Thread1of1ForFork3_#t~post3#1_1|} AuxVars[] AssignedVars[~i~0, thread1Thread1of1ForFork3_#t~post3#1][628], [Black: 1901#(and (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), 1411#(and (or (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~j~0 ~N~0) (not (< ~i~0 ~N~0))) (<= 0 ~i~0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), Black: 1407#(and (<= 0 ~i~0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~j~0 ~N~0))), Black: 1401#(and (<= 0 ~i~0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= ~j~0 ~i~0) (< ~j~0 ~N~0)), Black: 1349#(<= 0 ~i~0), Black: 260#(<= ~n1~0 0), Black: 264#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1393#(and (<= 0 ~i~0) (<= ~j~0 ~i~0)), Black: 1397#(and (<= 0 ~i~0) (<= ~j~0 ~i~0) (< ~j~0 ~N~0)), Black: 1413#(and (or (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~j~0 ~N~0) (not (< ~i~0 ~N~0))) (<= 0 ~i~0)), Black: 1405#(and (<= 0 ~i~0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), Black: 3854#(and (<= ~q1_back~0 ~q1_front~0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (or (= ~j~0 0) (not (<= ~N~0 ~j~0))) (= |thread3Thread1of1ForFork2_~cond~2#1| 0) (<= ~N~0 ~i~0)), Black: 1409#(and (<= 0 ~i~0) (or (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~j~0 ~N~0))), Black: 3844#(and (<= ~q1_back~0 ~q1_front~0) (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0))))), Black: 3846#(and (<= ~q1_back~0 ~q1_front~0) (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (or (and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (not (<= ~N~0 ~i~0))) (and (= |thread3Thread1of1ForFork2_~cond~2#1| 0) (<= ~N~0 ~i~0)))), Black: 1399#(and (<= 0 ~i~0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= ~j~0 ~i~0)), Black: 3842#(and (<= |thread3Thread1of1ForFork2_~cond~2#1| (* 256 (div |thread3Thread1of1ForFork2_~cond~2#1| 256))) (<= 0 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 3856#(and (<= ~q1_back~0 ~q1_front~0) (= ~i~0 0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0) (<= ~N~0 ~i~0)), Black: 3852#(and (<= ~q1_back~0 ~q1_front~0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (= |thread3Thread1of1ForFork2_~cond~2#1| 0) (<= ~N~0 ~i~0)), Black: 3848#(and (<= ~q1_back~0 ~q1_front~0) (= ~j~0 0) (= ~i~0 0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0) (<= ~N~0 ~i~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 3850#(and (<= |thread3Thread1of1ForFork2_~cond~2#1| (* 256 (div |thread3Thread1of1ForFork2_~cond~2#1| 256))) (= ~j~0 0) (= ~i~0 0) (<= 0 |thread3Thread1of1ForFork2_~cond~2#1|)), 2611#true, Black: 281#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 283#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 3773#true, 1431#true, Black: 1443#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (or (<= ~q1_back~0 ~q1_front~0) (not (<= ~N~0 ~j~0)))), Black: 1447#(and (<= ~q1_back~0 ~q1_front~0) (= ~j~0 0) (= ~i~0 0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0) (<= ~N~0 ~i~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 1445#(and (<= ~q1_back~0 ~q1_front~0) (= ~j~0 0) (= ~i~0 0) (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 3726#(and (<= ~q1_back~0 ~q1_front~0) (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (< ~i~0 ~N~0)) (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (not (< ~i~0 ~N~0)))) (or (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= ~N~0 ~i~0)))), Black: 1441#(and (= ~j~0 0) (= ~i~0 0) (or (<= ~q1_back~0 ~q1_front~0) (not (<= ~N~0 ~j~0)))), Black: 3883#(and (= ~j~0 0) (= ~i~0 0) (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 3721#(and (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (not (<= ~N~0 ~i~0))), Black: 3715#(and (<= ~q1_back~0 ~q1_front~0) (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (< ~i~0 ~N~0)), Black: 3877#(and (= ~j~0 0) (= ~i~0 0) (or (not (<= ~N~0 ~j~0)) (<= |thread1Thread1of1ForFork3_~cond~0#1| (* (div |thread1Thread1of1ForFork3_~cond~0#1| 256) 256))) (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (= |thread1Thread1of1ForFork3_~cond~0#1| 1))), 150#L59true, Black: 2437#(and (= ~j~0 0) (= ~i~0 0) (or (and (< ~j~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)) (and (not (< ~j~0 ~N~0)) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)))), Black: 3881#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (or (not (<= ~N~0 ~j~0)) (<= |thread1Thread1of1ForFork3_~cond~0#1| (* (div |thread1Thread1of1ForFork3_~cond~0#1| 256) 256))) (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (= |thread1Thread1of1ForFork3_~cond~0#1| 1))), Black: 3740#(and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (not (<= ~N~0 ~i~0))), Black: 3718#(and (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (< ~i~0 ~N~0) (<= ~q1_back~0 (+ ~q1_front~0 1))), Black: 2603#(and (= ~j~0 0) (= ~i~0 0) (not (< ~j~0 ~N~0)) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), 1453#true, 171#L93-1true, Black: 2613#(or (and (not (<= ~N~0 ~i~0)) (= (+ (* (- 1) |thread1Thread1of1ForFork3_~cond~0#1|) 1) 0)) (and (= (* (- 1) |thread1Thread1of1ForFork3_~cond~0#1|) 0) (<= ~N~0 ~i~0))), Black: 2103#(and (= ~j~0 0) (= ~i~0 0)), Black: 3090#(= |thread3Thread1of1ForFork2_~cond~2#1| 1), Black: 3732#(and (<= ~q1_back~0 ~q1_front~0) (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (< ~i~0 ~N~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 3730#(and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (< ~i~0 ~N~0)), Black: 3723#(and (<= ~q1_back~0 ~q1_front~0) (or (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= ~N~0 ~i~0)))), Black: 3738#(and (or (and (not (<= ~N~0 ~i~0)) (= (+ (* (- 1) |thread1Thread1of1ForFork3_~cond~0#1|) 1) 0)) (and (= (* (- 1) |thread1Thread1of1ForFork3_~cond~0#1|) 0) (<= ~N~0 ~i~0))) (= |thread3Thread1of1ForFork2_~cond~2#1| 1)), Black: 3752#(and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (< ~i~0 ~N~0)) (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (not (< ~i~0 ~N~0))))), Black: 3736#(and (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (< ~i~0 ~N~0) (<= ~q1_back~0 (+ ~q1_front~0 1)) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 3746#(and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 1)), Black: 3734#(and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (< ~i~0 ~N~0) (<= ~q1_back~0 (+ ~q1_front~0 1))), Black: 3728#(and (<= ~q1_back~0 ~q1_front~0) (< ~i~0 ~N~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), 89#L145-4true, 229#true, Black: 3787#(and (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (= ~j~0 0) (= ~i~0 0) (<= (+ ~i~0 1) ~N~0))) (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)))), Black: 3783#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (<= (+ ~i~0 1) ~N~0)) (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)))), Black: 3789#(and (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)))), Black: 3779#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 3778#(or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0))), Black: 3785#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (= ~j~0 0) (= ~i~0 0) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= (+ ~i~0 1) ~N~0)) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 3793#(and (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (= ~j~0 0) (<= (+ ~i~0 1) ~N~0))) (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)))), Black: 3791#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (= ~i~0 0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 3781#(and (= ~j~0 0) (= ~i~0 0) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= (+ ~i~0 1) ~N~0))), 75#L111-1true, 3868#true, 70#L77true, 3888#true, Black: 3817#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 2015#(and (<= ~q1_back~0 ~q1_front~0) (or (and (= |thread3Thread1of1ForFork2_~cond~2#1| 0) (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 1))) (= ~j~0 0) (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (< ~i~0 ~N~0)) (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (not (< ~i~0 ~N~0))))), Black: 3821#(and (= ~i~0 0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (or (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= ~N~0 0))), Black: 2019#(and (= ~j~0 0) (= ~i~0 0) (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 234#(= ~total~0 0), Black: 3807#(and (= ~j~0 0) (= ~i~0 0)), Black: 1897#(or (and (= |thread3Thread1of1ForFork2_~cond~2#1| 0) (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 1))), Black: 3825#(and (= ~i~0 0) (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 2027#(and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 3819#(and (= ~j~0 0) (= ~i~0 0) (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 2011#(and (or (and (= |thread2Thread1of1ForFork1_~cond~1#1| 0) (not (< 0 ~N~0))) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (< 0 ~N~0))) (<= ~q1_back~0 ~q1_front~0) (= ~j~0 0) (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (< ~i~0 ~N~0)) (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (not (< ~i~0 ~N~0))))), Black: 3815#(and (= ~j~0 0) (= ~i~0 0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (or (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= ~N~0 0))), Black: 2025#(and (= ~j~0 0) (= ~i~0 0) (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 3823#(and (= ~i~0 0) (<= ~N~0 0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 247#(<= ~q1_back~0 ~q1_front~0), Black: 1844#(and (<= ~q1_back~0 ~q1_front~0) (= ~j~0 0) (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (< ~i~0 ~N~0)) (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (not (< ~i~0 ~N~0))))), Black: 2017#(and (<= ~q1_back~0 ~q1_front~0) (= ~j~0 0) (= ~i~0 0) (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (< ~i~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 2029#(and (<= ~q1_back~0 ~q1_front~0) (= ~i~0 0) (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (< ~i~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 2023#(and (or (and (= |thread3Thread1of1ForFork2_~cond~2#1| 0) (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 2033#(and (= ~i~0 0) (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 252#(<= ~q2_back~0 ~q2_front~0), Black: 2021#(and (<= ~q1_back~0 ~q1_front~0) (= ~i~0 0) (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (< ~i~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 2013#(and (<= ~q1_back~0 ~q1_front~0) (= ~j~0 0) (= ~i~0 0) (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (< ~i~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1))]) [2022-01-19 08:26:03,816 INFO L384 tUnfolder$Statistics]: this new event has 167 ancestors and is cut-off event [2022-01-19 08:26:03,816 INFO L387 tUnfolder$Statistics]: existing Event has 167 ancestors and is cut-off event [2022-01-19 08:26:03,816 INFO L387 tUnfolder$Statistics]: existing Event has 167 ancestors and is cut-off event [2022-01-19 08:26:03,817 INFO L387 tUnfolder$Statistics]: existing Event has 167 ancestors and is cut-off event [2022-01-19 08:26:03,817 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([842] L77-->L80: Formula: (= v_~j~0_12 (+ v_~j~0_13 1)) InVars {~j~0=v_~j~0_13} OutVars{thread2Thread1of1ForFork1_#t~post6#1=|v_thread2Thread1of1ForFork1_#t~post6#1_1|, ~j~0=v_~j~0_12} AuxVars[] AssignedVars[~j~0, thread2Thread1of1ForFork1_#t~post6#1][1141], [Black: 1901#(and (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), 133#L80true, 1405#(and (<= 0 ~i~0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), 3718#(and (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (< ~i~0 ~N~0) (<= ~q1_back~0 (+ ~q1_front~0 1))), Black: 1407#(and (<= 0 ~i~0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (or (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~j~0 ~N~0))), Black: 1401#(and (<= 0 ~i~0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= ~j~0 ~i~0) (< ~j~0 ~N~0)), Black: 1349#(<= 0 ~i~0), Black: 260#(<= ~n1~0 0), Black: 1411#(and (or (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~j~0 ~N~0) (not (< ~i~0 ~N~0))) (<= 0 ~i~0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0))), Black: 264#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1393#(and (<= 0 ~i~0) (<= ~j~0 ~i~0)), Black: 1397#(and (<= 0 ~i~0) (<= ~j~0 ~i~0) (< ~j~0 ~N~0)), Black: 1413#(and (or (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (< ~j~0 ~N~0) (not (< ~i~0 ~N~0))) (<= 0 ~i~0)), Black: 3854#(and (<= ~q1_back~0 ~q1_front~0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (or (= ~j~0 0) (not (<= ~N~0 ~j~0))) (= |thread3Thread1of1ForFork2_~cond~2#1| 0) (<= ~N~0 ~i~0)), Black: 1409#(and (<= 0 ~i~0) (or (= 0 (mod |thread1Thread1of1ForFork3_~cond~0#1| 256)) (< ~j~0 ~N~0))), Black: 3844#(and (<= ~q1_back~0 ~q1_front~0) (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0))))), Black: 3846#(and (<= ~q1_back~0 ~q1_front~0) (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (or (and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (not (<= ~N~0 ~i~0))) (and (= |thread3Thread1of1ForFork2_~cond~2#1| 0) (<= ~N~0 ~i~0)))), Black: 1399#(and (<= 0 ~i~0) (not (<= (mod |thread2Thread1of1ForFork1_~cond~1#1| 256) 0)) (<= ~j~0 ~i~0)), Black: 3842#(and (<= |thread3Thread1of1ForFork2_~cond~2#1| (* 256 (div |thread3Thread1of1ForFork2_~cond~2#1| 256))) (<= 0 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 3856#(and (<= ~q1_back~0 ~q1_front~0) (= ~i~0 0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0) (<= ~N~0 ~i~0)), Black: 3852#(and (<= ~q1_back~0 ~q1_front~0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (= |thread3Thread1of1ForFork2_~cond~2#1| 0) (<= ~N~0 ~i~0)), Black: 3848#(and (<= ~q1_back~0 ~q1_front~0) (= ~j~0 0) (= ~i~0 0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0) (<= ~N~0 ~i~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 3850#(and (<= |thread3Thread1of1ForFork2_~cond~2#1| (* 256 (div |thread3Thread1of1ForFork2_~cond~2#1| 256))) (= ~j~0 0) (= ~i~0 0) (<= 0 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 281#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 283#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 3773#true, 1431#true, Black: 1443#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (or (<= ~q1_back~0 ~q1_front~0) (not (<= ~N~0 ~j~0)))), 148#L56true, Black: 1447#(and (<= ~q1_back~0 ~q1_front~0) (= ~j~0 0) (= ~i~0 0) (= |thread3Thread1of1ForFork2_~cond~2#1| 0) (<= ~N~0 ~i~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 1445#(and (<= ~q1_back~0 ~q1_front~0) (= ~j~0 0) (= ~i~0 0) (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 3726#(and (<= ~q1_back~0 ~q1_front~0) (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (< ~i~0 ~N~0)) (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (not (< ~i~0 ~N~0)))) (or (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= ~N~0 ~i~0)))), Black: 1441#(and (= ~j~0 0) (= ~i~0 0) (or (<= ~q1_back~0 ~q1_front~0) (not (<= ~N~0 ~j~0)))), Black: 3883#(and (= ~j~0 0) (= ~i~0 0) (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), Black: 3721#(and (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (not (<= ~N~0 ~i~0))), Black: 3715#(and (<= ~q1_back~0 ~q1_front~0) (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (< ~i~0 ~N~0)), Black: 3877#(and (= ~j~0 0) (= ~i~0 0) (or (not (<= ~N~0 ~j~0)) (<= |thread1Thread1of1ForFork3_~cond~0#1| (* (div |thread1Thread1of1ForFork3_~cond~0#1| 256) 256))) (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (= |thread1Thread1of1ForFork3_~cond~0#1| 1))), Black: 2437#(and (= ~j~0 0) (= ~i~0 0) (or (and (< ~j~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)) (and (not (< ~j~0 ~N~0)) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)))), Black: 3881#(and (= ~j~0 0) (= ~i~0 0) (or (and (<= ~N~0 ~j~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (not (<= ~N~0 ~j~0)))) (or (not (<= ~N~0 ~j~0)) (<= |thread1Thread1of1ForFork3_~cond~0#1| (* (div |thread1Thread1of1ForFork3_~cond~0#1| 256) 256))) (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (= |thread1Thread1of1ForFork3_~cond~0#1| 1))), Black: 3740#(and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (not (<= ~N~0 ~i~0))), Black: 2603#(and (= ~j~0 0) (= ~i~0 0) (not (< ~j~0 ~N~0)) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)), 1453#true, 171#L93-1true, Black: 2613#(or (and (not (<= ~N~0 ~i~0)) (= (+ (* (- 1) |thread1Thread1of1ForFork3_~cond~0#1|) 1) 0)) (and (= (* (- 1) |thread1Thread1of1ForFork3_~cond~0#1|) 0) (<= ~N~0 ~i~0))), Black: 2103#(and (= ~j~0 0) (= ~i~0 0)), Black: 3090#(= |thread3Thread1of1ForFork2_~cond~2#1| 1), Black: 3732#(and (<= ~q1_back~0 ~q1_front~0) (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (< ~i~0 ~N~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 3730#(and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (< ~i~0 ~N~0)), Black: 3723#(and (<= ~q1_back~0 ~q1_front~0) (or (= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (not (<= ~N~0 ~i~0)))), Black: 3738#(and (or (and (not (<= ~N~0 ~i~0)) (= (+ (* (- 1) |thread1Thread1of1ForFork3_~cond~0#1|) 1) 0)) (and (= (* (- 1) |thread1Thread1of1ForFork3_~cond~0#1|) 0) (<= ~N~0 ~i~0))) (= |thread3Thread1of1ForFork2_~cond~2#1| 1)), Black: 3752#(and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (< ~i~0 ~N~0)) (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (not (< ~i~0 ~N~0))))), Black: 3736#(and (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (< ~i~0 ~N~0) (<= ~q1_back~0 (+ ~q1_front~0 1)) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 2611#true, Black: 3746#(and (<= ~q1_back~0 ~q1_front~0) (= |thread3Thread1of1ForFork2_~cond~2#1| 1)), Black: 3734#(and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (< ~i~0 ~N~0) (<= ~q1_back~0 (+ ~q1_front~0 1))), Black: 3728#(and (<= ~q1_back~0 ~q1_front~0) (< ~i~0 ~N~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), 89#L145-4true, 229#true, Black: 3787#(and (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (= ~j~0 0) (= ~i~0 0) (<= (+ ~i~0 1) ~N~0))) (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)))), Black: 3783#(and (= ~j~0 0) (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (<= (+ ~i~0 1) ~N~0)) (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)))), Black: 3789#(and (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)))), Black: 3779#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 3778#(or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0))), Black: 3785#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (= ~j~0 0) (= ~i~0 0) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= (+ ~i~0 1) ~N~0)) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 3793#(and (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (= ~j~0 0) (<= (+ ~i~0 1) ~N~0))) (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0)) (and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)))), Black: 3791#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (= ~i~0 0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 3781#(and (= ~j~0 0) (= ~i~0 0) (or (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= (+ ~i~0 1) ~N~0))), 75#L111-1true, 3868#true, 3888#true, Black: 3817#(and (= ~j~0 0) (= ~i~0 0) (<= ~N~0 0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 2015#(and (<= ~q1_back~0 ~q1_front~0) (or (and (= |thread3Thread1of1ForFork2_~cond~2#1| 0) (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 1))) (= ~j~0 0) (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (< ~i~0 ~N~0)) (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (not (< ~i~0 ~N~0))))), Black: 3821#(and (= ~i~0 0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (or (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= ~N~0 0))), Black: 2019#(and (= ~j~0 0) (= ~i~0 0) (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 234#(= ~total~0 0), Black: 3807#(and (= ~j~0 0) (= ~i~0 0)), Black: 1897#(or (and (= |thread3Thread1of1ForFork2_~cond~2#1| 0) (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 1))), Black: 3825#(and (= ~i~0 0) (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 2027#(and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 3819#(and (= ~j~0 0) (= ~i~0 0) (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (<= ~N~0 ~i~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 2011#(and (or (and (= |thread2Thread1of1ForFork1_~cond~1#1| 0) (not (< 0 ~N~0))) (and (= |thread2Thread1of1ForFork1_~cond~1#1| 1) (< 0 ~N~0))) (<= ~q1_back~0 ~q1_front~0) (= ~j~0 0) (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (< ~i~0 ~N~0)) (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (not (< ~i~0 ~N~0))))), Black: 3815#(and (= ~j~0 0) (= ~i~0 0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (or (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= ~N~0 0))), Black: 2025#(and (= ~j~0 0) (= ~i~0 0) (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 3823#(and (= ~i~0 0) (<= ~N~0 0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 247#(<= ~q1_back~0 ~q1_front~0), Black: 1844#(and (<= ~q1_back~0 ~q1_front~0) (= ~j~0 0) (= ~i~0 0) (or (and (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (< ~i~0 ~N~0)) (and (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (not (< ~i~0 ~N~0))))), Black: 2017#(and (<= ~q1_back~0 ~q1_front~0) (= ~j~0 0) (= ~i~0 0) (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (< ~i~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 2029#(and (<= ~q1_back~0 ~q1_front~0) (= ~i~0 0) (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (< ~i~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 2023#(and (or (and (= |thread3Thread1of1ForFork2_~cond~2#1| 0) (= |thread1Thread1of1ForFork3_~cond~0#1| 0) (= |thread2Thread1of1ForFork1_~cond~1#1| 0)) (and (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 1))) (= ~j~0 0) (= ~i~0 0)), Black: 2033#(and (= ~i~0 0) (= |thread3Thread1of1ForFork2_~cond~2#1| 1) (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 252#(<= ~q2_back~0 ~q2_front~0), Black: 2021#(and (<= ~q1_back~0 ~q1_front~0) (= ~i~0 0) (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (< ~i~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1)), Black: 2013#(and (<= ~q1_back~0 ~q1_front~0) (= ~j~0 0) (= ~i~0 0) (= |thread1Thread1of1ForFork3_~cond~0#1| 1) (< ~i~0 ~N~0) (= |thread2Thread1of1ForFork1_~cond~1#1| 1))]) [2022-01-19 08:26:03,817 INFO L384 tUnfolder$Statistics]: this new event has 167 ancestors and is cut-off event [2022-01-19 08:26:03,817 INFO L387 tUnfolder$Statistics]: existing Event has 167 ancestors and is cut-off event [2022-01-19 08:26:03,817 INFO L387 tUnfolder$Statistics]: existing Event has 167 ancestors and is cut-off event [2022-01-19 08:26:03,817 INFO L387 tUnfolder$Statistics]: existing Event has 167 ancestors and is cut-off event [2022-01-19 08:26:08,052 INFO L129 PetriNetUnfolder]: 79256/163793 cut-off events. [2022-01-19 08:26:08,052 INFO L130 PetriNetUnfolder]: For 1547598/1554857 co-relation queries the response was YES. [2022-01-19 08:26:11,448 INFO L84 FinitePrefix]: Finished finitePrefix Result has 819196 conditions, 163793 events. 79256/163793 cut-off events. For 1547598/1554857 co-relation queries the response was YES. Maximal size of possible extension queue 7133. Compared 2050367 event pairs, 14056 based on Foata normal form. 3236/162797 useless extension candidates. Maximal degree in co-relation 819107. Up to 65263 conditions per place. [2022-01-19 08:26:12,144 INFO L132 encePairwiseOnDemand]: 220/231 looper letters, 478 selfloop transitions, 695 changer transitions 11/1383 dead transitions. [2022-01-19 08:26:12,144 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 401 places, 1383 transitions, 22324 flow [2022-01-19 08:26:12,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-19 08:26:12,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-01-19 08:26:12,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2024 transitions. [2022-01-19 08:26:12,146 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8761904761904762 [2022-01-19 08:26:12,146 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 2024 transitions. [2022-01-19 08:26:12,146 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 2024 transitions. [2022-01-19 08:26:12,147 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 08:26:12,147 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2024 transitions. [2022-01-19 08:26:12,148 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 202.4) internal successors, (2024), 10 states have internal predecessors, (2024), 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 08:26:12,149 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 231.0) internal successors, (2541), 11 states have internal predecessors, (2541), 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 08:26:12,150 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 231.0) internal successors, (2541), 11 states have internal predecessors, (2541), 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 08:26:12,150 INFO L186 Difference]: Start difference. First operand has 393 places, 1049 transitions, 15718 flow. Second operand 10 states and 2024 transitions. [2022-01-19 08:26:12,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 401 places, 1383 transitions, 22324 flow [2022-01-19 08:26:55,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 395 places, 1383 transitions, 21266 flow, removed 27 selfloop flow, removed 6 redundant places. [2022-01-19 08:26:55,389 INFO L242 Difference]: Finished difference. Result has 400 places, 1185 transitions, 19186 flow [2022-01-19 08:26:55,390 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=231, PETRI_DIFFERENCE_MINUEND_FLOW=14347, PETRI_DIFFERENCE_MINUEND_PLACES=386, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1024, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=533, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=442, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=19186, PETRI_PLACES=400, PETRI_TRANSITIONS=1185} [2022-01-19 08:26:55,390 INFO L334 CegarLoopForPetriNet]: 209 programPoint places, 191 predicate places. [2022-01-19 08:26:55,390 INFO L470 AbstractCegarLoop]: Abstraction has has 400 places, 1185 transitions, 19186 flow [2022-01-19 08:26:55,390 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 190.125) internal successors, (1521), 8 states have internal predecessors, (1521), 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 08:26:55,390 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 08:26:55,391 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, 1] [2022-01-19 08:26:55,391 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-19 08:26:55,391 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-19 08:26:55,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 08:26:55,391 INFO L85 PathProgramCache]: Analyzing trace with hash -733488141, now seen corresponding path program 11 times [2022-01-19 08:26:55,391 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 08:26:55,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051460016] [2022-01-19 08:26:55,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 08:26:55,391 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 08:26:55,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 08:26:55,546 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 08:26:55,547 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 08:26:55,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051460016] [2022-01-19 08:26:55,547 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051460016] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 08:26:55,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1576831743] [2022-01-19 08:26:55,547 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-19 08:26:55,547 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 08:26:55,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 08:26:55,552 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 08:26:55,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-19 08:26:55,663 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 08:26:55,663 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 08:26:55,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 17 conjunts are in the unsatisfiable core [2022-01-19 08:26:55,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 08:26:56,496 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 08:26:56,496 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-19 08:26:56,496 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1576831743] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 08:26:56,496 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-19 08:26:56,496 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [8] total 15 [2022-01-19 08:26:56,496 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983187600] [2022-01-19 08:26:56,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 08:26:56,497 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-19 08:26:56,497 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 08:26:56,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-19 08:26:56,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2022-01-19 08:26:56,498 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 231 [2022-01-19 08:26:56,499 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 400 places, 1185 transitions, 19186 flow. Second operand has 11 states, 11 states have (on average 181.9090909090909) internal successors, (2001), 11 states have internal predecessors, (2001), 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 08:26:56,499 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 08:26:56,499 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 231 [2022-01-19 08:26:56,499 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand