/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.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/chl-name-comparator-symm.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bf34d27 [2022-01-19 00:44:24,875 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-19 00:44:24,877 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-19 00:44:24,898 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-19 00:44:24,898 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-19 00:44:24,899 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-19 00:44:24,900 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-19 00:44:24,901 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-19 00:44:24,903 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-19 00:44:24,903 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-19 00:44:24,904 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-19 00:44:24,905 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-19 00:44:24,905 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-19 00:44:24,906 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-19 00:44:24,906 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-19 00:44:24,907 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-19 00:44:24,908 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-19 00:44:24,908 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-19 00:44:24,909 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-19 00:44:24,910 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-19 00:44:24,911 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-19 00:44:24,912 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-19 00:44:24,913 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-19 00:44:24,913 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-19 00:44:24,915 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-19 00:44:24,915 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-19 00:44:24,915 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-19 00:44:24,916 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-19 00:44:24,916 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-19 00:44:24,942 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-19 00:44:24,943 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-19 00:44:24,944 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-19 00:44:24,944 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-19 00:44:24,945 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-19 00:44:24,945 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-19 00:44:24,946 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-19 00:44:24,946 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-19 00:44:24,946 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-19 00:44:24,946 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-19 00:44:24,947 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-19 00:44:24,947 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-19 00:44:24,948 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.epf [2022-01-19 00:44:24,977 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-19 00:44:24,977 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-19 00:44:24,978 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-19 00:44:24,978 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-19 00:44:24,978 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-19 00:44:24,978 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-19 00:44:24,978 INFO L138 SettingsManager]: * Use SBE=true [2022-01-19 00:44:24,978 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-19 00:44:24,978 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-19 00:44:24,979 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-19 00:44:24,979 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-19 00:44:24,979 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-19 00:44:24,979 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-19 00:44:24,979 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-19 00:44:24,979 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-19 00:44:24,980 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-19 00:44:24,980 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-19 00:44:24,980 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-19 00:44:24,980 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-19 00:44:24,980 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-19 00:44:24,980 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-19 00:44:24,980 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-19 00:44:24,980 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-19 00:44:24,980 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 00:44:24,980 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-19 00:44:24,980 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-19 00:44:24,980 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-19 00:44:24,981 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-19 00:44:24,981 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-19 00:44:24,981 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-19 00:44:24,982 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-19 00:44:24,982 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 00:44:25,176 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-19 00:44:25,195 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-19 00:44:25,196 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-19 00:44:25,197 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-19 00:44:25,197 INFO L275 PluginConnector]: CDTParser initialized [2022-01-19 00:44:25,198 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-name-comparator-symm.wvr.c [2022-01-19 00:44:25,245 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/daa1ab380/941ecc8ab7b3488c971c51498245b787/FLAG77c452efb [2022-01-19 00:44:25,642 INFO L306 CDTParser]: Found 1 translation units. [2022-01-19 00:44:25,642 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-name-comparator-symm.wvr.c [2022-01-19 00:44:25,652 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/daa1ab380/941ecc8ab7b3488c971c51498245b787/FLAG77c452efb [2022-01-19 00:44:25,663 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/daa1ab380/941ecc8ab7b3488c971c51498245b787 [2022-01-19 00:44:25,665 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-19 00:44:25,667 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-19 00:44:25,668 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-19 00:44:25,668 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-19 00:44:25,670 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-19 00:44:25,670 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 12:44:25" (1/1) ... [2022-01-19 00:44:25,671 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bd39079 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:44:25, skipping insertion in model container [2022-01-19 00:44:25,671 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 12:44:25" (1/1) ... [2022-01-19 00:44:25,675 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-19 00:44:25,699 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-19 00:44:25,912 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/chl-name-comparator-symm.wvr.c[3856,3869] [2022-01-19 00:44:25,919 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 00:44:25,926 INFO L203 MainTranslator]: Completed pre-run [2022-01-19 00:44:25,956 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/chl-name-comparator-symm.wvr.c[3856,3869] [2022-01-19 00:44:25,958 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 00:44:25,969 INFO L208 MainTranslator]: Completed translation [2022-01-19 00:44:25,970 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:44:25 WrapperNode [2022-01-19 00:44:25,970 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-19 00:44:25,972 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-19 00:44:25,972 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-19 00:44:25,972 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-19 00:44:25,976 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:44:25" (1/1) ... [2022-01-19 00:44:25,991 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:44:25" (1/1) ... [2022-01-19 00:44:26,022 INFO L137 Inliner]: procedures = 25, calls = 34, calls flagged for inlining = 14, calls inlined = 16, statements flattened = 278 [2022-01-19 00:44:26,023 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-19 00:44:26,023 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-19 00:44:26,024 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-19 00:44:26,024 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-19 00:44:26,029 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:44:25" (1/1) ... [2022-01-19 00:44:26,029 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:44:25" (1/1) ... [2022-01-19 00:44:26,039 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:44:25" (1/1) ... [2022-01-19 00:44:26,040 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:44:25" (1/1) ... [2022-01-19 00:44:26,053 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:44:25" (1/1) ... [2022-01-19 00:44:26,056 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:44:25" (1/1) ... [2022-01-19 00:44:26,057 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:44:25" (1/1) ... [2022-01-19 00:44:26,059 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-19 00:44:26,059 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-19 00:44:26,059 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-19 00:44:26,059 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-19 00:44:26,067 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:44:25" (1/1) ... [2022-01-19 00:44:26,071 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 00:44:26,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 00:44:26,088 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 00:44:26,094 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 00:44:26,114 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-19 00:44:26,115 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-19 00:44:26,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-19 00:44:26,115 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-19 00:44:26,115 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-01-19 00:44:26,115 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-01-19 00:44:26,115 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-01-19 00:44:26,115 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-01-19 00:44:26,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-19 00:44:26,115 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-19 00:44:26,115 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-19 00:44:26,115 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-19 00:44:26,115 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-19 00:44:26,116 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 00:44:26,180 INFO L234 CfgBuilder]: Building ICFG [2022-01-19 00:44:26,181 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-19 00:44:26,494 INFO L275 CfgBuilder]: Performing block encoding [2022-01-19 00:44:26,502 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-19 00:44:26,502 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-01-19 00:44:26,503 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 12:44:26 BoogieIcfgContainer [2022-01-19 00:44:26,504 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-19 00:44:26,505 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-19 00:44:26,505 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-19 00:44:26,518 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-19 00:44:26,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.01 12:44:25" (1/3) ... [2022-01-19 00:44:26,519 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6537a421 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 12:44:26, skipping insertion in model container [2022-01-19 00:44:26,519 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:44:25" (2/3) ... [2022-01-19 00:44:26,519 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6537a421 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 12:44:26, skipping insertion in model container [2022-01-19 00:44:26,519 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 12:44:26" (3/3) ... [2022-01-19 00:44:26,520 INFO L111 eAbstractionObserver]: Analyzing ICFG chl-name-comparator-symm.wvr.c [2022-01-19 00:44:26,523 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-19 00:44:26,527 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-19 00:44:26,527 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-19 00:44:26,585 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,586 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,586 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,586 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,586 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,586 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,586 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,586 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,586 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,587 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,587 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,587 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,587 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,587 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,587 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,587 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,587 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,587 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,588 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,588 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,588 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,588 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,588 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,588 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,588 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,589 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,589 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,589 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,589 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,589 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,589 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,589 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,589 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,589 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,590 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,590 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,590 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,590 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,590 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,590 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,590 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,590 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,590 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,590 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,590 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,591 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,591 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,591 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,591 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,591 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,591 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,591 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,592 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,592 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,592 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,592 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,592 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,592 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,592 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,592 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,592 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,592 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,593 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,593 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,593 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,593 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,593 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,593 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,593 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,593 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,593 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,593 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,593 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,594 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,594 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,594 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,594 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,594 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,595 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,595 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,595 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,595 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,595 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,595 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,595 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,595 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,595 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,595 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,595 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,596 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,596 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,596 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,596 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,596 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,596 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,596 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,596 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,597 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,597 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,597 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,597 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,597 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,597 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,597 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,597 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,598 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,598 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,598 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,598 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,598 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,598 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,598 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,598 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,598 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,598 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,598 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,599 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,599 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,599 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,599 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,599 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,599 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,599 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,600 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,600 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,600 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,600 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,600 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,600 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,600 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,600 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,600 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,601 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,601 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,601 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,601 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,601 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,601 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,601 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,601 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,601 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,601 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,602 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,602 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,602 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,602 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,602 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,602 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,602 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,602 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,602 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,602 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,603 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,603 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,603 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,603 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,603 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,603 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,603 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,603 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,603 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,604 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,604 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,604 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,604 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,604 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,604 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,605 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,605 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,605 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,605 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,605 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,606 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,606 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,606 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,606 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,606 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,606 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,606 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,606 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,606 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,607 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,607 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,607 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,607 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,607 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,607 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,607 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,608 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,608 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,608 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,608 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,608 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,608 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,608 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 00:44:26,608 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 00:44:26,609 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 00:44:26,609 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 00:44:26,609 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 00:44:26,609 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 00:44:26,609 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 00:44:26,609 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 00:44:26,609 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 00:44:26,609 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 00:44:26,610 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 00:44:26,610 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 00:44:26,610 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 00:44:26,610 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 00:44:26,610 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 00:44:26,610 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 00:44:26,610 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 00:44:26,610 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 00:44:26,610 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 00:44:26,611 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 00:44:26,611 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 00:44:26,611 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 00:44:26,611 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 00:44:26,611 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 00:44:26,611 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,611 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,611 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,612 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,612 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,612 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,612 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,612 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,612 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,612 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,613 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,613 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,613 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,613 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,613 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,613 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,613 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,613 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,613 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,613 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,614 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,614 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,614 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,614 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,614 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,614 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,614 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,614 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,614 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,615 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,615 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,615 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,615 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,615 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,615 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,615 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,615 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,615 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,616 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,616 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,616 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,616 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,617 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,617 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,617 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,617 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,617 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 00:44:26,617 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,617 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,617 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 00:44:26,618 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 00:44:26,618 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 00:44:26,618 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,618 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,618 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,619 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,619 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 00:44:26,619 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 00:44:26,619 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 00:44:26,619 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 00:44:26,619 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,619 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,619 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 00:44:26,619 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 00:44:26,620 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 00:44:26,620 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 00:44:26,620 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,620 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,620 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,620 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,620 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,621 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,621 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,621 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,621 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 00:44:26,621 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,621 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,621 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 00:44:26,622 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,622 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,622 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 00:44:26,622 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 00:44:26,622 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,622 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,622 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 00:44:26,623 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 00:44:26,623 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 00:44:26,623 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 00:44:26,623 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 00:44:26,623 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 00:44:26,623 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 00:44:26,623 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 00:44:26,624 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,624 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,624 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,624 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,624 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,624 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,624 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,624 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,624 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,625 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,625 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,625 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,625 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,625 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,625 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,625 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,626 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,626 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,626 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,626 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,630 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,630 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,630 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,631 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,631 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,631 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,631 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,631 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,632 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,632 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,634 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,634 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,634 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,634 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,634 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,634 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,634 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,634 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,635 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,635 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,635 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,635 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,635 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,635 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,635 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,635 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,636 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,636 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,636 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,636 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,637 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,637 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,638 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,638 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,638 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,638 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 00:44:26,638 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,638 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,638 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,638 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,638 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 00:44:26,638 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,639 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,639 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,639 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,639 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,639 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,639 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,640 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,640 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:44:26,642 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-01-19 00:44:26,677 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 00:44:26,681 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 00:44:26,682 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-01-19 00:44:26,691 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 325 places, 353 transitions, 722 flow [2022-01-19 00:44:26,777 INFO L129 PetriNetUnfolder]: 35/351 cut-off events. [2022-01-19 00:44:26,778 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-01-19 00:44:26,783 INFO L84 FinitePrefix]: Finished finitePrefix Result has 360 conditions, 351 events. 35/351 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 737 event pairs, 0 based on Foata normal form. 0/315 useless extension candidates. Maximal degree in co-relation 211. Up to 2 conditions per place. [2022-01-19 00:44:26,783 INFO L82 GeneralOperation]: Start removeDead. Operand has 325 places, 353 transitions, 722 flow [2022-01-19 00:44:26,788 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 314 places, 342 transitions, 696 flow [2022-01-19 00:44:26,829 INFO L129 PetriNetUnfolder]: 35/341 cut-off events. [2022-01-19 00:44:26,829 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-01-19 00:44:26,829 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:44:26,830 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] [2022-01-19 00:44:26,830 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:44:26,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:44:26,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1977256279, now seen corresponding path program 1 times [2022-01-19 00:44:26,839 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:44:26,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904978626] [2022-01-19 00:44:26,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:44:26,840 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:44:26,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:44:27,010 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 00:44:27,010 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:44:27,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904978626] [2022-01-19 00:44:27,011 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904978626] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:44:27,011 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:44:27,011 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-19 00:44:27,012 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553190717] [2022-01-19 00:44:27,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:44:27,018 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-19 00:44:27,018 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:44:27,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-19 00:44:27,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-19 00:44:27,038 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 334 out of 353 [2022-01-19 00:44:27,042 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 342 transitions, 696 flow. Second operand has 2 states, 2 states have (on average 337.0) internal successors, (674), 2 states have internal predecessors, (674), 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 00:44:27,043 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:44:27,043 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 334 of 353 [2022-01-19 00:44:27,045 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:44:27,101 INFO L129 PetriNetUnfolder]: 21/328 cut-off events. [2022-01-19 00:44:27,102 INFO L130 PetriNetUnfolder]: For 8/9 co-relation queries the response was YES. [2022-01-19 00:44:27,105 INFO L84 FinitePrefix]: Finished finitePrefix Result has 342 conditions, 328 events. 21/328 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 709 event pairs, 0 based on Foata normal form. 17/313 useless extension candidates. Maximal degree in co-relation 202. Up to 5 conditions per place. [2022-01-19 00:44:27,107 INFO L132 encePairwiseOnDemand]: 339/353 looper letters, 4 selfloop transitions, 0 changer transitions 3/328 dead transitions. [2022-01-19 00:44:27,107 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 328 transitions, 676 flow [2022-01-19 00:44:27,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-19 00:44:27,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-01-19 00:44:27,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 686 transitions. [2022-01-19 00:44:27,120 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9716713881019831 [2022-01-19 00:44:27,120 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 686 transitions. [2022-01-19 00:44:27,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 686 transitions. [2022-01-19 00:44:27,123 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:44:27,125 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 686 transitions. [2022-01-19 00:44:27,129 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 343.0) internal successors, (686), 2 states have internal predecessors, (686), 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 00:44:27,136 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 353.0) internal successors, (1059), 3 states have internal predecessors, (1059), 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 00:44:27,137 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 353.0) internal successors, (1059), 3 states have internal predecessors, (1059), 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 00:44:27,138 INFO L186 Difference]: Start difference. First operand has 314 places, 342 transitions, 696 flow. Second operand 2 states and 686 transitions. [2022-01-19 00:44:27,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 328 transitions, 676 flow [2022-01-19 00:44:27,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 328 transitions, 668 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-01-19 00:44:27,149 INFO L242 Difference]: Finished difference. Result has 311 places, 325 transitions, 654 flow [2022-01-19 00:44:27,151 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=353, PETRI_DIFFERENCE_MINUEND_FLOW=660, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=328, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=328, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=654, PETRI_PLACES=311, PETRI_TRANSITIONS=325} [2022-01-19 00:44:27,154 INFO L334 CegarLoopForPetriNet]: 314 programPoint places, -3 predicate places. [2022-01-19 00:44:27,155 INFO L470 AbstractCegarLoop]: Abstraction has has 311 places, 325 transitions, 654 flow [2022-01-19 00:44:27,155 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 337.0) internal successors, (674), 2 states have internal predecessors, (674), 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 00:44:27,156 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:44:27,156 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] [2022-01-19 00:44:27,156 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-19 00:44:27,157 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:44:27,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:44:27,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1672738487, now seen corresponding path program 1 times [2022-01-19 00:44:27,157 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:44:27,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105981191] [2022-01-19 00:44:27,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:44:27,158 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:44:27,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:44:27,315 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 00:44:27,315 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:44:27,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105981191] [2022-01-19 00:44:27,315 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105981191] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:44:27,316 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:44:27,316 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 00:44:27,316 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029430049] [2022-01-19 00:44:27,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:44:27,317 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 00:44:27,317 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:44:27,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 00:44:27,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 00:44:27,319 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 304 out of 353 [2022-01-19 00:44:27,320 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 325 transitions, 654 flow. Second operand has 3 states, 3 states have (on average 308.0) internal successors, (924), 3 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 00:44:27,320 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:44:27,320 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 304 of 353 [2022-01-19 00:44:27,320 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:44:27,763 INFO L129 PetriNetUnfolder]: 642/3582 cut-off events. [2022-01-19 00:44:27,763 INFO L130 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2022-01-19 00:44:27,776 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4430 conditions, 3582 events. 642/3582 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 33579 event pairs, 264 based on Foata normal form. 0/3053 useless extension candidates. Maximal degree in co-relation 4427. Up to 505 conditions per place. [2022-01-19 00:44:27,790 INFO L132 encePairwiseOnDemand]: 345/353 looper letters, 55 selfloop transitions, 4 changer transitions 0/350 dead transitions. [2022-01-19 00:44:27,791 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 350 transitions, 825 flow [2022-01-19 00:44:27,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 00:44:27,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 00:44:27,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 975 transitions. [2022-01-19 00:44:27,804 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9206798866855525 [2022-01-19 00:44:27,804 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 975 transitions. [2022-01-19 00:44:27,804 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 975 transitions. [2022-01-19 00:44:27,804 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:44:27,805 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 975 transitions. [2022-01-19 00:44:27,806 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 325.0) internal successors, (975), 3 states have internal predecessors, (975), 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 00:44:27,809 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 353.0) internal successors, (1412), 4 states have internal predecessors, (1412), 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 00:44:27,809 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 353.0) internal successors, (1412), 4 states have internal predecessors, (1412), 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 00:44:27,809 INFO L186 Difference]: Start difference. First operand has 311 places, 325 transitions, 654 flow. Second operand 3 states and 975 transitions. [2022-01-19 00:44:27,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 350 transitions, 825 flow [2022-01-19 00:44:27,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 310 places, 350 transitions, 825 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-01-19 00:44:27,818 INFO L242 Difference]: Finished difference. Result has 312 places, 329 transitions, 694 flow [2022-01-19 00:44:27,819 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=353, PETRI_DIFFERENCE_MINUEND_FLOW=654, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=694, PETRI_PLACES=312, PETRI_TRANSITIONS=329} [2022-01-19 00:44:27,819 INFO L334 CegarLoopForPetriNet]: 314 programPoint places, -2 predicate places. [2022-01-19 00:44:27,819 INFO L470 AbstractCegarLoop]: Abstraction has has 312 places, 329 transitions, 694 flow [2022-01-19 00:44:27,820 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 308.0) internal successors, (924), 3 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 00:44:27,820 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:44:27,820 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:44:27,820 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-19 00:44:27,821 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:44:27,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:44:27,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1890052835, now seen corresponding path program 1 times [2022-01-19 00:44:27,822 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:44:27,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775550673] [2022-01-19 00:44:27,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:44:27,822 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:44:27,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:44:27,903 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 00:44:27,904 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:44:27,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775550673] [2022-01-19 00:44:27,904 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775550673] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:44:27,904 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:44:27,904 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 00:44:27,905 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910076873] [2022-01-19 00:44:27,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:44:27,906 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 00:44:27,906 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:44:27,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 00:44:27,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 00:44:27,908 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 304 out of 353 [2022-01-19 00:44:27,909 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 329 transitions, 694 flow. Second operand has 3 states, 3 states have (on average 308.0) internal successors, (924), 3 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 00:44:27,909 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:44:27,909 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 304 of 353 [2022-01-19 00:44:27,909 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:44:28,212 INFO L129 PetriNetUnfolder]: 475/3127 cut-off events. [2022-01-19 00:44:28,213 INFO L130 PetriNetUnfolder]: For 259/259 co-relation queries the response was YES. [2022-01-19 00:44:28,218 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3889 conditions, 3127 events. 475/3127 cut-off events. For 259/259 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 29491 event pairs, 253 based on Foata normal form. 49/2760 useless extension candidates. Maximal degree in co-relation 3884. Up to 317 conditions per place. [2022-01-19 00:44:28,225 INFO L132 encePairwiseOnDemand]: 347/353 looper letters, 57 selfloop transitions, 2 changer transitions 0/350 dead transitions. [2022-01-19 00:44:28,225 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 350 transitions, 853 flow [2022-01-19 00:44:28,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 00:44:28,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 00:44:28,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 973 transitions. [2022-01-19 00:44:28,227 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9187913125590179 [2022-01-19 00:44:28,227 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 973 transitions. [2022-01-19 00:44:28,227 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 973 transitions. [2022-01-19 00:44:28,227 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:44:28,227 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 973 transitions. [2022-01-19 00:44:28,229 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 324.3333333333333) internal successors, (973), 3 states have internal predecessors, (973), 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 00:44:28,230 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 353.0) internal successors, (1412), 4 states have internal predecessors, (1412), 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 00:44:28,231 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 353.0) internal successors, (1412), 4 states have internal predecessors, (1412), 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 00:44:28,231 INFO L186 Difference]: Start difference. First operand has 312 places, 329 transitions, 694 flow. Second operand 3 states and 973 transitions. [2022-01-19 00:44:28,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 350 transitions, 853 flow [2022-01-19 00:44:28,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 350 transitions, 851 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 00:44:28,236 INFO L242 Difference]: Finished difference. Result has 315 places, 329 transitions, 704 flow [2022-01-19 00:44:28,236 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=353, PETRI_DIFFERENCE_MINUEND_FLOW=680, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=325, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=704, PETRI_PLACES=315, PETRI_TRANSITIONS=329} [2022-01-19 00:44:28,238 INFO L334 CegarLoopForPetriNet]: 314 programPoint places, 1 predicate places. [2022-01-19 00:44:28,238 INFO L470 AbstractCegarLoop]: Abstraction has has 315 places, 329 transitions, 704 flow [2022-01-19 00:44:28,239 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 308.0) internal successors, (924), 3 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 00:44:28,239 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:44:28,239 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] [2022-01-19 00:44:28,239 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-19 00:44:28,239 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:44:28,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:44:28,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1681652397, now seen corresponding path program 1 times [2022-01-19 00:44:28,240 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:44:28,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318280222] [2022-01-19 00:44:28,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:44:28,240 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:44:28,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:44:28,319 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 00:44:28,319 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:44:28,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318280222] [2022-01-19 00:44:28,319 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318280222] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:44:28,319 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:44:28,320 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 00:44:28,320 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921750606] [2022-01-19 00:44:28,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:44:28,320 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 00:44:28,321 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:44:28,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 00:44:28,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 00:44:28,324 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 315 out of 353 [2022-01-19 00:44:28,326 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 329 transitions, 704 flow. Second operand has 4 states, 4 states have (on average 318.0) internal successors, (1272), 4 states have internal predecessors, (1272), 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 00:44:28,326 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:44:28,326 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 315 of 353 [2022-01-19 00:44:28,326 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:44:28,510 INFO L129 PetriNetUnfolder]: 165/1793 cut-off events. [2022-01-19 00:44:28,510 INFO L130 PetriNetUnfolder]: For 29/52 co-relation queries the response was YES. [2022-01-19 00:44:28,517 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2042 conditions, 1793 events. 165/1793 cut-off events. For 29/52 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 13495 event pairs, 21 based on Foata normal form. 1/1607 useless extension candidates. Maximal degree in co-relation 2036. Up to 74 conditions per place. [2022-01-19 00:44:28,522 INFO L132 encePairwiseOnDemand]: 341/353 looper letters, 27 selfloop transitions, 11 changer transitions 0/344 dead transitions. [2022-01-19 00:44:28,522 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 344 transitions, 814 flow [2022-01-19 00:44:28,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-19 00:44:28,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-01-19 00:44:28,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1299 transitions. [2022-01-19 00:44:28,524 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.919971671388102 [2022-01-19 00:44:28,524 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1299 transitions. [2022-01-19 00:44:28,524 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1299 transitions. [2022-01-19 00:44:28,525 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:44:28,525 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1299 transitions. [2022-01-19 00:44:28,527 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 324.75) internal successors, (1299), 4 states have internal predecessors, (1299), 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 00:44:28,529 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 353.0) internal successors, (1765), 5 states have internal predecessors, (1765), 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 00:44:28,529 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 353.0) internal successors, (1765), 5 states have internal predecessors, (1765), 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 00:44:28,529 INFO L186 Difference]: Start difference. First operand has 315 places, 329 transitions, 704 flow. Second operand 4 states and 1299 transitions. [2022-01-19 00:44:28,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 344 transitions, 814 flow [2022-01-19 00:44:28,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 344 transitions, 812 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 00:44:28,534 INFO L242 Difference]: Finished difference. Result has 320 places, 335 transitions, 772 flow [2022-01-19 00:44:28,534 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=353, PETRI_DIFFERENCE_MINUEND_FLOW=702, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=329, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=318, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=772, PETRI_PLACES=320, PETRI_TRANSITIONS=335} [2022-01-19 00:44:28,535 INFO L334 CegarLoopForPetriNet]: 314 programPoint places, 6 predicate places. [2022-01-19 00:44:28,536 INFO L470 AbstractCegarLoop]: Abstraction has has 320 places, 335 transitions, 772 flow [2022-01-19 00:44:28,536 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 318.0) internal successors, (1272), 4 states have internal predecessors, (1272), 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 00:44:28,536 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:44:28,537 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] [2022-01-19 00:44:28,537 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-19 00:44:28,537 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:44:28,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:44:28,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1341510675, now seen corresponding path program 1 times [2022-01-19 00:44:28,538 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:44:28,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980050657] [2022-01-19 00:44:28,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:44:28,538 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:44:28,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:44:28,603 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 00:44:28,603 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:44:28,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980050657] [2022-01-19 00:44:28,603 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980050657] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:44:28,603 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:44:28,603 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-19 00:44:28,603 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933469954] [2022-01-19 00:44:28,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:44:28,604 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-19 00:44:28,604 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:44:28,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-19 00:44:28,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-19 00:44:28,605 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 353 [2022-01-19 00:44:28,607 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 335 transitions, 772 flow. Second operand has 5 states, 5 states have (on average 318.6) internal successors, (1593), 5 states have internal predecessors, (1593), 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 00:44:28,607 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:44:28,607 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 353 [2022-01-19 00:44:28,607 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:44:28,758 INFO L129 PetriNetUnfolder]: 132/1424 cut-off events. [2022-01-19 00:44:28,759 INFO L130 PetriNetUnfolder]: For 42/53 co-relation queries the response was YES. [2022-01-19 00:44:28,766 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1730 conditions, 1424 events. 132/1424 cut-off events. For 42/53 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 9520 event pairs, 31 based on Foata normal form. 2/1293 useless extension candidates. Maximal degree in co-relation 1722. Up to 113 conditions per place. [2022-01-19 00:44:28,769 INFO L132 encePairwiseOnDemand]: 342/353 looper letters, 30 selfloop transitions, 9 changer transitions 0/352 dead transitions. [2022-01-19 00:44:28,769 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 352 transitions, 890 flow [2022-01-19 00:44:28,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-19 00:44:28,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-01-19 00:44:28,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1937 transitions. [2022-01-19 00:44:28,772 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9145420207743153 [2022-01-19 00:44:28,772 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1937 transitions. [2022-01-19 00:44:28,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1937 transitions. [2022-01-19 00:44:28,773 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:44:28,773 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1937 transitions. [2022-01-19 00:44:28,776 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 322.8333333333333) internal successors, (1937), 6 states have internal predecessors, (1937), 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 00:44:28,779 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 353.0) internal successors, (2471), 7 states have internal predecessors, (2471), 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 00:44:28,780 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 353.0) internal successors, (2471), 7 states have internal predecessors, (2471), 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 00:44:28,780 INFO L186 Difference]: Start difference. First operand has 320 places, 335 transitions, 772 flow. Second operand 6 states and 1937 transitions. [2022-01-19 00:44:28,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 352 transitions, 890 flow [2022-01-19 00:44:28,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 325 places, 352 transitions, 890 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-01-19 00:44:28,787 INFO L242 Difference]: Finished difference. Result has 329 places, 341 transitions, 831 flow [2022-01-19 00:44:28,787 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=353, PETRI_DIFFERENCE_MINUEND_FLOW=772, PETRI_DIFFERENCE_MINUEND_PLACES=320, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=335, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=326, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=831, PETRI_PLACES=329, PETRI_TRANSITIONS=341} [2022-01-19 00:44:28,788 INFO L334 CegarLoopForPetriNet]: 314 programPoint places, 15 predicate places. [2022-01-19 00:44:28,789 INFO L470 AbstractCegarLoop]: Abstraction has has 329 places, 341 transitions, 831 flow [2022-01-19 00:44:28,789 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 318.6) internal successors, (1593), 5 states have internal predecessors, (1593), 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 00:44:28,789 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:44:28,790 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 00:44:28,790 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-19 00:44:28,790 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:44:28,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:44:28,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1215126355, now seen corresponding path program 1 times [2022-01-19 00:44:28,791 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:44:28,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807758386] [2022-01-19 00:44:28,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:44:28,791 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:44:28,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:44:28,845 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 00:44:28,845 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:44:28,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807758386] [2022-01-19 00:44:28,845 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807758386] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:44:28,845 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:44:28,845 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-19 00:44:28,845 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653846118] [2022-01-19 00:44:28,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:44:28,846 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-19 00:44:28,846 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:44:28,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-19 00:44:28,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-19 00:44:28,848 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 353 [2022-01-19 00:44:28,850 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 329 places, 341 transitions, 831 flow. Second operand has 5 states, 5 states have (on average 318.6) internal successors, (1593), 5 states have internal predecessors, (1593), 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 00:44:28,850 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:44:28,850 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 353 [2022-01-19 00:44:28,850 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:44:29,086 INFO L129 PetriNetUnfolder]: 216/2386 cut-off events. [2022-01-19 00:44:29,087 INFO L130 PetriNetUnfolder]: For 137/148 co-relation queries the response was YES. [2022-01-19 00:44:29,099 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2902 conditions, 2386 events. 216/2386 cut-off events. For 137/148 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 18509 event pairs, 47 based on Foata normal form. 0/2128 useless extension candidates. Maximal degree in co-relation 2889. Up to 176 conditions per place. [2022-01-19 00:44:29,107 INFO L132 encePairwiseOnDemand]: 342/353 looper letters, 29 selfloop transitions, 9 changer transitions 0/357 dead transitions. [2022-01-19 00:44:29,107 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 334 places, 357 transitions, 944 flow [2022-01-19 00:44:29,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-19 00:44:29,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-01-19 00:44:29,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1936 transitions. [2022-01-19 00:44:29,110 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9140698772426817 [2022-01-19 00:44:29,110 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1936 transitions. [2022-01-19 00:44:29,110 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1936 transitions. [2022-01-19 00:44:29,111 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:44:29,111 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1936 transitions. [2022-01-19 00:44:29,113 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 322.6666666666667) internal successors, (1936), 6 states have internal predecessors, (1936), 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 00:44:29,116 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 353.0) internal successors, (2471), 7 states have internal predecessors, (2471), 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 00:44:29,116 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 353.0) internal successors, (2471), 7 states have internal predecessors, (2471), 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 00:44:29,116 INFO L186 Difference]: Start difference. First operand has 329 places, 341 transitions, 831 flow. Second operand 6 states and 1936 transitions. [2022-01-19 00:44:29,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 334 places, 357 transitions, 944 flow [2022-01-19 00:44:29,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 333 places, 357 transitions, 939 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 00:44:29,122 INFO L242 Difference]: Finished difference. Result has 337 places, 347 transitions, 885 flow [2022-01-19 00:44:29,123 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=353, PETRI_DIFFERENCE_MINUEND_FLOW=826, PETRI_DIFFERENCE_MINUEND_PLACES=328, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=341, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=885, PETRI_PLACES=337, PETRI_TRANSITIONS=347} [2022-01-19 00:44:29,124 INFO L334 CegarLoopForPetriNet]: 314 programPoint places, 23 predicate places. [2022-01-19 00:44:29,125 INFO L470 AbstractCegarLoop]: Abstraction has has 337 places, 347 transitions, 885 flow [2022-01-19 00:44:29,125 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 318.6) internal successors, (1593), 5 states have internal predecessors, (1593), 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 00:44:29,125 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:44:29,125 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] [2022-01-19 00:44:29,125 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-19 00:44:29,126 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:44:29,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:44:29,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1786217094, now seen corresponding path program 1 times [2022-01-19 00:44:29,126 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:44:29,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640419082] [2022-01-19 00:44:29,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:44:29,127 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:44:29,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:44:29,181 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 00:44:29,181 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:44:29,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640419082] [2022-01-19 00:44:29,181 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640419082] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:44:29,182 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:44:29,182 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-19 00:44:29,182 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514570269] [2022-01-19 00:44:29,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:44:29,185 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-19 00:44:29,185 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:44:29,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-19 00:44:29,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-19 00:44:29,187 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 322 out of 353 [2022-01-19 00:44:29,188 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 347 transitions, 885 flow. Second operand has 5 states, 5 states have (on average 324.4) internal successors, (1622), 5 states have internal predecessors, (1622), 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 00:44:29,188 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:44:29,188 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 322 of 353 [2022-01-19 00:44:29,188 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:44:29,363 INFO L129 PetriNetUnfolder]: 110/1717 cut-off events. [2022-01-19 00:44:29,363 INFO L130 PetriNetUnfolder]: For 75/87 co-relation queries the response was YES. [2022-01-19 00:44:29,375 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2075 conditions, 1717 events. 110/1717 cut-off events. For 75/87 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 11580 event pairs, 4 based on Foata normal form. 0/1581 useless extension candidates. Maximal degree in co-relation 2058. Up to 53 conditions per place. [2022-01-19 00:44:29,379 INFO L132 encePairwiseOnDemand]: 348/353 looper letters, 16 selfloop transitions, 4 changer transitions 0/351 dead transitions. [2022-01-19 00:44:29,379 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 351 transitions, 933 flow [2022-01-19 00:44:29,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 00:44:29,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 00:44:29,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1631 transitions. [2022-01-19 00:44:29,382 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9240793201133144 [2022-01-19 00:44:29,382 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1631 transitions. [2022-01-19 00:44:29,382 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1631 transitions. [2022-01-19 00:44:29,382 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:44:29,382 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1631 transitions. [2022-01-19 00:44:29,384 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 326.2) internal successors, (1631), 5 states have internal predecessors, (1631), 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 00:44:29,386 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 353.0) internal successors, (2118), 6 states have internal predecessors, (2118), 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 00:44:29,388 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 353.0) internal successors, (2118), 6 states have internal predecessors, (2118), 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 00:44:29,388 INFO L186 Difference]: Start difference. First operand has 337 places, 347 transitions, 885 flow. Second operand 5 states and 1631 transitions. [2022-01-19 00:44:29,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 341 places, 351 transitions, 933 flow [2022-01-19 00:44:29,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 340 places, 351 transitions, 928 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 00:44:29,394 INFO L242 Difference]: Finished difference. Result has 341 places, 348 transitions, 896 flow [2022-01-19 00:44:29,395 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=353, PETRI_DIFFERENCE_MINUEND_FLOW=880, PETRI_DIFFERENCE_MINUEND_PLACES=336, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=347, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=343, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=896, PETRI_PLACES=341, PETRI_TRANSITIONS=348} [2022-01-19 00:44:29,395 INFO L334 CegarLoopForPetriNet]: 314 programPoint places, 27 predicate places. [2022-01-19 00:44:29,395 INFO L470 AbstractCegarLoop]: Abstraction has has 341 places, 348 transitions, 896 flow [2022-01-19 00:44:29,396 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 324.4) internal successors, (1622), 5 states have internal predecessors, (1622), 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 00:44:29,396 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:44:29,396 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] [2022-01-19 00:44:29,396 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-19 00:44:29,396 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:44:29,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:44:29,397 INFO L85 PathProgramCache]: Analyzing trace with hash 454408965, now seen corresponding path program 1 times [2022-01-19 00:44:29,397 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:44:29,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507917531] [2022-01-19 00:44:29,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:44:29,397 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:44:29,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:44:29,468 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:44:29,469 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:44:29,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507917531] [2022-01-19 00:44:29,469 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507917531] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 00:44:29,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [859989758] [2022-01-19 00:44:29,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:44:29,470 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 00:44:29,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 00:44:29,471 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 00:44:29,518 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 00:44:29,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:44:29,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-19 00:44:29,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 00:44:29,840 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:44:29,841 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 00:44:30,056 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:44:30,057 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [859989758] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 00:44:30,057 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 00:44:30,057 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2022-01-19 00:44:30,057 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272215490] [2022-01-19 00:44:30,057 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 00:44:30,058 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-19 00:44:30,058 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:44:30,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-19 00:44:30,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-01-19 00:44:30,061 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 321 out of 353 [2022-01-19 00:44:30,063 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 348 transitions, 896 flow. Second operand has 14 states, 14 states have (on average 323.64285714285717) internal successors, (4531), 14 states have internal predecessors, (4531), 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 00:44:30,064 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:44:30,064 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 321 of 353 [2022-01-19 00:44:30,064 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:44:30,348 INFO L129 PetriNetUnfolder]: 110/1726 cut-off events. [2022-01-19 00:44:30,349 INFO L130 PetriNetUnfolder]: For 76/88 co-relation queries the response was YES. [2022-01-19 00:44:30,360 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2096 conditions, 1726 events. 110/1726 cut-off events. For 76/88 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 11560 event pairs, 4 based on Foata normal form. 2/1593 useless extension candidates. Maximal degree in co-relation 2078. Up to 53 conditions per place. [2022-01-19 00:44:30,364 INFO L132 encePairwiseOnDemand]: 345/353 looper letters, 17 selfloop transitions, 11 changer transitions 0/358 dead transitions. [2022-01-19 00:44:30,364 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 351 places, 358 transitions, 974 flow [2022-01-19 00:44:30,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-19 00:44:30,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-01-19 00:44:30,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 3561 transitions. [2022-01-19 00:44:30,368 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9170744269894412 [2022-01-19 00:44:30,368 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 3561 transitions. [2022-01-19 00:44:30,368 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 3561 transitions. [2022-01-19 00:44:30,370 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:44:30,370 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 3561 transitions. [2022-01-19 00:44:30,374 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 323.72727272727275) internal successors, (3561), 11 states have internal predecessors, (3561), 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 00:44:30,378 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 353.0) internal successors, (4236), 12 states have internal predecessors, (4236), 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 00:44:30,379 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 353.0) internal successors, (4236), 12 states have internal predecessors, (4236), 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 00:44:30,379 INFO L186 Difference]: Start difference. First operand has 341 places, 348 transitions, 896 flow. Second operand 11 states and 3561 transitions. [2022-01-19 00:44:30,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 351 places, 358 transitions, 974 flow [2022-01-19 00:44:30,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 348 places, 358 transitions, 968 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-01-19 00:44:30,385 INFO L242 Difference]: Finished difference. Result has 351 places, 354 transitions, 945 flow [2022-01-19 00:44:30,385 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=353, PETRI_DIFFERENCE_MINUEND_FLOW=890, PETRI_DIFFERENCE_MINUEND_PLACES=338, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=348, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=340, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=945, PETRI_PLACES=351, PETRI_TRANSITIONS=354} [2022-01-19 00:44:30,386 INFO L334 CegarLoopForPetriNet]: 314 programPoint places, 37 predicate places. [2022-01-19 00:44:30,386 INFO L470 AbstractCegarLoop]: Abstraction has has 351 places, 354 transitions, 945 flow [2022-01-19 00:44:30,387 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 323.64285714285717) internal successors, (4531), 14 states have internal predecessors, (4531), 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 00:44:30,387 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:44:30,388 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:44:30,406 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 00:44:30,603 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 00:44:30,604 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:44:30,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:44:30,604 INFO L85 PathProgramCache]: Analyzing trace with hash 266249057, now seen corresponding path program 2 times [2022-01-19 00:44:30,604 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:44:30,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066380167] [2022-01-19 00:44:30,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:44:30,604 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:44:30,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:44:30,675 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-01-19 00:44:30,675 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:44:30,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066380167] [2022-01-19 00:44:30,676 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066380167] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:44:30,676 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:44:30,676 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 00:44:30,676 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88295321] [2022-01-19 00:44:30,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:44:30,676 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 00:44:30,676 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:44:30,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 00:44:30,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-01-19 00:44:30,678 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 306 out of 353 [2022-01-19 00:44:30,680 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 351 places, 354 transitions, 945 flow. Second operand has 8 states, 8 states have (on average 309.125) internal successors, (2473), 8 states have internal predecessors, (2473), 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 00:44:30,680 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:44:30,680 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 306 of 353 [2022-01-19 00:44:30,680 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:44:30,978 INFO L129 PetriNetUnfolder]: 111/1830 cut-off events. [2022-01-19 00:44:30,978 INFO L130 PetriNetUnfolder]: For 78/90 co-relation queries the response was YES. [2022-01-19 00:44:30,988 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2404 conditions, 1830 events. 111/1830 cut-off events. For 78/90 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 12266 event pairs, 4 based on Foata normal form. 8/1703 useless extension candidates. Maximal degree in co-relation 2383. Up to 128 conditions per place. [2022-01-19 00:44:30,991 INFO L132 encePairwiseOnDemand]: 344/353 looper letters, 35 selfloop transitions, 4 changer transitions 5/369 dead transitions. [2022-01-19 00:44:30,991 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 369 transitions, 1063 flow [2022-01-19 00:44:30,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-19 00:44:30,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-01-19 00:44:30,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 2493 transitions. [2022-01-19 00:44:30,995 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8827903682719547 [2022-01-19 00:44:30,995 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 2493 transitions. [2022-01-19 00:44:30,995 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 2493 transitions. [2022-01-19 00:44:30,996 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:44:30,996 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 2493 transitions. [2022-01-19 00:44:30,999 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 311.625) internal successors, (2493), 8 states have internal predecessors, (2493), 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 00:44:31,002 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 353.0) internal successors, (3177), 9 states have internal predecessors, (3177), 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 00:44:31,003 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 353.0) internal successors, (3177), 9 states have internal predecessors, (3177), 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 00:44:31,003 INFO L186 Difference]: Start difference. First operand has 351 places, 354 transitions, 945 flow. Second operand 8 states and 2493 transitions. [2022-01-19 00:44:31,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 358 places, 369 transitions, 1063 flow [2022-01-19 00:44:31,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 369 transitions, 1054 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-01-19 00:44:31,009 INFO L242 Difference]: Finished difference. Result has 361 places, 357 transitions, 972 flow [2022-01-19 00:44:31,009 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=353, PETRI_DIFFERENCE_MINUEND_FLOW=936, PETRI_DIFFERENCE_MINUEND_PLACES=348, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=354, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=350, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=972, PETRI_PLACES=361, PETRI_TRANSITIONS=357} [2022-01-19 00:44:31,010 INFO L334 CegarLoopForPetriNet]: 314 programPoint places, 47 predicate places. [2022-01-19 00:44:31,010 INFO L470 AbstractCegarLoop]: Abstraction has has 361 places, 357 transitions, 972 flow [2022-01-19 00:44:31,011 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 309.125) internal successors, (2473), 8 states have internal predecessors, (2473), 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 00:44:31,011 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:44:31,011 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:44:31,011 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-19 00:44:31,011 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:44:31,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:44:31,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1901665691, now seen corresponding path program 1 times [2022-01-19 00:44:31,012 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:44:31,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640231767] [2022-01-19 00:44:31,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:44:31,012 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:44:31,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:44:31,051 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-01-19 00:44:31,051 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:44:31,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640231767] [2022-01-19 00:44:31,051 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640231767] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:44:31,052 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:44:31,052 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 00:44:31,052 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832802627] [2022-01-19 00:44:31,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:44:31,052 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 00:44:31,052 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:44:31,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 00:44:31,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 00:44:31,054 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 315 out of 353 [2022-01-19 00:44:31,055 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 361 places, 357 transitions, 972 flow. Second operand has 4 states, 4 states have (on average 318.0) internal successors, (1272), 4 states have internal predecessors, (1272), 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 00:44:31,055 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:44:31,055 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 315 of 353 [2022-01-19 00:44:31,055 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:44:31,399 INFO L129 PetriNetUnfolder]: 293/2938 cut-off events. [2022-01-19 00:44:31,399 INFO L130 PetriNetUnfolder]: For 212/223 co-relation queries the response was YES. [2022-01-19 00:44:31,418 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3962 conditions, 2938 events. 293/2938 cut-off events. For 212/223 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 23947 event pairs, 64 based on Foata normal form. 0/2626 useless extension candidates. Maximal degree in co-relation 3935. Up to 196 conditions per place. [2022-01-19 00:44:31,424 INFO L132 encePairwiseOnDemand]: 341/353 looper letters, 26 selfloop transitions, 11 changer transitions 0/371 dead transitions. [2022-01-19 00:44:31,424 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 371 transitions, 1077 flow [2022-01-19 00:44:31,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-19 00:44:31,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-01-19 00:44:31,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1298 transitions. [2022-01-19 00:44:31,427 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9192634560906515 [2022-01-19 00:44:31,427 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1298 transitions. [2022-01-19 00:44:31,427 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1298 transitions. [2022-01-19 00:44:31,427 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:44:31,427 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1298 transitions. [2022-01-19 00:44:31,429 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 324.5) internal successors, (1298), 4 states have internal predecessors, (1298), 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 00:44:31,430 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 353.0) internal successors, (1765), 5 states have internal predecessors, (1765), 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 00:44:31,430 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 353.0) internal successors, (1765), 5 states have internal predecessors, (1765), 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 00:44:31,430 INFO L186 Difference]: Start difference. First operand has 361 places, 357 transitions, 972 flow. Second operand 4 states and 1298 transitions. [2022-01-19 00:44:31,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 371 transitions, 1077 flow [2022-01-19 00:44:31,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 371 transitions, 1067 flow, removed 4 selfloop flow, removed 5 redundant places. [2022-01-19 00:44:31,437 INFO L242 Difference]: Finished difference. Result has 358 places, 363 transitions, 1032 flow [2022-01-19 00:44:31,438 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=353, PETRI_DIFFERENCE_MINUEND_FLOW=962, PETRI_DIFFERENCE_MINUEND_PLACES=352, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=346, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1032, PETRI_PLACES=358, PETRI_TRANSITIONS=363} [2022-01-19 00:44:31,438 INFO L334 CegarLoopForPetriNet]: 314 programPoint places, 44 predicate places. [2022-01-19 00:44:31,438 INFO L470 AbstractCegarLoop]: Abstraction has has 358 places, 363 transitions, 1032 flow [2022-01-19 00:44:31,439 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 318.0) internal successors, (1272), 4 states have internal predecessors, (1272), 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 00:44:31,439 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:44:31,439 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:44:31,439 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-19 00:44:31,439 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:44:31,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:44:31,440 INFO L85 PathProgramCache]: Analyzing trace with hash -227916070, now seen corresponding path program 1 times [2022-01-19 00:44:31,440 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:44:31,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929339559] [2022-01-19 00:44:31,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:44:31,440 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:44:31,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:44:31,470 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-01-19 00:44:31,470 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:44:31,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929339559] [2022-01-19 00:44:31,470 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929339559] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:44:31,470 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:44:31,470 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 00:44:31,470 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538135960] [2022-01-19 00:44:31,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:44:31,471 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 00:44:31,471 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:44:31,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 00:44:31,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 00:44:31,472 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 315 out of 353 [2022-01-19 00:44:31,473 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 363 transitions, 1032 flow. Second operand has 4 states, 4 states have (on average 318.0) internal successors, (1272), 4 states have internal predecessors, (1272), 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 00:44:31,473 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:44:31,473 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 315 of 353 [2022-01-19 00:44:31,473 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:44:31,706 INFO L129 PetriNetUnfolder]: 178/2081 cut-off events. [2022-01-19 00:44:31,706 INFO L130 PetriNetUnfolder]: For 169/305 co-relation queries the response was YES. [2022-01-19 00:44:31,719 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2879 conditions, 2081 events. 178/2081 cut-off events. For 169/305 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 14243 event pairs, 37 based on Foata normal form. 10/1960 useless extension candidates. Maximal degree in co-relation 2854. Up to 136 conditions per place. [2022-01-19 00:44:31,723 INFO L132 encePairwiseOnDemand]: 348/353 looper letters, 35 selfloop transitions, 4 changer transitions 0/372 dead transitions. [2022-01-19 00:44:31,723 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 372 transitions, 1135 flow [2022-01-19 00:44:31,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 00:44:31,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 00:44:31,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1611 transitions. [2022-01-19 00:44:31,726 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9127478753541076 [2022-01-19 00:44:31,726 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1611 transitions. [2022-01-19 00:44:31,726 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1611 transitions. [2022-01-19 00:44:31,726 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:44:31,727 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1611 transitions. [2022-01-19 00:44:31,728 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 322.2) internal successors, (1611), 5 states have internal predecessors, (1611), 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 00:44:31,730 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 353.0) internal successors, (2118), 6 states have internal predecessors, (2118), 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 00:44:31,730 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 353.0) internal successors, (2118), 6 states have internal predecessors, (2118), 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 00:44:31,730 INFO L186 Difference]: Start difference. First operand has 358 places, 363 transitions, 1032 flow. Second operand 5 states and 1611 transitions. [2022-01-19 00:44:31,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 362 places, 372 transitions, 1135 flow [2022-01-19 00:44:31,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 362 places, 372 transitions, 1133 flow, removed 1 selfloop flow, removed 0 redundant places. [2022-01-19 00:44:31,737 INFO L242 Difference]: Finished difference. Result has 363 places, 363 transitions, 1044 flow [2022-01-19 00:44:31,737 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=353, PETRI_DIFFERENCE_MINUEND_FLOW=1026, PETRI_DIFFERENCE_MINUEND_PLACES=358, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=358, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1044, PETRI_PLACES=363, PETRI_TRANSITIONS=363} [2022-01-19 00:44:31,737 INFO L334 CegarLoopForPetriNet]: 314 programPoint places, 49 predicate places. [2022-01-19 00:44:31,737 INFO L470 AbstractCegarLoop]: Abstraction has has 363 places, 363 transitions, 1044 flow [2022-01-19 00:44:31,738 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 318.0) internal successors, (1272), 4 states have internal predecessors, (1272), 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 00:44:31,738 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:44:31,738 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:44:31,738 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-19 00:44:31,738 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:44:31,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:44:31,739 INFO L85 PathProgramCache]: Analyzing trace with hash -731169643, now seen corresponding path program 1 times [2022-01-19 00:44:31,739 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:44:31,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068699285] [2022-01-19 00:44:31,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:44:31,739 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:44:31,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:44:31,800 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-01-19 00:44:31,801 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:44:31,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068699285] [2022-01-19 00:44:31,801 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068699285] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:44:31,801 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:44:31,801 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 00:44:31,801 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633288337] [2022-01-19 00:44:31,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:44:31,801 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 00:44:31,801 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:44:31,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 00:44:31,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-19 00:44:31,803 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 353 [2022-01-19 00:44:31,804 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 363 places, 363 transitions, 1044 flow. Second operand has 6 states, 6 states have (on average 299.3333333333333) internal successors, (1796), 6 states have internal predecessors, (1796), 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 00:44:31,804 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:44:31,804 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 353 [2022-01-19 00:44:31,804 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:44:32,886 INFO L129 PetriNetUnfolder]: 1787/9609 cut-off events. [2022-01-19 00:44:32,886 INFO L130 PetriNetUnfolder]: For 3050/3062 co-relation queries the response was YES. [2022-01-19 00:44:32,933 INFO L84 FinitePrefix]: Finished finitePrefix Result has 15608 conditions, 9609 events. 1787/9609 cut-off events. For 3050/3062 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 98130 event pairs, 691 based on Foata normal form. 31/8775 useless extension candidates. Maximal degree in co-relation 15581. Up to 1901 conditions per place. [2022-01-19 00:44:33,061 INFO L132 encePairwiseOnDemand]: 343/353 looper letters, 184 selfloop transitions, 36 changer transitions 0/527 dead transitions. [2022-01-19 00:44:33,061 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 527 transitions, 2115 flow [2022-01-19 00:44:33,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-19 00:44:33,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-01-19 00:44:33,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 5234 transitions. [2022-01-19 00:44:33,071 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.872187968671888 [2022-01-19 00:44:33,071 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 5234 transitions. [2022-01-19 00:44:33,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 5234 transitions. [2022-01-19 00:44:33,073 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:44:33,073 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 5234 transitions. [2022-01-19 00:44:33,080 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 307.88235294117646) internal successors, (5234), 17 states have internal predecessors, (5234), 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 00:44:33,087 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 353.0) internal successors, (6354), 18 states have internal predecessors, (6354), 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 00:44:33,087 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 353.0) internal successors, (6354), 18 states have internal predecessors, (6354), 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 00:44:33,088 INFO L186 Difference]: Start difference. First operand has 363 places, 363 transitions, 1044 flow. Second operand 17 states and 5234 transitions. [2022-01-19 00:44:33,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 379 places, 527 transitions, 2115 flow [2022-01-19 00:44:33,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 377 places, 527 transitions, 2093 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-01-19 00:44:33,104 INFO L242 Difference]: Finished difference. Result has 385 places, 391 transitions, 1302 flow [2022-01-19 00:44:33,104 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=353, PETRI_DIFFERENCE_MINUEND_FLOW=1032, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=353, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1302, PETRI_PLACES=385, PETRI_TRANSITIONS=391} [2022-01-19 00:44:33,105 INFO L334 CegarLoopForPetriNet]: 314 programPoint places, 71 predicate places. [2022-01-19 00:44:33,105 INFO L470 AbstractCegarLoop]: Abstraction has has 385 places, 391 transitions, 1302 flow [2022-01-19 00:44:33,105 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 299.3333333333333) internal successors, (1796), 6 states have internal predecessors, (1796), 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 00:44:33,105 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:44:33,107 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:44:33,107 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-19 00:44:33,107 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:44:33,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:44:33,107 INFO L85 PathProgramCache]: Analyzing trace with hash -423907830, now seen corresponding path program 1 times [2022-01-19 00:44:33,107 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:44:33,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129075242] [2022-01-19 00:44:33,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:44:33,108 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:44:33,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:44:33,148 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-01-19 00:44:33,148 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:44:33,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129075242] [2022-01-19 00:44:33,148 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129075242] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:44:33,148 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:44:33,148 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-19 00:44:33,148 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615798874] [2022-01-19 00:44:33,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:44:33,149 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-19 00:44:33,149 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:44:33,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-19 00:44:33,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-19 00:44:33,150 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 313 out of 353 [2022-01-19 00:44:33,151 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 385 places, 391 transitions, 1302 flow. Second operand has 5 states, 5 states have (on average 316.8) internal successors, (1584), 5 states have internal predecessors, (1584), 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 00:44:33,151 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:44:33,151 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 313 of 353 [2022-01-19 00:44:33,151 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:44:33,519 INFO L129 PetriNetUnfolder]: 229/2435 cut-off events. [2022-01-19 00:44:33,519 INFO L130 PetriNetUnfolder]: For 693/821 co-relation queries the response was YES. [2022-01-19 00:44:33,535 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3658 conditions, 2435 events. 229/2435 cut-off events. For 693/821 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 17296 event pairs, 40 based on Foata normal form. 24/2300 useless extension candidates. Maximal degree in co-relation 3625. Up to 164 conditions per place. [2022-01-19 00:44:33,541 INFO L132 encePairwiseOnDemand]: 343/353 looper letters, 44 selfloop transitions, 19 changer transitions 0/410 dead transitions. [2022-01-19 00:44:33,541 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 391 places, 410 transitions, 1485 flow [2022-01-19 00:44:33,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 00:44:33,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 00:44:33,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2239 transitions. [2022-01-19 00:44:33,545 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9061108862808579 [2022-01-19 00:44:33,545 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 2239 transitions. [2022-01-19 00:44:33,545 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 2239 transitions. [2022-01-19 00:44:33,546 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:44:33,546 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 2239 transitions. [2022-01-19 00:44:33,549 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 319.85714285714283) internal successors, (2239), 7 states have internal predecessors, (2239), 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 00:44:33,551 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 353.0) internal successors, (2824), 8 states have internal predecessors, (2824), 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 00:44:33,552 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 353.0) internal successors, (2824), 8 states have internal predecessors, (2824), 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 00:44:33,552 INFO L186 Difference]: Start difference. First operand has 385 places, 391 transitions, 1302 flow. Second operand 7 states and 2239 transitions. [2022-01-19 00:44:33,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 391 places, 410 transitions, 1485 flow [2022-01-19 00:44:33,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 387 places, 410 transitions, 1451 flow, removed 4 selfloop flow, removed 4 redundant places. [2022-01-19 00:44:33,561 INFO L242 Difference]: Finished difference. Result has 390 places, 397 transitions, 1358 flow [2022-01-19 00:44:33,561 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=353, PETRI_DIFFERENCE_MINUEND_FLOW=1268, PETRI_DIFFERENCE_MINUEND_PLACES=381, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=391, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=373, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1358, PETRI_PLACES=390, PETRI_TRANSITIONS=397} [2022-01-19 00:44:33,561 INFO L334 CegarLoopForPetriNet]: 314 programPoint places, 76 predicate places. [2022-01-19 00:44:33,562 INFO L470 AbstractCegarLoop]: Abstraction has has 390 places, 397 transitions, 1358 flow [2022-01-19 00:44:33,562 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 316.8) internal successors, (1584), 5 states have internal predecessors, (1584), 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 00:44:33,562 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:44:33,562 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:44:33,562 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-19 00:44:33,562 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:44:33,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:44:33,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1856360310, now seen corresponding path program 1 times [2022-01-19 00:44:33,563 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:44:33,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686362410] [2022-01-19 00:44:33,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:44:33,563 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:44:33,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:44:33,616 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-01-19 00:44:33,617 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:44:33,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686362410] [2022-01-19 00:44:33,617 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686362410] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:44:33,617 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:44:33,617 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 00:44:33,617 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515510846] [2022-01-19 00:44:33,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:44:33,617 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 00:44:33,617 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:44:33,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 00:44:33,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-19 00:44:33,619 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 312 out of 353 [2022-01-19 00:44:33,621 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 390 places, 397 transitions, 1358 flow. Second operand has 7 states, 7 states have (on average 314.7142857142857) internal successors, (2203), 7 states have internal predecessors, (2203), 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 00:44:33,621 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:44:33,621 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 312 of 353 [2022-01-19 00:44:33,621 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:44:34,014 INFO L129 PetriNetUnfolder]: 270/2864 cut-off events. [2022-01-19 00:44:34,015 INFO L130 PetriNetUnfolder]: For 752/879 co-relation queries the response was YES. [2022-01-19 00:44:34,034 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4438 conditions, 2864 events. 270/2864 cut-off events. For 752/879 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 21838 event pairs, 50 based on Foata normal form. 17/2691 useless extension candidates. Maximal degree in co-relation 4402. Up to 228 conditions per place. [2022-01-19 00:44:34,040 INFO L132 encePairwiseOnDemand]: 337/353 looper letters, 40 selfloop transitions, 17 changer transitions 0/423 dead transitions. [2022-01-19 00:44:34,040 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 397 places, 423 transitions, 1542 flow [2022-01-19 00:44:34,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-19 00:44:34,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-01-19 00:44:34,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 2551 transitions. [2022-01-19 00:44:34,044 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9033286118980169 [2022-01-19 00:44:34,044 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 2551 transitions. [2022-01-19 00:44:34,044 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 2551 transitions. [2022-01-19 00:44:34,044 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:44:34,045 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 2551 transitions. [2022-01-19 00:44:34,047 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 318.875) internal successors, (2551), 8 states have internal predecessors, (2551), 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 00:44:34,050 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 353.0) internal successors, (3177), 9 states have internal predecessors, (3177), 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 00:44:34,050 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 353.0) internal successors, (3177), 9 states have internal predecessors, (3177), 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 00:44:34,050 INFO L186 Difference]: Start difference. First operand has 390 places, 397 transitions, 1358 flow. Second operand 8 states and 2551 transitions. [2022-01-19 00:44:34,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 397 places, 423 transitions, 1542 flow [2022-01-19 00:44:34,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 395 places, 423 transitions, 1524 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-01-19 00:44:34,060 INFO L242 Difference]: Finished difference. Result has 399 places, 407 transitions, 1449 flow [2022-01-19 00:44:34,060 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=353, PETRI_DIFFERENCE_MINUEND_FLOW=1340, PETRI_DIFFERENCE_MINUEND_PLACES=388, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=397, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=380, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1449, PETRI_PLACES=399, PETRI_TRANSITIONS=407} [2022-01-19 00:44:34,061 INFO L334 CegarLoopForPetriNet]: 314 programPoint places, 85 predicate places. [2022-01-19 00:44:34,061 INFO L470 AbstractCegarLoop]: Abstraction has has 399 places, 407 transitions, 1449 flow [2022-01-19 00:44:34,061 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 314.7142857142857) internal successors, (2203), 7 states have internal predecessors, (2203), 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 00:44:34,061 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:44:34,061 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:44:34,061 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-19 00:44:34,062 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:44:34,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:44:34,062 INFO L85 PathProgramCache]: Analyzing trace with hash -38920124, now seen corresponding path program 1 times [2022-01-19 00:44:34,062 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:44:34,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936545950] [2022-01-19 00:44:34,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:44:34,062 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:44:34,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:44:34,090 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-01-19 00:44:34,091 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:44:34,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936545950] [2022-01-19 00:44:34,091 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936545950] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:44:34,091 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:44:34,091 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 00:44:34,093 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761050670] [2022-01-19 00:44:34,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:44:34,093 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 00:44:34,093 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:44:34,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 00:44:34,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 00:44:34,096 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 307 out of 353 [2022-01-19 00:44:34,096 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 399 places, 407 transitions, 1449 flow. Second operand has 3 states, 3 states have (on average 312.6666666666667) internal successors, (938), 3 states have internal predecessors, (938), 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 00:44:34,097 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:44:34,097 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 307 of 353 [2022-01-19 00:44:34,097 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:44:35,565 INFO L129 PetriNetUnfolder]: 1317/11822 cut-off events. [2022-01-19 00:44:35,565 INFO L130 PetriNetUnfolder]: For 4086/4151 co-relation queries the response was YES. [2022-01-19 00:44:35,612 INFO L84 FinitePrefix]: Finished finitePrefix Result has 18163 conditions, 11822 events. 1317/11822 cut-off events. For 4086/4151 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 133267 event pairs, 377 based on Foata normal form. 10/10854 useless extension candidates. Maximal degree in co-relation 18122. Up to 970 conditions per place. [2022-01-19 00:44:35,631 INFO L132 encePairwiseOnDemand]: 349/353 looper letters, 52 selfloop transitions, 3 changer transitions 0/425 dead transitions. [2022-01-19 00:44:35,631 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 401 places, 425 transitions, 1618 flow [2022-01-19 00:44:35,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 00:44:35,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 00:44:35,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 970 transitions. [2022-01-19 00:44:35,633 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9159584513692163 [2022-01-19 00:44:35,633 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 970 transitions. [2022-01-19 00:44:35,633 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 970 transitions. [2022-01-19 00:44:35,634 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:44:35,634 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 970 transitions. [2022-01-19 00:44:35,635 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 323.3333333333333) internal successors, (970), 3 states have internal predecessors, (970), 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 00:44:35,636 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 353.0) internal successors, (1412), 4 states have internal predecessors, (1412), 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 00:44:35,636 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 353.0) internal successors, (1412), 4 states have internal predecessors, (1412), 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 00:44:35,636 INFO L186 Difference]: Start difference. First operand has 399 places, 407 transitions, 1449 flow. Second operand 3 states and 970 transitions. [2022-01-19 00:44:35,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 401 places, 425 transitions, 1618 flow [2022-01-19 00:44:35,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 398 places, 425 transitions, 1605 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-01-19 00:44:35,663 INFO L242 Difference]: Finished difference. Result has 400 places, 409 transitions, 1458 flow [2022-01-19 00:44:35,664 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=353, PETRI_DIFFERENCE_MINUEND_FLOW=1436, PETRI_DIFFERENCE_MINUEND_PLACES=396, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=407, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=404, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1458, PETRI_PLACES=400, PETRI_TRANSITIONS=409} [2022-01-19 00:44:35,664 INFO L334 CegarLoopForPetriNet]: 314 programPoint places, 86 predicate places. [2022-01-19 00:44:35,664 INFO L470 AbstractCegarLoop]: Abstraction has has 400 places, 409 transitions, 1458 flow [2022-01-19 00:44:35,665 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 312.6666666666667) internal successors, (938), 3 states have internal predecessors, (938), 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 00:44:35,665 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:44:35,665 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:44:35,665 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-19 00:44:35,665 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:44:35,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:44:35,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1289922524, now seen corresponding path program 1 times [2022-01-19 00:44:35,666 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:44:35,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332236132] [2022-01-19 00:44:35,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:44:35,666 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:44:35,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:44:35,708 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-01-19 00:44:35,708 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:44:35,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332236132] [2022-01-19 00:44:35,708 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332236132] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:44:35,708 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:44:35,708 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 00:44:35,708 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201412639] [2022-01-19 00:44:35,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:44:35,709 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 00:44:35,709 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:44:35,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 00:44:35,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-19 00:44:35,724 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 353 [2022-01-19 00:44:35,726 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 400 places, 409 transitions, 1458 flow. Second operand has 6 states, 6 states have (on average 316.8333333333333) internal successors, (1901), 6 states have internal predecessors, (1901), 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 00:44:35,726 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:44:35,726 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 353 [2022-01-19 00:44:35,726 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:44:36,487 INFO L129 PetriNetUnfolder]: 430/5025 cut-off events. [2022-01-19 00:44:36,488 INFO L130 PetriNetUnfolder]: For 1306/1598 co-relation queries the response was YES. [2022-01-19 00:44:36,529 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8064 conditions, 5025 events. 430/5025 cut-off events. For 1306/1598 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 44356 event pairs, 88 based on Foata normal form. 42/4801 useless extension candidates. Maximal degree in co-relation 8022. Up to 468 conditions per place. [2022-01-19 00:44:36,540 INFO L132 encePairwiseOnDemand]: 341/353 looper letters, 49 selfloop transitions, 13 changer transitions 0/433 dead transitions. [2022-01-19 00:44:36,540 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 406 places, 433 transitions, 1671 flow [2022-01-19 00:44:36,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 00:44:36,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 00:44:36,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2248 transitions. [2022-01-19 00:44:36,544 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9097531363820316 [2022-01-19 00:44:36,544 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 2248 transitions. [2022-01-19 00:44:36,544 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 2248 transitions. [2022-01-19 00:44:36,545 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:44:36,545 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 2248 transitions. [2022-01-19 00:44:36,605 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 321.14285714285717) internal successors, (2248), 7 states have internal predecessors, (2248), 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 00:44:36,607 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 353.0) internal successors, (2824), 8 states have internal predecessors, (2824), 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 00:44:36,608 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 353.0) internal successors, (2824), 8 states have internal predecessors, (2824), 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 00:44:36,608 INFO L186 Difference]: Start difference. First operand has 400 places, 409 transitions, 1458 flow. Second operand 7 states and 2248 transitions. [2022-01-19 00:44:36,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 406 places, 433 transitions, 1671 flow [2022-01-19 00:44:36,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 404 places, 433 transitions, 1665 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-01-19 00:44:36,621 INFO L242 Difference]: Finished difference. Result has 409 places, 419 transitions, 1565 flow [2022-01-19 00:44:36,622 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=353, PETRI_DIFFERENCE_MINUEND_FLOW=1452, PETRI_DIFFERENCE_MINUEND_PLACES=398, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=409, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=397, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1565, PETRI_PLACES=409, PETRI_TRANSITIONS=419} [2022-01-19 00:44:36,622 INFO L334 CegarLoopForPetriNet]: 314 programPoint places, 95 predicate places. [2022-01-19 00:44:36,622 INFO L470 AbstractCegarLoop]: Abstraction has has 409 places, 419 transitions, 1565 flow [2022-01-19 00:44:36,623 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 316.8333333333333) internal successors, (1901), 6 states have internal predecessors, (1901), 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 00:44:36,623 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:44:36,623 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:44:36,623 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-19 00:44:36,623 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:44:36,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:44:36,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1054611153, now seen corresponding path program 1 times [2022-01-19 00:44:36,624 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:44:36,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780955640] [2022-01-19 00:44:36,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:44:36,624 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:44:36,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:44:36,676 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-01-19 00:44:36,676 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:44:36,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780955640] [2022-01-19 00:44:36,676 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780955640] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:44:36,676 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:44:36,676 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 00:44:36,676 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099481929] [2022-01-19 00:44:36,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:44:36,677 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 00:44:36,677 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:44:36,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 00:44:36,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-19 00:44:36,679 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 312 out of 353 [2022-01-19 00:44:36,680 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 419 transitions, 1565 flow. Second operand has 7 states, 7 states have (on average 314.7142857142857) internal successors, (2203), 7 states have internal predecessors, (2203), 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 00:44:36,680 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:44:36,680 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 312 of 353 [2022-01-19 00:44:36,680 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:44:38,155 INFO L129 PetriNetUnfolder]: 1034/9391 cut-off events. [2022-01-19 00:44:38,155 INFO L130 PetriNetUnfolder]: For 3419/3457 co-relation queries the response was YES. [2022-01-19 00:44:38,215 INFO L84 FinitePrefix]: Finished finitePrefix Result has 15122 conditions, 9391 events. 1034/9391 cut-off events. For 3419/3457 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 106061 event pairs, 299 based on Foata normal form. 28/8485 useless extension candidates. Maximal degree in co-relation 15075. Up to 1027 conditions per place. [2022-01-19 00:44:38,230 INFO L132 encePairwiseOnDemand]: 337/353 looper letters, 39 selfloop transitions, 17 changer transitions 0/444 dead transitions. [2022-01-19 00:44:38,230 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 416 places, 444 transitions, 1744 flow [2022-01-19 00:44:38,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-19 00:44:38,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-01-19 00:44:38,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 2550 transitions. [2022-01-19 00:44:38,233 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9029745042492918 [2022-01-19 00:44:38,234 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 2550 transitions. [2022-01-19 00:44:38,234 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 2550 transitions. [2022-01-19 00:44:38,234 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:44:38,235 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 2550 transitions. [2022-01-19 00:44:38,245 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 318.75) internal successors, (2550), 8 states have internal predecessors, (2550), 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 00:44:38,248 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 353.0) internal successors, (3177), 9 states have internal predecessors, (3177), 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 00:44:38,249 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 353.0) internal successors, (3177), 9 states have internal predecessors, (3177), 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 00:44:38,249 INFO L186 Difference]: Start difference. First operand has 409 places, 419 transitions, 1565 flow. Second operand 8 states and 2550 transitions. [2022-01-19 00:44:38,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 416 places, 444 transitions, 1744 flow [2022-01-19 00:44:38,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 416 places, 444 transitions, 1738 flow, removed 3 selfloop flow, removed 0 redundant places. [2022-01-19 00:44:38,275 INFO L242 Difference]: Finished difference. Result has 420 places, 429 transitions, 1668 flow [2022-01-19 00:44:38,276 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=353, PETRI_DIFFERENCE_MINUEND_FLOW=1559, PETRI_DIFFERENCE_MINUEND_PLACES=409, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=419, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=402, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1668, PETRI_PLACES=420, PETRI_TRANSITIONS=429} [2022-01-19 00:44:38,276 INFO L334 CegarLoopForPetriNet]: 314 programPoint places, 106 predicate places. [2022-01-19 00:44:38,276 INFO L470 AbstractCegarLoop]: Abstraction has has 420 places, 429 transitions, 1668 flow [2022-01-19 00:44:38,277 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 314.7142857142857) internal successors, (2203), 7 states have internal predecessors, (2203), 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 00:44:38,277 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:44:38,277 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:44:38,277 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-19 00:44:38,277 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:44:38,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:44:38,278 INFO L85 PathProgramCache]: Analyzing trace with hash 224451925, now seen corresponding path program 1 times [2022-01-19 00:44:38,278 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:44:38,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575294486] [2022-01-19 00:44:38,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:44:38,278 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:44:38,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:44:38,311 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-01-19 00:44:38,311 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:44:38,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575294486] [2022-01-19 00:44:38,311 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575294486] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:44:38,311 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:44:38,311 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-19 00:44:38,312 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420373755] [2022-01-19 00:44:38,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:44:38,312 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-19 00:44:38,312 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:44:38,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-19 00:44:38,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-19 00:44:38,313 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 313 out of 353 [2022-01-19 00:44:38,314 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 420 places, 429 transitions, 1668 flow. Second operand has 5 states, 5 states have (on average 317.0) internal successors, (1585), 5 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 00:44:38,314 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:44:38,314 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 313 of 353 [2022-01-19 00:44:38,314 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:44:39,884 INFO L129 PetriNetUnfolder]: 1164/9843 cut-off events. [2022-01-19 00:44:39,884 INFO L130 PetriNetUnfolder]: For 4994/5032 co-relation queries the response was YES. [2022-01-19 00:44:39,963 INFO L84 FinitePrefix]: Finished finitePrefix Result has 17036 conditions, 9843 events. 1164/9843 cut-off events. For 4994/5032 co-relation queries the response was YES. Maximal size of possible extension queue 429. Compared 113044 event pairs, 416 based on Foata normal form. 74/8901 useless extension candidates. Maximal degree in co-relation 16984. Up to 1168 conditions per place. [2022-01-19 00:44:39,982 INFO L132 encePairwiseOnDemand]: 343/353 looper letters, 46 selfloop transitions, 19 changer transitions 0/446 dead transitions. [2022-01-19 00:44:39,982 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 426 places, 446 transitions, 1854 flow [2022-01-19 00:44:39,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 00:44:39,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 00:44:39,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2238 transitions. [2022-01-19 00:44:39,985 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.905706191825172 [2022-01-19 00:44:39,985 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 2238 transitions. [2022-01-19 00:44:39,985 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 2238 transitions. [2022-01-19 00:44:39,986 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:44:39,986 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 2238 transitions. [2022-01-19 00:44:39,988 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 319.7142857142857) internal successors, (2238), 7 states have internal predecessors, (2238), 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 00:44:39,990 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 353.0) internal successors, (2824), 8 states have internal predecessors, (2824), 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 00:44:39,990 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 353.0) internal successors, (2824), 8 states have internal predecessors, (2824), 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 00:44:39,990 INFO L186 Difference]: Start difference. First operand has 420 places, 429 transitions, 1668 flow. Second operand 7 states and 2238 transitions. [2022-01-19 00:44:39,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 426 places, 446 transitions, 1854 flow [2022-01-19 00:44:40,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 423 places, 446 transitions, 1841 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-01-19 00:44:40,023 INFO L242 Difference]: Finished difference. Result has 426 places, 435 transitions, 1751 flow [2022-01-19 00:44:40,023 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=353, PETRI_DIFFERENCE_MINUEND_FLOW=1655, PETRI_DIFFERENCE_MINUEND_PLACES=417, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=429, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=411, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1751, PETRI_PLACES=426, PETRI_TRANSITIONS=435} [2022-01-19 00:44:40,023 INFO L334 CegarLoopForPetriNet]: 314 programPoint places, 112 predicate places. [2022-01-19 00:44:40,023 INFO L470 AbstractCegarLoop]: Abstraction has has 426 places, 435 transitions, 1751 flow [2022-01-19 00:44:40,024 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 317.0) internal successors, (1585), 5 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 00:44:40,024 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:44:40,024 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:44:40,024 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-19 00:44:40,024 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:44:40,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:44:40,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1161617543, now seen corresponding path program 1 times [2022-01-19 00:44:40,025 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:44:40,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548180539] [2022-01-19 00:44:40,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:44:40,025 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:44:40,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:44:40,054 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-01-19 00:44:40,055 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:44:40,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548180539] [2022-01-19 00:44:40,055 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548180539] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:44:40,055 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:44:40,055 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 00:44:40,055 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432563552] [2022-01-19 00:44:40,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:44:40,056 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 00:44:40,056 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:44:40,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 00:44:40,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 00:44:40,057 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 307 out of 353 [2022-01-19 00:44:40,058 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 426 places, 435 transitions, 1751 flow. Second operand has 3 states, 3 states have (on average 312.6666666666667) internal successors, (938), 3 states have internal predecessors, (938), 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 00:44:40,058 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:44:40,058 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 307 of 353 [2022-01-19 00:44:40,058 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:44:44,408 INFO L129 PetriNetUnfolder]: 3174/27589 cut-off events. [2022-01-19 00:44:44,409 INFO L130 PetriNetUnfolder]: For 16718/18283 co-relation queries the response was YES. [2022-01-19 00:44:44,703 INFO L84 FinitePrefix]: Finished finitePrefix Result has 48080 conditions, 27589 events. 3174/27589 cut-off events. For 16718/18283 co-relation queries the response was YES. Maximal size of possible extension queue 663. Compared 385483 event pairs, 1289 based on Foata normal form. 48/25580 useless extension candidates. Maximal degree in co-relation 48025. Up to 3009 conditions per place. [2022-01-19 00:44:44,750 INFO L132 encePairwiseOnDemand]: 349/353 looper letters, 51 selfloop transitions, 3 changer transitions 0/452 dead transitions. [2022-01-19 00:44:44,750 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 428 places, 452 transitions, 1919 flow [2022-01-19 00:44:44,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 00:44:44,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 00:44:44,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 969 transitions. [2022-01-19 00:44:44,751 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9150141643059491 [2022-01-19 00:44:44,752 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 969 transitions. [2022-01-19 00:44:44,752 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 969 transitions. [2022-01-19 00:44:44,752 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:44:44,752 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 969 transitions. [2022-01-19 00:44:44,753 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 323.0) internal successors, (969), 3 states have internal predecessors, (969), 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 00:44:44,754 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 353.0) internal successors, (1412), 4 states have internal predecessors, (1412), 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 00:44:44,754 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 353.0) internal successors, (1412), 4 states have internal predecessors, (1412), 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 00:44:44,754 INFO L186 Difference]: Start difference. First operand has 426 places, 435 transitions, 1751 flow. Second operand 3 states and 969 transitions. [2022-01-19 00:44:44,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 428 places, 452 transitions, 1919 flow [2022-01-19 00:44:44,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 426 places, 452 transitions, 1895 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-01-19 00:44:44,940 INFO L242 Difference]: Finished difference. Result has 428 places, 437 transitions, 1749 flow [2022-01-19 00:44:44,941 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=353, PETRI_DIFFERENCE_MINUEND_FLOW=1727, PETRI_DIFFERENCE_MINUEND_PLACES=424, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=435, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=432, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1749, PETRI_PLACES=428, PETRI_TRANSITIONS=437} [2022-01-19 00:44:44,941 INFO L334 CegarLoopForPetriNet]: 314 programPoint places, 114 predicate places. [2022-01-19 00:44:44,941 INFO L470 AbstractCegarLoop]: Abstraction has has 428 places, 437 transitions, 1749 flow [2022-01-19 00:44:44,941 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 312.6666666666667) internal successors, (938), 3 states have internal predecessors, (938), 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 00:44:44,941 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:44:44,942 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:44:44,942 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-19 00:44:44,942 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:44:44,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:44:44,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1604949299, now seen corresponding path program 1 times [2022-01-19 00:44:44,942 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:44:44,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344715371] [2022-01-19 00:44:44,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:44:44,942 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:44:44,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:44:44,992 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-01-19 00:44:44,993 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:44:44,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344715371] [2022-01-19 00:44:44,993 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344715371] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:44:44,993 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:44:44,993 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 00:44:44,993 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447504587] [2022-01-19 00:44:44,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:44:44,993 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 00:44:44,993 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:44:44,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 00:44:44,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-19 00:44:44,995 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 353 [2022-01-19 00:44:44,996 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 428 places, 437 transitions, 1749 flow. Second operand has 6 states, 6 states have (on average 316.8333333333333) internal successors, (1901), 6 states have internal predecessors, (1901), 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 00:44:44,996 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:44:44,996 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 353 [2022-01-19 00:44:44,996 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:44:48,290 INFO L129 PetriNetUnfolder]: 1878/18064 cut-off events. [2022-01-19 00:44:48,290 INFO L130 PetriNetUnfolder]: For 8872/8947 co-relation queries the response was YES. [2022-01-19 00:44:48,491 INFO L84 FinitePrefix]: Finished finitePrefix Result has 31458 conditions, 18064 events. 1878/18064 cut-off events. For 8872/8947 co-relation queries the response was YES. Maximal size of possible extension queue 690. Compared 239582 event pairs, 673 based on Foata normal form. 107/16639 useless extension candidates. Maximal degree in co-relation 31401. Up to 2346 conditions per place. [2022-01-19 00:44:48,529 INFO L132 encePairwiseOnDemand]: 341/353 looper letters, 48 selfloop transitions, 13 changer transitions 0/460 dead transitions. [2022-01-19 00:44:48,529 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 434 places, 460 transitions, 1957 flow [2022-01-19 00:44:48,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 00:44:48,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 00:44:48,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2247 transitions. [2022-01-19 00:44:48,531 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9093484419263456 [2022-01-19 00:44:48,531 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 2247 transitions. [2022-01-19 00:44:48,532 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 2247 transitions. [2022-01-19 00:44:48,532 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:44:48,532 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 2247 transitions. [2022-01-19 00:44:48,534 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 321.0) internal successors, (2247), 7 states have internal predecessors, (2247), 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 00:44:48,536 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 353.0) internal successors, (2824), 8 states have internal predecessors, (2824), 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 00:44:48,536 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 353.0) internal successors, (2824), 8 states have internal predecessors, (2824), 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 00:44:48,536 INFO L186 Difference]: Start difference. First operand has 428 places, 437 transitions, 1749 flow. Second operand 7 states and 2247 transitions. [2022-01-19 00:44:48,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 434 places, 460 transitions, 1957 flow [2022-01-19 00:44:48,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 432 places, 460 transitions, 1951 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-01-19 00:44:48,724 INFO L242 Difference]: Finished difference. Result has 437 places, 447 transitions, 1856 flow [2022-01-19 00:44:48,724 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=353, PETRI_DIFFERENCE_MINUEND_FLOW=1743, PETRI_DIFFERENCE_MINUEND_PLACES=426, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=437, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=425, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1856, PETRI_PLACES=437, PETRI_TRANSITIONS=447} [2022-01-19 00:44:48,724 INFO L334 CegarLoopForPetriNet]: 314 programPoint places, 123 predicate places. [2022-01-19 00:44:48,724 INFO L470 AbstractCegarLoop]: Abstraction has has 437 places, 447 transitions, 1856 flow [2022-01-19 00:44:48,725 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 316.8333333333333) internal successors, (1901), 6 states have internal predecessors, (1901), 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 00:44:48,725 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:44:48,725 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:44:48,725 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-19 00:44:48,725 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:44:48,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:44:48,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1570120376, now seen corresponding path program 1 times [2022-01-19 00:44:48,725 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:44:48,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549460420] [2022-01-19 00:44:48,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:44:48,726 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:44:48,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:44:48,810 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-01-19 00:44:48,810 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:44:48,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549460420] [2022-01-19 00:44:48,810 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549460420] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 00:44:48,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1835716968] [2022-01-19 00:44:48,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:44:48,811 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 00:44:48,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 00:44:48,816 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 00:44:48,817 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 00:44:48,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:44:48,915 INFO L263 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 7 conjunts are in the unsatisfiable core [2022-01-19 00:44:48,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 00:44:49,160 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-01-19 00:44:49,161 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-19 00:44:49,161 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1835716968] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:44:49,161 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-19 00:44:49,161 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 11 [2022-01-19 00:44:49,161 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012163021] [2022-01-19 00:44:49,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:44:49,161 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 00:44:49,161 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:44:49,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 00:44:49,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-01-19 00:44:49,163 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 297 out of 353 [2022-01-19 00:44:49,164 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 437 places, 447 transitions, 1856 flow. Second operand has 6 states, 6 states have (on average 301.0) internal successors, (1806), 6 states have internal predecessors, (1806), 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 00:44:49,164 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:44:49,164 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 297 of 353 [2022-01-19 00:44:49,164 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:44:50,156 INFO L129 PetriNetUnfolder]: 439/5629 cut-off events. [2022-01-19 00:44:50,156 INFO L130 PetriNetUnfolder]: For 2940/5712 co-relation queries the response was YES. [2022-01-19 00:44:50,198 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10190 conditions, 5629 events. 439/5629 cut-off events. For 2940/5712 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 52606 event pairs, 116 based on Foata normal form. 45/5382 useless extension candidates. Maximal degree in co-relation 10128. Up to 403 conditions per place. [2022-01-19 00:44:50,205 INFO L132 encePairwiseOnDemand]: 343/353 looper letters, 59 selfloop transitions, 19 changer transitions 0/449 dead transitions. [2022-01-19 00:44:50,205 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 443 places, 449 transitions, 1943 flow [2022-01-19 00:44:50,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 00:44:50,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 00:44:50,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2736 transitions. [2022-01-19 00:44:50,209 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8611898016997167 [2022-01-19 00:44:50,209 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2736 transitions. [2022-01-19 00:44:50,209 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2736 transitions. [2022-01-19 00:44:50,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:44:50,209 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2736 transitions. [2022-01-19 00:44:50,211 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 304.0) internal successors, (2736), 9 states have internal predecessors, (2736), 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 00:44:50,213 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 353.0) internal successors, (3530), 10 states have internal predecessors, (3530), 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 00:44:50,213 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 353.0) internal successors, (3530), 10 states have internal predecessors, (3530), 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 00:44:50,213 INFO L186 Difference]: Start difference. First operand has 437 places, 447 transitions, 1856 flow. Second operand 9 states and 2736 transitions. [2022-01-19 00:44:50,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 443 places, 449 transitions, 1943 flow [2022-01-19 00:44:50,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 436 places, 449 transitions, 1877 flow, removed 23 selfloop flow, removed 7 redundant places. [2022-01-19 00:44:50,232 INFO L242 Difference]: Finished difference. Result has 440 places, 434 transitions, 1743 flow [2022-01-19 00:44:50,232 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=353, PETRI_DIFFERENCE_MINUEND_FLOW=1672, PETRI_DIFFERENCE_MINUEND_PLACES=428, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=430, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=412, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1743, PETRI_PLACES=440, PETRI_TRANSITIONS=434} [2022-01-19 00:44:50,233 INFO L334 CegarLoopForPetriNet]: 314 programPoint places, 126 predicate places. [2022-01-19 00:44:50,233 INFO L470 AbstractCegarLoop]: Abstraction has has 440 places, 434 transitions, 1743 flow [2022-01-19 00:44:50,233 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 301.0) internal successors, (1806), 6 states have internal predecessors, (1806), 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 00:44:50,233 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:44:50,233 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:44:50,250 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 00:44:50,444 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,SelfDestructingSolverStorable20 [2022-01-19 00:44:50,444 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:44:50,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:44:50,445 INFO L85 PathProgramCache]: Analyzing trace with hash 625962326, now seen corresponding path program 1 times [2022-01-19 00:44:50,445 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:44:50,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783251782] [2022-01-19 00:44:50,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:44:50,445 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:44:50,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:44:50,528 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-01-19 00:44:50,528 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:44:50,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783251782] [2022-01-19 00:44:50,528 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783251782] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 00:44:50,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1712190054] [2022-01-19 00:44:50,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:44:50,529 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 00:44:50,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 00:44:50,530 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 00:44:50,530 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 00:44:50,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:44:50,630 INFO L263 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 7 conjunts are in the unsatisfiable core [2022-01-19 00:44:50,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 00:44:50,895 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-01-19 00:44:50,895 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-19 00:44:50,895 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1712190054] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:44:50,895 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-19 00:44:50,895 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 11 [2022-01-19 00:44:50,895 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647390730] [2022-01-19 00:44:50,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:44:50,897 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 00:44:50,897 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:44:50,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 00:44:50,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-01-19 00:44:50,899 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 297 out of 353 [2022-01-19 00:44:50,899 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 440 places, 434 transitions, 1743 flow. Second operand has 6 states, 6 states have (on average 301.0) internal successors, (1806), 6 states have internal predecessors, (1806), 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 00:44:50,900 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:44:50,900 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 297 of 353 [2022-01-19 00:44:50,900 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:44:52,091 INFO L129 PetriNetUnfolder]: 1096/6554 cut-off events. [2022-01-19 00:44:52,092 INFO L130 PetriNetUnfolder]: For 3722/3735 co-relation queries the response was YES. [2022-01-19 00:44:52,153 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12306 conditions, 6554 events. 1096/6554 cut-off events. For 3722/3735 co-relation queries the response was YES. Maximal size of possible extension queue 620. Compared 74329 event pairs, 684 based on Foata normal form. 0/5572 useless extension candidates. Maximal degree in co-relation 12245. Up to 1695 conditions per place. [2022-01-19 00:44:52,166 INFO L132 encePairwiseOnDemand]: 343/353 looper letters, 43 selfloop transitions, 4 changer transitions 62/431 dead transitions. [2022-01-19 00:44:52,166 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 446 places, 431 transitions, 1797 flow [2022-01-19 00:44:52,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 00:44:52,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 00:44:52,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2735 transitions. [2022-01-19 00:44:52,169 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8608750393452943 [2022-01-19 00:44:52,169 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2735 transitions. [2022-01-19 00:44:52,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2735 transitions. [2022-01-19 00:44:52,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:44:52,170 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2735 transitions. [2022-01-19 00:44:52,172 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 303.8888888888889) internal successors, (2735), 9 states have internal predecessors, (2735), 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 00:44:52,174 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 353.0) internal successors, (3530), 10 states have internal predecessors, (3530), 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 00:44:52,174 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 353.0) internal successors, (3530), 10 states have internal predecessors, (3530), 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 00:44:52,175 INFO L186 Difference]: Start difference. First operand has 440 places, 434 transitions, 1743 flow. Second operand 9 states and 2735 transitions. [2022-01-19 00:44:52,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 446 places, 431 transitions, 1797 flow [2022-01-19 00:44:52,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 434 places, 431 transitions, 1701 flow, removed 26 selfloop flow, removed 12 redundant places. [2022-01-19 00:44:52,198 INFO L242 Difference]: Finished difference. Result has 437 places, 369 transitions, 1230 flow [2022-01-19 00:44:52,198 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=353, PETRI_DIFFERENCE_MINUEND_FLOW=1505, PETRI_DIFFERENCE_MINUEND_PLACES=426, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=414, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=410, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1230, PETRI_PLACES=437, PETRI_TRANSITIONS=369} [2022-01-19 00:44:52,199 INFO L334 CegarLoopForPetriNet]: 314 programPoint places, 123 predicate places. [2022-01-19 00:44:52,199 INFO L470 AbstractCegarLoop]: Abstraction has has 437 places, 369 transitions, 1230 flow [2022-01-19 00:44:52,199 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 301.0) internal successors, (1806), 6 states have internal predecessors, (1806), 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 00:44:52,199 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:44:52,199 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:44:52,216 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 00:44:52,400 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 00:44:52,400 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:44:52,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:44:52,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1422028368, now seen corresponding path program 1 times [2022-01-19 00:44:52,401 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:44:52,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977663812] [2022-01-19 00:44:52,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:44:52,401 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:44:52,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:44:52,561 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-01-19 00:44:52,561 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:44:52,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977663812] [2022-01-19 00:44:52,561 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977663812] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:44:52,561 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:44:52,561 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-01-19 00:44:52,561 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095428790] [2022-01-19 00:44:52,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:44:52,562 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-01-19 00:44:52,562 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:44:52,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-01-19 00:44:52,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2022-01-19 00:44:52,565 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 252 out of 353 [2022-01-19 00:44:52,567 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 437 places, 369 transitions, 1230 flow. Second operand has 17 states, 17 states have (on average 254.94117647058823) internal successors, (4334), 17 states have internal predecessors, (4334), 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 00:44:52,567 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:44:52,567 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 252 of 353 [2022-01-19 00:44:52,567 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:45:03,629 INFO L129 PetriNetUnfolder]: 16930/58230 cut-off events. [2022-01-19 00:45:03,629 INFO L130 PetriNetUnfolder]: For 33522/35276 co-relation queries the response was YES. [2022-01-19 00:45:04,911 INFO L84 FinitePrefix]: Finished finitePrefix Result has 122763 conditions, 58230 events. 16930/58230 cut-off events. For 33522/35276 co-relation queries the response was YES. Maximal size of possible extension queue 1165. Compared 768837 event pairs, 7521 based on Foata normal form. 1026/57441 useless extension candidates. Maximal degree in co-relation 122706. Up to 17276 conditions per place. [2022-01-19 00:45:05,090 INFO L132 encePairwiseOnDemand]: 331/353 looper letters, 502 selfloop transitions, 62 changer transitions 0/831 dead transitions. [2022-01-19 00:45:05,091 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 441 places, 831 transitions, 4090 flow [2022-01-19 00:45:05,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-01-19 00:45:05,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2022-01-19 00:45:05,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 10794 transitions. [2022-01-19 00:45:05,097 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7458025288468182 [2022-01-19 00:45:05,097 INFO L72 ComplementDD]: Start complementDD. Operand 41 states and 10794 transitions. [2022-01-19 00:45:05,097 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 10794 transitions. [2022-01-19 00:45:05,112 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:45:05,112 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 41 states and 10794 transitions. [2022-01-19 00:45:05,120 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 42 states, 41 states have (on average 263.2682926829268) internal successors, (10794), 41 states have internal predecessors, (10794), 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 00:45:05,146 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 42 states, 42 states have (on average 353.0) internal successors, (14826), 42 states have internal predecessors, (14826), 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 00:45:05,147 INFO L81 ComplementDD]: Finished complementDD. Result has 42 states, 42 states have (on average 353.0) internal successors, (14826), 42 states have internal predecessors, (14826), 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 00:45:05,147 INFO L186 Difference]: Start difference. First operand has 437 places, 369 transitions, 1230 flow. Second operand 41 states and 10794 transitions. [2022-01-19 00:45:05,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 441 places, 831 transitions, 4090 flow [2022-01-19 00:45:05,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 415 places, 831 transitions, 3890 flow, removed 89 selfloop flow, removed 26 redundant places. [2022-01-19 00:45:05,965 INFO L242 Difference]: Finished difference. Result has 445 places, 424 transitions, 1604 flow [2022-01-19 00:45:05,966 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=353, PETRI_DIFFERENCE_MINUEND_FLOW=1146, PETRI_DIFFERENCE_MINUEND_PLACES=375, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=347, PETRI_DIFFERENCE_SUBTRAHEND_STATES=41, PETRI_FLOW=1604, PETRI_PLACES=445, PETRI_TRANSITIONS=424} [2022-01-19 00:45:05,966 INFO L334 CegarLoopForPetriNet]: 314 programPoint places, 131 predicate places. [2022-01-19 00:45:05,966 INFO L470 AbstractCegarLoop]: Abstraction has has 445 places, 424 transitions, 1604 flow [2022-01-19 00:45:05,967 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 254.94117647058823) internal successors, (4334), 17 states have internal predecessors, (4334), 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 00:45:05,967 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:45:05,967 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:45:05,967 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-19 00:45:05,967 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:45:05,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:45:05,968 INFO L85 PathProgramCache]: Analyzing trace with hash 739231410, now seen corresponding path program 2 times [2022-01-19 00:45:05,968 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:45:05,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329032923] [2022-01-19 00:45:05,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:45:05,968 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:45:05,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:45:06,119 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-01-19 00:45:06,119 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:45:06,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329032923] [2022-01-19 00:45:06,120 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329032923] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:45:06,120 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:45:06,120 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-01-19 00:45:06,120 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896266439] [2022-01-19 00:45:06,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:45:06,120 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-01-19 00:45:06,120 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:45:06,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-01-19 00:45:06,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2022-01-19 00:45:06,123 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 252 out of 353 [2022-01-19 00:45:06,125 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 445 places, 424 transitions, 1604 flow. Second operand has 17 states, 17 states have (on average 254.94117647058823) internal successors, (4334), 17 states have internal predecessors, (4334), 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 00:45:06,125 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:45:06,125 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 252 of 353 [2022-01-19 00:45:06,125 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:45:18,633 INFO L129 PetriNetUnfolder]: 17233/60373 cut-off events. [2022-01-19 00:45:18,634 INFO L130 PetriNetUnfolder]: For 57201/59036 co-relation queries the response was YES. [2022-01-19 00:45:19,661 INFO L84 FinitePrefix]: Finished finitePrefix Result has 144624 conditions, 60373 events. 17233/60373 cut-off events. For 57201/59036 co-relation queries the response was YES. Maximal size of possible extension queue 1157. Compared 799323 event pairs, 7611 based on Foata normal form. 972/57180 useless extension candidates. Maximal degree in co-relation 144558. Up to 17252 conditions per place. [2022-01-19 00:45:19,827 INFO L132 encePairwiseOnDemand]: 331/353 looper letters, 544 selfloop transitions, 96 changer transitions 0/907 dead transitions. [2022-01-19 00:45:19,827 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 485 places, 907 transitions, 5116 flow [2022-01-19 00:45:19,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-01-19 00:45:19,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2022-01-19 00:45:19,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 10787 transitions. [2022-01-19 00:45:19,843 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7453188696192911 [2022-01-19 00:45:19,843 INFO L72 ComplementDD]: Start complementDD. Operand 41 states and 10787 transitions. [2022-01-19 00:45:19,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 10787 transitions. [2022-01-19 00:45:19,845 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:45:19,845 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 41 states and 10787 transitions. [2022-01-19 00:45:19,855 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 42 states, 41 states have (on average 263.0975609756098) internal successors, (10787), 41 states have internal predecessors, (10787), 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 00:45:19,865 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 42 states, 42 states have (on average 353.0) internal successors, (14826), 42 states have internal predecessors, (14826), 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 00:45:19,866 INFO L81 ComplementDD]: Finished complementDD. Result has 42 states, 42 states have (on average 353.0) internal successors, (14826), 42 states have internal predecessors, (14826), 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 00:45:19,866 INFO L186 Difference]: Start difference. First operand has 445 places, 424 transitions, 1604 flow. Second operand 41 states and 10787 transitions. [2022-01-19 00:45:19,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 485 places, 907 transitions, 5116 flow [2022-01-19 00:45:20,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 480 places, 907 transitions, 4939 flow, removed 25 selfloop flow, removed 5 redundant places. [2022-01-19 00:45:20,700 INFO L242 Difference]: Finished difference. Result has 510 places, 480 transitions, 2316 flow [2022-01-19 00:45:20,700 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=353, PETRI_DIFFERENCE_MINUEND_FLOW=1568, PETRI_DIFFERENCE_MINUEND_PLACES=440, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=424, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=369, PETRI_DIFFERENCE_SUBTRAHEND_STATES=41, PETRI_FLOW=2316, PETRI_PLACES=510, PETRI_TRANSITIONS=480} [2022-01-19 00:45:20,701 INFO L334 CegarLoopForPetriNet]: 314 programPoint places, 196 predicate places. [2022-01-19 00:45:20,701 INFO L470 AbstractCegarLoop]: Abstraction has has 510 places, 480 transitions, 2316 flow [2022-01-19 00:45:20,701 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 254.94117647058823) internal successors, (4334), 17 states have internal predecessors, (4334), 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 00:45:20,701 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:45:20,702 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:45:20,702 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-19 00:45:20,702 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:45:20,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:45:20,702 INFO L85 PathProgramCache]: Analyzing trace with hash 186949176, now seen corresponding path program 3 times [2022-01-19 00:45:20,702 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:45:20,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176584850] [2022-01-19 00:45:20,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:45:20,702 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:45:20,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:45:20,865 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-01-19 00:45:20,865 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:45:20,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176584850] [2022-01-19 00:45:20,865 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176584850] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:45:20,865 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:45:20,865 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-01-19 00:45:20,865 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711464476] [2022-01-19 00:45:20,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:45:20,866 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-01-19 00:45:20,866 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:45:20,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-01-19 00:45:20,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2022-01-19 00:45:20,868 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 252 out of 353 [2022-01-19 00:45:20,870 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 510 places, 480 transitions, 2316 flow. Second operand has 17 states, 17 states have (on average 254.94117647058823) internal successors, (4334), 17 states have internal predecessors, (4334), 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 00:45:20,870 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:45:20,870 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 252 of 353 [2022-01-19 00:45:20,870 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:45:34,503 INFO L129 PetriNetUnfolder]: 17855/62280 cut-off events. [2022-01-19 00:45:34,503 INFO L130 PetriNetUnfolder]: For 119521/121395 co-relation queries the response was YES. [2022-01-19 00:45:36,037 INFO L84 FinitePrefix]: Finished finitePrefix Result has 169636 conditions, 62280 events. 17855/62280 cut-off events. For 119521/121395 co-relation queries the response was YES. Maximal size of possible extension queue 1221. Compared 831432 event pairs, 7721 based on Foata normal form. 1026/59226 useless extension candidates. Maximal degree in co-relation 169539. Up to 17276 conditions per place. [2022-01-19 00:45:36,199 INFO L132 encePairwiseOnDemand]: 331/353 looper letters, 514 selfloop transitions, 110 changer transitions 0/891 dead transitions. [2022-01-19 00:45:36,199 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 549 places, 891 transitions, 6390 flow [2022-01-19 00:45:36,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-01-19 00:45:36,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2022-01-19 00:45:36,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 10500 transitions. [2022-01-19 00:45:36,205 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7436260623229461 [2022-01-19 00:45:36,205 INFO L72 ComplementDD]: Start complementDD. Operand 40 states and 10500 transitions. [2022-01-19 00:45:36,205 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 10500 transitions. [2022-01-19 00:45:36,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:45:36,207 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 40 states and 10500 transitions. [2022-01-19 00:45:36,213 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 41 states, 40 states have (on average 262.5) internal successors, (10500), 40 states have internal predecessors, (10500), 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 00:45:36,221 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 41 states, 41 states have (on average 353.0) internal successors, (14473), 41 states have internal predecessors, (14473), 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 00:45:36,221 INFO L81 ComplementDD]: Finished complementDD. Result has 41 states, 41 states have (on average 353.0) internal successors, (14473), 41 states have internal predecessors, (14473), 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 00:45:36,221 INFO L186 Difference]: Start difference. First operand has 510 places, 480 transitions, 2316 flow. Second operand 40 states and 10500 transitions. [2022-01-19 00:45:36,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 549 places, 891 transitions, 6390 flow [2022-01-19 00:45:37,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 544 places, 891 transitions, 5951 flow, removed 141 selfloop flow, removed 5 redundant places. [2022-01-19 00:45:37,783 INFO L242 Difference]: Finished difference. Result has 572 places, 532 transitions, 3102 flow [2022-01-19 00:45:37,784 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=353, PETRI_DIFFERENCE_MINUEND_FLOW=2128, PETRI_DIFFERENCE_MINUEND_PLACES=505, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=480, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=408, PETRI_DIFFERENCE_SUBTRAHEND_STATES=40, PETRI_FLOW=3102, PETRI_PLACES=572, PETRI_TRANSITIONS=532} [2022-01-19 00:45:37,784 INFO L334 CegarLoopForPetriNet]: 314 programPoint places, 258 predicate places. [2022-01-19 00:45:37,784 INFO L470 AbstractCegarLoop]: Abstraction has has 572 places, 532 transitions, 3102 flow [2022-01-19 00:45:37,785 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 254.94117647058823) internal successors, (4334), 17 states have internal predecessors, (4334), 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 00:45:37,785 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:45:37,785 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:45:37,785 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-19 00:45:37,785 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:45:37,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:45:37,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1109768790, now seen corresponding path program 4 times [2022-01-19 00:45:37,785 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:45:37,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600740898] [2022-01-19 00:45:37,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:45:37,786 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:45:37,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:45:37,940 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-01-19 00:45:37,940 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:45:37,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600740898] [2022-01-19 00:45:37,940 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600740898] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:45:37,940 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:45:37,940 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-01-19 00:45:37,940 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949386662] [2022-01-19 00:45:37,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:45:37,941 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-01-19 00:45:37,941 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:45:37,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-01-19 00:45:37,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2022-01-19 00:45:37,943 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 252 out of 353 [2022-01-19 00:45:37,944 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 572 places, 532 transitions, 3102 flow. Second operand has 17 states, 17 states have (on average 254.94117647058823) internal successors, (4334), 17 states have internal predecessors, (4334), 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 00:45:37,945 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:45:37,945 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 252 of 353 [2022-01-19 00:45:37,945 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:45:53,414 INFO L129 PetriNetUnfolder]: 18529/66445 cut-off events. [2022-01-19 00:45:53,414 INFO L130 PetriNetUnfolder]: For 204365/206452 co-relation queries the response was YES. [2022-01-19 00:45:55,684 INFO L84 FinitePrefix]: Finished finitePrefix Result has 193731 conditions, 66445 events. 18529/66445 cut-off events. For 204365/206452 co-relation queries the response was YES. Maximal size of possible extension queue 1233. Compared 895320 event pairs, 7707 based on Foata normal form. 972/63013 useless extension candidates. Maximal degree in co-relation 193605. Up to 17252 conditions per place. [2022-01-19 00:45:55,867 INFO L132 encePairwiseOnDemand]: 331/353 looper letters, 558 selfloop transitions, 135 changer transitions 0/960 dead transitions. [2022-01-19 00:45:55,867 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 611 places, 960 transitions, 7809 flow [2022-01-19 00:45:55,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-01-19 00:45:55,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2022-01-19 00:45:55,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 10497 transitions. [2022-01-19 00:45:55,873 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7434135977337111 [2022-01-19 00:45:55,873 INFO L72 ComplementDD]: Start complementDD. Operand 40 states and 10497 transitions. [2022-01-19 00:45:55,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 10497 transitions. [2022-01-19 00:45:55,874 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:45:55,874 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 40 states and 10497 transitions. [2022-01-19 00:45:55,883 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 41 states, 40 states have (on average 262.425) internal successors, (10497), 40 states have internal predecessors, (10497), 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 00:45:55,894 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 41 states, 41 states have (on average 353.0) internal successors, (14473), 41 states have internal predecessors, (14473), 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 00:45:55,895 INFO L81 ComplementDD]: Finished complementDD. Result has 41 states, 41 states have (on average 353.0) internal successors, (14473), 41 states have internal predecessors, (14473), 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 00:45:55,895 INFO L186 Difference]: Start difference. First operand has 572 places, 532 transitions, 3102 flow. Second operand 40 states and 10497 transitions. [2022-01-19 00:45:55,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 611 places, 960 transitions, 7809 flow [2022-01-19 00:45:58,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 607 places, 960 transitions, 7298 flow, removed 205 selfloop flow, removed 4 redundant places. [2022-01-19 00:45:58,551 INFO L242 Difference]: Finished difference. Result has 635 places, 584 transitions, 3985 flow [2022-01-19 00:45:58,552 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=353, PETRI_DIFFERENCE_MINUEND_FLOW=2782, PETRI_DIFFERENCE_MINUEND_PLACES=568, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=532, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=435, PETRI_DIFFERENCE_SUBTRAHEND_STATES=40, PETRI_FLOW=3985, PETRI_PLACES=635, PETRI_TRANSITIONS=584} [2022-01-19 00:45:58,552 INFO L334 CegarLoopForPetriNet]: 314 programPoint places, 321 predicate places. [2022-01-19 00:45:58,552 INFO L470 AbstractCegarLoop]: Abstraction has has 635 places, 584 transitions, 3985 flow [2022-01-19 00:45:58,553 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 254.94117647058823) internal successors, (4334), 17 states have internal predecessors, (4334), 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 00:45:58,553 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:45:58,553 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:45:58,553 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-19 00:45:58,553 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:45:58,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:45:58,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1878427122, now seen corresponding path program 5 times [2022-01-19 00:45:58,553 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:45:58,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584562795] [2022-01-19 00:45:58,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:45:58,554 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:45:58,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:45:58,689 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-01-19 00:45:58,689 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:45:58,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584562795] [2022-01-19 00:45:58,689 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584562795] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:45:58,689 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:45:58,689 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-01-19 00:45:58,689 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100425326] [2022-01-19 00:45:58,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:45:58,689 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-01-19 00:45:58,690 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:45:58,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-01-19 00:45:58,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2022-01-19 00:45:58,693 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 252 out of 353 [2022-01-19 00:45:58,695 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 635 places, 584 transitions, 3985 flow. Second operand has 17 states, 17 states have (on average 254.94117647058823) internal successors, (4334), 17 states have internal predecessors, (4334), 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 00:45:58,695 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:45:58,695 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 252 of 353 [2022-01-19 00:45:58,695 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:46:16,386 INFO L129 PetriNetUnfolder]: 19535/69392 cut-off events. [2022-01-19 00:46:16,386 INFO L130 PetriNetUnfolder]: For 339230/341186 co-relation queries the response was YES. [2022-01-19 00:46:19,333 INFO L84 FinitePrefix]: Finished finitePrefix Result has 226527 conditions, 69392 events. 19535/69392 cut-off events. For 339230/341186 co-relation queries the response was YES. Maximal size of possible extension queue 1314. Compared 940143 event pairs, 8077 based on Foata normal form. 1027/66030 useless extension candidates. Maximal degree in co-relation 226373. Up to 17276 conditions per place. [2022-01-19 00:46:19,526 INFO L132 encePairwiseOnDemand]: 331/353 looper letters, 589 selfloop transitions, 127 changer transitions 0/983 dead transitions. [2022-01-19 00:46:19,526 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 674 places, 983 transitions, 9421 flow [2022-01-19 00:46:19,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-01-19 00:46:19,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2022-01-19 00:46:19,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 10485 transitions. [2022-01-19 00:46:19,531 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7425637393767706 [2022-01-19 00:46:19,531 INFO L72 ComplementDD]: Start complementDD. Operand 40 states and 10485 transitions. [2022-01-19 00:46:19,531 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 10485 transitions. [2022-01-19 00:46:19,532 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:46:19,532 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 40 states and 10485 transitions. [2022-01-19 00:46:19,538 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 41 states, 40 states have (on average 262.125) internal successors, (10485), 40 states have internal predecessors, (10485), 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 00:46:19,545 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 41 states, 41 states have (on average 353.0) internal successors, (14473), 41 states have internal predecessors, (14473), 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 00:46:19,546 INFO L81 ComplementDD]: Finished complementDD. Result has 41 states, 41 states have (on average 353.0) internal successors, (14473), 41 states have internal predecessors, (14473), 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 00:46:19,546 INFO L186 Difference]: Start difference. First operand has 635 places, 584 transitions, 3985 flow. Second operand 40 states and 10485 transitions. [2022-01-19 00:46:19,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 674 places, 983 transitions, 9421 flow [2022-01-19 00:46:22,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 670 places, 983 transitions, 8689 flow, removed 308 selfloop flow, removed 4 redundant places. [2022-01-19 00:46:22,869 INFO L242 Difference]: Finished difference. Result has 699 places, 637 transitions, 4960 flow [2022-01-19 00:46:22,869 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=353, PETRI_DIFFERENCE_MINUEND_FLOW=3514, PETRI_DIFFERENCE_MINUEND_PLACES=631, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=584, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=494, PETRI_DIFFERENCE_SUBTRAHEND_STATES=40, PETRI_FLOW=4960, PETRI_PLACES=699, PETRI_TRANSITIONS=637} [2022-01-19 00:46:22,870 INFO L334 CegarLoopForPetriNet]: 314 programPoint places, 385 predicate places. [2022-01-19 00:46:22,870 INFO L470 AbstractCegarLoop]: Abstraction has has 699 places, 637 transitions, 4960 flow [2022-01-19 00:46:22,870 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 254.94117647058823) internal successors, (4334), 17 states have internal predecessors, (4334), 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 00:46:22,870 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:46:22,871 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:46:22,871 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-01-19 00:46:22,871 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 00:46:22,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:46:22,871 INFO L85 PathProgramCache]: Analyzing trace with hash 555993134, now seen corresponding path program 6 times [2022-01-19 00:46:22,871 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:46:22,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11712530] [2022-01-19 00:46:22,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:46:22,871 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:46:22,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:46:23,042 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-01-19 00:46:23,042 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:46:23,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11712530] [2022-01-19 00:46:23,042 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11712530] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:46:23,042 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:46:23,042 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-01-19 00:46:23,042 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898626546] [2022-01-19 00:46:23,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:46:23,043 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-01-19 00:46:23,043 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:46:23,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-01-19 00:46:23,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2022-01-19 00:46:23,045 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 252 out of 353 [2022-01-19 00:46:23,052 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 699 places, 637 transitions, 4960 flow. Second operand has 17 states, 17 states have (on average 254.94117647058823) internal successors, (4334), 17 states have internal predecessors, (4334), 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 00:46:23,052 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:46:23,052 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 252 of 353 [2022-01-19 00:46:23,052 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand