/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe-After.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/chl-match-trans.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bf34d27 [2022-01-19 13:07:08,681 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-19 13:07:08,683 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-19 13:07:08,721 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-19 13:07:08,721 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-19 13:07:08,733 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-19 13:07:08,734 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-19 13:07:08,735 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-19 13:07:08,736 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-19 13:07:08,736 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-19 13:07:08,737 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-19 13:07:08,737 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-19 13:07:08,738 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-19 13:07:08,738 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-19 13:07:08,739 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-19 13:07:08,739 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-19 13:07:08,740 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-19 13:07:08,740 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-19 13:07:08,741 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-19 13:07:08,742 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-19 13:07:08,743 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-19 13:07:08,743 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-19 13:07:08,744 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-19 13:07:08,744 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-19 13:07:08,746 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-19 13:07:08,746 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-19 13:07:08,746 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-19 13:07:08,746 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-19 13:07:08,747 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-19 13:07:08,747 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-19 13:07:08,747 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-19 13:07:08,748 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-19 13:07:08,748 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-19 13:07:08,749 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-19 13:07:08,749 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-19 13:07:08,749 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-19 13:07:08,750 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-19 13:07:08,750 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-19 13:07:08,750 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-19 13:07:08,750 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-19 13:07:08,751 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-19 13:07:08,764 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe-After.epf [2022-01-19 13:07:08,788 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-19 13:07:08,788 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-19 13:07:08,789 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-19 13:07:08,789 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-19 13:07:08,789 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-19 13:07:08,789 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-19 13:07:08,789 INFO L138 SettingsManager]: * Use SBE=true [2022-01-19 13:07:08,789 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-19 13:07:08,790 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-19 13:07:08,790 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-19 13:07:08,790 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-19 13:07:08,790 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-19 13:07:08,790 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-19 13:07:08,791 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-19 13:07:08,791 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-19 13:07:08,791 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-19 13:07:08,791 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-19 13:07:08,791 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-19 13:07:08,791 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-19 13:07:08,791 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-19 13:07:08,791 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-19 13:07:08,791 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-19 13:07:08,791 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-19 13:07:08,792 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 13:07:08,792 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-19 13:07:08,792 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-19 13:07:08,792 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-19 13:07:08,792 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-19 13:07:08,792 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-19 13:07:08,792 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-19 13:07:08,792 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-19 13:07:08,792 INFO L138 SettingsManager]: * When to check the insufficient erros location relative to the other error locations=AFTER [2022-01-19 13:07:08,792 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-01-19 13:07:08,975 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-19 13:07:08,989 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-19 13:07:08,990 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-19 13:07:08,991 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-19 13:07:08,991 INFO L275 PluginConnector]: CDTParser initialized [2022-01-19 13:07:08,992 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-match-trans.wvr.c [2022-01-19 13:07:09,036 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c07843740/56d08d4d674c47eb847725e276f3219f/FLAG2f84fe660 [2022-01-19 13:07:09,424 INFO L306 CDTParser]: Found 1 translation units. [2022-01-19 13:07:09,424 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-match-trans.wvr.c [2022-01-19 13:07:09,432 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c07843740/56d08d4d674c47eb847725e276f3219f/FLAG2f84fe660 [2022-01-19 13:07:09,444 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c07843740/56d08d4d674c47eb847725e276f3219f [2022-01-19 13:07:09,447 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-19 13:07:09,448 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-19 13:07:09,449 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-19 13:07:09,449 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-19 13:07:09,451 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-19 13:07:09,451 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 01:07:09" (1/1) ... [2022-01-19 13:07:09,452 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54b72c98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:07:09, skipping insertion in model container [2022-01-19 13:07:09,452 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 01:07:09" (1/1) ... [2022-01-19 13:07:09,456 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-19 13:07:09,472 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-19 13:07:09,642 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-match-trans.wvr.c[2954,2967] [2022-01-19 13:07:09,653 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 13:07:09,659 INFO L203 MainTranslator]: Completed pre-run [2022-01-19 13:07:09,678 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-match-trans.wvr.c[2954,2967] [2022-01-19 13:07:09,680 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 13:07:09,690 INFO L208 MainTranslator]: Completed translation [2022-01-19 13:07:09,691 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:07:09 WrapperNode [2022-01-19 13:07:09,691 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-19 13:07:09,692 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-19 13:07:09,692 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-19 13:07:09,692 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-19 13:07:09,697 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:07:09" (1/1) ... [2022-01-19 13:07:09,710 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:07:09" (1/1) ... [2022-01-19 13:07:09,745 INFO L137 Inliner]: procedures = 23, calls = 33, calls flagged for inlining = 11, calls inlined = 21, statements flattened = 250 [2022-01-19 13:07:09,746 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-19 13:07:09,746 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-19 13:07:09,746 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-19 13:07:09,746 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-19 13:07:09,751 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:07:09" (1/1) ... [2022-01-19 13:07:09,752 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:07:09" (1/1) ... [2022-01-19 13:07:09,755 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:07:09" (1/1) ... [2022-01-19 13:07:09,755 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:07:09" (1/1) ... [2022-01-19 13:07:09,759 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:07:09" (1/1) ... [2022-01-19 13:07:09,761 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:07:09" (1/1) ... [2022-01-19 13:07:09,763 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:07:09" (1/1) ... [2022-01-19 13:07:09,774 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-19 13:07:09,775 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-19 13:07:09,775 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-19 13:07:09,775 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-19 13:07:09,777 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:07:09" (1/1) ... [2022-01-19 13:07:09,781 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 13:07:09,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 13:07:09,807 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-19 13:07:09,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-19 13:07:09,833 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-19 13:07:09,833 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-01-19 13:07:09,833 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-01-19 13:07:09,834 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-01-19 13:07:09,834 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-01-19 13:07:09,834 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-01-19 13:07:09,834 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-01-19 13:07:09,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-19 13:07:09,834 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-19 13:07:09,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-19 13:07:09,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-19 13:07:09,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-19 13:07:09,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-19 13:07:09,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-19 13:07:09,835 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-19 13:07:09,894 INFO L234 CfgBuilder]: Building ICFG [2022-01-19 13:07:09,895 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-19 13:07:10,238 INFO L275 CfgBuilder]: Performing block encoding [2022-01-19 13:07:10,246 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-19 13:07:10,246 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-01-19 13:07:10,248 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 01:07:10 BoogieIcfgContainer [2022-01-19 13:07:10,248 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-19 13:07:10,249 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-19 13:07:10,249 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-19 13:07:10,255 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-19 13:07:10,255 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.01 01:07:09" (1/3) ... [2022-01-19 13:07:10,256 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e4a4e97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 01:07:10, skipping insertion in model container [2022-01-19 13:07:10,256 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:07:09" (2/3) ... [2022-01-19 13:07:10,256 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e4a4e97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 01:07:10, skipping insertion in model container [2022-01-19 13:07:10,256 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 01:07:10" (3/3) ... [2022-01-19 13:07:10,257 INFO L111 eAbstractionObserver]: Analyzing ICFG chl-match-trans.wvr.c [2022-01-19 13:07:10,260 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-19 13:07:10,260 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-19 13:07:10,261 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-19 13:07:10,320 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,320 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,320 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,320 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,320 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,320 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,320 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,321 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,321 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,321 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,321 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,321 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,321 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,321 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,321 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,321 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,321 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,322 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,322 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,322 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,322 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,322 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,322 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,323 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,323 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,323 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,323 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,323 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,324 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,324 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,324 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,324 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,324 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,324 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,324 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,325 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,325 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,325 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,325 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,325 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,325 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,326 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,326 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,326 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,326 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,327 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,327 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,327 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,327 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,327 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,327 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,328 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,328 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,328 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,328 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,328 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,329 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,329 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,329 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,329 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,329 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,330 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,330 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,330 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~s1~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,330 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,330 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~s1~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,330 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,330 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,331 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,331 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,331 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,331 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,331 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,331 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,331 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,331 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,332 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,332 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,332 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,332 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,332 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,332 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,332 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,332 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,332 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,333 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,333 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,333 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,333 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,334 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,334 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,334 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,336 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,340 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,340 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,340 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,340 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,340 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,340 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,340 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,340 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,340 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,340 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,341 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,341 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,342 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,342 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,342 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,342 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,343 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,343 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,343 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,343 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,343 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,343 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,343 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,343 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,344 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,344 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,344 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,344 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,344 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,344 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,344 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,345 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,345 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,345 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,345 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,345 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,351 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,351 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,352 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~s2~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,352 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,352 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~s2~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,352 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,352 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,352 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,352 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,353 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,353 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,353 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,353 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,353 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~s2~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,353 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~s1~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,353 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~s2~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,353 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~s1~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,353 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~s2~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,353 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~s1~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,354 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~s2~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,354 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~s1~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,354 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,354 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,354 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,354 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,354 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,354 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,354 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,354 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,354 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~s2~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,355 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~s1~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,355 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~s2~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,355 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~s1~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,355 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~s2~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,355 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~s1~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,355 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~s2~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,355 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~s1~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,355 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,355 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,355 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,356 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,356 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,356 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,356 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,356 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,356 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,356 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,356 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,356 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,356 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,356 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,357 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,357 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,357 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,357 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,357 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,357 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,357 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,357 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,358 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,358 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,358 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,358 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,358 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,358 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,358 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,358 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,358 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,358 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,359 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,359 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,359 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,359 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,359 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,359 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,359 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,359 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,359 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,359 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,359 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,360 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,360 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,360 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,360 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,360 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,360 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,360 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,361 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,361 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,361 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,361 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,361 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,361 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,361 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,361 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,361 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,362 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,362 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,362 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,362 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,362 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,362 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,362 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,362 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,362 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,362 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,362 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,363 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,363 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,363 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,363 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,363 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,363 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,363 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,363 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,363 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,363 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,364 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,364 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,364 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,364 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,364 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,364 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~s1~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,364 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,364 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~s1~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,364 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,364 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,365 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,365 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,365 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,365 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,365 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,365 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,365 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,365 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,365 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,365 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,365 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,366 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,366 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,366 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,366 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,366 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,366 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,366 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,366 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,366 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,366 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,366 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,367 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,367 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,367 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,367 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,367 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,367 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,367 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,367 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,367 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,367 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,368 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,368 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,368 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,368 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,368 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,368 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,368 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,368 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,368 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,369 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,369 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,369 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,369 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,369 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,369 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,369 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,369 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,369 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,369 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,370 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,370 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,370 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,370 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,370 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,370 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,370 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,370 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,370 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,370 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,371 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,371 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,374 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~s2~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,374 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,374 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~s2~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,374 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,374 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,374 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,374 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,374 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,375 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,375 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,375 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,375 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~s2~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,375 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~s1~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,375 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~s2~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,375 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~s1~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,375 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~s2~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,375 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~s1~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,375 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~s2~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,376 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~s1~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,376 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,376 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,376 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,376 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,376 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,376 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,376 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,376 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,376 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~s2~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,377 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~s1~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,378 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~s2~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,378 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~s1~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,378 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~s2~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,378 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~s1~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,379 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~s2~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,379 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~s1~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,379 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,379 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,379 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,379 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,379 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,379 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,379 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,379 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,380 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,387 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,387 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,387 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,387 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,387 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,387 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,387 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,387 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,387 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,387 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,388 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,388 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,388 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,389 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,389 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,389 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,389 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,389 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,389 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,389 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,390 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,390 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,390 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,390 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,390 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,390 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,390 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,390 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,390 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,391 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,391 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,391 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,391 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,391 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,391 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,391 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,391 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,392 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,392 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,392 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,392 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,392 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,392 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,392 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,392 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,392 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,392 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,392 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,392 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,393 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,393 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,393 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,393 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,393 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,393 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,393 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,393 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,393 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,394 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,394 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,394 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,394 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,394 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,394 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,394 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,394 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,395 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,395 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,395 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,395 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,395 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,395 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,395 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,395 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,395 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,397 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,397 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~s1~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,397 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,398 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~s1~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,398 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,398 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,398 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,398 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,398 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,398 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,398 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,398 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,398 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,398 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,398 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,398 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,399 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,399 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,399 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,399 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,399 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,399 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,401 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,402 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,402 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,402 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,402 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,402 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,402 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,402 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,403 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,403 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,403 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,403 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,403 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,403 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,403 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,403 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,403 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,403 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,404 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,404 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,404 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,404 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,404 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,404 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,404 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,404 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,405 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,405 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,405 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,405 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,405 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,405 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,405 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,405 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,405 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,405 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,405 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,405 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,405 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,405 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,406 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,406 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,406 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,406 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,406 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,406 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,407 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,407 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~s2~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,407 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,407 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~s2~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,407 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,408 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,408 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,408 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,408 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,408 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,408 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,408 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,408 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~s2~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,408 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~s1~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,408 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~s2~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,408 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~s1~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,409 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~s2~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,409 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~s1~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,409 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~s2~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,409 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~s1~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,409 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,409 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,409 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,409 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,409 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,409 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,409 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,409 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,409 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~s2~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,410 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~s1~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,410 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~s2~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,410 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~s1~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,410 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~s2~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,410 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~s1~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,410 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~s2~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,410 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~s1~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,410 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,410 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,410 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,410 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,410 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,410 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,410 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,411 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,411 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,411 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,411 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,411 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,411 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,411 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,411 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,411 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,411 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,411 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,411 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,411 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,411 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,412 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,414 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,414 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,414 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,414 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,414 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~s1~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,414 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,414 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,415 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,415 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,415 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~s2~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,415 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,415 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,415 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,415 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,415 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,415 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,415 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,417 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,417 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,417 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,417 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,417 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,417 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,417 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,418 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,418 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,418 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~s1~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,418 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~s2~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,418 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,418 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,418 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,418 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,418 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,419 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,419 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,419 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,420 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~s2~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,420 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,420 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,420 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,420 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~s1~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,420 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,420 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,420 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,420 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,420 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,420 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,420 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,420 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,420 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,420 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:07:10,423 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-01-19 13:07:10,461 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 13:07:10,466 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-19 13:07:10,466 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-01-19 13:07:10,479 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 326 places, 341 transitions, 706 flow [2022-01-19 13:07:10,614 INFO L129 PetriNetUnfolder]: 25/338 cut-off events. [2022-01-19 13:07:10,614 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-01-19 13:07:10,622 INFO L84 FinitePrefix]: Finished finitePrefix Result has 351 conditions, 338 events. 25/338 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 635 event pairs, 0 based on Foata normal form. 0/312 useless extension candidates. Maximal degree in co-relation 256. Up to 2 conditions per place. [2022-01-19 13:07:10,623 INFO L82 GeneralOperation]: Start removeDead. Operand has 326 places, 341 transitions, 706 flow [2022-01-19 13:07:10,630 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 312 places, 327 transitions, 672 flow [2022-01-19 13:07:10,682 INFO L129 PetriNetUnfolder]: 25/326 cut-off events. [2022-01-19 13:07:10,682 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-01-19 13:07:10,682 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:07:10,683 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:07:10,684 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:07:10,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:07:10,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1820755081, now seen corresponding path program 1 times [2022-01-19 13:07:10,693 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:07:10,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81947543] [2022-01-19 13:07:10,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:07:10,695 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:07:10,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:07:11,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:07:11,081 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:07:11,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81947543] [2022-01-19 13:07:11,081 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81947543] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:07:11,081 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:07:11,081 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 13:07:11,082 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460876891] [2022-01-19 13:07:11,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:07:11,088 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 13:07:11,088 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:07:11,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 13:07:11,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-19 13:07:11,113 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 307 out of 341 [2022-01-19 13:07:11,118 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 327 transitions, 672 flow. Second operand has 7 states, 7 states have (on average 309.57142857142856) internal successors, (2167), 7 states have internal predecessors, (2167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:11,118 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:07:11,118 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 307 of 341 [2022-01-19 13:07:11,119 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:07:11,360 INFO L129 PetriNetUnfolder]: 87/826 cut-off events. [2022-01-19 13:07:11,361 INFO L130 PetriNetUnfolder]: For 64/64 co-relation queries the response was YES. [2022-01-19 13:07:11,368 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1024 conditions, 826 events. 87/826 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 4473 event pairs, 31 based on Foata normal form. 153/902 useless extension candidates. Maximal degree in co-relation 845. Up to 72 conditions per place. [2022-01-19 13:07:11,374 INFO L132 encePairwiseOnDemand]: 319/341 looper letters, 30 selfloop transitions, 5 changer transitions 6/335 dead transitions. [2022-01-19 13:07:11,374 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 335 transitions, 797 flow [2022-01-19 13:07:11,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 13:07:11,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 13:07:11,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2843 transitions. [2022-01-19 13:07:11,391 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9263603779732812 [2022-01-19 13:07:11,392 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2843 transitions. [2022-01-19 13:07:11,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2843 transitions. [2022-01-19 13:07:11,395 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:07:11,397 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2843 transitions. [2022-01-19 13:07:11,404 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 315.8888888888889) internal successors, (2843), 9 states have internal predecessors, (2843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:11,415 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 341.0) internal successors, (3410), 10 states have internal predecessors, (3410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:11,416 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 341.0) internal successors, (3410), 10 states have internal predecessors, (3410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:11,417 INFO L186 Difference]: Start difference. First operand has 312 places, 327 transitions, 672 flow. Second operand 9 states and 2843 transitions. [2022-01-19 13:07:11,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 335 transitions, 797 flow [2022-01-19 13:07:11,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 335 transitions, 767 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-01-19 13:07:11,431 INFO L242 Difference]: Finished difference. Result has 319 places, 315 transitions, 661 flow [2022-01-19 13:07:11,433 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=634, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=309, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=661, PETRI_PLACES=319, PETRI_TRANSITIONS=315} [2022-01-19 13:07:11,437 INFO L334 CegarLoopForPetriNet]: 312 programPoint places, 7 predicate places. [2022-01-19 13:07:11,437 INFO L470 AbstractCegarLoop]: Abstraction has has 319 places, 315 transitions, 661 flow [2022-01-19 13:07:11,439 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 309.57142857142856) internal successors, (2167), 7 states have internal predecessors, (2167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:11,439 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:07:11,439 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:07:11,439 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-19 13:07:11,439 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:07:11,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:07:11,440 INFO L85 PathProgramCache]: Analyzing trace with hash -566622069, now seen corresponding path program 1 times [2022-01-19 13:07:11,440 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:07:11,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948543215] [2022-01-19 13:07:11,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:07:11,440 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:07:11,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:07:11,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:07:11,577 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:07:11,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948543215] [2022-01-19 13:07:11,577 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948543215] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:07:11,577 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:07:11,577 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 13:07:11,578 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260622673] [2022-01-19 13:07:11,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:07:11,578 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 13:07:11,579 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:07:11,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 13:07:11,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-19 13:07:11,581 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 311 out of 341 [2022-01-19 13:07:11,582 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 315 transitions, 661 flow. Second operand has 6 states, 6 states have (on average 313.3333333333333) internal successors, (1880), 6 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:11,582 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:07:11,582 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 311 of 341 [2022-01-19 13:07:11,582 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:07:11,705 INFO L129 PetriNetUnfolder]: 32/499 cut-off events. [2022-01-19 13:07:11,705 INFO L130 PetriNetUnfolder]: For 25/34 co-relation queries the response was YES. [2022-01-19 13:07:11,711 INFO L84 FinitePrefix]: Finished finitePrefix Result has 593 conditions, 499 events. 32/499 cut-off events. For 25/34 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1902 event pairs, 9 based on Foata normal form. 5/462 useless extension candidates. Maximal degree in co-relation 580. Up to 36 conditions per place. [2022-01-19 13:07:11,713 INFO L132 encePairwiseOnDemand]: 335/341 looper letters, 21 selfloop transitions, 3 changer transitions 4/328 dead transitions. [2022-01-19 13:07:11,713 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 328 transitions, 755 flow [2022-01-19 13:07:11,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 13:07:11,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 13:07:11,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2206 transitions. [2022-01-19 13:07:11,716 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9241726015919565 [2022-01-19 13:07:11,716 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 2206 transitions. [2022-01-19 13:07:11,716 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 2206 transitions. [2022-01-19 13:07:11,717 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:07:11,717 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 2206 transitions. [2022-01-19 13:07:11,720 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 315.14285714285717) internal successors, (2206), 7 states have internal predecessors, (2206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:11,723 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 341.0) internal successors, (2728), 8 states have internal predecessors, (2728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:11,724 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 341.0) internal successors, (2728), 8 states have internal predecessors, (2728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:11,724 INFO L186 Difference]: Start difference. First operand has 319 places, 315 transitions, 661 flow. Second operand 7 states and 2206 transitions. [2022-01-19 13:07:11,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 328 transitions, 755 flow [2022-01-19 13:07:11,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 328 transitions, 744 flow, removed 3 selfloop flow, removed 4 redundant places. [2022-01-19 13:07:11,731 INFO L242 Difference]: Finished difference. Result has 322 places, 317 transitions, 677 flow [2022-01-19 13:07:11,731 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=652, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=677, PETRI_PLACES=322, PETRI_TRANSITIONS=317} [2022-01-19 13:07:11,732 INFO L334 CegarLoopForPetriNet]: 312 programPoint places, 10 predicate places. [2022-01-19 13:07:11,732 INFO L470 AbstractCegarLoop]: Abstraction has has 322 places, 317 transitions, 677 flow [2022-01-19 13:07:11,733 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 313.3333333333333) internal successors, (1880), 6 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:11,733 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:07:11,733 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:07:11,733 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-19 13:07:11,733 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:07:11,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:07:11,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1572473933, now seen corresponding path program 1 times [2022-01-19 13:07:11,734 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:07:11,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237364698] [2022-01-19 13:07:11,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:07:11,734 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:07:11,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:07:11,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:07:11,868 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:07:11,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237364698] [2022-01-19 13:07:11,868 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237364698] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:07:11,868 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:07:11,869 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 13:07:11,869 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612779745] [2022-01-19 13:07:11,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:07:11,869 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 13:07:11,869 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:07:11,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 13:07:11,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 13:07:11,871 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 341 [2022-01-19 13:07:11,872 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 317 transitions, 677 flow. Second operand has 4 states, 4 states have (on average 307.25) internal successors, (1229), 4 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:11,872 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:07:11,872 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 341 [2022-01-19 13:07:11,872 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:07:12,317 INFO L129 PetriNetUnfolder]: 503/3092 cut-off events. [2022-01-19 13:07:12,317 INFO L130 PetriNetUnfolder]: For 107/107 co-relation queries the response was YES. [2022-01-19 13:07:12,333 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3926 conditions, 3092 events. 503/3092 cut-off events. For 107/107 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 27515 event pairs, 249 based on Foata normal form. 0/2628 useless extension candidates. Maximal degree in co-relation 3903. Up to 448 conditions per place. [2022-01-19 13:07:12,342 INFO L132 encePairwiseOnDemand]: 337/341 looper letters, 40 selfloop transitions, 2 changer transitions 3/335 dead transitions. [2022-01-19 13:07:12,342 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 335 transitions, 805 flow [2022-01-19 13:07:12,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-19 13:07:12,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-01-19 13:07:12,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1256 transitions. [2022-01-19 13:07:12,344 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9208211143695014 [2022-01-19 13:07:12,344 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1256 transitions. [2022-01-19 13:07:12,344 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1256 transitions. [2022-01-19 13:07:12,345 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:07:12,345 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1256 transitions. [2022-01-19 13:07:12,347 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 314.0) internal successors, (1256), 4 states have internal predecessors, (1256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:12,349 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 341.0) internal successors, (1705), 5 states have internal predecessors, (1705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:12,349 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 341.0) internal successors, (1705), 5 states have internal predecessors, (1705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:12,349 INFO L186 Difference]: Start difference. First operand has 322 places, 317 transitions, 677 flow. Second operand 4 states and 1256 transitions. [2022-01-19 13:07:12,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 335 transitions, 805 flow [2022-01-19 13:07:12,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 335 transitions, 800 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-01-19 13:07:12,356 INFO L242 Difference]: Finished difference. Result has 322 places, 315 transitions, 671 flow [2022-01-19 13:07:12,357 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=672, PETRI_DIFFERENCE_MINUEND_PLACES=317, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=315, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=671, PETRI_PLACES=322, PETRI_TRANSITIONS=315} [2022-01-19 13:07:12,358 INFO L334 CegarLoopForPetriNet]: 312 programPoint places, 10 predicate places. [2022-01-19 13:07:12,358 INFO L470 AbstractCegarLoop]: Abstraction has has 322 places, 315 transitions, 671 flow [2022-01-19 13:07:12,359 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 307.25) internal successors, (1229), 4 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:12,359 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:07:12,359 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:07:12,359 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-19 13:07:12,360 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:07:12,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:07:12,360 INFO L85 PathProgramCache]: Analyzing trace with hash -2140776571, now seen corresponding path program 2 times [2022-01-19 13:07:12,360 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:07:12,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899134802] [2022-01-19 13:07:12,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:07:12,360 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:07:12,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:07:12,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:07:12,423 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:07:12,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899134802] [2022-01-19 13:07:12,424 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899134802] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:07:12,424 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:07:12,424 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 13:07:12,424 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908532356] [2022-01-19 13:07:12,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:07:12,424 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 13:07:12,425 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:07:12,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 13:07:12,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 13:07:12,429 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 341 [2022-01-19 13:07:12,430 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 315 transitions, 671 flow. Second operand has 4 states, 4 states have (on average 307.25) internal successors, (1229), 4 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:12,430 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:07:12,430 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 341 [2022-01-19 13:07:12,431 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:07:12,799 INFO L129 PetriNetUnfolder]: 436/2996 cut-off events. [2022-01-19 13:07:12,800 INFO L130 PetriNetUnfolder]: For 259/262 co-relation queries the response was YES. [2022-01-19 13:07:12,813 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3824 conditions, 2996 events. 436/2996 cut-off events. For 259/262 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 26074 event pairs, 222 based on Foata normal form. 2/2677 useless extension candidates. Maximal degree in co-relation 3757. Up to 408 conditions per place. [2022-01-19 13:07:12,820 INFO L132 encePairwiseOnDemand]: 337/341 looper letters, 38 selfloop transitions, 3 changer transitions 1/332 dead transitions. [2022-01-19 13:07:12,820 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 332 transitions, 804 flow [2022-01-19 13:07:12,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-19 13:07:12,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-01-19 13:07:12,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1254 transitions. [2022-01-19 13:07:12,822 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9193548387096774 [2022-01-19 13:07:12,822 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1254 transitions. [2022-01-19 13:07:12,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1254 transitions. [2022-01-19 13:07:12,823 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:07:12,823 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1254 transitions. [2022-01-19 13:07:12,824 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 313.5) internal successors, (1254), 4 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:12,826 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 341.0) internal successors, (1705), 5 states have internal predecessors, (1705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:12,826 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 341.0) internal successors, (1705), 5 states have internal predecessors, (1705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:12,826 INFO L186 Difference]: Start difference. First operand has 322 places, 315 transitions, 671 flow. Second operand 4 states and 1254 transitions. [2022-01-19 13:07:12,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 322 places, 332 transitions, 804 flow [2022-01-19 13:07:12,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 332 transitions, 796 flow, removed 3 selfloop flow, removed 4 redundant places. [2022-01-19 13:07:12,832 INFO L242 Difference]: Finished difference. Result has 320 places, 317 transitions, 693 flow [2022-01-19 13:07:12,832 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=664, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=693, PETRI_PLACES=320, PETRI_TRANSITIONS=317} [2022-01-19 13:07:12,832 INFO L334 CegarLoopForPetriNet]: 312 programPoint places, 8 predicate places. [2022-01-19 13:07:12,833 INFO L470 AbstractCegarLoop]: Abstraction has has 320 places, 317 transitions, 693 flow [2022-01-19 13:07:12,833 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 307.25) internal successors, (1229), 4 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:12,833 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:07:12,833 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:07:12,833 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-19 13:07:12,833 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:07:12,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:07:12,834 INFO L85 PathProgramCache]: Analyzing trace with hash -237683451, now seen corresponding path program 3 times [2022-01-19 13:07:12,834 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:07:12,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284680274] [2022-01-19 13:07:12,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:07:12,834 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:07:12,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:07:12,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:07:12,877 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:07:12,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284680274] [2022-01-19 13:07:12,877 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284680274] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:07:12,878 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:07:12,878 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 13:07:12,878 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819658361] [2022-01-19 13:07:12,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:07:12,878 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 13:07:12,878 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:07:12,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 13:07:12,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 13:07:12,880 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 341 [2022-01-19 13:07:12,880 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 317 transitions, 693 flow. Second operand has 4 states, 4 states have (on average 307.25) internal successors, (1229), 4 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:12,881 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:07:12,881 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 341 [2022-01-19 13:07:12,881 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:07:13,325 INFO L129 PetriNetUnfolder]: 467/3337 cut-off events. [2022-01-19 13:07:13,325 INFO L130 PetriNetUnfolder]: For 631/712 co-relation queries the response was YES. [2022-01-19 13:07:13,342 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4412 conditions, 3337 events. 467/3337 cut-off events. For 631/712 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 30628 event pairs, 228 based on Foata normal form. 4/3040 useless extension candidates. Maximal degree in co-relation 4201. Up to 399 conditions per place. [2022-01-19 13:07:13,353 INFO L132 encePairwiseOnDemand]: 337/341 looper letters, 41 selfloop transitions, 5 changer transitions 0/336 dead transitions. [2022-01-19 13:07:13,353 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 336 transitions, 845 flow [2022-01-19 13:07:13,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-19 13:07:13,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-01-19 13:07:13,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1257 transitions. [2022-01-19 13:07:13,355 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9215542521994134 [2022-01-19 13:07:13,356 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1257 transitions. [2022-01-19 13:07:13,356 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1257 transitions. [2022-01-19 13:07:13,356 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:07:13,356 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1257 transitions. [2022-01-19 13:07:13,358 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 314.25) internal successors, (1257), 4 states have internal predecessors, (1257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:13,360 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 341.0) internal successors, (1705), 5 states have internal predecessors, (1705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:13,360 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 341.0) internal successors, (1705), 5 states have internal predecessors, (1705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:13,360 INFO L186 Difference]: Start difference. First operand has 320 places, 317 transitions, 693 flow. Second operand 4 states and 1257 transitions. [2022-01-19 13:07:13,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 336 transitions, 845 flow [2022-01-19 13:07:13,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 322 places, 336 transitions, 843 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 13:07:13,367 INFO L242 Difference]: Finished difference. Result has 324 places, 318 transitions, 720 flow [2022-01-19 13:07:13,368 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=692, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=720, PETRI_PLACES=324, PETRI_TRANSITIONS=318} [2022-01-19 13:07:13,369 INFO L334 CegarLoopForPetriNet]: 312 programPoint places, 12 predicate places. [2022-01-19 13:07:13,370 INFO L470 AbstractCegarLoop]: Abstraction has has 324 places, 318 transitions, 720 flow [2022-01-19 13:07:13,370 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 307.25) internal successors, (1229), 4 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:13,370 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:07:13,370 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:07:13,371 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-19 13:07:13,371 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:07:13,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:07:13,371 INFO L85 PathProgramCache]: Analyzing trace with hash 632786909, now seen corresponding path program 4 times [2022-01-19 13:07:13,371 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:07:13,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189923932] [2022-01-19 13:07:13,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:07:13,371 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:07:13,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:07:13,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:07:13,429 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:07:13,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189923932] [2022-01-19 13:07:13,429 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189923932] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:07:13,429 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:07:13,429 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 13:07:13,429 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211078081] [2022-01-19 13:07:13,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:07:13,430 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 13:07:13,430 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:07:13,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 13:07:13,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 13:07:13,432 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 341 [2022-01-19 13:07:13,433 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 324 places, 318 transitions, 720 flow. Second operand has 4 states, 4 states have (on average 307.25) internal successors, (1229), 4 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:13,433 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:07:13,433 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 341 [2022-01-19 13:07:13,433 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:07:13,875 INFO L129 PetriNetUnfolder]: 464/3338 cut-off events. [2022-01-19 13:07:13,876 INFO L130 PetriNetUnfolder]: For 1011/1095 co-relation queries the response was YES. [2022-01-19 13:07:13,890 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4551 conditions, 3338 events. 464/3338 cut-off events. For 1011/1095 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 30555 event pairs, 226 based on Foata normal form. 4/3036 useless extension candidates. Maximal degree in co-relation 4335. Up to 399 conditions per place. [2022-01-19 13:07:13,896 INFO L132 encePairwiseOnDemand]: 337/341 looper letters, 39 selfloop transitions, 5 changer transitions 1/335 dead transitions. [2022-01-19 13:07:13,896 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 335 transitions, 864 flow [2022-01-19 13:07:13,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-19 13:07:13,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-01-19 13:07:13,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1256 transitions. [2022-01-19 13:07:13,899 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9208211143695014 [2022-01-19 13:07:13,899 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1256 transitions. [2022-01-19 13:07:13,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1256 transitions. [2022-01-19 13:07:13,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:07:13,899 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1256 transitions. [2022-01-19 13:07:13,902 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 314.0) internal successors, (1256), 4 states have internal predecessors, (1256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:13,903 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 341.0) internal successors, (1705), 5 states have internal predecessors, (1705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:13,904 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 341.0) internal successors, (1705), 5 states have internal predecessors, (1705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:13,904 INFO L186 Difference]: Start difference. First operand has 324 places, 318 transitions, 720 flow. Second operand 4 states and 1256 transitions. [2022-01-19 13:07:13,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 335 transitions, 864 flow [2022-01-19 13:07:13,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 326 places, 335 transitions, 860 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 13:07:13,911 INFO L242 Difference]: Finished difference. Result has 328 places, 319 transitions, 746 flow [2022-01-19 13:07:13,911 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=716, PETRI_DIFFERENCE_MINUEND_PLACES=323, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=318, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=313, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=746, PETRI_PLACES=328, PETRI_TRANSITIONS=319} [2022-01-19 13:07:13,913 INFO L334 CegarLoopForPetriNet]: 312 programPoint places, 16 predicate places. [2022-01-19 13:07:13,913 INFO L470 AbstractCegarLoop]: Abstraction has has 328 places, 319 transitions, 746 flow [2022-01-19 13:07:13,913 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 307.25) internal successors, (1229), 4 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:13,913 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:07:13,914 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:07:13,914 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-19 13:07:13,914 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:07:13,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:07:13,914 INFO L85 PathProgramCache]: Analyzing trace with hash 42985117, now seen corresponding path program 5 times [2022-01-19 13:07:13,915 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:07:13,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186558559] [2022-01-19 13:07:13,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:07:13,915 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:07:13,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:07:13,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:07:13,962 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:07:13,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186558559] [2022-01-19 13:07:13,963 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186558559] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:07:13,963 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:07:13,963 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 13:07:13,963 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584897725] [2022-01-19 13:07:13,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:07:13,966 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 13:07:13,966 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:07:13,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 13:07:13,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 13:07:13,968 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 341 [2022-01-19 13:07:13,969 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 319 transitions, 746 flow. Second operand has 4 states, 4 states have (on average 307.25) internal successors, (1229), 4 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:13,969 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:07:13,969 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 341 [2022-01-19 13:07:13,969 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:07:14,370 INFO L129 PetriNetUnfolder]: 486/3495 cut-off events. [2022-01-19 13:07:14,370 INFO L130 PetriNetUnfolder]: For 1637/1815 co-relation queries the response was YES. [2022-01-19 13:07:14,391 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4842 conditions, 3495 events. 486/3495 cut-off events. For 1637/1815 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 32098 event pairs, 259 based on Foata normal form. 1/3158 useless extension candidates. Maximal degree in co-relation 4594. Up to 480 conditions per place. [2022-01-19 13:07:14,399 INFO L132 encePairwiseOnDemand]: 337/341 looper letters, 40 selfloop transitions, 3 changer transitions 1/334 dead transitions. [2022-01-19 13:07:14,400 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 334 transitions, 880 flow [2022-01-19 13:07:14,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-19 13:07:14,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-01-19 13:07:14,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1254 transitions. [2022-01-19 13:07:14,402 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9193548387096774 [2022-01-19 13:07:14,402 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1254 transitions. [2022-01-19 13:07:14,402 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1254 transitions. [2022-01-19 13:07:14,402 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:07:14,402 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1254 transitions. [2022-01-19 13:07:14,404 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 313.5) internal successors, (1254), 4 states have internal predecessors, (1254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:14,406 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 341.0) internal successors, (1705), 5 states have internal predecessors, (1705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:14,406 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 341.0) internal successors, (1705), 5 states have internal predecessors, (1705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:14,407 INFO L186 Difference]: Start difference. First operand has 328 places, 319 transitions, 746 flow. Second operand 4 states and 1254 transitions. [2022-01-19 13:07:14,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 331 places, 334 transitions, 880 flow [2022-01-19 13:07:14,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 330 places, 334 transitions, 876 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 13:07:14,415 INFO L242 Difference]: Finished difference. Result has 332 places, 320 transitions, 766 flow [2022-01-19 13:07:14,415 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=742, PETRI_DIFFERENCE_MINUEND_PLACES=327, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=319, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=316, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=766, PETRI_PLACES=332, PETRI_TRANSITIONS=320} [2022-01-19 13:07:14,416 INFO L334 CegarLoopForPetriNet]: 312 programPoint places, 20 predicate places. [2022-01-19 13:07:14,416 INFO L470 AbstractCegarLoop]: Abstraction has has 332 places, 320 transitions, 766 flow [2022-01-19 13:07:14,417 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 307.25) internal successors, (1229), 4 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:14,417 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:07:14,417 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:07:14,417 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-19 13:07:14,417 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:07:14,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:07:14,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1261496579, now seen corresponding path program 6 times [2022-01-19 13:07:14,418 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:07:14,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751638888] [2022-01-19 13:07:14,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:07:14,418 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:07:14,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:07:14,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:07:14,474 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:07:14,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751638888] [2022-01-19 13:07:14,474 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751638888] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:07:14,474 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:07:14,474 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 13:07:14,474 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921993784] [2022-01-19 13:07:14,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:07:14,474 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 13:07:14,474 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:07:14,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 13:07:14,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 13:07:14,476 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 341 [2022-01-19 13:07:14,486 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 320 transitions, 766 flow. Second operand has 4 states, 4 states have (on average 307.25) internal successors, (1229), 4 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:14,486 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:07:14,486 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 341 [2022-01-19 13:07:14,486 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:07:14,892 INFO L129 PetriNetUnfolder]: 485/3470 cut-off events. [2022-01-19 13:07:14,893 INFO L130 PetriNetUnfolder]: For 2348/2664 co-relation queries the response was YES. [2022-01-19 13:07:14,916 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4941 conditions, 3470 events. 485/3470 cut-off events. For 2348/2664 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 31856 event pairs, 247 based on Foata normal form. 3/3169 useless extension candidates. Maximal degree in co-relation 4708. Up to 459 conditions per place. [2022-01-19 13:07:14,924 INFO L132 encePairwiseOnDemand]: 337/341 looper letters, 40 selfloop transitions, 4 changer transitions 1/335 dead transitions. [2022-01-19 13:07:14,924 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 335 places, 335 transitions, 896 flow [2022-01-19 13:07:14,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-19 13:07:14,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-01-19 13:07:14,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1255 transitions. [2022-01-19 13:07:14,926 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9200879765395894 [2022-01-19 13:07:14,926 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1255 transitions. [2022-01-19 13:07:14,926 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1255 transitions. [2022-01-19 13:07:14,926 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:07:14,926 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1255 transitions. [2022-01-19 13:07:14,928 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 313.75) internal successors, (1255), 4 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:14,930 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 341.0) internal successors, (1705), 5 states have internal predecessors, (1705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:14,930 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 341.0) internal successors, (1705), 5 states have internal predecessors, (1705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:14,930 INFO L186 Difference]: Start difference. First operand has 332 places, 320 transitions, 766 flow. Second operand 4 states and 1255 transitions. [2022-01-19 13:07:14,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 335 places, 335 transitions, 896 flow [2022-01-19 13:07:14,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 334 places, 335 transitions, 893 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 13:07:14,938 INFO L242 Difference]: Finished difference. Result has 336 places, 320 transitions, 777 flow [2022-01-19 13:07:14,939 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=748, PETRI_DIFFERENCE_MINUEND_PLACES=331, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=319, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=315, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=777, PETRI_PLACES=336, PETRI_TRANSITIONS=320} [2022-01-19 13:07:14,939 INFO L334 CegarLoopForPetriNet]: 312 programPoint places, 24 predicate places. [2022-01-19 13:07:14,939 INFO L470 AbstractCegarLoop]: Abstraction has has 336 places, 320 transitions, 777 flow [2022-01-19 13:07:14,939 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 307.25) internal successors, (1229), 4 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:14,939 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:07:14,940 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:07:14,940 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-19 13:07:14,940 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:07:14,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:07:14,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1753842987, now seen corresponding path program 1 times [2022-01-19 13:07:14,940 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:07:14,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146209917] [2022-01-19 13:07:14,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:07:14,940 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:07:14,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:07:14,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:07:14,988 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:07:14,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146209917] [2022-01-19 13:07:14,988 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146209917] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:07:14,988 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:07:14,988 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 13:07:14,988 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419851203] [2022-01-19 13:07:14,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:07:14,989 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 13:07:14,989 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:07:14,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 13:07:14,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 13:07:14,990 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 341 [2022-01-19 13:07:14,991 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 336 places, 320 transitions, 777 flow. Second operand has 4 states, 4 states have (on average 307.25) internal successors, (1229), 4 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:14,991 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:07:14,991 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 341 [2022-01-19 13:07:14,991 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:07:15,382 INFO L129 PetriNetUnfolder]: 419/3319 cut-off events. [2022-01-19 13:07:15,382 INFO L130 PetriNetUnfolder]: For 2398/2416 co-relation queries the response was YES. [2022-01-19 13:07:15,402 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4930 conditions, 3319 events. 419/3319 cut-off events. For 2398/2416 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 32011 event pairs, 66 based on Foata normal form. 10/3183 useless extension candidates. Maximal degree in co-relation 4664. Up to 333 conditions per place. [2022-01-19 13:07:15,408 INFO L132 encePairwiseOnDemand]: 333/341 looper letters, 52 selfloop transitions, 8 changer transitions 3/353 dead transitions. [2022-01-19 13:07:15,409 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 353 transitions, 1102 flow [2022-01-19 13:07:15,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 13:07:15,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 13:07:15,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1571 transitions. [2022-01-19 13:07:15,411 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9214076246334311 [2022-01-19 13:07:15,411 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1571 transitions. [2022-01-19 13:07:15,411 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1571 transitions. [2022-01-19 13:07:15,412 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:07:15,412 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1571 transitions. [2022-01-19 13:07:15,414 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 314.2) internal successors, (1571), 5 states have internal predecessors, (1571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:15,416 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 341.0) internal successors, (2046), 6 states have internal predecessors, (2046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:15,417 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 341.0) internal successors, (2046), 6 states have internal predecessors, (2046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:15,417 INFO L186 Difference]: Start difference. First operand has 336 places, 320 transitions, 777 flow. Second operand 5 states and 1571 transitions. [2022-01-19 13:07:15,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 340 places, 353 transitions, 1102 flow [2022-01-19 13:07:15,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 339 places, 353 transitions, 1094 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 13:07:15,424 INFO L242 Difference]: Finished difference. Result has 342 places, 327 transitions, 866 flow [2022-01-19 13:07:15,425 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=774, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=320, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=314, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=866, PETRI_PLACES=342, PETRI_TRANSITIONS=327} [2022-01-19 13:07:15,425 INFO L334 CegarLoopForPetriNet]: 312 programPoint places, 30 predicate places. [2022-01-19 13:07:15,425 INFO L470 AbstractCegarLoop]: Abstraction has has 342 places, 327 transitions, 866 flow [2022-01-19 13:07:15,426 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 307.25) internal successors, (1229), 4 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:15,426 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:07:15,426 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:07:15,426 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-19 13:07:15,426 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:07:15,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:07:15,427 INFO L85 PathProgramCache]: Analyzing trace with hash 244563527, now seen corresponding path program 2 times [2022-01-19 13:07:15,427 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:07:15,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264566742] [2022-01-19 13:07:15,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:07:15,427 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:07:15,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:07:15,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:07:15,474 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:07:15,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264566742] [2022-01-19 13:07:15,474 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264566742] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:07:15,474 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:07:15,474 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 13:07:15,474 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006513843] [2022-01-19 13:07:15,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:07:15,475 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 13:07:15,475 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:07:15,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 13:07:15,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 13:07:15,477 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 341 [2022-01-19 13:07:15,478 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 327 transitions, 866 flow. Second operand has 4 states, 4 states have (on average 307.25) internal successors, (1229), 4 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:15,478 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:07:15,478 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 341 [2022-01-19 13:07:15,478 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:07:15,943 INFO L129 PetriNetUnfolder]: 474/4030 cut-off events. [2022-01-19 13:07:15,943 INFO L130 PetriNetUnfolder]: For 3570/4052 co-relation queries the response was YES. [2022-01-19 13:07:15,966 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5971 conditions, 4030 events. 474/4030 cut-off events. For 3570/4052 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 39441 event pairs, 200 based on Foata normal form. 24/3744 useless extension candidates. Maximal degree in co-relation 5652. Up to 378 conditions per place. [2022-01-19 13:07:15,974 INFO L132 encePairwiseOnDemand]: 331/341 looper letters, 54 selfloop transitions, 14 changer transitions 2/360 dead transitions. [2022-01-19 13:07:15,974 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 360 transitions, 1173 flow [2022-01-19 13:07:15,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 13:07:15,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 13:07:15,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1578 transitions. [2022-01-19 13:07:15,977 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9255131964809384 [2022-01-19 13:07:15,977 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1578 transitions. [2022-01-19 13:07:15,977 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1578 transitions. [2022-01-19 13:07:15,978 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:07:15,978 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1578 transitions. [2022-01-19 13:07:15,980 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 315.6) internal successors, (1578), 5 states have internal predecessors, (1578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:15,981 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 341.0) internal successors, (2046), 6 states have internal predecessors, (2046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:15,982 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 341.0) internal successors, (2046), 6 states have internal predecessors, (2046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:15,982 INFO L186 Difference]: Start difference. First operand has 342 places, 327 transitions, 866 flow. Second operand 5 states and 1578 transitions. [2022-01-19 13:07:15,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 346 places, 360 transitions, 1173 flow [2022-01-19 13:07:15,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 345 places, 360 transitions, 1156 flow, removed 8 selfloop flow, removed 1 redundant places. [2022-01-19 13:07:15,991 INFO L242 Difference]: Finished difference. Result has 349 places, 335 transitions, 983 flow [2022-01-19 13:07:15,991 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=855, PETRI_DIFFERENCE_MINUEND_PLACES=341, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=315, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=983, PETRI_PLACES=349, PETRI_TRANSITIONS=335} [2022-01-19 13:07:15,991 INFO L334 CegarLoopForPetriNet]: 312 programPoint places, 37 predicate places. [2022-01-19 13:07:15,992 INFO L470 AbstractCegarLoop]: Abstraction has has 349 places, 335 transitions, 983 flow [2022-01-19 13:07:15,992 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 307.25) internal successors, (1229), 4 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:15,992 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:07:15,992 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:07:15,992 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-19 13:07:15,992 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:07:15,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:07:15,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1361086785, now seen corresponding path program 3 times [2022-01-19 13:07:15,993 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:07:15,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412124754] [2022-01-19 13:07:15,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:07:15,993 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:07:16,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:07:16,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:07:16,036 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:07:16,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412124754] [2022-01-19 13:07:16,036 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412124754] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:07:16,036 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:07:16,036 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 13:07:16,037 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402773625] [2022-01-19 13:07:16,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:07:16,037 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 13:07:16,037 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:07:16,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 13:07:16,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 13:07:16,038 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 341 [2022-01-19 13:07:16,039 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 349 places, 335 transitions, 983 flow. Second operand has 4 states, 4 states have (on average 307.25) internal successors, (1229), 4 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:16,039 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:07:16,039 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 341 [2022-01-19 13:07:16,039 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:07:16,489 INFO L129 PetriNetUnfolder]: 410/3486 cut-off events. [2022-01-19 13:07:16,490 INFO L130 PetriNetUnfolder]: For 3975/3983 co-relation queries the response was YES. [2022-01-19 13:07:16,517 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5996 conditions, 3486 events. 410/3486 cut-off events. For 3975/3983 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 34156 event pairs, 76 based on Foata normal form. 9/3344 useless extension candidates. Maximal degree in co-relation 5412. Up to 368 conditions per place. [2022-01-19 13:07:16,526 INFO L132 encePairwiseOnDemand]: 333/341 looper letters, 64 selfloop transitions, 10 changer transitions 6/370 dead transitions. [2022-01-19 13:07:16,526 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 370 transitions, 1410 flow [2022-01-19 13:07:16,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 13:07:16,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 13:07:16,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1572 transitions. [2022-01-19 13:07:16,529 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9219941348973607 [2022-01-19 13:07:16,529 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1572 transitions. [2022-01-19 13:07:16,529 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1572 transitions. [2022-01-19 13:07:16,530 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:07:16,530 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1572 transitions. [2022-01-19 13:07:16,532 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 314.4) internal successors, (1572), 5 states have internal predecessors, (1572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:16,533 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 341.0) internal successors, (2046), 6 states have internal predecessors, (2046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:16,534 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 341.0) internal successors, (2046), 6 states have internal predecessors, (2046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:16,534 INFO L186 Difference]: Start difference. First operand has 349 places, 335 transitions, 983 flow. Second operand 5 states and 1572 transitions. [2022-01-19 13:07:16,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 352 places, 370 transitions, 1410 flow [2022-01-19 13:07:16,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 351 places, 370 transitions, 1388 flow, removed 11 selfloop flow, removed 1 redundant places. [2022-01-19 13:07:16,548 INFO L242 Difference]: Finished difference. Result has 354 places, 341 transitions, 1066 flow [2022-01-19 13:07:16,548 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=971, PETRI_DIFFERENCE_MINUEND_PLACES=347, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=335, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=327, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1066, PETRI_PLACES=354, PETRI_TRANSITIONS=341} [2022-01-19 13:07:16,549 INFO L334 CegarLoopForPetriNet]: 312 programPoint places, 42 predicate places. [2022-01-19 13:07:16,549 INFO L470 AbstractCegarLoop]: Abstraction has has 354 places, 341 transitions, 1066 flow [2022-01-19 13:07:16,549 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 307.25) internal successors, (1229), 4 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:16,549 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:07:16,549 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:07:16,549 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-19 13:07:16,549 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:07:16,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:07:16,550 INFO L85 PathProgramCache]: Analyzing trace with hash 76886119, now seen corresponding path program 4 times [2022-01-19 13:07:16,550 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:07:16,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065669625] [2022-01-19 13:07:16,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:07:16,550 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:07:16,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:07:16,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:07:16,598 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:07:16,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065669625] [2022-01-19 13:07:16,598 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065669625] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:07:16,598 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:07:16,598 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 13:07:16,598 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41111630] [2022-01-19 13:07:16,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:07:16,599 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 13:07:16,599 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:07:16,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 13:07:16,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 13:07:16,600 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 341 [2022-01-19 13:07:16,601 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 354 places, 341 transitions, 1066 flow. Second operand has 4 states, 4 states have (on average 307.25) internal successors, (1229), 4 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:16,601 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:07:16,601 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 341 [2022-01-19 13:07:16,601 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:07:17,147 INFO L129 PetriNetUnfolder]: 453/4000 cut-off events. [2022-01-19 13:07:17,147 INFO L130 PetriNetUnfolder]: For 5444/5745 co-relation queries the response was YES. [2022-01-19 13:07:17,176 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6729 conditions, 4000 events. 453/4000 cut-off events. For 5444/5745 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 39526 event pairs, 184 based on Foata normal form. 13/3733 useless extension candidates. Maximal degree in co-relation 6169. Up to 429 conditions per place. [2022-01-19 13:07:17,186 INFO L132 encePairwiseOnDemand]: 331/341 looper letters, 68 selfloop transitions, 12 changer transitions 5/375 dead transitions. [2022-01-19 13:07:17,186 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 375 transitions, 1455 flow [2022-01-19 13:07:17,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 13:07:17,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 13:07:17,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1577 transitions. [2022-01-19 13:07:17,189 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9249266862170088 [2022-01-19 13:07:17,189 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1577 transitions. [2022-01-19 13:07:17,189 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1577 transitions. [2022-01-19 13:07:17,189 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:07:17,189 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1577 transitions. [2022-01-19 13:07:17,191 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 315.4) internal successors, (1577), 5 states have internal predecessors, (1577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:17,193 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 341.0) internal successors, (2046), 6 states have internal predecessors, (2046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:17,193 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 341.0) internal successors, (2046), 6 states have internal predecessors, (2046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:17,193 INFO L186 Difference]: Start difference. First operand has 354 places, 341 transitions, 1066 flow. Second operand 5 states and 1577 transitions. [2022-01-19 13:07:17,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 375 transitions, 1455 flow [2022-01-19 13:07:17,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 375 transitions, 1441 flow, removed 7 selfloop flow, removed 0 redundant places. [2022-01-19 13:07:17,210 INFO L242 Difference]: Finished difference. Result has 361 places, 348 transitions, 1186 flow [2022-01-19 13:07:17,210 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=1033, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=340, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=330, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1186, PETRI_PLACES=361, PETRI_TRANSITIONS=348} [2022-01-19 13:07:17,210 INFO L334 CegarLoopForPetriNet]: 312 programPoint places, 49 predicate places. [2022-01-19 13:07:17,210 INFO L470 AbstractCegarLoop]: Abstraction has has 361 places, 348 transitions, 1186 flow [2022-01-19 13:07:17,211 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 307.25) internal successors, (1229), 4 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:17,211 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:07:17,211 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:07:17,211 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-19 13:07:17,211 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:07:17,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:07:17,211 INFO L85 PathProgramCache]: Analyzing trace with hash -160415361, now seen corresponding path program 1 times [2022-01-19 13:07:17,212 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:07:17,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688528910] [2022-01-19 13:07:17,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:07:17,212 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:07:17,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:07:17,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:07:17,251 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:07:17,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688528910] [2022-01-19 13:07:17,251 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688528910] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:07:17,251 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:07:17,251 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 13:07:17,251 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040707944] [2022-01-19 13:07:17,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:07:17,251 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 13:07:17,252 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:07:17,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 13:07:17,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 13:07:17,253 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 341 [2022-01-19 13:07:17,253 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 361 places, 348 transitions, 1186 flow. Second operand has 4 states, 4 states have (on average 307.25) internal successors, (1229), 4 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:17,253 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:07:17,253 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 341 [2022-01-19 13:07:17,253 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:07:17,746 INFO L129 PetriNetUnfolder]: 474/4001 cut-off events. [2022-01-19 13:07:17,746 INFO L130 PetriNetUnfolder]: For 6782/6840 co-relation queries the response was YES. [2022-01-19 13:07:17,775 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7187 conditions, 4001 events. 474/4001 cut-off events. For 6782/6840 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 40395 event pairs, 81 based on Foata normal form. 10/3784 useless extension candidates. Maximal degree in co-relation 6741. Up to 271 conditions per place. [2022-01-19 13:07:17,784 INFO L132 encePairwiseOnDemand]: 334/341 looper letters, 76 selfloop transitions, 15 changer transitions 9/390 dead transitions. [2022-01-19 13:07:17,784 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 390 transitions, 1771 flow [2022-01-19 13:07:17,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 13:07:17,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 13:07:17,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1575 transitions. [2022-01-19 13:07:17,787 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9237536656891495 [2022-01-19 13:07:17,787 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1575 transitions. [2022-01-19 13:07:17,787 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1575 transitions. [2022-01-19 13:07:17,787 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:07:17,787 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1575 transitions. [2022-01-19 13:07:17,789 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 315.0) internal successors, (1575), 5 states have internal predecessors, (1575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:17,791 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 341.0) internal successors, (2046), 6 states have internal predecessors, (2046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:17,791 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 341.0) internal successors, (2046), 6 states have internal predecessors, (2046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:17,791 INFO L186 Difference]: Start difference. First operand has 361 places, 348 transitions, 1186 flow. Second operand 5 states and 1575 transitions. [2022-01-19 13:07:17,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 390 transitions, 1771 flow [2022-01-19 13:07:17,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 390 transitions, 1761 flow, removed 5 selfloop flow, removed 0 redundant places. [2022-01-19 13:07:17,809 INFO L242 Difference]: Finished difference. Result has 368 places, 357 transitions, 1343 flow [2022-01-19 13:07:17,809 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=1178, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=348, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=336, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1343, PETRI_PLACES=368, PETRI_TRANSITIONS=357} [2022-01-19 13:07:17,810 INFO L334 CegarLoopForPetriNet]: 312 programPoint places, 56 predicate places. [2022-01-19 13:07:17,810 INFO L470 AbstractCegarLoop]: Abstraction has has 368 places, 357 transitions, 1343 flow [2022-01-19 13:07:17,810 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 307.25) internal successors, (1229), 4 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:17,810 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:07:17,810 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:07:17,810 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-19 13:07:17,810 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:07:17,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:07:17,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1363545151, now seen corresponding path program 2 times [2022-01-19 13:07:17,811 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:07:17,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237758117] [2022-01-19 13:07:17,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:07:17,811 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:07:17,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:07:17,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:07:17,868 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:07:17,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237758117] [2022-01-19 13:07:17,868 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237758117] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:07:17,868 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:07:17,868 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 13:07:17,868 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778890827] [2022-01-19 13:07:17,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:07:17,869 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 13:07:17,869 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:07:17,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 13:07:17,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 13:07:17,870 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 341 [2022-01-19 13:07:17,871 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 357 transitions, 1343 flow. Second operand has 4 states, 4 states have (on average 307.25) internal successors, (1229), 4 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:17,872 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:07:17,872 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 341 [2022-01-19 13:07:17,872 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:07:18,445 INFO L129 PetriNetUnfolder]: 472/4301 cut-off events. [2022-01-19 13:07:18,445 INFO L130 PetriNetUnfolder]: For 8896/9257 co-relation queries the response was YES. [2022-01-19 13:07:18,471 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7572 conditions, 4301 events. 472/4301 cut-off events. For 8896/9257 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 43381 event pairs, 156 based on Foata normal form. 20/4035 useless extension candidates. Maximal degree in co-relation 7104. Up to 354 conditions per place. [2022-01-19 13:07:18,479 INFO L132 encePairwiseOnDemand]: 332/341 looper letters, 71 selfloop transitions, 24 changer transitions 4/389 dead transitions. [2022-01-19 13:07:18,480 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 389 transitions, 1805 flow [2022-01-19 13:07:18,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 13:07:18,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 13:07:18,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1578 transitions. [2022-01-19 13:07:18,482 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9255131964809384 [2022-01-19 13:07:18,482 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1578 transitions. [2022-01-19 13:07:18,482 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1578 transitions. [2022-01-19 13:07:18,483 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:07:18,483 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1578 transitions. [2022-01-19 13:07:18,485 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 315.6) internal successors, (1578), 5 states have internal predecessors, (1578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:18,486 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 341.0) internal successors, (2046), 6 states have internal predecessors, (2046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:18,486 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 341.0) internal successors, (2046), 6 states have internal predecessors, (2046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:18,486 INFO L186 Difference]: Start difference. First operand has 368 places, 357 transitions, 1343 flow. Second operand 5 states and 1578 transitions. [2022-01-19 13:07:18,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 389 transitions, 1805 flow [2022-01-19 13:07:18,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 389 transitions, 1781 flow, removed 12 selfloop flow, removed 0 redundant places. [2022-01-19 13:07:18,507 INFO L242 Difference]: Finished difference. Result has 376 places, 365 transitions, 1537 flow [2022-01-19 13:07:18,508 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=1329, PETRI_DIFFERENCE_MINUEND_PLACES=368, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=335, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1537, PETRI_PLACES=376, PETRI_TRANSITIONS=365} [2022-01-19 13:07:18,508 INFO L334 CegarLoopForPetriNet]: 312 programPoint places, 64 predicate places. [2022-01-19 13:07:18,508 INFO L470 AbstractCegarLoop]: Abstraction has has 376 places, 365 transitions, 1537 flow [2022-01-19 13:07:18,508 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 307.25) internal successors, (1229), 4 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:18,508 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:07:18,508 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:07:18,509 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-19 13:07:18,509 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:07:18,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:07:18,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1567935337, now seen corresponding path program 1 times [2022-01-19 13:07:18,509 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:07:18,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125593115] [2022-01-19 13:07:18,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:07:18,509 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:07:18,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:07:18,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:07:18,573 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:07:18,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125593115] [2022-01-19 13:07:18,573 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125593115] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:07:18,573 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:07:18,573 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 13:07:18,573 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317642508] [2022-01-19 13:07:18,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:07:18,574 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 13:07:18,574 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:07:18,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 13:07:18,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-19 13:07:18,576 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 308 out of 341 [2022-01-19 13:07:18,577 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 376 places, 365 transitions, 1537 flow. Second operand has 7 states, 7 states have (on average 310.2857142857143) internal successors, (2172), 7 states have internal predecessors, (2172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:18,577 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:07:18,577 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 308 of 341 [2022-01-19 13:07:18,577 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:07:18,972 INFO L129 PetriNetUnfolder]: 413/2727 cut-off events. [2022-01-19 13:07:18,972 INFO L130 PetriNetUnfolder]: For 3465/3708 co-relation queries the response was YES. [2022-01-19 13:07:18,991 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4820 conditions, 2727 events. 413/2727 cut-off events. For 3465/3708 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 25929 event pairs, 175 based on Foata normal form. 38/2556 useless extension candidates. Maximal degree in co-relation 4237. Up to 524 conditions per place. [2022-01-19 13:07:18,996 INFO L132 encePairwiseOnDemand]: 333/341 looper letters, 22 selfloop transitions, 5 changer transitions 18/383 dead transitions. [2022-01-19 13:07:18,996 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 383 transitions, 1658 flow [2022-01-19 13:07:18,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 13:07:18,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 13:07:18,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2809 transitions. [2022-01-19 13:07:18,999 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9152818507657218 [2022-01-19 13:07:18,999 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2809 transitions. [2022-01-19 13:07:18,999 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2809 transitions. [2022-01-19 13:07:19,000 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:07:19,000 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2809 transitions. [2022-01-19 13:07:19,037 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 312.1111111111111) internal successors, (2809), 9 states have internal predecessors, (2809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:19,040 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 341.0) internal successors, (3410), 10 states have internal predecessors, (3410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:19,040 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 341.0) internal successors, (3410), 10 states have internal predecessors, (3410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:19,040 INFO L186 Difference]: Start difference. First operand has 376 places, 365 transitions, 1537 flow. Second operand 9 states and 2809 transitions. [2022-01-19 13:07:19,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 383 places, 383 transitions, 1658 flow [2022-01-19 13:07:19,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 382 places, 383 transitions, 1628 flow, removed 15 selfloop flow, removed 1 redundant places. [2022-01-19 13:07:19,054 INFO L242 Difference]: Finished difference. Result has 389 places, 360 transitions, 1427 flow [2022-01-19 13:07:19,055 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=1507, PETRI_DIFFERENCE_MINUEND_PLACES=374, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=365, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=360, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1427, PETRI_PLACES=389, PETRI_TRANSITIONS=360} [2022-01-19 13:07:19,056 INFO L334 CegarLoopForPetriNet]: 312 programPoint places, 77 predicate places. [2022-01-19 13:07:19,056 INFO L470 AbstractCegarLoop]: Abstraction has has 389 places, 360 transitions, 1427 flow [2022-01-19 13:07:19,056 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 310.2857142857143) internal successors, (2172), 7 states have internal predecessors, (2172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:19,056 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:07:19,056 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:07:19,056 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-19 13:07:19,056 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:07:19,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:07:19,057 INFO L85 PathProgramCache]: Analyzing trace with hash -521787837, now seen corresponding path program 3 times [2022-01-19 13:07:19,057 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:07:19,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510254334] [2022-01-19 13:07:19,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:07:19,057 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:07:19,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:07:19,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:07:19,105 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:07:19,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510254334] [2022-01-19 13:07:19,106 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510254334] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:07:19,106 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:07:19,106 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 13:07:19,106 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883556012] [2022-01-19 13:07:19,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:07:19,107 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 13:07:19,107 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:07:19,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 13:07:19,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 13:07:19,108 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 341 [2022-01-19 13:07:19,109 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 389 places, 360 transitions, 1427 flow. Second operand has 4 states, 4 states have (on average 307.25) internal successors, (1229), 4 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:19,109 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:07:19,109 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 341 [2022-01-19 13:07:19,109 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:07:19,590 INFO L129 PetriNetUnfolder]: 421/3575 cut-off events. [2022-01-19 13:07:19,591 INFO L130 PetriNetUnfolder]: For 7724/7822 co-relation queries the response was YES. [2022-01-19 13:07:19,617 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7255 conditions, 3575 events. 421/3575 cut-off events. For 7724/7822 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 35240 event pairs, 82 based on Foata normal form. 6/3373 useless extension candidates. Maximal degree in co-relation 7161. Up to 357 conditions per place. [2022-01-19 13:07:19,625 INFO L132 encePairwiseOnDemand]: 333/341 looper letters, 84 selfloop transitions, 12 changer transitions 14/404 dead transitions. [2022-01-19 13:07:19,626 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 391 places, 404 transitions, 2101 flow [2022-01-19 13:07:19,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 13:07:19,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 13:07:19,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1575 transitions. [2022-01-19 13:07:19,628 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9237536656891495 [2022-01-19 13:07:19,628 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1575 transitions. [2022-01-19 13:07:19,628 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1575 transitions. [2022-01-19 13:07:19,628 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:07:19,628 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1575 transitions. [2022-01-19 13:07:19,630 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 315.0) internal successors, (1575), 5 states have internal predecessors, (1575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:19,632 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 341.0) internal successors, (2046), 6 states have internal predecessors, (2046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:19,632 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 341.0) internal successors, (2046), 6 states have internal predecessors, (2046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:19,632 INFO L186 Difference]: Start difference. First operand has 389 places, 360 transitions, 1427 flow. Second operand 5 states and 1575 transitions. [2022-01-19 13:07:19,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 391 places, 404 transitions, 2101 flow [2022-01-19 13:07:19,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 388 places, 404 transitions, 2094 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-01-19 13:07:19,660 INFO L242 Difference]: Finished difference. Result has 391 places, 366 transitions, 1548 flow [2022-01-19 13:07:19,660 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=1398, PETRI_DIFFERENCE_MINUEND_PLACES=384, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=359, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=349, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1548, PETRI_PLACES=391, PETRI_TRANSITIONS=366} [2022-01-19 13:07:19,660 INFO L334 CegarLoopForPetriNet]: 312 programPoint places, 79 predicate places. [2022-01-19 13:07:19,661 INFO L470 AbstractCegarLoop]: Abstraction has has 391 places, 366 transitions, 1548 flow [2022-01-19 13:07:19,661 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 307.25) internal successors, (1229), 4 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:19,661 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:07:19,661 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:07:19,661 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-19 13:07:19,661 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:07:19,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:07:19,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1926116063, now seen corresponding path program 4 times [2022-01-19 13:07:19,662 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:07:19,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407159169] [2022-01-19 13:07:19,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:07:19,662 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:07:19,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:07:19,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:07:19,706 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:07:19,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407159169] [2022-01-19 13:07:19,706 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407159169] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:07:19,706 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:07:19,706 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 13:07:19,706 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285880012] [2022-01-19 13:07:19,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:07:19,707 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 13:07:19,707 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:07:19,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 13:07:19,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 13:07:19,708 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 341 [2022-01-19 13:07:19,709 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 391 places, 366 transitions, 1548 flow. Second operand has 4 states, 4 states have (on average 307.25) internal successors, (1229), 4 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:19,709 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:07:19,709 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 341 [2022-01-19 13:07:19,709 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:07:20,257 INFO L129 PetriNetUnfolder]: 419/3715 cut-off events. [2022-01-19 13:07:20,258 INFO L130 PetriNetUnfolder]: For 9249/9476 co-relation queries the response was YES. [2022-01-19 13:07:20,285 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7511 conditions, 3715 events. 419/3715 cut-off events. For 9249/9476 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 36452 event pairs, 184 based on Foata normal form. 4/3455 useless extension candidates. Maximal degree in co-relation 7248. Up to 498 conditions per place. [2022-01-19 13:07:20,292 INFO L132 encePairwiseOnDemand]: 333/341 looper letters, 72 selfloop transitions, 13 changer transitions 16/395 dead transitions. [2022-01-19 13:07:20,293 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 394 places, 395 transitions, 2078 flow [2022-01-19 13:07:20,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 13:07:20,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 13:07:20,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1567 transitions. [2022-01-19 13:07:20,295 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9190615835777126 [2022-01-19 13:07:20,295 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1567 transitions. [2022-01-19 13:07:20,295 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1567 transitions. [2022-01-19 13:07:20,296 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:07:20,296 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1567 transitions. [2022-01-19 13:07:20,297 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 313.4) internal successors, (1567), 5 states have internal predecessors, (1567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:20,299 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 341.0) internal successors, (2046), 6 states have internal predecessors, (2046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:20,299 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 341.0) internal successors, (2046), 6 states have internal predecessors, (2046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:20,299 INFO L186 Difference]: Start difference. First operand has 391 places, 366 transitions, 1548 flow. Second operand 5 states and 1567 transitions. [2022-01-19 13:07:20,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 394 places, 395 transitions, 2078 flow [2022-01-19 13:07:20,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 393 places, 395 transitions, 2056 flow, removed 11 selfloop flow, removed 1 redundant places. [2022-01-19 13:07:20,328 INFO L242 Difference]: Finished difference. Result has 396 places, 366 transitions, 1578 flow [2022-01-19 13:07:20,328 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=1514, PETRI_DIFFERENCE_MINUEND_PLACES=389, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=365, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1578, PETRI_PLACES=396, PETRI_TRANSITIONS=366} [2022-01-19 13:07:20,328 INFO L334 CegarLoopForPetriNet]: 312 programPoint places, 84 predicate places. [2022-01-19 13:07:20,328 INFO L470 AbstractCegarLoop]: Abstraction has has 396 places, 366 transitions, 1578 flow [2022-01-19 13:07:20,329 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 307.25) internal successors, (1229), 4 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:20,329 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:07:20,329 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:07:20,329 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-19 13:07:20,329 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:07:20,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:07:20,329 INFO L85 PathProgramCache]: Analyzing trace with hash 2134534103, now seen corresponding path program 1 times [2022-01-19 13:07:20,329 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:07:20,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547392719] [2022-01-19 13:07:20,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:07:20,330 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:07:20,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:07:20,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:07:20,368 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:07:20,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547392719] [2022-01-19 13:07:20,368 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547392719] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:07:20,368 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:07:20,368 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 13:07:20,368 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743678345] [2022-01-19 13:07:20,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:07:20,369 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 13:07:20,369 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:07:20,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 13:07:20,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 13:07:20,370 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 341 [2022-01-19 13:07:20,370 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 396 places, 366 transitions, 1578 flow. Second operand has 4 states, 4 states have (on average 307.25) internal successors, (1229), 4 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:20,370 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:07:20,370 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 341 [2022-01-19 13:07:20,370 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:07:20,895 INFO L129 PetriNetUnfolder]: 452/3643 cut-off events. [2022-01-19 13:07:20,895 INFO L130 PetriNetUnfolder]: For 10583/10593 co-relation queries the response was YES. [2022-01-19 13:07:20,922 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7719 conditions, 3643 events. 452/3643 cut-off events. For 10583/10593 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 35715 event pairs, 43 based on Foata normal form. 12/3457 useless extension candidates. Maximal degree in co-relation 7326. Up to 428 conditions per place. [2022-01-19 13:07:20,929 INFO L132 encePairwiseOnDemand]: 333/341 looper letters, 83 selfloop transitions, 16 changer transitions 14/407 dead transitions. [2022-01-19 13:07:20,930 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 400 places, 407 transitions, 2309 flow [2022-01-19 13:07:20,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 13:07:20,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 13:07:20,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1569 transitions. [2022-01-19 13:07:20,932 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9202346041055719 [2022-01-19 13:07:20,932 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1569 transitions. [2022-01-19 13:07:20,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1569 transitions. [2022-01-19 13:07:20,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:07:20,933 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1569 transitions. [2022-01-19 13:07:20,935 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 313.8) internal successors, (1569), 5 states have internal predecessors, (1569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:20,936 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 341.0) internal successors, (2046), 6 states have internal predecessors, (2046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:20,936 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 341.0) internal successors, (2046), 6 states have internal predecessors, (2046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:20,937 INFO L186 Difference]: Start difference. First operand has 396 places, 366 transitions, 1578 flow. Second operand 5 states and 1569 transitions. [2022-01-19 13:07:20,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 400 places, 407 transitions, 2309 flow [2022-01-19 13:07:20,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 400 places, 407 transitions, 2297 flow, removed 6 selfloop flow, removed 0 redundant places. [2022-01-19 13:07:20,969 INFO L242 Difference]: Finished difference. Result has 404 places, 373 transitions, 1740 flow [2022-01-19 13:07:20,969 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=1566, PETRI_DIFFERENCE_MINUEND_PLACES=396, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=366, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=353, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1740, PETRI_PLACES=404, PETRI_TRANSITIONS=373} [2022-01-19 13:07:20,970 INFO L334 CegarLoopForPetriNet]: 312 programPoint places, 92 predicate places. [2022-01-19 13:07:20,970 INFO L470 AbstractCegarLoop]: Abstraction has has 404 places, 373 transitions, 1740 flow [2022-01-19 13:07:20,970 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 307.25) internal successors, (1229), 4 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:20,970 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:07:20,970 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:07:20,970 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-19 13:07:20,970 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:07:20,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:07:20,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1231313157, now seen corresponding path program 2 times [2022-01-19 13:07:20,971 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:07:20,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406234317] [2022-01-19 13:07:20,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:07:20,971 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:07:20,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:07:21,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:07:21,021 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:07:21,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406234317] [2022-01-19 13:07:21,021 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406234317] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:07:21,021 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:07:21,021 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 13:07:21,021 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409246360] [2022-01-19 13:07:21,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:07:21,022 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 13:07:21,022 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:07:21,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 13:07:21,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 13:07:21,024 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 341 [2022-01-19 13:07:21,024 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 404 places, 373 transitions, 1740 flow. Second operand has 4 states, 4 states have (on average 307.25) internal successors, (1229), 4 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:21,024 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:07:21,024 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 341 [2022-01-19 13:07:21,024 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:07:21,596 INFO L129 PetriNetUnfolder]: 419/3451 cut-off events. [2022-01-19 13:07:21,596 INFO L130 PetriNetUnfolder]: For 11218/11287 co-relation queries the response was YES. [2022-01-19 13:07:21,628 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7437 conditions, 3451 events. 419/3451 cut-off events. For 11218/11287 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 32813 event pairs, 45 based on Foata normal form. 15/3260 useless extension candidates. Maximal degree in co-relation 7069. Up to 386 conditions per place. [2022-01-19 13:07:21,636 INFO L132 encePairwiseOnDemand]: 333/341 looper letters, 89 selfloop transitions, 17 changer transitions 9/409 dead transitions. [2022-01-19 13:07:21,636 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 408 places, 409 transitions, 2345 flow [2022-01-19 13:07:21,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 13:07:21,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 13:07:21,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1573 transitions. [2022-01-19 13:07:21,639 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9225806451612903 [2022-01-19 13:07:21,639 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1573 transitions. [2022-01-19 13:07:21,639 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1573 transitions. [2022-01-19 13:07:21,639 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:07:21,639 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1573 transitions. [2022-01-19 13:07:21,641 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 314.6) internal successors, (1573), 5 states have internal predecessors, (1573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:21,643 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 341.0) internal successors, (2046), 6 states have internal predecessors, (2046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:21,643 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 341.0) internal successors, (2046), 6 states have internal predecessors, (2046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:21,643 INFO L186 Difference]: Start difference. First operand has 404 places, 373 transitions, 1740 flow. Second operand 5 states and 1573 transitions. [2022-01-19 13:07:21,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 408 places, 409 transitions, 2345 flow [2022-01-19 13:07:21,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 406 places, 409 transitions, 2290 flow, removed 23 selfloop flow, removed 2 redundant places. [2022-01-19 13:07:21,675 INFO L242 Difference]: Finished difference. Result has 410 places, 381 transitions, 1865 flow [2022-01-19 13:07:21,675 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=1650, PETRI_DIFFERENCE_MINUEND_PLACES=402, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=371, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=356, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1865, PETRI_PLACES=410, PETRI_TRANSITIONS=381} [2022-01-19 13:07:21,675 INFO L334 CegarLoopForPetriNet]: 312 programPoint places, 98 predicate places. [2022-01-19 13:07:21,676 INFO L470 AbstractCegarLoop]: Abstraction has has 410 places, 381 transitions, 1865 flow [2022-01-19 13:07:21,676 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 307.25) internal successors, (1229), 4 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:21,676 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:07:21,676 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:07:21,676 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-19 13:07:21,676 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:07:21,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:07:21,677 INFO L85 PathProgramCache]: Analyzing trace with hash -66234203, now seen corresponding path program 1 times [2022-01-19 13:07:21,677 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:07:21,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626247113] [2022-01-19 13:07:21,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:07:21,677 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:07:21,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:07:21,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:07:21,720 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:07:21,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626247113] [2022-01-19 13:07:21,720 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626247113] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:07:21,720 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:07:21,720 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 13:07:21,720 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826354426] [2022-01-19 13:07:21,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:07:21,720 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 13:07:21,720 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:07:21,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 13:07:21,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 13:07:21,721 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 341 [2022-01-19 13:07:21,722 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 410 places, 381 transitions, 1865 flow. Second operand has 4 states, 4 states have (on average 307.5) internal successors, (1230), 4 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:21,722 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:07:21,722 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 341 [2022-01-19 13:07:21,722 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:07:22,250 INFO L129 PetriNetUnfolder]: 417/3568 cut-off events. [2022-01-19 13:07:22,251 INFO L130 PetriNetUnfolder]: For 11280/11372 co-relation queries the response was YES. [2022-01-19 13:07:22,278 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7782 conditions, 3568 events. 417/3568 cut-off events. For 11280/11372 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 34450 event pairs, 108 based on Foata normal form. 8/3356 useless extension candidates. Maximal degree in co-relation 7384. Up to 341 conditions per place. [2022-01-19 13:07:22,285 INFO L132 encePairwiseOnDemand]: 334/341 looper letters, 97 selfloop transitions, 18 changer transitions 5/414 dead transitions. [2022-01-19 13:07:22,286 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 414 places, 414 transitions, 2427 flow [2022-01-19 13:07:22,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 13:07:22,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 13:07:22,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1574 transitions. [2022-01-19 13:07:22,288 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.92316715542522 [2022-01-19 13:07:22,288 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1574 transitions. [2022-01-19 13:07:22,288 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1574 transitions. [2022-01-19 13:07:22,288 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:07:22,288 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1574 transitions. [2022-01-19 13:07:22,290 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 314.8) internal successors, (1574), 5 states have internal predecessors, (1574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:22,292 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 341.0) internal successors, (2046), 6 states have internal predecessors, (2046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:22,292 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 341.0) internal successors, (2046), 6 states have internal predecessors, (2046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:22,292 INFO L186 Difference]: Start difference. First operand has 410 places, 381 transitions, 1865 flow. Second operand 5 states and 1574 transitions. [2022-01-19 13:07:22,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 414 places, 414 transitions, 2427 flow [2022-01-19 13:07:22,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 414 places, 414 transitions, 2405 flow, removed 11 selfloop flow, removed 0 redundant places. [2022-01-19 13:07:22,323 INFO L242 Difference]: Finished difference. Result has 417 places, 388 transitions, 2030 flow [2022-01-19 13:07:22,323 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=1843, PETRI_DIFFERENCE_MINUEND_PLACES=410, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=381, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=365, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2030, PETRI_PLACES=417, PETRI_TRANSITIONS=388} [2022-01-19 13:07:22,323 INFO L334 CegarLoopForPetriNet]: 312 programPoint places, 105 predicate places. [2022-01-19 13:07:22,323 INFO L470 AbstractCegarLoop]: Abstraction has has 417 places, 388 transitions, 2030 flow [2022-01-19 13:07:22,324 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 307.5) internal successors, (1230), 4 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:22,324 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:07:22,324 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:07:22,324 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-19 13:07:22,324 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:07:22,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:07:22,324 INFO L85 PathProgramCache]: Analyzing trace with hash 299128503, now seen corresponding path program 2 times [2022-01-19 13:07:22,324 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:07:22,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302468266] [2022-01-19 13:07:22,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:07:22,325 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:07:22,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:07:22,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:07:22,368 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:07:22,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302468266] [2022-01-19 13:07:22,368 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302468266] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:07:22,368 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:07:22,368 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 13:07:22,368 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496972243] [2022-01-19 13:07:22,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:07:22,368 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 13:07:22,369 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:07:22,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 13:07:22,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 13:07:22,370 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 341 [2022-01-19 13:07:22,370 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 417 places, 388 transitions, 2030 flow. Second operand has 4 states, 4 states have (on average 307.5) internal successors, (1230), 4 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:22,370 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:07:22,370 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 341 [2022-01-19 13:07:22,370 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:07:22,908 INFO L129 PetriNetUnfolder]: 415/3517 cut-off events. [2022-01-19 13:07:22,908 INFO L130 PetriNetUnfolder]: For 12247/12371 co-relation queries the response was YES. [2022-01-19 13:07:22,945 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7758 conditions, 3517 events. 415/3517 cut-off events. For 12247/12371 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 33888 event pairs, 102 based on Foata normal form. 4/3295 useless extension candidates. Maximal degree in co-relation 7567. Up to 380 conditions per place. [2022-01-19 13:07:22,954 INFO L132 encePairwiseOnDemand]: 334/341 looper letters, 100 selfloop transitions, 19 changer transitions 20/433 dead transitions. [2022-01-19 13:07:22,954 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 421 places, 433 transitions, 2894 flow [2022-01-19 13:07:22,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 13:07:22,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 13:07:22,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1574 transitions. [2022-01-19 13:07:22,956 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.92316715542522 [2022-01-19 13:07:22,956 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1574 transitions. [2022-01-19 13:07:22,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1574 transitions. [2022-01-19 13:07:22,957 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:07:22,957 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1574 transitions. [2022-01-19 13:07:22,958 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 314.8) internal successors, (1574), 5 states have internal predecessors, (1574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:22,960 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 341.0) internal successors, (2046), 6 states have internal predecessors, (2046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:22,960 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 341.0) internal successors, (2046), 6 states have internal predecessors, (2046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:22,960 INFO L186 Difference]: Start difference. First operand has 417 places, 388 transitions, 2030 flow. Second operand 5 states and 1574 transitions. [2022-01-19 13:07:22,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 421 places, 433 transitions, 2894 flow [2022-01-19 13:07:23,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 421 places, 433 transitions, 2872 flow, removed 11 selfloop flow, removed 0 redundant places. [2022-01-19 13:07:23,005 INFO L242 Difference]: Finished difference. Result has 424 places, 386 transitions, 2058 flow [2022-01-19 13:07:23,006 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=2018, PETRI_DIFFERENCE_MINUEND_PLACES=417, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=388, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=372, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2058, PETRI_PLACES=424, PETRI_TRANSITIONS=386} [2022-01-19 13:07:23,006 INFO L334 CegarLoopForPetriNet]: 312 programPoint places, 112 predicate places. [2022-01-19 13:07:23,006 INFO L470 AbstractCegarLoop]: Abstraction has has 424 places, 386 transitions, 2058 flow [2022-01-19 13:07:23,006 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 307.5) internal successors, (1230), 4 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:23,007 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:07:23,007 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:07:23,007 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-19 13:07:23,007 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:07:23,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:07:23,007 INFO L85 PathProgramCache]: Analyzing trace with hash 543254387, now seen corresponding path program 3 times [2022-01-19 13:07:23,007 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:07:23,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425692983] [2022-01-19 13:07:23,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:07:23,007 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:07:23,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:07:23,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:07:23,047 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:07:23,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425692983] [2022-01-19 13:07:23,047 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425692983] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:07:23,047 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:07:23,047 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 13:07:23,047 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087715588] [2022-01-19 13:07:23,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:07:23,047 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 13:07:23,047 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:07:23,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 13:07:23,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 13:07:23,049 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 341 [2022-01-19 13:07:23,049 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 424 places, 386 transitions, 2058 flow. Second operand has 4 states, 4 states have (on average 307.5) internal successors, (1230), 4 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:23,049 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:07:23,049 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 341 [2022-01-19 13:07:23,049 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:07:23,500 INFO L129 PetriNetUnfolder]: 369/3165 cut-off events. [2022-01-19 13:07:23,501 INFO L130 PetriNetUnfolder]: For 11385/11485 co-relation queries the response was YES. [2022-01-19 13:07:23,527 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6964 conditions, 3165 events. 369/3165 cut-off events. For 11385/11485 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 29163 event pairs, 90 based on Foata normal form. 2/2952 useless extension candidates. Maximal degree in co-relation 6796. Up to 359 conditions per place. [2022-01-19 13:07:23,535 INFO L132 encePairwiseOnDemand]: 335/341 looper letters, 102 selfloop transitions, 17 changer transitions 7/420 dead transitions. [2022-01-19 13:07:23,535 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 427 places, 420 transitions, 2701 flow [2022-01-19 13:07:23,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 13:07:23,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 13:07:23,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1567 transitions. [2022-01-19 13:07:23,537 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9190615835777126 [2022-01-19 13:07:23,537 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1567 transitions. [2022-01-19 13:07:23,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1567 transitions. [2022-01-19 13:07:23,537 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:07:23,537 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1567 transitions. [2022-01-19 13:07:23,539 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 313.4) internal successors, (1567), 5 states have internal predecessors, (1567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:23,540 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 341.0) internal successors, (2046), 6 states have internal predecessors, (2046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:23,540 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 341.0) internal successors, (2046), 6 states have internal predecessors, (2046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:23,540 INFO L186 Difference]: Start difference. First operand has 424 places, 386 transitions, 2058 flow. Second operand 5 states and 1567 transitions. [2022-01-19 13:07:23,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 427 places, 420 transitions, 2701 flow [2022-01-19 13:07:23,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 424 places, 420 transitions, 2632 flow, removed 29 selfloop flow, removed 3 redundant places. [2022-01-19 13:07:23,576 INFO L242 Difference]: Finished difference. Result has 426 places, 391 transitions, 2128 flow [2022-01-19 13:07:23,576 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=1965, PETRI_DIFFERENCE_MINUEND_PLACES=420, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=385, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=371, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2128, PETRI_PLACES=426, PETRI_TRANSITIONS=391} [2022-01-19 13:07:23,576 INFO L334 CegarLoopForPetriNet]: 312 programPoint places, 114 predicate places. [2022-01-19 13:07:23,577 INFO L470 AbstractCegarLoop]: Abstraction has has 426 places, 391 transitions, 2128 flow [2022-01-19 13:07:23,577 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 307.5) internal successors, (1230), 4 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:23,577 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:07:23,577 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:07:23,577 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-19 13:07:23,577 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:07:23,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:07:23,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1524011439, now seen corresponding path program 4 times [2022-01-19 13:07:23,578 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:07:23,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247729261] [2022-01-19 13:07:23,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:07:23,579 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:07:23,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:07:23,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:07:23,634 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:07:23,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247729261] [2022-01-19 13:07:23,634 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247729261] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:07:23,634 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:07:23,634 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 13:07:23,635 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185706727] [2022-01-19 13:07:23,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:07:23,636 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 13:07:23,636 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:07:23,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 13:07:23,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 13:07:23,637 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 341 [2022-01-19 13:07:23,638 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 426 places, 391 transitions, 2128 flow. Second operand has 4 states, 4 states have (on average 307.5) internal successors, (1230), 4 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:23,638 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:07:23,638 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 341 [2022-01-19 13:07:23,638 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:07:24,133 INFO L129 PetriNetUnfolder]: 367/3106 cut-off events. [2022-01-19 13:07:24,134 INFO L130 PetriNetUnfolder]: For 11010/11113 co-relation queries the response was YES. [2022-01-19 13:07:24,163 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6811 conditions, 3106 events. 367/3106 cut-off events. For 11010/11113 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 28777 event pairs, 98 based on Foata normal form. 3/2902 useless extension candidates. Maximal degree in co-relation 6642. Up to 391 conditions per place. [2022-01-19 13:07:24,171 INFO L132 encePairwiseOnDemand]: 335/341 looper letters, 96 selfloop transitions, 16 changer transitions 10/416 dead transitions. [2022-01-19 13:07:24,171 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 429 places, 416 transitions, 2643 flow [2022-01-19 13:07:24,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 13:07:24,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 13:07:24,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1564 transitions. [2022-01-19 13:07:24,172 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9173020527859238 [2022-01-19 13:07:24,172 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1564 transitions. [2022-01-19 13:07:24,172 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1564 transitions. [2022-01-19 13:07:24,173 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:07:24,173 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1564 transitions. [2022-01-19 13:07:24,174 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 312.8) internal successors, (1564), 5 states have internal predecessors, (1564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:24,176 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 341.0) internal successors, (2046), 6 states have internal predecessors, (2046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:24,176 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 341.0) internal successors, (2046), 6 states have internal predecessors, (2046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:24,176 INFO L186 Difference]: Start difference. First operand has 426 places, 391 transitions, 2128 flow. Second operand 5 states and 1564 transitions. [2022-01-19 13:07:24,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 429 places, 416 transitions, 2643 flow [2022-01-19 13:07:24,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 427 places, 416 transitions, 2604 flow, removed 9 selfloop flow, removed 2 redundant places. [2022-01-19 13:07:24,210 INFO L242 Difference]: Finished difference. Result has 430 places, 392 transitions, 2164 flow [2022-01-19 13:07:24,210 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=2076, PETRI_DIFFERENCE_MINUEND_PLACES=423, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=390, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=374, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2164, PETRI_PLACES=430, PETRI_TRANSITIONS=392} [2022-01-19 13:07:24,210 INFO L334 CegarLoopForPetriNet]: 312 programPoint places, 118 predicate places. [2022-01-19 13:07:24,210 INFO L470 AbstractCegarLoop]: Abstraction has has 430 places, 392 transitions, 2164 flow [2022-01-19 13:07:24,211 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 307.5) internal successors, (1230), 4 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:24,211 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:07:24,211 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:07:24,211 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-19 13:07:24,211 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:07:24,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:07:24,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1854010667, now seen corresponding path program 1 times [2022-01-19 13:07:24,211 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:07:24,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702364068] [2022-01-19 13:07:24,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:07:24,212 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:07:24,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:07:24,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:07:24,248 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:07:24,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702364068] [2022-01-19 13:07:24,248 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702364068] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:07:24,248 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:07:24,248 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 13:07:24,248 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64254727] [2022-01-19 13:07:24,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:07:24,249 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 13:07:24,249 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:07:24,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 13:07:24,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 13:07:24,250 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 341 [2022-01-19 13:07:24,250 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 430 places, 392 transitions, 2164 flow. Second operand has 4 states, 4 states have (on average 307.5) internal successors, (1230), 4 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:24,250 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:07:24,250 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 341 [2022-01-19 13:07:24,250 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:07:24,683 INFO L129 PetriNetUnfolder]: 399/3056 cut-off events. [2022-01-19 13:07:24,683 INFO L130 PetriNetUnfolder]: For 10907/10917 co-relation queries the response was YES. [2022-01-19 13:07:24,709 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6789 conditions, 3056 events. 399/3056 cut-off events. For 10907/10917 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 28118 event pairs, 45 based on Foata normal form. 6/2865 useless extension candidates. Maximal degree in co-relation 6641. Up to 266 conditions per place. [2022-01-19 13:07:24,715 INFO L132 encePairwiseOnDemand]: 332/341 looper letters, 102 selfloop transitions, 26 changer transitions 18/440 dead transitions. [2022-01-19 13:07:24,715 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 434 places, 440 transitions, 3172 flow [2022-01-19 13:07:24,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 13:07:24,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 13:07:24,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1572 transitions. [2022-01-19 13:07:24,716 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9219941348973607 [2022-01-19 13:07:24,717 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1572 transitions. [2022-01-19 13:07:24,717 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1572 transitions. [2022-01-19 13:07:24,717 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:07:24,717 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1572 transitions. [2022-01-19 13:07:24,719 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 314.4) internal successors, (1572), 5 states have internal predecessors, (1572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:24,720 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 341.0) internal successors, (2046), 6 states have internal predecessors, (2046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:24,720 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 341.0) internal successors, (2046), 6 states have internal predecessors, (2046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:24,720 INFO L186 Difference]: Start difference. First operand has 430 places, 392 transitions, 2164 flow. Second operand 5 states and 1572 transitions. [2022-01-19 13:07:24,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 434 places, 440 transitions, 3172 flow [2022-01-19 13:07:24,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 433 places, 440 transitions, 3160 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-01-19 13:07:24,758 INFO L242 Difference]: Finished difference. Result has 437 places, 392 transitions, 2293 flow [2022-01-19 13:07:24,758 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=2155, PETRI_DIFFERENCE_MINUEND_PLACES=429, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=392, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=368, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2293, PETRI_PLACES=437, PETRI_TRANSITIONS=392} [2022-01-19 13:07:24,759 INFO L334 CegarLoopForPetriNet]: 312 programPoint places, 125 predicate places. [2022-01-19 13:07:24,759 INFO L470 AbstractCegarLoop]: Abstraction has has 437 places, 392 transitions, 2293 flow [2022-01-19 13:07:24,759 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 307.5) internal successors, (1230), 4 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:24,759 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:07:24,759 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:07:24,759 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-19 13:07:24,759 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:07:24,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:07:24,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1432073873, now seen corresponding path program 1 times [2022-01-19 13:07:24,760 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:07:24,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574718337] [2022-01-19 13:07:24,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:07:24,760 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:07:24,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:07:24,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:07:24,796 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:07:24,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574718337] [2022-01-19 13:07:24,796 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574718337] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:07:24,796 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:07:24,796 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 13:07:24,796 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814108608] [2022-01-19 13:07:24,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:07:24,796 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 13:07:24,797 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:07:24,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 13:07:24,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 13:07:24,798 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 341 [2022-01-19 13:07:24,798 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 437 places, 392 transitions, 2293 flow. Second operand has 4 states, 4 states have (on average 307.5) internal successors, (1230), 4 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:24,798 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:07:24,798 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 341 [2022-01-19 13:07:24,798 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:07:25,245 INFO L129 PetriNetUnfolder]: 339/2786 cut-off events. [2022-01-19 13:07:25,245 INFO L130 PetriNetUnfolder]: For 12020/12044 co-relation queries the response was YES. [2022-01-19 13:07:25,275 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6362 conditions, 2786 events. 339/2786 cut-off events. For 12020/12044 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 24856 event pairs, 27 based on Foata normal form. 12/2632 useless extension candidates. Maximal degree in co-relation 6209. Up to 226 conditions per place. [2022-01-19 13:07:25,282 INFO L132 encePairwiseOnDemand]: 332/341 looper letters, 122 selfloop transitions, 25 changer transitions 9/450 dead transitions. [2022-01-19 13:07:25,282 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 441 places, 450 transitions, 3457 flow [2022-01-19 13:07:25,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 13:07:25,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 13:07:25,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1578 transitions. [2022-01-19 13:07:25,292 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9255131964809384 [2022-01-19 13:07:25,292 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1578 transitions. [2022-01-19 13:07:25,292 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1578 transitions. [2022-01-19 13:07:25,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:07:25,293 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1578 transitions. [2022-01-19 13:07:25,296 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 315.6) internal successors, (1578), 5 states have internal predecessors, (1578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:25,297 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 341.0) internal successors, (2046), 6 states have internal predecessors, (2046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:25,298 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 341.0) internal successors, (2046), 6 states have internal predecessors, (2046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:25,298 INFO L186 Difference]: Start difference. First operand has 437 places, 392 transitions, 2293 flow. Second operand 5 states and 1578 transitions. [2022-01-19 13:07:25,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 441 places, 450 transitions, 3457 flow [2022-01-19 13:07:25,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 438 places, 450 transitions, 3379 flow, removed 25 selfloop flow, removed 3 redundant places. [2022-01-19 13:07:25,336 INFO L242 Difference]: Finished difference. Result has 442 places, 401 transitions, 2507 flow [2022-01-19 13:07:25,336 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=2241, PETRI_DIFFERENCE_MINUEND_PLACES=434, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=392, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=369, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2507, PETRI_PLACES=442, PETRI_TRANSITIONS=401} [2022-01-19 13:07:25,336 INFO L334 CegarLoopForPetriNet]: 312 programPoint places, 130 predicate places. [2022-01-19 13:07:25,337 INFO L470 AbstractCegarLoop]: Abstraction has has 442 places, 401 transitions, 2507 flow [2022-01-19 13:07:25,337 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 307.5) internal successors, (1230), 4 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:25,337 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:07:25,337 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:07:25,337 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-19 13:07:25,337 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:07:25,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:07:25,338 INFO L85 PathProgramCache]: Analyzing trace with hash 598045953, now seen corresponding path program 2 times [2022-01-19 13:07:25,338 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:07:25,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402697400] [2022-01-19 13:07:25,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:07:25,338 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:07:25,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:07:25,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:07:25,379 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:07:25,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402697400] [2022-01-19 13:07:25,379 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402697400] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:07:25,379 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:07:25,379 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 13:07:25,379 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546710820] [2022-01-19 13:07:25,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:07:25,380 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 13:07:25,380 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:07:25,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 13:07:25,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 13:07:25,381 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 341 [2022-01-19 13:07:25,381 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 442 places, 401 transitions, 2507 flow. Second operand has 4 states, 4 states have (on average 307.5) internal successors, (1230), 4 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:25,381 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:07:25,382 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 341 [2022-01-19 13:07:25,382 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:07:25,871 INFO L129 PetriNetUnfolder]: 348/2932 cut-off events. [2022-01-19 13:07:25,871 INFO L130 PetriNetUnfolder]: For 12709/12783 co-relation queries the response was YES. [2022-01-19 13:07:25,900 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6466 conditions, 2932 events. 348/2932 cut-off events. For 12709/12783 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 26335 event pairs, 47 based on Foata normal form. 18/2754 useless extension candidates. Maximal degree in co-relation 6302. Up to 154 conditions per place. [2022-01-19 13:07:25,908 INFO L132 encePairwiseOnDemand]: 331/341 looper letters, 124 selfloop transitions, 34 changer transitions 7/459 dead transitions. [2022-01-19 13:07:25,909 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 446 places, 459 transitions, 3634 flow [2022-01-19 13:07:25,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 13:07:25,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 13:07:25,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1579 transitions. [2022-01-19 13:07:25,912 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9260997067448681 [2022-01-19 13:07:25,912 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1579 transitions. [2022-01-19 13:07:25,912 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1579 transitions. [2022-01-19 13:07:25,913 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:07:25,913 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1579 transitions. [2022-01-19 13:07:25,914 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 315.8) internal successors, (1579), 5 states have internal predecessors, (1579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:25,915 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 341.0) internal successors, (2046), 6 states have internal predecessors, (2046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:25,915 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 341.0) internal successors, (2046), 6 states have internal predecessors, (2046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:25,916 INFO L186 Difference]: Start difference. First operand has 442 places, 401 transitions, 2507 flow. Second operand 5 states and 1579 transitions. [2022-01-19 13:07:25,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 446 places, 459 transitions, 3634 flow [2022-01-19 13:07:25,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 445 places, 459 transitions, 3588 flow, removed 19 selfloop flow, removed 1 redundant places. [2022-01-19 13:07:25,957 INFO L242 Difference]: Finished difference. Result has 449 places, 415 transitions, 2882 flow [2022-01-19 13:07:25,957 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=2442, PETRI_DIFFERENCE_MINUEND_PLACES=441, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=400, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=371, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2882, PETRI_PLACES=449, PETRI_TRANSITIONS=415} [2022-01-19 13:07:25,957 INFO L334 CegarLoopForPetriNet]: 312 programPoint places, 137 predicate places. [2022-01-19 13:07:25,957 INFO L470 AbstractCegarLoop]: Abstraction has has 449 places, 415 transitions, 2882 flow [2022-01-19 13:07:25,958 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 307.5) internal successors, (1230), 4 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:25,958 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:07:25,958 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:07:25,958 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-19 13:07:25,958 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:07:25,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:07:25,958 INFO L85 PathProgramCache]: Analyzing trace with hash 875340509, now seen corresponding path program 2 times [2022-01-19 13:07:25,958 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:07:25,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721517968] [2022-01-19 13:07:25,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:07:25,959 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:07:25,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:07:25,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:07:25,994 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:07:25,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721517968] [2022-01-19 13:07:25,994 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721517968] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:07:25,994 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:07:25,994 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 13:07:25,994 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657085523] [2022-01-19 13:07:25,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:07:25,995 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 13:07:25,995 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:07:25,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 13:07:25,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 13:07:25,996 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 341 [2022-01-19 13:07:25,996 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 449 places, 415 transitions, 2882 flow. Second operand has 4 states, 4 states have (on average 307.5) internal successors, (1230), 4 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:25,996 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:07:25,996 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 341 [2022-01-19 13:07:25,997 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:07:26,471 INFO L129 PetriNetUnfolder]: 351/2788 cut-off events. [2022-01-19 13:07:26,472 INFO L130 PetriNetUnfolder]: For 13495/13559 co-relation queries the response was YES. [2022-01-19 13:07:26,499 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6331 conditions, 2788 events. 351/2788 cut-off events. For 13495/13559 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 24922 event pairs, 41 based on Foata normal form. 11/2610 useless extension candidates. Maximal degree in co-relation 6160. Up to 195 conditions per place. [2022-01-19 13:07:26,506 INFO L132 encePairwiseOnDemand]: 331/341 looper letters, 119 selfloop transitions, 38 changer transitions 6/457 dead transitions. [2022-01-19 13:07:26,506 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 453 places, 457 transitions, 3795 flow [2022-01-19 13:07:26,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 13:07:26,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 13:07:26,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1576 transitions. [2022-01-19 13:07:26,508 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9243401759530792 [2022-01-19 13:07:26,508 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1576 transitions. [2022-01-19 13:07:26,508 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1576 transitions. [2022-01-19 13:07:26,508 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:07:26,508 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1576 transitions. [2022-01-19 13:07:26,509 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 315.2) internal successors, (1576), 5 states have internal predecessors, (1576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:26,510 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 341.0) internal successors, (2046), 6 states have internal predecessors, (2046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:26,511 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 341.0) internal successors, (2046), 6 states have internal predecessors, (2046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:26,511 INFO L186 Difference]: Start difference. First operand has 449 places, 415 transitions, 2882 flow. Second operand 5 states and 1576 transitions. [2022-01-19 13:07:26,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 453 places, 457 transitions, 3795 flow [2022-01-19 13:07:26,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 452 places, 457 transitions, 3730 flow, removed 31 selfloop flow, removed 1 redundant places. [2022-01-19 13:07:26,553 INFO L242 Difference]: Finished difference. Result has 456 places, 424 transitions, 3168 flow [2022-01-19 13:07:26,553 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=2758, PETRI_DIFFERENCE_MINUEND_PLACES=448, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=412, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=378, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3168, PETRI_PLACES=456, PETRI_TRANSITIONS=424} [2022-01-19 13:07:26,553 INFO L334 CegarLoopForPetriNet]: 312 programPoint places, 144 predicate places. [2022-01-19 13:07:26,553 INFO L470 AbstractCegarLoop]: Abstraction has has 456 places, 424 transitions, 3168 flow [2022-01-19 13:07:26,554 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 307.5) internal successors, (1230), 4 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:26,554 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:07:26,554 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:07:26,554 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-01-19 13:07:26,554 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:07:26,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:07:26,554 INFO L85 PathProgramCache]: Analyzing trace with hash -663131617, now seen corresponding path program 1 times [2022-01-19 13:07:26,554 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:07:26,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725334682] [2022-01-19 13:07:26,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:07:26,555 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:07:26,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:07:26,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:07:26,638 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:07:26,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725334682] [2022-01-19 13:07:26,638 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725334682] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:07:26,638 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:07:26,638 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 13:07:26,638 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032907238] [2022-01-19 13:07:26,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:07:26,638 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 13:07:26,638 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:07:26,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 13:07:26,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-19 13:07:26,640 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 305 out of 341 [2022-01-19 13:07:26,641 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 456 places, 424 transitions, 3168 flow. Second operand has 8 states, 8 states have (on average 307.25) internal successors, (2458), 8 states have internal predecessors, (2458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:26,641 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:07:26,641 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 305 of 341 [2022-01-19 13:07:26,641 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:07:27,178 INFO L129 PetriNetUnfolder]: 272/2780 cut-off events. [2022-01-19 13:07:27,179 INFO L130 PetriNetUnfolder]: For 9471/9783 co-relation queries the response was YES. [2022-01-19 13:07:27,203 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5688 conditions, 2780 events. 272/2780 cut-off events. For 9471/9783 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 26019 event pairs, 68 based on Foata normal form. 73/2689 useless extension candidates. Maximal degree in co-relation 5507. Up to 319 conditions per place. [2022-01-19 13:07:27,208 INFO L132 encePairwiseOnDemand]: 331/341 looper letters, 35 selfloop transitions, 7 changer transitions 10/450 dead transitions. [2022-01-19 13:07:27,208 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 466 places, 450 transitions, 3333 flow [2022-01-19 13:07:27,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-19 13:07:27,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-01-19 13:07:27,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 3402 transitions. [2022-01-19 13:07:27,211 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9069581444948014 [2022-01-19 13:07:27,211 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 3402 transitions. [2022-01-19 13:07:27,211 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 3402 transitions. [2022-01-19 13:07:27,211 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:07:27,211 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 3402 transitions. [2022-01-19 13:07:27,214 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 309.27272727272725) internal successors, (3402), 11 states have internal predecessors, (3402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:27,216 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 341.0) internal successors, (4092), 12 states have internal predecessors, (4092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:27,216 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 341.0) internal successors, (4092), 12 states have internal predecessors, (4092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:27,216 INFO L186 Difference]: Start difference. First operand has 456 places, 424 transitions, 3168 flow. Second operand 11 states and 3402 transitions. [2022-01-19 13:07:27,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 466 places, 450 transitions, 3333 flow [2022-01-19 13:07:27,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 466 places, 450 transitions, 3289 flow, removed 22 selfloop flow, removed 0 redundant places. [2022-01-19 13:07:27,252 INFO L242 Difference]: Finished difference. Result has 475 places, 424 transitions, 3060 flow [2022-01-19 13:07:27,252 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=3124, PETRI_DIFFERENCE_MINUEND_PLACES=456, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=424, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=417, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3060, PETRI_PLACES=475, PETRI_TRANSITIONS=424} [2022-01-19 13:07:27,253 INFO L334 CegarLoopForPetriNet]: 312 programPoint places, 163 predicate places. [2022-01-19 13:07:27,253 INFO L470 AbstractCegarLoop]: Abstraction has has 475 places, 424 transitions, 3060 flow [2022-01-19 13:07:27,253 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 307.25) internal successors, (2458), 8 states have internal predecessors, (2458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:27,253 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:07:27,253 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:07:27,253 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-01-19 13:07:27,253 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:07:27,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:07:27,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1873514764, now seen corresponding path program 1 times [2022-01-19 13:07:27,254 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:07:27,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302732197] [2022-01-19 13:07:27,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:07:27,254 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:07:27,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:07:27,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:07:27,343 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:07:27,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302732197] [2022-01-19 13:07:27,343 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302732197] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:07:27,343 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:07:27,343 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-19 13:07:27,343 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374531593] [2022-01-19 13:07:27,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:07:27,344 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-19 13:07:27,344 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:07:27,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-19 13:07:27,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-01-19 13:07:27,346 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 301 out of 341 [2022-01-19 13:07:27,347 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 475 places, 424 transitions, 3060 flow. Second operand has 9 states, 9 states have (on average 303.44444444444446) internal successors, (2731), 9 states have internal predecessors, (2731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:27,347 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:07:27,347 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 301 of 341 [2022-01-19 13:07:27,347 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:07:29,202 INFO L129 PetriNetUnfolder]: 2145/8999 cut-off events. [2022-01-19 13:07:29,203 INFO L130 PetriNetUnfolder]: For 14558/15346 co-relation queries the response was YES. [2022-01-19 13:07:29,313 INFO L84 FinitePrefix]: Finished finitePrefix Result has 19089 conditions, 8999 events. 2145/8999 cut-off events. For 14558/15346 co-relation queries the response was YES. Maximal size of possible extension queue 478. Compared 100791 event pairs, 1032 based on Foata normal form. 233/8495 useless extension candidates. Maximal degree in co-relation 18997. Up to 2070 conditions per place. [2022-01-19 13:07:29,328 INFO L132 encePairwiseOnDemand]: 328/341 looper letters, 78 selfloop transitions, 12 changer transitions 4/489 dead transitions. [2022-01-19 13:07:29,329 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 486 places, 489 transitions, 3510 flow [2022-01-19 13:07:29,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-19 13:07:29,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-01-19 13:07:29,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 4291 transitions. [2022-01-19 13:07:29,331 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8988269794721407 [2022-01-19 13:07:29,331 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 4291 transitions. [2022-01-19 13:07:29,331 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 4291 transitions. [2022-01-19 13:07:29,335 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:07:29,335 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 4291 transitions. [2022-01-19 13:07:29,338 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 306.5) internal successors, (4291), 14 states have internal predecessors, (4291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:29,341 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 341.0) internal successors, (5115), 15 states have internal predecessors, (5115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:29,342 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 341.0) internal successors, (5115), 15 states have internal predecessors, (5115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:29,342 INFO L186 Difference]: Start difference. First operand has 475 places, 424 transitions, 3060 flow. Second operand 14 states and 4291 transitions. [2022-01-19 13:07:29,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 486 places, 489 transitions, 3510 flow [2022-01-19 13:07:29,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 482 places, 489 transitions, 3494 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-01-19 13:07:29,401 INFO L242 Difference]: Finished difference. Result has 491 places, 430 transitions, 3118 flow [2022-01-19 13:07:29,401 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=3046, PETRI_DIFFERENCE_MINUEND_PLACES=469, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=424, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=412, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=3118, PETRI_PLACES=491, PETRI_TRANSITIONS=430} [2022-01-19 13:07:29,402 INFO L334 CegarLoopForPetriNet]: 312 programPoint places, 179 predicate places. [2022-01-19 13:07:29,402 INFO L470 AbstractCegarLoop]: Abstraction has has 491 places, 430 transitions, 3118 flow [2022-01-19 13:07:29,402 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 303.44444444444446) internal successors, (2731), 9 states have internal predecessors, (2731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:29,402 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:07:29,402 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:07:29,402 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-01-19 13:07:29,402 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:07:29,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:07:29,403 INFO L85 PathProgramCache]: Analyzing trace with hash -930111915, now seen corresponding path program 1 times [2022-01-19 13:07:29,403 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:07:29,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066874375] [2022-01-19 13:07:29,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:07:29,403 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:07:29,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:07:30,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:07:30,018 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:07:30,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066874375] [2022-01-19 13:07:30,018 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066874375] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:07:30,018 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:07:30,018 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2022-01-19 13:07:30,018 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266301401] [2022-01-19 13:07:30,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:07:30,019 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-01-19 13:07:30,019 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:07:30,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-01-19 13:07:30,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2022-01-19 13:07:30,025 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 341 [2022-01-19 13:07:30,029 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 491 places, 430 transitions, 3118 flow. Second operand has 40 states, 40 states have (on average 227.375) internal successors, (9095), 40 states have internal predecessors, (9095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:07:30,030 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:07:30,030 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 341 [2022-01-19 13:07:30,030 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:08:22,711 INFO L129 PetriNetUnfolder]: 70512/237254 cut-off events. [2022-01-19 13:08:22,711 INFO L130 PetriNetUnfolder]: For 205208/207418 co-relation queries the response was YES. [2022-01-19 13:08:28,418 INFO L84 FinitePrefix]: Finished finitePrefix Result has 440988 conditions, 237254 events. 70512/237254 cut-off events. For 205208/207418 co-relation queries the response was YES. Maximal size of possible extension queue 3318. Compared 3656423 event pairs, 3626 based on Foata normal form. 84/220630 useless extension candidates. Maximal degree in co-relation 440867. Up to 27856 conditions per place. [2022-01-19 13:08:29,050 INFO L132 encePairwiseOnDemand]: 288/341 looper letters, 2183 selfloop transitions, 119 changer transitions 9/2636 dead transitions. [2022-01-19 13:08:29,050 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 575 places, 2636 transitions, 12281 flow [2022-01-19 13:08:29,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2022-01-19 13:08:29,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2022-01-19 13:08:29,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 21885 transitions. [2022-01-19 13:08:29,067 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.737688340580443 [2022-01-19 13:08:29,067 INFO L72 ComplementDD]: Start complementDD. Operand 87 states and 21885 transitions. [2022-01-19 13:08:29,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 21885 transitions. [2022-01-19 13:08:29,072 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:08:29,072 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 87 states and 21885 transitions. [2022-01-19 13:08:29,090 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 88 states, 87 states have (on average 251.55172413793105) internal successors, (21885), 87 states have internal predecessors, (21885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:08:29,107 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 88 states, 88 states have (on average 341.0) internal successors, (30008), 88 states have internal predecessors, (30008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:08:29,111 INFO L81 ComplementDD]: Finished complementDD. Result has 88 states, 88 states have (on average 341.0) internal successors, (30008), 88 states have internal predecessors, (30008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:08:29,111 INFO L186 Difference]: Start difference. First operand has 491 places, 430 transitions, 3118 flow. Second operand 87 states and 21885 transitions. [2022-01-19 13:08:29,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 575 places, 2636 transitions, 12281 flow [2022-01-19 13:08:39,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 568 places, 2636 transitions, 12260 flow, removed 5 selfloop flow, removed 7 redundant places. [2022-01-19 13:08:39,359 INFO L242 Difference]: Finished difference. Result has 619 places, 529 transitions, 3724 flow [2022-01-19 13:08:39,360 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=3097, PETRI_DIFFERENCE_MINUEND_PLACES=482, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=430, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=379, PETRI_DIFFERENCE_SUBTRAHEND_STATES=87, PETRI_FLOW=3724, PETRI_PLACES=619, PETRI_TRANSITIONS=529} [2022-01-19 13:08:39,360 INFO L334 CegarLoopForPetriNet]: 312 programPoint places, 307 predicate places. [2022-01-19 13:08:39,360 INFO L470 AbstractCegarLoop]: Abstraction has has 619 places, 529 transitions, 3724 flow [2022-01-19 13:08:39,361 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 227.375) internal successors, (9095), 40 states have internal predecessors, (9095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:08:39,361 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:08:39,361 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:08:39,361 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-01-19 13:08:39,361 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 13:08:39,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:08:39,362 INFO L85 PathProgramCache]: Analyzing trace with hash 347260863, now seen corresponding path program 2 times [2022-01-19 13:08:39,362 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:08:39,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980275968] [2022-01-19 13:08:39,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:08:39,362 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:08:39,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:08:40,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 13:08:40,051 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:08:40,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980275968] [2022-01-19 13:08:40,051 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980275968] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:08:40,052 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:08:40,052 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2022-01-19 13:08:40,052 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834916004] [2022-01-19 13:08:40,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:08:40,052 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-01-19 13:08:40,052 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:08:40,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-01-19 13:08:40,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2022-01-19 13:08:40,055 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 341 [2022-01-19 13:08:40,059 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 619 places, 529 transitions, 3724 flow. Second operand has 40 states, 40 states have (on average 227.375) internal successors, (9095), 40 states have internal predecessors, (9095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:08:40,059 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:08:40,059 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 341 [2022-01-19 13:08:40,059 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand