/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-nzb-file-symm.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bf34d27 [2022-01-19 13:13:33,787 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-19 13:13:33,788 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-19 13:13:33,836 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-19 13:13:33,836 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-19 13:13:33,839 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-19 13:13:33,840 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-19 13:13:33,847 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-19 13:13:33,848 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-19 13:13:33,850 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-19 13:13:33,851 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-19 13:13:33,852 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-19 13:13:33,852 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-19 13:13:33,852 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-19 13:13:33,853 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-19 13:13:33,853 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-19 13:13:33,854 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-19 13:13:33,854 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-19 13:13:33,855 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-19 13:13:33,856 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-19 13:13:33,857 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-19 13:13:33,857 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-19 13:13:33,858 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-19 13:13:33,858 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-19 13:13:33,860 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-19 13:13:33,860 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-19 13:13:33,860 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-19 13:13:33,860 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-19 13:13:33,861 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-19 13:13:33,861 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-19 13:13:33,861 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-19 13:13:33,862 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-19 13:13:33,862 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-19 13:13:33,862 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-19 13:13:33,863 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-19 13:13:33,863 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-19 13:13:33,863 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-19 13:13:33,864 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-19 13:13:33,864 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-19 13:13:33,864 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-19 13:13:33,865 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-19 13:13:33,865 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:13:33,878 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-19 13:13:33,878 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-19 13:13:33,879 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-19 13:13:33,879 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-19 13:13:33,880 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-19 13:13:33,880 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-19 13:13:33,880 INFO L138 SettingsManager]: * Use SBE=true [2022-01-19 13:13:33,880 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-19 13:13:33,880 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-19 13:13:33,880 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-19 13:13:33,880 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-19 13:13:33,880 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-19 13:13:33,881 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-19 13:13:33,881 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-19 13:13:33,881 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-19 13:13:33,881 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-19 13:13:33,881 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-19 13:13:33,881 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-19 13:13:33,881 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-19 13:13:33,881 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-19 13:13:33,882 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-19 13:13:33,882 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-19 13:13:33,882 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-19 13:13:33,882 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 13:13:33,882 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-19 13:13:33,882 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-19 13:13:33,882 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-19 13:13:33,882 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-19 13:13:33,883 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-19 13:13:33,883 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-19 13:13:33,883 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-19 13:13:33,883 INFO L138 SettingsManager]: * When to check the insufficient erros location relative to the other error locations=AFTER [2022-01-19 13:13:33,883 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:13:34,019 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-19 13:13:34,034 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-19 13:13:34,038 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-19 13:13:34,039 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-19 13:13:34,040 INFO L275 PluginConnector]: CDTParser initialized [2022-01-19 13:13:34,040 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-nzb-file-symm.wvr.c [2022-01-19 13:13:34,095 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1c8d0589/9130afc3c0fe4c78a142a609bc35c0c6/FLAGaa09ad384 [2022-01-19 13:13:34,447 INFO L306 CDTParser]: Found 1 translation units. [2022-01-19 13:13:34,448 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-nzb-file-symm.wvr.c [2022-01-19 13:13:34,452 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1c8d0589/9130afc3c0fe4c78a142a609bc35c0c6/FLAGaa09ad384 [2022-01-19 13:13:34,462 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1c8d0589/9130afc3c0fe4c78a142a609bc35c0c6 [2022-01-19 13:13:34,464 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-19 13:13:34,465 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-19 13:13:34,466 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-19 13:13:34,466 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-19 13:13:34,467 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-19 13:13:34,468 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 01:13:34" (1/1) ... [2022-01-19 13:13:34,469 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47531d36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:13:34, skipping insertion in model container [2022-01-19 13:13:34,469 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 01:13:34" (1/1) ... [2022-01-19 13:13:34,473 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-19 13:13:34,485 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-19 13:13:34,633 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-nzb-file-symm.wvr.c[4929,4942] [2022-01-19 13:13:34,651 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 13:13:34,656 INFO L203 MainTranslator]: Completed pre-run [2022-01-19 13:13:34,675 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-nzb-file-symm.wvr.c[4929,4942] [2022-01-19 13:13:34,678 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 13:13:34,703 INFO L208 MainTranslator]: Completed translation [2022-01-19 13:13:34,703 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:13:34 WrapperNode [2022-01-19 13:13:34,704 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-19 13:13:34,704 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-19 13:13:34,704 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-19 13:13:34,704 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-19 13:13:34,709 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:13:34" (1/1) ... [2022-01-19 13:13:34,716 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:13:34" (1/1) ... [2022-01-19 13:13:34,741 INFO L137 Inliner]: procedures = 25, calls = 55, calls flagged for inlining = 21, calls inlined = 29, statements flattened = 452 [2022-01-19 13:13:34,741 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-19 13:13:34,742 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-19 13:13:34,742 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-19 13:13:34,742 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-19 13:13:34,747 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:13:34" (1/1) ... [2022-01-19 13:13:34,748 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:13:34" (1/1) ... [2022-01-19 13:13:34,751 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:13:34" (1/1) ... [2022-01-19 13:13:34,751 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:13:34" (1/1) ... [2022-01-19 13:13:34,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:13:34" (1/1) ... [2022-01-19 13:13:34,763 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:13:34" (1/1) ... [2022-01-19 13:13:34,765 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:13:34" (1/1) ... [2022-01-19 13:13:34,767 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-19 13:13:34,768 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-19 13:13:34,768 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-19 13:13:34,768 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-19 13:13:34,769 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:13:34" (1/1) ... [2022-01-19 13:13:34,785 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 13:13:34,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 13:13:34,805 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:13:34,811 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:13:34,830 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-19 13:13:34,830 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-19 13:13:34,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-19 13:13:34,830 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-19 13:13:34,830 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-01-19 13:13:34,830 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-01-19 13:13:34,831 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-01-19 13:13:34,831 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-01-19 13:13:34,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-19 13:13:34,831 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-19 13:13:34,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-19 13:13:34,831 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-19 13:13:34,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-19 13:13:34,832 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:13:34,911 INFO L234 CfgBuilder]: Building ICFG [2022-01-19 13:13:34,913 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-19 13:13:35,363 INFO L275 CfgBuilder]: Performing block encoding [2022-01-19 13:13:35,373 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-19 13:13:35,373 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-01-19 13:13:35,379 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 01:13:35 BoogieIcfgContainer [2022-01-19 13:13:35,379 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-19 13:13:35,381 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-19 13:13:35,381 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-19 13:13:35,393 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-19 13:13:35,393 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.01 01:13:34" (1/3) ... [2022-01-19 13:13:35,394 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d6bdca3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 01:13:35, skipping insertion in model container [2022-01-19 13:13:35,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 01:13:34" (2/3) ... [2022-01-19 13:13:35,394 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d6bdca3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 01:13:35, skipping insertion in model container [2022-01-19 13:13:35,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 01:13:35" (3/3) ... [2022-01-19 13:13:35,395 INFO L111 eAbstractionObserver]: Analyzing ICFG chl-nzb-file-symm.wvr.c [2022-01-19 13:13:35,398 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-19 13:13:35,399 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-19 13:13:35,399 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-19 13:13:35,478 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,479 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,479 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,479 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,479 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,480 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,480 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,480 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,480 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,480 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,480 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,480 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,481 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,481 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,481 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,481 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,481 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,481 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,481 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,481 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,481 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,482 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,482 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,482 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,482 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,482 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,482 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,482 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,482 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,482 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,483 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,483 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,483 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,483 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,483 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,484 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,484 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,484 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,484 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,484 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,484 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,484 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,484 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,485 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,485 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,485 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,485 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,485 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,485 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,485 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,485 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,485 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,485 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,486 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,486 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,486 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,486 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,486 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,486 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,487 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,487 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,487 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,487 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,487 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,487 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,487 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,487 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,487 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,488 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,488 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,488 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,488 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,488 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,488 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,488 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,488 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,488 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,488 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,489 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,489 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,489 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,489 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,489 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,489 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,489 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,489 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,489 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,489 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,490 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,490 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,490 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,490 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,490 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,490 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,490 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,490 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,490 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,491 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,491 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,491 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,491 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,491 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,491 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,491 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,492 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,492 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,492 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,492 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,492 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,492 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,493 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,493 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,493 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,493 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,493 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,493 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,493 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,493 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,493 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,494 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,494 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,494 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,494 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,494 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,494 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,494 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,494 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,494 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,495 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,495 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,495 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,495 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,495 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,495 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,495 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,495 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,495 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,496 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,496 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,496 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,496 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,496 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,496 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,496 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,496 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,496 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,497 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,497 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,497 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,497 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,497 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,497 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,497 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,498 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,498 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,498 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,498 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,498 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,499 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,499 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,499 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,499 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,499 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,500 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,500 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,500 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,500 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,500 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,500 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,500 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,500 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,500 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,500 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,501 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,501 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,501 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,502 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,502 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,502 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,502 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,502 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,502 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,502 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,503 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,503 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,503 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,504 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,504 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,504 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,504 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,504 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,505 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,505 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,505 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,505 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,505 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,505 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,505 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,505 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,505 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,505 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,506 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,506 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,506 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,506 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,506 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,506 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,506 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,507 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,507 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,507 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,507 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,507 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,508 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,508 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,508 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,508 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,508 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,510 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,511 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,511 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,513 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,518 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,518 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,518 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,518 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,518 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,518 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,518 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,519 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,519 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,519 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,519 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,519 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,520 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,521 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,527 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,528 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,528 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,528 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,528 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,528 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,528 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,528 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,528 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,529 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,529 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,529 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,529 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,529 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,529 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,529 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,529 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,529 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,529 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,529 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,530 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,530 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,530 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,530 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,530 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,530 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,530 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,530 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,530 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,530 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,530 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,530 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,531 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,531 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,531 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,531 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,531 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,531 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,531 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,531 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,531 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,531 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,531 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,532 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,532 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,532 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,532 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,532 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,532 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,532 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,532 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,532 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,532 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,533 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,533 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,533 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,533 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,533 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,533 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,533 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,533 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,533 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,533 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,534 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,534 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,534 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,534 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,534 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,534 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,534 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,534 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,534 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,534 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,535 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,535 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,535 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,535 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,535 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,535 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,535 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,535 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,535 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,535 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,535 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,535 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,536 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,536 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,536 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,536 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,536 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,536 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,536 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,536 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,536 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,536 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,537 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,537 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,537 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,537 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,537 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,537 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,537 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,537 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,537 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,537 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,537 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,538 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,538 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,538 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,538 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,538 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,538 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,538 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,538 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,538 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,538 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,538 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,539 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,539 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,539 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,539 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,539 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,539 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,539 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,539 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,539 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,539 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,540 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,540 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,540 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,540 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,540 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,540 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,540 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,540 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,540 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,540 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,540 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,541 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,541 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,541 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,541 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,541 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,541 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,541 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,541 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,541 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,541 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,542 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,542 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,542 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,542 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,542 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,542 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,542 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,542 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,542 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,542 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,542 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,543 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,543 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,543 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,545 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,545 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,545 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,546 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,546 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,546 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,546 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,546 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,546 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,546 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,546 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,546 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,551 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,551 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,552 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,552 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,552 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,552 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,552 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,552 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,552 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,552 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,552 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,552 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,553 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,553 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,553 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,553 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,553 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,553 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,553 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,553 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,553 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,553 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,554 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,554 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,554 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,554 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,554 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,554 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,554 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,554 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,554 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,554 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,555 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,555 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,555 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,555 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,555 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,557 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,558 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,558 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,558 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,558 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,558 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,558 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,558 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,558 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,558 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,558 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,559 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,559 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,559 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,559 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,559 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,559 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,563 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,563 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,564 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,564 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,564 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,564 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,564 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,564 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,564 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,564 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,564 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,565 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,566 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,567 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,568 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,568 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,568 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,568 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,568 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,568 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,568 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,568 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,568 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,568 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,568 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,568 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,569 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,569 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,570 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,570 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,570 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,570 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,570 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,570 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,570 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,570 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,570 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,571 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,571 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,571 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,571 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,571 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,571 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,571 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,571 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,571 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,572 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,572 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,572 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,572 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,572 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,572 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,572 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,573 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,573 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,573 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,573 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,573 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,573 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,573 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,573 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,573 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,573 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,573 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,574 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,574 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,574 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,574 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,574 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,574 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,574 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,574 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,574 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,574 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,574 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,574 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,575 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,575 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,575 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,575 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,575 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,575 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,575 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,575 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,575 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,575 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,575 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,575 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,575 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,575 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,576 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,576 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,576 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,576 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,576 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,576 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,576 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,576 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,576 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,576 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,576 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,576 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,576 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,577 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,577 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,577 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,577 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,577 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,577 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,577 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,577 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,577 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,577 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,577 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,577 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,577 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,578 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,578 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,578 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,578 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,578 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,578 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,578 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,578 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,578 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,578 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,578 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,579 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,579 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,580 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,580 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,580 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,582 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,582 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,582 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,582 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,582 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,582 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,582 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,582 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,582 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,582 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,583 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,583 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,583 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,583 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,583 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,583 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,583 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,583 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,583 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,583 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,583 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,583 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,583 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,583 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,583 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,584 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,584 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,584 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,584 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,584 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,584 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,584 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,584 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,584 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,584 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,584 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,585 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,585 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,585 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,585 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,585 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,585 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,585 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,585 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,585 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,585 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,585 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,585 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,585 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,585 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,586 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,586 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,586 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,586 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,586 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,586 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,586 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,587 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,587 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,587 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,587 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,587 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,588 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,588 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,588 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,588 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,588 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,588 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,588 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,588 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,588 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,588 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,588 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,588 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,588 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,588 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,588 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,589 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,589 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,589 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,589 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,589 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,589 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,589 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,589 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,589 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,589 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,589 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,589 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,589 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,589 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,589 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,589 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,590 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,590 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,590 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,590 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,590 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,594 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,595 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,595 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,595 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,595 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,595 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,595 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,595 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,595 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,596 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,596 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,596 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,596 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,596 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,596 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,596 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,596 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,596 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,596 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,596 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,596 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,596 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,596 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,596 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,597 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,597 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,597 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,597 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,597 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,597 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,597 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,597 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,597 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,597 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,597 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,597 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,597 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,597 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,598 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,598 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,598 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,598 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,598 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,598 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,598 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,598 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,598 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,598 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,598 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,598 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,598 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,598 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,598 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,599 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,599 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,599 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,599 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,599 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,599 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,599 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,599 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,599 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,599 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,599 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,599 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,599 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,599 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,600 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,600 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,600 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,600 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,600 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,600 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,600 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,600 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,600 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,600 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,600 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,600 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,600 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,600 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,601 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,601 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,601 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,601 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,601 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,601 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,601 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,601 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,601 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,601 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,601 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,601 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,601 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,602 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,602 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,602 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,602 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,602 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,602 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,602 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,602 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,602 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,602 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,602 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,602 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,602 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,602 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,602 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,603 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,603 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,603 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,603 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,603 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,603 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,603 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,603 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,603 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,603 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,603 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,603 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,603 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,603 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,603 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,603 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,604 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,608 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,608 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,608 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,608 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite22#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,608 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret24#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,608 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short21#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,608 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,608 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite19#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,608 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,608 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,609 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,609 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,609 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,609 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,609 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite27#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,609 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,609 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,609 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post23#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,609 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,609 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,609 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,609 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,609 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,609 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,609 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,609 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite28#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,609 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~short15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,610 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite25#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,610 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,610 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,610 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,610 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,610 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ret26#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,610 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,610 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,610 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,610 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem20#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,612 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,612 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem48#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,612 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,612 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,612 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite53#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,612 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret54#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,612 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,612 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,612 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,612 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,612 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,612 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,613 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short49#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,613 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,613 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,613 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet30#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,613 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite50#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,613 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,613 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,613 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~nondet29#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,613 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,613 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,613 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ret52#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,613 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_minus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,613 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite55#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,613 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,613 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite56#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,613 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post51#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,613 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,613 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite47#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,614 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,614 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,614 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,614 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,614 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short33#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,614 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~short46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,614 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 13:13:35,616 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-01-19 13:13:35,663 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 13:13:35,670 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:13:35,670 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-01-19 13:13:35,690 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 538 places, 596 transitions, 1208 flow [2022-01-19 13:13:35,875 INFO L129 PetriNetUnfolder]: 65/594 cut-off events. [2022-01-19 13:13:35,875 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-01-19 13:13:35,889 INFO L84 FinitePrefix]: Finished finitePrefix Result has 603 conditions, 594 events. 65/594 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1760 event pairs, 0 based on Foata normal form. 0/528 useless extension candidates. Maximal degree in co-relation 413. Up to 2 conditions per place. [2022-01-19 13:13:35,889 INFO L82 GeneralOperation]: Start removeDead. Operand has 538 places, 596 transitions, 1208 flow [2022-01-19 13:13:35,902 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 527 places, 585 transitions, 1182 flow [2022-01-19 13:13:35,968 INFO L129 PetriNetUnfolder]: 57/538 cut-off events. [2022-01-19 13:13:35,968 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-01-19 13:13:35,969 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:13:35,969 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] [2022-01-19 13:13:35,970 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 13:13:35,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:13:35,974 INFO L85 PathProgramCache]: Analyzing trace with hash 957133029, now seen corresponding path program 1 times [2022-01-19 13:13:35,980 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:13:35,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193033576] [2022-01-19 13:13:35,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:13:35,981 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:13:36,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:13:36,165 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:13:36,166 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:13:36,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193033576] [2022-01-19 13:13:36,166 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193033576] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:13:36,166 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:13:36,167 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-19 13:13:36,167 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032889385] [2022-01-19 13:13:36,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:13:36,174 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-19 13:13:36,174 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:13:36,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-19 13:13:36,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-19 13:13:36,197 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 566 out of 596 [2022-01-19 13:13:36,217 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 527 places, 585 transitions, 1182 flow. Second operand has 2 states, 2 states have (on average 568.5) internal successors, (1137), 2 states have internal predecessors, (1137), 0 states have call successors, (0), 0 states have 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:13:36,217 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:13:36,217 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 566 of 596 [2022-01-19 13:13:36,218 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:13:36,358 INFO L129 PetriNetUnfolder]: 40/560 cut-off events. [2022-01-19 13:13:36,358 INFO L130 PetriNetUnfolder]: For 9/10 co-relation queries the response was YES. [2022-01-19 13:13:36,364 INFO L84 FinitePrefix]: Finished finitePrefix Result has 574 conditions, 560 events. 40/560 cut-off events. For 9/10 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1694 event pairs, 0 based on Foata normal form. 30/529 useless extension candidates. Maximal degree in co-relation 396. Up to 5 conditions per place. [2022-01-19 13:13:36,368 INFO L132 encePairwiseOnDemand]: 571/596 looper letters, 4 selfloop transitions, 0 changer transitions 5/560 dead transitions. [2022-01-19 13:13:36,368 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 528 places, 560 transitions, 1140 flow [2022-01-19 13:13:36,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-19 13:13:36,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-01-19 13:13:36,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 1161 transitions. [2022-01-19 13:13:36,384 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9739932885906041 [2022-01-19 13:13:36,384 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 1161 transitions. [2022-01-19 13:13:36,384 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 1161 transitions. [2022-01-19 13:13:36,388 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:13:36,389 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 1161 transitions. [2022-01-19 13:13:36,395 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 580.5) internal successors, (1161), 2 states have internal predecessors, (1161), 0 states have call successors, (0), 0 states have 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:13:36,408 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 596.0) internal successors, (1788), 3 states have internal predecessors, (1788), 0 states have call successors, (0), 0 states have 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:13:36,409 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 596.0) internal successors, (1788), 3 states have internal predecessors, (1788), 0 states have call successors, (0), 0 states have 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:13:36,410 INFO L186 Difference]: Start difference. First operand has 527 places, 585 transitions, 1182 flow. Second operand 2 states and 1161 transitions. [2022-01-19 13:13:36,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 528 places, 560 transitions, 1140 flow [2022-01-19 13:13:36,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 524 places, 560 transitions, 1132 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-01-19 13:13:36,428 INFO L242 Difference]: Finished difference. Result has 524 places, 555 transitions, 1114 flow [2022-01-19 13:13:36,430 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=1124, PETRI_DIFFERENCE_MINUEND_PLACES=523, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=560, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=560, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=1114, PETRI_PLACES=524, PETRI_TRANSITIONS=555} [2022-01-19 13:13:36,435 INFO L334 CegarLoopForPetriNet]: 527 programPoint places, -3 predicate places. [2022-01-19 13:13:36,435 INFO L470 AbstractCegarLoop]: Abstraction has has 524 places, 555 transitions, 1114 flow [2022-01-19 13:13:36,436 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 568.5) internal successors, (1137), 2 states have internal predecessors, (1137), 0 states have call successors, (0), 0 states have 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:13:36,436 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:13:36,436 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] [2022-01-19 13:13:36,436 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-19 13:13:36,436 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 13:13:36,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:13:36,437 INFO L85 PathProgramCache]: Analyzing trace with hash 473457702, now seen corresponding path program 1 times [2022-01-19 13:13:36,437 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:13:36,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492160474] [2022-01-19 13:13:36,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:13:36,437 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:13:36,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:13:36,610 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:13:36,610 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:13:36,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492160474] [2022-01-19 13:13:36,610 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492160474] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:13:36,611 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:13:36,611 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 13:13:36,611 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659468749] [2022-01-19 13:13:36,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:13:36,612 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 13:13:36,612 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:13:36,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 13:13:36,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 13:13:36,616 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 552 out of 596 [2022-01-19 13:13:36,617 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 524 places, 555 transitions, 1114 flow. Second operand has 3 states, 3 states have (on average 555.3333333333334) internal successors, (1666), 3 states have internal predecessors, (1666), 0 states have call successors, (0), 0 states have 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:13:36,618 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:13:36,618 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 552 of 596 [2022-01-19 13:13:36,618 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:13:36,942 INFO L129 PetriNetUnfolder]: 177/1911 cut-off events. [2022-01-19 13:13:36,942 INFO L130 PetriNetUnfolder]: For 19/21 co-relation queries the response was YES. [2022-01-19 13:13:36,950 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2050 conditions, 1911 events. 177/1911 cut-off events. For 19/21 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 14008 event pairs, 36 based on Foata normal form. 1/1696 useless extension candidates. Maximal degree in co-relation 2047. Up to 87 conditions per place. [2022-01-19 13:13:36,957 INFO L132 encePairwiseOnDemand]: 590/596 looper letters, 27 selfloop transitions, 4 changer transitions 0/568 dead transitions. [2022-01-19 13:13:36,957 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 521 places, 568 transitions, 1205 flow [2022-01-19 13:13:36,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 13:13:36,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 13:13:36,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1689 transitions. [2022-01-19 13:13:36,960 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9446308724832215 [2022-01-19 13:13:36,960 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1689 transitions. [2022-01-19 13:13:36,960 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1689 transitions. [2022-01-19 13:13:36,960 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:13:36,961 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1689 transitions. [2022-01-19 13:13:36,963 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 563.0) internal successors, (1689), 3 states have internal predecessors, (1689), 0 states have call successors, (0), 0 states have 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:13:36,966 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 596.0) internal successors, (2384), 4 states have internal predecessors, (2384), 0 states have call successors, (0), 0 states have 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:13:36,967 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 596.0) internal successors, (2384), 4 states have internal predecessors, (2384), 0 states have call successors, (0), 0 states have 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:13:36,967 INFO L186 Difference]: Start difference. First operand has 524 places, 555 transitions, 1114 flow. Second operand 3 states and 1689 transitions. [2022-01-19 13:13:36,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 521 places, 568 transitions, 1205 flow [2022-01-19 13:13:36,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 521 places, 568 transitions, 1205 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-01-19 13:13:36,975 INFO L242 Difference]: Finished difference. Result has 523 places, 557 transitions, 1142 flow [2022-01-19 13:13:36,975 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=1114, PETRI_DIFFERENCE_MINUEND_PLACES=519, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=555, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=551, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1142, PETRI_PLACES=523, PETRI_TRANSITIONS=557} [2022-01-19 13:13:36,976 INFO L334 CegarLoopForPetriNet]: 527 programPoint places, -4 predicate places. [2022-01-19 13:13:36,977 INFO L470 AbstractCegarLoop]: Abstraction has has 523 places, 557 transitions, 1142 flow [2022-01-19 13:13:36,977 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 555.3333333333334) internal successors, (1666), 3 states have internal predecessors, (1666), 0 states have call successors, (0), 0 states have 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:13:36,978 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:13:36,978 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] [2022-01-19 13:13:36,978 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-19 13:13:36,978 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 13:13:36,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:13:36,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1593023258, now seen corresponding path program 2 times [2022-01-19 13:13:36,979 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:13:36,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469408162] [2022-01-19 13:13:36,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:13:36,979 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:13:37,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:13:37,065 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:13:37,066 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:13:37,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469408162] [2022-01-19 13:13:37,066 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469408162] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:13:37,066 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:13:37,066 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 13:13:37,067 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572545223] [2022-01-19 13:13:37,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:13:37,069 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 13:13:37,069 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:13:37,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 13:13:37,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 13:13:37,071 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 552 out of 596 [2022-01-19 13:13:37,073 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 523 places, 557 transitions, 1142 flow. Second operand has 3 states, 3 states have (on average 555.3333333333334) internal successors, (1666), 3 states have internal predecessors, (1666), 0 states have call successors, (0), 0 states have 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:13:37,073 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:13:37,073 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 552 of 596 [2022-01-19 13:13:37,073 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:13:37,326 INFO L129 PetriNetUnfolder]: 168/1861 cut-off events. [2022-01-19 13:13:37,326 INFO L130 PetriNetUnfolder]: For 77/82 co-relation queries the response was YES. [2022-01-19 13:13:37,336 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2058 conditions, 1861 events. 168/1861 cut-off events. For 77/82 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 13758 event pairs, 39 based on Foata normal form. 4/1689 useless extension candidates. Maximal degree in co-relation 2053. Up to 100 conditions per place. [2022-01-19 13:13:37,341 INFO L132 encePairwiseOnDemand]: 590/596 looper letters, 29 selfloop transitions, 4 changer transitions 0/570 dead transitions. [2022-01-19 13:13:37,342 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 525 places, 570 transitions, 1241 flow [2022-01-19 13:13:37,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 13:13:37,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 13:13:37,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1689 transitions. [2022-01-19 13:13:37,345 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9446308724832215 [2022-01-19 13:13:37,345 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1689 transitions. [2022-01-19 13:13:37,345 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1689 transitions. [2022-01-19 13:13:37,346 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:13:37,346 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1689 transitions. [2022-01-19 13:13:37,348 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 563.0) internal successors, (1689), 3 states have internal predecessors, (1689), 0 states have call successors, (0), 0 states have 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:13:37,351 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 596.0) internal successors, (2384), 4 states have internal predecessors, (2384), 0 states have call successors, (0), 0 states have 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:13:37,352 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 596.0) internal successors, (2384), 4 states have internal predecessors, (2384), 0 states have call successors, (0), 0 states have 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:13:37,352 INFO L186 Difference]: Start difference. First operand has 523 places, 557 transitions, 1142 flow. Second operand 3 states and 1689 transitions. [2022-01-19 13:13:37,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 525 places, 570 transitions, 1241 flow [2022-01-19 13:13:37,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 523 places, 570 transitions, 1233 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-01-19 13:13:37,361 INFO L242 Difference]: Finished difference. Result has 525 places, 559 transitions, 1166 flow [2022-01-19 13:13:37,362 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=1134, PETRI_DIFFERENCE_MINUEND_PLACES=521, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=557, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=553, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1166, PETRI_PLACES=525, PETRI_TRANSITIONS=559} [2022-01-19 13:13:37,364 INFO L334 CegarLoopForPetriNet]: 527 programPoint places, -2 predicate places. [2022-01-19 13:13:37,364 INFO L470 AbstractCegarLoop]: Abstraction has has 525 places, 559 transitions, 1166 flow [2022-01-19 13:13:37,365 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 555.3333333333334) internal successors, (1666), 3 states have internal predecessors, (1666), 0 states have call successors, (0), 0 states have 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:13:37,365 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:13:37,365 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:13:37,365 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-19 13:13:37,365 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 13:13:37,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:13:37,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1976754200, now seen corresponding path program 1 times [2022-01-19 13:13:37,366 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:13:37,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542507827] [2022-01-19 13:13:37,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:13:37,366 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:13:37,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:13:37,472 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:13:37,473 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:13:37,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542507827] [2022-01-19 13:13:37,473 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542507827] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:13:37,473 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:13:37,473 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-19 13:13:37,473 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275591402] [2022-01-19 13:13:37,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:13:37,474 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-19 13:13:37,474 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:13:37,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-19 13:13:37,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-19 13:13:37,479 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 544 out of 596 [2022-01-19 13:13:37,481 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 525 places, 559 transitions, 1166 flow. Second operand has 5 states, 5 states have (on average 547.6) internal successors, (2738), 5 states have internal predecessors, (2738), 0 states have call successors, (0), 0 states have 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:13:37,481 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:13:37,481 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 544 of 596 [2022-01-19 13:13:37,481 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:13:37,598 INFO L129 PetriNetUnfolder]: 50/678 cut-off events. [2022-01-19 13:13:37,598 INFO L130 PetriNetUnfolder]: For 23/39 co-relation queries the response was YES. [2022-01-19 13:13:37,605 INFO L84 FinitePrefix]: Finished finitePrefix Result has 750 conditions, 678 events. 50/678 cut-off events. For 23/39 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2596 event pairs, 0 based on Foata normal form. 0/615 useless extension candidates. Maximal degree in co-relation 744. Up to 31 conditions per place. [2022-01-19 13:13:37,608 INFO L132 encePairwiseOnDemand]: 586/596 looper letters, 26 selfloop transitions, 8 changer transitions 0/567 dead transitions. [2022-01-19 13:13:37,608 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 529 places, 567 transitions, 1250 flow [2022-01-19 13:13:37,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 13:13:37,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 13:13:37,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2756 transitions. [2022-01-19 13:13:37,612 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9248322147651007 [2022-01-19 13:13:37,612 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 2756 transitions. [2022-01-19 13:13:37,612 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 2756 transitions. [2022-01-19 13:13:37,613 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:13:37,613 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 2756 transitions. [2022-01-19 13:13:37,616 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 551.2) internal successors, (2756), 5 states have internal predecessors, (2756), 0 states have call successors, (0), 0 states have 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:13:37,620 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 596.0) internal successors, (3576), 6 states have internal predecessors, (3576), 0 states have call successors, (0), 0 states have 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:13:37,622 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 596.0) internal successors, (3576), 6 states have internal predecessors, (3576), 0 states have call successors, (0), 0 states have 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:13:37,622 INFO L186 Difference]: Start difference. First operand has 525 places, 559 transitions, 1166 flow. Second operand 5 states and 2756 transitions. [2022-01-19 13:13:37,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 529 places, 567 transitions, 1250 flow [2022-01-19 13:13:37,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 527 places, 567 transitions, 1242 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-01-19 13:13:37,630 INFO L242 Difference]: Finished difference. Result has 528 places, 561 transitions, 1190 flow [2022-01-19 13:13:37,631 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=1158, PETRI_DIFFERENCE_MINUEND_PLACES=523, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=559, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=551, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1190, PETRI_PLACES=528, PETRI_TRANSITIONS=561} [2022-01-19 13:13:37,632 INFO L334 CegarLoopForPetriNet]: 527 programPoint places, 1 predicate places. [2022-01-19 13:13:37,632 INFO L470 AbstractCegarLoop]: Abstraction has has 528 places, 561 transitions, 1190 flow [2022-01-19 13:13:37,633 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 547.6) internal successors, (2738), 5 states have internal predecessors, (2738), 0 states have call successors, (0), 0 states have 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:13:37,633 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:13:37,633 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] [2022-01-19 13:13:37,634 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-19 13:13:37,634 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 13:13:37,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:13:37,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1612412822, now seen corresponding path program 1 times [2022-01-19 13:13:37,634 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:13:37,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269760083] [2022-01-19 13:13:37,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:13:37,635 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:13:37,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:13:37,722 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 13:13:37,723 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:13:37,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269760083] [2022-01-19 13:13:37,723 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269760083] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 13:13:37,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1659400604] [2022-01-19 13:13:37,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:13:37,723 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 13:13:37,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 13:13:37,725 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 13:13:37,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-19 13:13:37,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:13:37,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-19 13:13:37,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 13:13:38,160 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 13:13:38,160 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 13:13:38,405 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 13:13:38,405 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1659400604] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 13:13:38,405 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 13:13:38,405 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2022-01-19 13:13:38,406 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841399510] [2022-01-19 13:13:38,406 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 13:13:38,406 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-19 13:13:38,406 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:13:38,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-19 13:13:38,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-01-19 13:13:38,412 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 542 out of 596 [2022-01-19 13:13:38,418 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 528 places, 561 transitions, 1190 flow. Second operand has 15 states, 15 states have (on average 545.1333333333333) internal successors, (8177), 15 states have internal predecessors, (8177), 0 states have call successors, (0), 0 states have 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:13:38,419 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:13:38,419 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 542 of 596 [2022-01-19 13:13:38,419 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:13:38,709 INFO L129 PetriNetUnfolder]: 50/694 cut-off events. [2022-01-19 13:13:38,709 INFO L130 PetriNetUnfolder]: For 23/39 co-relation queries the response was YES. [2022-01-19 13:13:38,716 INFO L84 FinitePrefix]: Finished finitePrefix Result has 795 conditions, 694 events. 50/694 cut-off events. For 23/39 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2562 event pairs, 0 based on Foata normal form. 4/637 useless extension candidates. Maximal degree in co-relation 788. Up to 25 conditions per place. [2022-01-19 13:13:38,719 INFO L132 encePairwiseOnDemand]: 580/596 looper letters, 28 selfloop transitions, 22 changer transitions 0/581 dead transitions. [2022-01-19 13:13:38,719 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 538 places, 581 transitions, 1334 flow [2022-01-19 13:13:38,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-19 13:13:38,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-01-19 13:13:38,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6016 transitions. [2022-01-19 13:13:38,727 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9176327028676022 [2022-01-19 13:13:38,727 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 6016 transitions. [2022-01-19 13:13:38,727 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 6016 transitions. [2022-01-19 13:13:38,729 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:13:38,729 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 6016 transitions. [2022-01-19 13:13:38,737 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 546.9090909090909) internal successors, (6016), 11 states have internal predecessors, (6016), 0 states have call successors, (0), 0 states have 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:13:38,745 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 596.0) internal successors, (7152), 12 states have internal predecessors, (7152), 0 states have call successors, (0), 0 states have 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:13:38,747 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 596.0) internal successors, (7152), 12 states have internal predecessors, (7152), 0 states have call successors, (0), 0 states have 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:13:38,747 INFO L186 Difference]: Start difference. First operand has 528 places, 561 transitions, 1190 flow. Second operand 11 states and 6016 transitions. [2022-01-19 13:13:38,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 538 places, 581 transitions, 1334 flow [2022-01-19 13:13:38,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 535 places, 581 transitions, 1322 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-01-19 13:13:38,754 INFO L242 Difference]: Finished difference. Result has 538 places, 573 transitions, 1289 flow [2022-01-19 13:13:38,755 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=1178, PETRI_DIFFERENCE_MINUEND_PLACES=525, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=561, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=545, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1289, PETRI_PLACES=538, PETRI_TRANSITIONS=573} [2022-01-19 13:13:38,756 INFO L334 CegarLoopForPetriNet]: 527 programPoint places, 11 predicate places. [2022-01-19 13:13:38,756 INFO L470 AbstractCegarLoop]: Abstraction has has 538 places, 573 transitions, 1289 flow [2022-01-19 13:13:38,758 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 545.1333333333333) internal successors, (8177), 15 states have internal predecessors, (8177), 0 states have call successors, (0), 0 states have 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:13:38,758 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:13:38,758 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:13:38,777 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-19 13:13:38,976 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 13:13:38,977 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 13:13:38,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:13:38,978 INFO L85 PathProgramCache]: Analyzing trace with hash -226902670, now seen corresponding path program 2 times [2022-01-19 13:13:38,978 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:13:38,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370478199] [2022-01-19 13:13:38,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:13:38,978 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:13:39,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:13:39,068 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-01-19 13:13:39,069 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:13:39,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370478199] [2022-01-19 13:13:39,069 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370478199] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 13:13:39,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [296621991] [2022-01-19 13:13:39,069 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 13:13:39,069 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 13:13:39,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 13:13:39,070 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 13:13:39,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-19 13:13:39,180 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-01-19 13:13:39,180 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 13:13:39,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-19 13:13:39,193 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 13:13:39,401 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-01-19 13:13:39,401 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-19 13:13:39,401 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [296621991] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:13:39,401 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-19 13:13:39,401 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2022-01-19 13:13:39,402 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862879342] [2022-01-19 13:13:39,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:13:39,402 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-19 13:13:39,404 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:13:39,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-19 13:13:39,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-01-19 13:13:39,408 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 545 out of 596 [2022-01-19 13:13:39,410 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 538 places, 573 transitions, 1289 flow. Second operand has 5 states, 5 states have (on average 547.4) internal successors, (2737), 5 states have internal predecessors, (2737), 0 states have call successors, (0), 0 states have 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:13:39,410 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:13:39,410 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 545 of 596 [2022-01-19 13:13:39,410 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:13:39,672 INFO L129 PetriNetUnfolder]: 149/1715 cut-off events. [2022-01-19 13:13:39,672 INFO L130 PetriNetUnfolder]: For 31/60 co-relation queries the response was YES. [2022-01-19 13:13:39,680 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1930 conditions, 1715 events. 149/1715 cut-off events. For 31/60 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 10572 event pairs, 17 based on Foata normal form. 10/1550 useless extension candidates. Maximal degree in co-relation 1920. Up to 76 conditions per place. [2022-01-19 13:13:39,685 INFO L132 encePairwiseOnDemand]: 589/596 looper letters, 33 selfloop transitions, 5 changer transitions 0/586 dead transitions. [2022-01-19 13:13:39,685 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 544 places, 586 transitions, 1398 flow [2022-01-19 13:13:39,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 13:13:39,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 13:13:39,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 3855 transitions. [2022-01-19 13:13:39,691 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9240172579098753 [2022-01-19 13:13:39,691 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 3855 transitions. [2022-01-19 13:13:39,691 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 3855 transitions. [2022-01-19 13:13:39,692 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:13:39,692 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 3855 transitions. [2022-01-19 13:13:39,697 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 550.7142857142857) internal successors, (3855), 7 states have internal predecessors, (3855), 0 states have call successors, (0), 0 states have 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:13:39,701 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 596.0) internal successors, (4768), 8 states have internal predecessors, (4768), 0 states have call successors, (0), 0 states have 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:13:39,701 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 596.0) internal successors, (4768), 8 states have internal predecessors, (4768), 0 states have call successors, (0), 0 states have 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:13:39,701 INFO L186 Difference]: Start difference. First operand has 538 places, 573 transitions, 1289 flow. Second operand 7 states and 3855 transitions. [2022-01-19 13:13:39,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 544 places, 586 transitions, 1398 flow [2022-01-19 13:13:39,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 541 places, 586 transitions, 1381 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-01-19 13:13:39,711 INFO L242 Difference]: Finished difference. Result has 546 places, 577 transitions, 1311 flow [2022-01-19 13:13:39,712 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=1272, PETRI_DIFFERENCE_MINUEND_PLACES=535, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=573, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=568, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1311, PETRI_PLACES=546, PETRI_TRANSITIONS=577} [2022-01-19 13:13:39,713 INFO L334 CegarLoopForPetriNet]: 527 programPoint places, 19 predicate places. [2022-01-19 13:13:39,713 INFO L470 AbstractCegarLoop]: Abstraction has has 546 places, 577 transitions, 1311 flow [2022-01-19 13:13:39,713 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 547.4) internal successors, (2737), 5 states have internal predecessors, (2737), 0 states have call successors, (0), 0 states have 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:13:39,713 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:13:39,714 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 13:13:39,732 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-19 13:13:39,930 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-01-19 13:13:39,930 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 13:13:39,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:13:39,930 INFO L85 PathProgramCache]: Analyzing trace with hash 755089234, now seen corresponding path program 1 times [2022-01-19 13:13:39,931 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:13:39,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100096802] [2022-01-19 13:13:39,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:13:39,931 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:13:39,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:13:40,001 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-01-19 13:13:40,001 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:13:40,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100096802] [2022-01-19 13:13:40,001 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100096802] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 13:13:40,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1799255616] [2022-01-19 13:13:40,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:13:40,002 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 13:13:40,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 13:13:40,003 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 13:13:40,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-19 13:13:40,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:13:40,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-19 13:13:40,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 13:13:40,375 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-01-19 13:13:40,375 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 13:13:40,600 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-01-19 13:13:40,600 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1799255616] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 13:13:40,601 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 13:13:40,601 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2022-01-19 13:13:40,601 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214280900] [2022-01-19 13:13:40,601 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 13:13:40,601 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-01-19 13:13:40,601 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:13:40,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-01-19 13:13:40,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2022-01-19 13:13:40,607 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 542 out of 596 [2022-01-19 13:13:40,613 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 546 places, 577 transitions, 1311 flow. Second operand has 22 states, 22 states have (on average 545.0454545454545) internal successors, (11991), 22 states have internal predecessors, (11991), 0 states have call successors, (0), 0 states have 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:13:40,614 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:13:40,614 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 542 of 596 [2022-01-19 13:13:40,614 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:13:40,909 INFO L129 PetriNetUnfolder]: 51/742 cut-off events. [2022-01-19 13:13:40,909 INFO L130 PetriNetUnfolder]: For 51/67 co-relation queries the response was YES. [2022-01-19 13:13:40,917 INFO L84 FinitePrefix]: Finished finitePrefix Result has 948 conditions, 742 events. 51/742 cut-off events. For 51/67 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2749 event pairs, 0 based on Foata normal form. 4/689 useless extension candidates. Maximal degree in co-relation 933. Up to 25 conditions per place. [2022-01-19 13:13:40,919 INFO L132 encePairwiseOnDemand]: 580/596 looper letters, 36 selfloop transitions, 34 changer transitions 0/605 dead transitions. [2022-01-19 13:13:40,920 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 562 places, 605 transitions, 1563 flow [2022-01-19 13:13:40,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-19 13:13:40,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-01-19 13:13:40,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 9288 transitions. [2022-01-19 13:13:40,931 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9166995657323332 [2022-01-19 13:13:40,931 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 9288 transitions. [2022-01-19 13:13:40,931 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 9288 transitions. [2022-01-19 13:13:40,934 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:13:40,934 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 9288 transitions. [2022-01-19 13:13:40,944 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 546.3529411764706) internal successors, (9288), 17 states have internal predecessors, (9288), 0 states have call successors, (0), 0 states have 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:13:40,955 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 596.0) internal successors, (10728), 18 states have internal predecessors, (10728), 0 states have call successors, (0), 0 states have 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:13:40,956 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 596.0) internal successors, (10728), 18 states have internal predecessors, (10728), 0 states have call successors, (0), 0 states have 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:13:40,956 INFO L186 Difference]: Start difference. First operand has 546 places, 577 transitions, 1311 flow. Second operand 17 states and 9288 transitions. [2022-01-19 13:13:40,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 562 places, 605 transitions, 1563 flow [2022-01-19 13:13:40,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 561 places, 605 transitions, 1562 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 13:13:40,965 INFO L242 Difference]: Finished difference. Result has 564 places, 591 transitions, 1485 flow [2022-01-19 13:13:40,966 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=1310, PETRI_DIFFERENCE_MINUEND_PLACES=545, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=577, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=551, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1485, PETRI_PLACES=564, PETRI_TRANSITIONS=591} [2022-01-19 13:13:40,966 INFO L334 CegarLoopForPetriNet]: 527 programPoint places, 37 predicate places. [2022-01-19 13:13:40,966 INFO L470 AbstractCegarLoop]: Abstraction has has 564 places, 591 transitions, 1485 flow [2022-01-19 13:13:40,969 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 545.0454545454545) internal successors, (11991), 22 states have internal predecessors, (11991), 0 states have call successors, (0), 0 states have 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:13:40,969 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:13:40,969 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:40,988 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-19 13:13:41,186 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 13:13:41,186 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 13:13:41,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:13:41,187 INFO L85 PathProgramCache]: Analyzing trace with hash -565416218, now seen corresponding path program 2 times [2022-01-19 13:13:41,187 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:13:41,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162724605] [2022-01-19 13:13:41,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:13:41,187 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:13:41,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:13:41,265 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-01-19 13:13:41,265 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:13:41,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162724605] [2022-01-19 13:13:41,265 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162724605] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:13:41,265 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:13:41,265 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-19 13:13:41,265 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788440078] [2022-01-19 13:13:41,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:13:41,266 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-19 13:13:41,266 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:13:41,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-19 13:13:41,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-19 13:13:41,268 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 545 out of 596 [2022-01-19 13:13:41,269 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 564 places, 591 transitions, 1485 flow. Second operand has 5 states, 5 states have (on average 547.4) internal successors, (2737), 5 states have internal predecessors, (2737), 0 states have call successors, (0), 0 states have 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:13:41,269 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:13:41,269 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 545 of 596 [2022-01-19 13:13:41,269 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:13:41,488 INFO L129 PetriNetUnfolder]: 151/1280 cut-off events. [2022-01-19 13:13:41,489 INFO L130 PetriNetUnfolder]: For 112/122 co-relation queries the response was YES. [2022-01-19 13:13:41,497 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1636 conditions, 1280 events. 151/1280 cut-off events. For 112/122 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 6500 event pairs, 37 based on Foata normal form. 0/1141 useless extension candidates. Maximal degree in co-relation 1618. Up to 140 conditions per place. [2022-01-19 13:13:41,500 INFO L132 encePairwiseOnDemand]: 589/596 looper letters, 32 selfloop transitions, 5 changer transitions 0/603 dead transitions. [2022-01-19 13:13:41,500 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 570 places, 603 transitions, 1589 flow [2022-01-19 13:13:41,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 13:13:41,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 13:13:41,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 3854 transitions. [2022-01-19 13:13:41,506 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.923777564717162 [2022-01-19 13:13:41,506 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 3854 transitions. [2022-01-19 13:13:41,506 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 3854 transitions. [2022-01-19 13:13:41,507 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:13:41,508 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 3854 transitions. [2022-01-19 13:13:41,512 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 550.5714285714286) internal successors, (3854), 7 states have internal predecessors, (3854), 0 states have call successors, (0), 0 states have 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:13:41,516 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 596.0) internal successors, (4768), 8 states have internal predecessors, (4768), 0 states have call successors, (0), 0 states have 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:13:41,517 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 596.0) internal successors, (4768), 8 states have internal predecessors, (4768), 0 states have call successors, (0), 0 states have 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:13:41,517 INFO L186 Difference]: Start difference. First operand has 564 places, 591 transitions, 1485 flow. Second operand 7 states and 3854 transitions. [2022-01-19 13:13:41,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 570 places, 603 transitions, 1589 flow [2022-01-19 13:13:41,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 562 places, 603 transitions, 1544 flow, removed 8 selfloop flow, removed 8 redundant places. [2022-01-19 13:13:41,525 INFO L242 Difference]: Finished difference. Result has 567 places, 595 transitions, 1479 flow [2022-01-19 13:13:41,526 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=1440, PETRI_DIFFERENCE_MINUEND_PLACES=556, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=591, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=586, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1479, PETRI_PLACES=567, PETRI_TRANSITIONS=595} [2022-01-19 13:13:41,526 INFO L334 CegarLoopForPetriNet]: 527 programPoint places, 40 predicate places. [2022-01-19 13:13:41,527 INFO L470 AbstractCegarLoop]: Abstraction has has 567 places, 595 transitions, 1479 flow [2022-01-19 13:13:41,527 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 547.4) internal successors, (2737), 5 states have internal predecessors, (2737), 0 states have call successors, (0), 0 states have 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:13:41,527 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:13:41,527 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:41,528 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-19 13:13:41,528 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 13:13:41,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:13:41,528 INFO L85 PathProgramCache]: Analyzing trace with hash 514282158, now seen corresponding path program 1 times [2022-01-19 13:13:41,528 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:13:41,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925674488] [2022-01-19 13:13:41,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:13:41,528 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:13:41,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:13:41,623 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-01-19 13:13:41,623 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:13:41,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925674488] [2022-01-19 13:13:41,624 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925674488] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:13:41,624 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:13:41,624 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 13:13:41,624 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188323574] [2022-01-19 13:13:41,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:13:41,626 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 13:13:41,626 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:13:41,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 13:13:41,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-19 13:13:41,629 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 531 out of 596 [2022-01-19 13:13:41,631 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 567 places, 595 transitions, 1479 flow. Second operand has 7 states, 7 states have (on average 535.4285714285714) internal successors, (3748), 7 states have internal predecessors, (3748), 0 states have call successors, (0), 0 states have 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:13:41,631 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:13:41,631 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 531 of 596 [2022-01-19 13:13:41,631 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:13:41,816 INFO L129 PetriNetUnfolder]: 54/846 cut-off events. [2022-01-19 13:13:41,816 INFO L130 PetriNetUnfolder]: For 71/87 co-relation queries the response was YES. [2022-01-19 13:13:41,825 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1197 conditions, 846 events. 54/846 cut-off events. For 71/87 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 3623 event pairs, 0 based on Foata normal form. 4/801 useless extension candidates. Maximal degree in co-relation 1174. Up to 83 conditions per place. [2022-01-19 13:13:41,828 INFO L132 encePairwiseOnDemand]: 588/596 looper letters, 38 selfloop transitions, 4 changer transitions 4/607 dead transitions. [2022-01-19 13:13:41,828 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 573 places, 607 transitions, 1595 flow [2022-01-19 13:13:41,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 13:13:41,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 13:13:41,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 3764 transitions. [2022-01-19 13:13:41,834 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9022051773729626 [2022-01-19 13:13:41,834 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 3764 transitions. [2022-01-19 13:13:41,834 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 3764 transitions. [2022-01-19 13:13:41,835 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:13:41,835 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 3764 transitions. [2022-01-19 13:13:41,841 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 537.7142857142857) internal successors, (3764), 7 states have internal predecessors, (3764), 0 states have call successors, (0), 0 states have 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:13:41,847 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 596.0) internal successors, (4768), 8 states have internal predecessors, (4768), 0 states have call successors, (0), 0 states have 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:13:41,848 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 596.0) internal successors, (4768), 8 states have internal predecessors, (4768), 0 states have call successors, (0), 0 states have 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:13:41,848 INFO L186 Difference]: Start difference. First operand has 567 places, 595 transitions, 1479 flow. Second operand 7 states and 3764 transitions. [2022-01-19 13:13:41,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 573 places, 607 transitions, 1595 flow [2022-01-19 13:13:41,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 572 places, 607 transitions, 1594 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 13:13:41,857 INFO L242 Difference]: Finished difference. Result has 577 places, 598 transitions, 1512 flow [2022-01-19 13:13:41,858 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=1478, PETRI_DIFFERENCE_MINUEND_PLACES=566, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=595, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=591, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1512, PETRI_PLACES=577, PETRI_TRANSITIONS=598} [2022-01-19 13:13:41,858 INFO L334 CegarLoopForPetriNet]: 527 programPoint places, 50 predicate places. [2022-01-19 13:13:41,859 INFO L470 AbstractCegarLoop]: Abstraction has has 577 places, 598 transitions, 1512 flow [2022-01-19 13:13:41,859 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 535.4285714285714) internal successors, (3748), 7 states have internal predecessors, (3748), 0 states have call successors, (0), 0 states have 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:13:41,859 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:13:41,868 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:41,868 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-19 13:13:41,868 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 13:13:41,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:13:41,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1134371698, now seen corresponding path program 1 times [2022-01-19 13:13:41,869 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:13:41,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816175497] [2022-01-19 13:13:41,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:13:41,869 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:13:41,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:13:41,945 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-01-19 13:13:41,945 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:13:41,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816175497] [2022-01-19 13:13:41,945 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816175497] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:13:41,945 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:13:41,945 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 13:13:41,945 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580434113] [2022-01-19 13:13:41,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:13:41,946 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 13:13:41,946 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:13:41,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 13:13:41,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-19 13:13:41,948 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 531 out of 596 [2022-01-19 13:13:41,950 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 577 places, 598 transitions, 1512 flow. Second operand has 7 states, 7 states have (on average 535.4285714285714) internal successors, (3748), 7 states have internal predecessors, (3748), 0 states have call successors, (0), 0 states have 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:13:41,950 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:13:41,950 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 531 of 596 [2022-01-19 13:13:41,950 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:13:42,118 INFO L129 PetriNetUnfolder]: 56/894 cut-off events. [2022-01-19 13:13:42,118 INFO L130 PetriNetUnfolder]: For 127/143 co-relation queries the response was YES. [2022-01-19 13:13:42,127 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1387 conditions, 894 events. 56/894 cut-off events. For 127/143 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 4025 event pairs, 0 based on Foata normal form. 4/849 useless extension candidates. Maximal degree in co-relation 1359. Up to 125 conditions per place. [2022-01-19 13:13:42,129 INFO L132 encePairwiseOnDemand]: 589/596 looper letters, 42 selfloop transitions, 2 changer transitions 5/611 dead transitions. [2022-01-19 13:13:42,130 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 580 places, 611 transitions, 1650 flow [2022-01-19 13:13:42,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 13:13:42,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 13:13:42,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 3765 transitions. [2022-01-19 13:13:42,135 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9024448705656759 [2022-01-19 13:13:42,135 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 3765 transitions. [2022-01-19 13:13:42,135 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 3765 transitions. [2022-01-19 13:13:42,136 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:13:42,136 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 3765 transitions. [2022-01-19 13:13:42,139 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 537.8571428571429) internal successors, (3765), 7 states have internal predecessors, (3765), 0 states have call successors, (0), 0 states have 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:13:42,144 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 596.0) internal successors, (4768), 8 states have internal predecessors, (4768), 0 states have call successors, (0), 0 states have 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:13:42,145 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 596.0) internal successors, (4768), 8 states have internal predecessors, (4768), 0 states have call successors, (0), 0 states have 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:13:42,145 INFO L186 Difference]: Start difference. First operand has 577 places, 598 transitions, 1512 flow. Second operand 7 states and 3765 transitions. [2022-01-19 13:13:42,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 580 places, 611 transitions, 1650 flow [2022-01-19 13:13:42,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 576 places, 611 transitions, 1632 flow, removed 8 selfloop flow, removed 4 redundant places. [2022-01-19 13:13:42,154 INFO L242 Difference]: Finished difference. Result has 581 places, 599 transitions, 1526 flow [2022-01-19 13:13:42,155 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=1504, PETRI_DIFFERENCE_MINUEND_PLACES=570, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=598, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=596, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1526, PETRI_PLACES=581, PETRI_TRANSITIONS=599} [2022-01-19 13:13:42,155 INFO L334 CegarLoopForPetriNet]: 527 programPoint places, 54 predicate places. [2022-01-19 13:13:42,155 INFO L470 AbstractCegarLoop]: Abstraction has has 581 places, 599 transitions, 1526 flow [2022-01-19 13:13:42,156 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 535.4285714285714) internal successors, (3748), 7 states have internal predecessors, (3748), 0 states have call successors, (0), 0 states have 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:13:42,156 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:13:42,156 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:42,156 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-19 13:13:42,156 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 13:13:42,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:13:42,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1515986788, now seen corresponding path program 1 times [2022-01-19 13:13:42,157 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:13:42,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904851948] [2022-01-19 13:13:42,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:13:42,157 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:13:42,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:13:42,197 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-01-19 13:13:42,197 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:13:42,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904851948] [2022-01-19 13:13:42,197 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904851948] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:13:42,197 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:13:42,198 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 13:13:42,198 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747251854] [2022-01-19 13:13:42,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:13:42,198 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 13:13:42,198 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:13:42,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 13:13:42,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 13:13:42,200 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 548 out of 596 [2022-01-19 13:13:42,201 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 581 places, 599 transitions, 1526 flow. Second operand has 4 states, 4 states have (on average 550.75) internal successors, (2203), 4 states have internal predecessors, (2203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:13:42,202 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:13:42,202 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 548 of 596 [2022-01-19 13:13:42,202 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:13:42,386 INFO L129 PetriNetUnfolder]: 137/1358 cut-off events. [2022-01-19 13:13:42,386 INFO L130 PetriNetUnfolder]: For 151/163 co-relation queries the response was YES. [2022-01-19 13:13:42,394 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1886 conditions, 1358 events. 137/1358 cut-off events. For 151/163 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 7135 event pairs, 30 based on Foata normal form. 6/1238 useless extension candidates. Maximal degree in co-relation 1856. Up to 139 conditions per place. [2022-01-19 13:13:42,397 INFO L132 encePairwiseOnDemand]: 592/596 looper letters, 29 selfloop transitions, 3 changer transitions 2/606 dead transitions. [2022-01-19 13:13:42,397 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 581 places, 606 transitions, 1614 flow [2022-01-19 13:13:42,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 13:13:42,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 13:13:42,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2770 transitions. [2022-01-19 13:13:42,401 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9295302013422819 [2022-01-19 13:13:42,401 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 2770 transitions. [2022-01-19 13:13:42,401 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 2770 transitions. [2022-01-19 13:13:42,402 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:13:42,402 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 2770 transitions. [2022-01-19 13:13:42,405 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 554.0) internal successors, (2770), 5 states have internal predecessors, (2770), 0 states have call successors, (0), 0 states have 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:13:42,407 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 596.0) internal successors, (3576), 6 states have internal predecessors, (3576), 0 states have call successors, (0), 0 states have 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:13:42,408 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 596.0) internal successors, (3576), 6 states have internal predecessors, (3576), 0 states have call successors, (0), 0 states have 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:13:42,408 INFO L186 Difference]: Start difference. First operand has 581 places, 599 transitions, 1526 flow. Second operand 5 states and 2770 transitions. [2022-01-19 13:13:42,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 581 places, 606 transitions, 1614 flow [2022-01-19 13:13:42,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 576 places, 606 transitions, 1604 flow, removed 4 selfloop flow, removed 5 redundant places. [2022-01-19 13:13:42,416 INFO L242 Difference]: Finished difference. Result has 579 places, 599 transitions, 1529 flow [2022-01-19 13:13:42,417 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=1516, PETRI_DIFFERENCE_MINUEND_PLACES=572, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=599, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=596, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1529, PETRI_PLACES=579, PETRI_TRANSITIONS=599} [2022-01-19 13:13:42,418 INFO L334 CegarLoopForPetriNet]: 527 programPoint places, 52 predicate places. [2022-01-19 13:13:42,418 INFO L470 AbstractCegarLoop]: Abstraction has has 579 places, 599 transitions, 1529 flow [2022-01-19 13:13:42,418 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 550.75) internal successors, (2203), 4 states have internal predecessors, (2203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:13:42,418 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:13:42,418 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:42,418 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-19 13:13:42,418 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 13:13:42,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:13:42,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1405245386, now seen corresponding path program 1 times [2022-01-19 13:13:42,419 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:13:42,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741394480] [2022-01-19 13:13:42,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:13:42,419 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:13:42,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:13:42,458 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-01-19 13:13:42,458 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:13:42,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741394480] [2022-01-19 13:13:42,458 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741394480] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:13:42,458 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:13:42,459 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 13:13:42,459 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216178966] [2022-01-19 13:13:42,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:13:42,459 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 13:13:42,459 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:13:42,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 13:13:42,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 13:13:42,461 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 548 out of 596 [2022-01-19 13:13:42,462 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 579 places, 599 transitions, 1529 flow. Second operand has 4 states, 4 states have (on average 550.75) internal successors, (2203), 4 states have internal predecessors, (2203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:13:42,462 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:13:42,462 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 548 of 596 [2022-01-19 13:13:42,462 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:13:42,694 INFO L129 PetriNetUnfolder]: 136/1792 cut-off events. [2022-01-19 13:13:42,694 INFO L130 PetriNetUnfolder]: For 117/140 co-relation queries the response was YES. [2022-01-19 13:13:42,708 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2275 conditions, 1792 events. 136/1792 cut-off events. For 117/140 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 11181 event pairs, 14 based on Foata normal form. 8/1639 useless extension candidates. Maximal degree in co-relation 2246. Up to 69 conditions per place. [2022-01-19 13:13:42,712 INFO L132 encePairwiseOnDemand]: 592/596 looper letters, 30 selfloop transitions, 3 changer transitions 2/607 dead transitions. [2022-01-19 13:13:42,713 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 583 places, 607 transitions, 1622 flow [2022-01-19 13:13:42,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 13:13:42,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 13:13:42,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2771 transitions. [2022-01-19 13:13:42,716 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9298657718120805 [2022-01-19 13:13:42,716 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 2771 transitions. [2022-01-19 13:13:42,716 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 2771 transitions. [2022-01-19 13:13:42,717 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:13:42,717 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 2771 transitions. [2022-01-19 13:13:42,720 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 554.2) internal successors, (2771), 5 states have internal predecessors, (2771), 0 states have call successors, (0), 0 states have 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:13:42,722 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 596.0) internal successors, (3576), 6 states have internal predecessors, (3576), 0 states have call successors, (0), 0 states have 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:13:42,723 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 596.0) internal successors, (3576), 6 states have internal predecessors, (3576), 0 states have call successors, (0), 0 states have 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:13:42,723 INFO L186 Difference]: Start difference. First operand has 579 places, 599 transitions, 1529 flow. Second operand 5 states and 2771 transitions. [2022-01-19 13:13:42,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 583 places, 607 transitions, 1622 flow [2022-01-19 13:13:42,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 581 places, 607 transitions, 1613 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-01-19 13:13:42,731 INFO L242 Difference]: Finished difference. Result has 584 places, 599 transitions, 1537 flow [2022-01-19 13:13:42,732 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=1520, PETRI_DIFFERENCE_MINUEND_PLACES=577, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=599, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=596, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1537, PETRI_PLACES=584, PETRI_TRANSITIONS=599} [2022-01-19 13:13:42,734 INFO L334 CegarLoopForPetriNet]: 527 programPoint places, 57 predicate places. [2022-01-19 13:13:42,734 INFO L470 AbstractCegarLoop]: Abstraction has has 584 places, 599 transitions, 1537 flow [2022-01-19 13:13:42,735 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 550.75) internal successors, (2203), 4 states have internal predecessors, (2203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:13:42,735 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:13:42,735 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:42,735 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-19 13:13:42,735 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 13:13:42,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:13:42,735 INFO L85 PathProgramCache]: Analyzing trace with hash -186903562, now seen corresponding path program 1 times [2022-01-19 13:13:42,735 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:13:42,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644504532] [2022-01-19 13:13:42,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:13:42,736 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:13:42,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:13:42,791 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-01-19 13:13:42,791 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:13:42,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644504532] [2022-01-19 13:13:42,791 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644504532] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:13:42,791 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:13:42,791 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 13:13:42,793 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923604840] [2022-01-19 13:13:42,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:13:42,793 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 13:13:42,793 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:13:42,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 13:13:42,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 13:13:42,795 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 549 out of 596 [2022-01-19 13:13:42,795 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 584 places, 599 transitions, 1537 flow. Second operand has 3 states, 3 states have (on average 552.0) internal successors, (1656), 3 states have internal predecessors, (1656), 0 states have call successors, (0), 0 states have 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:13:42,795 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:13:42,796 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 549 of 596 [2022-01-19 13:13:42,796 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:13:43,027 INFO L129 PetriNetUnfolder]: 159/1654 cut-off events. [2022-01-19 13:13:43,027 INFO L130 PetriNetUnfolder]: For 141/159 co-relation queries the response was YES. [2022-01-19 13:13:43,041 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2126 conditions, 1654 events. 159/1654 cut-off events. For 141/159 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 10239 event pairs, 36 based on Foata normal form. 0/1485 useless extension candidates. Maximal degree in co-relation 2094. Up to 111 conditions per place. [2022-01-19 13:13:43,045 INFO L132 encePairwiseOnDemand]: 591/596 looper letters, 24 selfloop transitions, 4 changer transitions 0/606 dead transitions. [2022-01-19 13:13:43,045 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 586 places, 606 transitions, 1609 flow [2022-01-19 13:13:43,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 13:13:43,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 13:13:43,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1676 transitions. [2022-01-19 13:13:43,048 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9373601789709173 [2022-01-19 13:13:43,048 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1676 transitions. [2022-01-19 13:13:43,048 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1676 transitions. [2022-01-19 13:13:43,048 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:13:43,048 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1676 transitions. [2022-01-19 13:13:43,050 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 558.6666666666666) internal successors, (1676), 3 states have internal predecessors, (1676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 13:13:43,052 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 596.0) internal successors, (2384), 4 states have internal predecessors, (2384), 0 states have call successors, (0), 0 states have 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:13:43,052 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 596.0) internal successors, (2384), 4 states have internal predecessors, (2384), 0 states have call successors, (0), 0 states have 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:13:43,052 INFO L186 Difference]: Start difference. First operand has 584 places, 599 transitions, 1537 flow. Second operand 3 states and 1676 transitions. [2022-01-19 13:13:43,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 586 places, 606 transitions, 1609 flow [2022-01-19 13:13:43,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 584 places, 606 transitions, 1600 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-01-19 13:13:43,061 INFO L242 Difference]: Finished difference. Result has 585 places, 600 transitions, 1546 flow [2022-01-19 13:13:43,062 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=1528, PETRI_DIFFERENCE_MINUEND_PLACES=582, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=599, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=595, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1546, PETRI_PLACES=585, PETRI_TRANSITIONS=600} [2022-01-19 13:13:43,062 INFO L334 CegarLoopForPetriNet]: 527 programPoint places, 58 predicate places. [2022-01-19 13:13:43,062 INFO L470 AbstractCegarLoop]: Abstraction has has 585 places, 600 transitions, 1546 flow [2022-01-19 13:13:43,063 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 552.0) internal successors, (1656), 3 states have internal predecessors, (1656), 0 states have call successors, (0), 0 states have 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:13:43,063 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:13:43,063 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:43,063 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-19 13:13:43,063 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 13:13:43,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:13:43,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1542592377, now seen corresponding path program 1 times [2022-01-19 13:13:43,063 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:13:43,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777033014] [2022-01-19 13:13:43,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:13:43,064 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:13:43,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:13:43,106 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-01-19 13:13:43,106 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:13:43,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777033014] [2022-01-19 13:13:43,106 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777033014] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:13:43,106 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:13:43,106 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 13:13:43,106 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472897241] [2022-01-19 13:13:43,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:13:43,107 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 13:13:43,107 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:13:43,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 13:13:43,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 13:13:43,108 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 549 out of 596 [2022-01-19 13:13:43,109 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 585 places, 600 transitions, 1546 flow. Second operand has 3 states, 3 states have (on average 552.0) internal successors, (1656), 3 states have internal predecessors, (1656), 0 states have call successors, (0), 0 states have 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:13:43,109 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:13:43,109 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 549 of 596 [2022-01-19 13:13:43,109 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:13:43,452 INFO L129 PetriNetUnfolder]: 179/2575 cut-off events. [2022-01-19 13:13:43,453 INFO L130 PetriNetUnfolder]: For 125/167 co-relation queries the response was YES. [2022-01-19 13:13:43,474 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3205 conditions, 2575 events. 179/2575 cut-off events. For 125/167 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 17246 event pairs, 12 based on Foata normal form. 2/2357 useless extension candidates. Maximal degree in co-relation 3172. Up to 58 conditions per place. [2022-01-19 13:13:43,481 INFO L132 encePairwiseOnDemand]: 591/596 looper letters, 25 selfloop transitions, 4 changer transitions 0/608 dead transitions. [2022-01-19 13:13:43,481 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 587 places, 608 transitions, 1623 flow [2022-01-19 13:13:43,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 13:13:43,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 13:13:43,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1677 transitions. [2022-01-19 13:13:43,483 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9379194630872483 [2022-01-19 13:13:43,483 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1677 transitions. [2022-01-19 13:13:43,483 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1677 transitions. [2022-01-19 13:13:43,484 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:13:43,484 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1677 transitions. [2022-01-19 13:13:43,485 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 559.0) internal successors, (1677), 3 states have internal predecessors, (1677), 0 states have call successors, (0), 0 states have 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:13:43,486 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 596.0) internal successors, (2384), 4 states have internal predecessors, (2384), 0 states have call successors, (0), 0 states have 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:13:43,487 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 596.0) internal successors, (2384), 4 states have internal predecessors, (2384), 0 states have call successors, (0), 0 states have 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:13:43,487 INFO L186 Difference]: Start difference. First operand has 585 places, 600 transitions, 1546 flow. Second operand 3 states and 1677 transitions. [2022-01-19 13:13:43,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 587 places, 608 transitions, 1623 flow [2022-01-19 13:13:43,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 586 places, 608 transitions, 1619 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 13:13:43,496 INFO L242 Difference]: Finished difference. Result has 587 places, 601 transitions, 1560 flow [2022-01-19 13:13:43,497 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=1542, PETRI_DIFFERENCE_MINUEND_PLACES=584, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=600, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=596, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1560, PETRI_PLACES=587, PETRI_TRANSITIONS=601} [2022-01-19 13:13:43,497 INFO L334 CegarLoopForPetriNet]: 527 programPoint places, 60 predicate places. [2022-01-19 13:13:43,497 INFO L470 AbstractCegarLoop]: Abstraction has has 587 places, 601 transitions, 1560 flow [2022-01-19 13:13:43,497 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 552.0) internal successors, (1656), 3 states have internal predecessors, (1656), 0 states have call successors, (0), 0 states have 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:13:43,497 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:13:43,498 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:43,498 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-19 13:13:43,498 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 13:13:43,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:13:43,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1049860450, now seen corresponding path program 1 times [2022-01-19 13:13:43,498 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:13:43,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930368725] [2022-01-19 13:13:43,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:13:43,498 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:13:43,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:13:43,542 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-01-19 13:13:43,542 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:13:43,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930368725] [2022-01-19 13:13:43,542 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930368725] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:13:43,542 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:13:43,542 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 13:13:43,542 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527693433] [2022-01-19 13:13:43,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:13:43,543 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 13:13:43,543 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:13:43,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 13:13:43,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 13:13:43,544 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 550 out of 596 [2022-01-19 13:13:43,545 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 587 places, 601 transitions, 1560 flow. Second operand has 3 states, 3 states have (on average 554.3333333333334) internal successors, (1663), 3 states have internal predecessors, (1663), 0 states have call successors, (0), 0 states have 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:13:43,545 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:13:43,545 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 550 of 596 [2022-01-19 13:13:43,545 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:13:43,959 INFO L129 PetriNetUnfolder]: 225/3066 cut-off events. [2022-01-19 13:13:43,959 INFO L130 PetriNetUnfolder]: For 240/296 co-relation queries the response was YES. [2022-01-19 13:13:43,974 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4006 conditions, 3066 events. 225/3066 cut-off events. For 240/296 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 22334 event pairs, 31 based on Foata normal form. 4/2849 useless extension candidates. Maximal degree in co-relation 3972. Up to 95 conditions per place. [2022-01-19 13:13:43,979 INFO L132 encePairwiseOnDemand]: 589/596 looper letters, 26 selfloop transitions, 5 changer transitions 0/612 dead transitions. [2022-01-19 13:13:43,979 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 589 places, 612 transitions, 1650 flow [2022-01-19 13:13:43,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 13:13:43,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 13:13:43,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1683 transitions. [2022-01-19 13:13:43,982 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9412751677852349 [2022-01-19 13:13:43,982 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1683 transitions. [2022-01-19 13:13:43,982 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1683 transitions. [2022-01-19 13:13:43,982 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:13:43,982 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1683 transitions. [2022-01-19 13:13:43,983 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 561.0) internal successors, (1683), 3 states have internal predecessors, (1683), 0 states have call successors, (0), 0 states have 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:13:43,985 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 596.0) internal successors, (2384), 4 states have internal predecessors, (2384), 0 states have call successors, (0), 0 states have 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:13:43,985 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 596.0) internal successors, (2384), 4 states have internal predecessors, (2384), 0 states have call successors, (0), 0 states have 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:13:43,985 INFO L186 Difference]: Start difference. First operand has 587 places, 601 transitions, 1560 flow. Second operand 3 states and 1683 transitions. [2022-01-19 13:13:43,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 589 places, 612 transitions, 1650 flow [2022-01-19 13:13:43,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 588 places, 612 transitions, 1646 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 13:13:43,995 INFO L242 Difference]: Finished difference. Result has 590 places, 604 transitions, 1595 flow [2022-01-19 13:13:43,996 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=1556, PETRI_DIFFERENCE_MINUEND_PLACES=586, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=601, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=596, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1595, PETRI_PLACES=590, PETRI_TRANSITIONS=604} [2022-01-19 13:13:43,996 INFO L334 CegarLoopForPetriNet]: 527 programPoint places, 63 predicate places. [2022-01-19 13:13:43,996 INFO L470 AbstractCegarLoop]: Abstraction has has 590 places, 604 transitions, 1595 flow [2022-01-19 13:13:43,996 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 554.3333333333334) internal successors, (1663), 3 states have internal predecessors, (1663), 0 states have call successors, (0), 0 states have 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:13:43,996 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:13:43,996 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:43,997 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-19 13:13:43,997 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 13:13:43,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:13:43,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1896665874, now seen corresponding path program 2 times [2022-01-19 13:13:43,997 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:13:43,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526513348] [2022-01-19 13:13:43,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:13:43,997 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:13:44,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:13:44,035 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-01-19 13:13:44,035 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:13:44,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526513348] [2022-01-19 13:13:44,035 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526513348] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:13:44,035 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:13:44,035 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 13:13:44,035 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664312436] [2022-01-19 13:13:44,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:13:44,036 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 13:13:44,036 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:13:44,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 13:13:44,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 13:13:44,037 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 550 out of 596 [2022-01-19 13:13:44,038 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 590 places, 604 transitions, 1595 flow. Second operand has 3 states, 3 states have (on average 554.3333333333334) internal successors, (1663), 3 states have internal predecessors, (1663), 0 states have call successors, (0), 0 states have 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:13:44,038 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:13:44,038 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 550 of 596 [2022-01-19 13:13:44,038 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:13:44,412 INFO L129 PetriNetUnfolder]: 221/2931 cut-off events. [2022-01-19 13:13:44,412 INFO L130 PetriNetUnfolder]: For 311/371 co-relation queries the response was YES. [2022-01-19 13:13:44,435 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3890 conditions, 2931 events. 221/2931 cut-off events. For 311/371 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 20852 event pairs, 40 based on Foata normal form. 3/2717 useless extension candidates. Maximal degree in co-relation 3855. Up to 128 conditions per place. [2022-01-19 13:13:44,443 INFO L132 encePairwiseOnDemand]: 592/596 looper letters, 26 selfloop transitions, 2 changer transitions 3/612 dead transitions. [2022-01-19 13:13:44,443 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 592 places, 612 transitions, 1676 flow [2022-01-19 13:13:44,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 13:13:44,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 13:13:44,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1680 transitions. [2022-01-19 13:13:44,445 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9395973154362416 [2022-01-19 13:13:44,445 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1680 transitions. [2022-01-19 13:13:44,445 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1680 transitions. [2022-01-19 13:13:44,446 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:13:44,446 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1680 transitions. [2022-01-19 13:13:44,447 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 560.0) internal successors, (1680), 3 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have 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:13:44,448 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 596.0) internal successors, (2384), 4 states have internal predecessors, (2384), 0 states have call successors, (0), 0 states have 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:13:44,448 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 596.0) internal successors, (2384), 4 states have internal predecessors, (2384), 0 states have call successors, (0), 0 states have 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:13:44,448 INFO L186 Difference]: Start difference. First operand has 590 places, 604 transitions, 1595 flow. Second operand 3 states and 1680 transitions. [2022-01-19 13:13:44,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 592 places, 612 transitions, 1676 flow [2022-01-19 13:13:44,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 590 places, 612 transitions, 1666 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-01-19 13:13:44,460 INFO L242 Difference]: Finished difference. Result has 591 places, 604 transitions, 1595 flow [2022-01-19 13:13:44,460 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=1585, PETRI_DIFFERENCE_MINUEND_PLACES=588, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=604, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=602, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1595, PETRI_PLACES=591, PETRI_TRANSITIONS=604} [2022-01-19 13:13:44,461 INFO L334 CegarLoopForPetriNet]: 527 programPoint places, 64 predicate places. [2022-01-19 13:13:44,461 INFO L470 AbstractCegarLoop]: Abstraction has has 591 places, 604 transitions, 1595 flow [2022-01-19 13:13:44,461 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 554.3333333333334) internal successors, (1663), 3 states have internal predecessors, (1663), 0 states have call successors, (0), 0 states have 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:13:44,461 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:13:44,461 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:44,461 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-19 13:13:44,461 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 13:13:44,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:13:44,462 INFO L85 PathProgramCache]: Analyzing trace with hash 428392958, now seen corresponding path program 1 times [2022-01-19 13:13:44,462 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:13:44,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016177311] [2022-01-19 13:13:44,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:13:44,462 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:13:44,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:13:44,500 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-01-19 13:13:44,500 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:13:44,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016177311] [2022-01-19 13:13:44,500 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016177311] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:13:44,500 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:13:44,500 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 13:13:44,500 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081630514] [2022-01-19 13:13:44,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:13:44,501 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 13:13:44,501 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:13:44,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 13:13:44,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 13:13:44,502 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 550 out of 596 [2022-01-19 13:13:44,503 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 591 places, 604 transitions, 1595 flow. Second operand has 3 states, 3 states have (on average 554.3333333333334) internal successors, (1663), 3 states have internal predecessors, (1663), 0 states have call successors, (0), 0 states have 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:13:44,503 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:13:44,503 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 550 of 596 [2022-01-19 13:13:44,503 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:13:44,890 INFO L129 PetriNetUnfolder]: 236/3053 cut-off events. [2022-01-19 13:13:44,890 INFO L130 PetriNetUnfolder]: For 365/427 co-relation queries the response was YES. [2022-01-19 13:13:44,910 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3964 conditions, 3053 events. 236/3053 cut-off events. For 365/427 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 22043 event pairs, 39 based on Foata normal form. 5/2822 useless extension candidates. Maximal degree in co-relation 3928. Up to 116 conditions per place. [2022-01-19 13:13:44,922 INFO L132 encePairwiseOnDemand]: 592/596 looper letters, 26 selfloop transitions, 3 changer transitions 3/613 dead transitions. [2022-01-19 13:13:44,922 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 593 places, 613 transitions, 1684 flow [2022-01-19 13:13:44,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 13:13:44,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 13:13:44,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1681 transitions. [2022-01-19 13:13:44,925 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9401565995525727 [2022-01-19 13:13:44,925 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1681 transitions. [2022-01-19 13:13:44,925 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1681 transitions. [2022-01-19 13:13:44,925 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:13:44,925 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1681 transitions. [2022-01-19 13:13:44,927 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 560.3333333333334) internal successors, (1681), 3 states have internal predecessors, (1681), 0 states have call successors, (0), 0 states have 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:13:44,928 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 596.0) internal successors, (2384), 4 states have internal predecessors, (2384), 0 states have call successors, (0), 0 states have 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:13:44,928 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 596.0) internal successors, (2384), 4 states have internal predecessors, (2384), 0 states have call successors, (0), 0 states have 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:13:44,928 INFO L186 Difference]: Start difference. First operand has 591 places, 604 transitions, 1595 flow. Second operand 3 states and 1681 transitions. [2022-01-19 13:13:44,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 593 places, 613 transitions, 1684 flow [2022-01-19 13:13:44,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 592 places, 613 transitions, 1682 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 13:13:44,938 INFO L242 Difference]: Finished difference. Result has 593 places, 604 transitions, 1606 flow [2022-01-19 13:13:44,938 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=1593, PETRI_DIFFERENCE_MINUEND_PLACES=590, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=604, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=601, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1606, PETRI_PLACES=593, PETRI_TRANSITIONS=604} [2022-01-19 13:13:44,938 INFO L334 CegarLoopForPetriNet]: 527 programPoint places, 66 predicate places. [2022-01-19 13:13:44,939 INFO L470 AbstractCegarLoop]: Abstraction has has 593 places, 604 transitions, 1606 flow [2022-01-19 13:13:44,939 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 554.3333333333334) internal successors, (1663), 3 states have internal predecessors, (1663), 0 states have call successors, (0), 0 states have 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:13:44,939 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:13:44,939 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:44,939 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-19 13:13:44,939 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 13:13:44,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:13:44,939 INFO L85 PathProgramCache]: Analyzing trace with hash -2085797344, now seen corresponding path program 2 times [2022-01-19 13:13:44,940 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:13:44,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160152893] [2022-01-19 13:13:44,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:13:44,940 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:13:44,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:13:44,987 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-01-19 13:13:44,987 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:13:44,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160152893] [2022-01-19 13:13:44,987 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160152893] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:13:44,987 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:13:44,987 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-19 13:13:44,987 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022831976] [2022-01-19 13:13:44,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:13:44,988 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-19 13:13:44,988 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:13:44,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-19 13:13:44,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-19 13:13:44,989 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 550 out of 596 [2022-01-19 13:13:44,990 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 593 places, 604 transitions, 1606 flow. Second operand has 3 states, 3 states have (on average 554.3333333333334) internal successors, (1663), 3 states have internal predecessors, (1663), 0 states have call successors, (0), 0 states have 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:13:44,990 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:13:44,990 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 550 of 596 [2022-01-19 13:13:44,990 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:13:45,348 INFO L129 PetriNetUnfolder]: 215/2844 cut-off events. [2022-01-19 13:13:45,348 INFO L130 PetriNetUnfolder]: For 428/494 co-relation queries the response was YES. [2022-01-19 13:13:45,370 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3790 conditions, 2844 events. 215/2844 cut-off events. For 428/494 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 19686 event pairs, 26 based on Foata normal form. 4/2642 useless extension candidates. Maximal degree in co-relation 3753. Up to 74 conditions per place. [2022-01-19 13:13:45,377 INFO L132 encePairwiseOnDemand]: 589/596 looper letters, 27 selfloop transitions, 5 changer transitions 3/616 dead transitions. [2022-01-19 13:13:45,377 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 595 places, 616 transitions, 1720 flow [2022-01-19 13:13:45,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-19 13:13:45,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-01-19 13:13:45,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1683 transitions. [2022-01-19 13:13:45,379 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9412751677852349 [2022-01-19 13:13:45,379 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1683 transitions. [2022-01-19 13:13:45,379 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1683 transitions. [2022-01-19 13:13:45,380 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:13:45,380 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1683 transitions. [2022-01-19 13:13:45,381 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 561.0) internal successors, (1683), 3 states have internal predecessors, (1683), 0 states have call successors, (0), 0 states have 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:13:45,382 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 596.0) internal successors, (2384), 4 states have internal predecessors, (2384), 0 states have call successors, (0), 0 states have 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:13:45,382 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 596.0) internal successors, (2384), 4 states have internal predecessors, (2384), 0 states have call successors, (0), 0 states have 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:13:45,382 INFO L186 Difference]: Start difference. First operand has 593 places, 604 transitions, 1606 flow. Second operand 3 states and 1683 transitions. [2022-01-19 13:13:45,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 595 places, 616 transitions, 1720 flow [2022-01-19 13:13:45,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 594 places, 616 transitions, 1717 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 13:13:45,393 INFO L242 Difference]: Finished difference. Result has 596 places, 605 transitions, 1628 flow [2022-01-19 13:13:45,394 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=1603, PETRI_DIFFERENCE_MINUEND_PLACES=592, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=604, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=599, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1628, PETRI_PLACES=596, PETRI_TRANSITIONS=605} [2022-01-19 13:13:45,394 INFO L334 CegarLoopForPetriNet]: 527 programPoint places, 69 predicate places. [2022-01-19 13:13:45,394 INFO L470 AbstractCegarLoop]: Abstraction has has 596 places, 605 transitions, 1628 flow [2022-01-19 13:13:45,395 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 554.3333333333334) internal successors, (1663), 3 states have internal predecessors, (1663), 0 states have call successors, (0), 0 states have 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:13:45,395 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:13:45,395 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:45,395 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-19 13:13:45,395 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 13:13:45,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:13:45,395 INFO L85 PathProgramCache]: Analyzing trace with hash 371722502, now seen corresponding path program 1 times [2022-01-19 13:13:45,395 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:13:45,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754090126] [2022-01-19 13:13:45,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:13:45,395 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:13:45,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:13:45,460 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-01-19 13:13:45,460 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:13:45,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754090126] [2022-01-19 13:13:45,461 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754090126] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:13:45,461 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:13:45,461 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-19 13:13:45,461 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938630634] [2022-01-19 13:13:45,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:13:45,462 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-19 13:13:45,462 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:13:45,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-19 13:13:45,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-19 13:13:45,464 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 514 out of 596 [2022-01-19 13:13:45,465 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 596 places, 605 transitions, 1628 flow. Second operand has 5 states, 5 states have (on average 518.8) internal successors, (2594), 5 states have internal predecessors, (2594), 0 states have call successors, (0), 0 states have 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:13:45,466 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:13:45,466 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 514 of 596 [2022-01-19 13:13:45,466 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:13:46,444 INFO L129 PetriNetUnfolder]: 1062/6556 cut-off events. [2022-01-19 13:13:46,444 INFO L130 PetriNetUnfolder]: For 2187/2189 co-relation queries the response was YES. [2022-01-19 13:13:46,489 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9902 conditions, 6556 events. 1062/6556 cut-off events. For 2187/2189 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 63139 event pairs, 409 based on Foata normal form. 1/5865 useless extension candidates. Maximal degree in co-relation 9864. Up to 1002 conditions per place. [2022-01-19 13:13:46,505 INFO L132 encePairwiseOnDemand]: 574/596 looper letters, 71 selfloop transitions, 21 changer transitions 29/666 dead transitions. [2022-01-19 13:13:46,505 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 602 places, 666 transitions, 2081 flow [2022-01-19 13:13:46,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 13:13:46,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 13:13:46,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 3713 transitions. [2022-01-19 13:13:46,510 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8899808245445829 [2022-01-19 13:13:46,511 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 3713 transitions. [2022-01-19 13:13:46,511 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 3713 transitions. [2022-01-19 13:13:46,511 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:13:46,511 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 3713 transitions. [2022-01-19 13:13:46,514 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 530.4285714285714) internal successors, (3713), 7 states have internal predecessors, (3713), 0 states have call successors, (0), 0 states have 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:13:46,516 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 596.0) internal successors, (4768), 8 states have internal predecessors, (4768), 0 states have call successors, (0), 0 states have 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:13:46,516 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 596.0) internal successors, (4768), 8 states have internal predecessors, (4768), 0 states have call successors, (0), 0 states have 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:13:46,516 INFO L186 Difference]: Start difference. First operand has 596 places, 605 transitions, 1628 flow. Second operand 7 states and 3713 transitions. [2022-01-19 13:13:46,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 602 places, 666 transitions, 2081 flow [2022-01-19 13:13:46,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 600 places, 666 transitions, 2047 flow, removed 9 selfloop flow, removed 2 redundant places. [2022-01-19 13:13:46,535 INFO L242 Difference]: Finished difference. Result has 606 places, 615 transitions, 1753 flow [2022-01-19 13:13:46,536 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=1610, PETRI_DIFFERENCE_MINUEND_PLACES=594, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=605, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=586, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1753, PETRI_PLACES=606, PETRI_TRANSITIONS=615} [2022-01-19 13:13:46,536 INFO L334 CegarLoopForPetriNet]: 527 programPoint places, 79 predicate places. [2022-01-19 13:13:46,536 INFO L470 AbstractCegarLoop]: Abstraction has has 606 places, 615 transitions, 1753 flow [2022-01-19 13:13:46,537 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 518.8) internal successors, (2594), 5 states have internal predecessors, (2594), 0 states have call successors, (0), 0 states have 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:13:46,537 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:13:46,537 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:46,537 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-19 13:13:46,537 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 13:13:46,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:13:46,537 INFO L85 PathProgramCache]: Analyzing trace with hash -487313754, now seen corresponding path program 2 times [2022-01-19 13:13:46,537 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:13:46,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443432424] [2022-01-19 13:13:46,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:13:46,538 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:13:46,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:13:46,615 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-01-19 13:13:46,615 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:13:46,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443432424] [2022-01-19 13:13:46,615 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443432424] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:13:46,615 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:13:46,615 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-19 13:13:46,616 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195544770] [2022-01-19 13:13:46,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:13:46,617 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-19 13:13:46,617 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:13:46,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-19 13:13:46,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-19 13:13:46,618 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 514 out of 596 [2022-01-19 13:13:46,619 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 606 places, 615 transitions, 1753 flow. Second operand has 5 states, 5 states have (on average 518.8) internal successors, (2594), 5 states have internal predecessors, (2594), 0 states have call successors, (0), 0 states have 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:13:46,619 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:13:46,619 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 514 of 596 [2022-01-19 13:13:46,619 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:13:47,461 INFO L129 PetriNetUnfolder]: 965/5840 cut-off events. [2022-01-19 13:13:47,461 INFO L130 PetriNetUnfolder]: For 2973/2985 co-relation queries the response was YES. [2022-01-19 13:13:47,503 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9292 conditions, 5840 events. 965/5840 cut-off events. For 2973/2985 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 54895 event pairs, 348 based on Foata normal form. 42/5414 useless extension candidates. Maximal degree in co-relation 9249. Up to 1071 conditions per place. [2022-01-19 13:13:47,515 INFO L132 encePairwiseOnDemand]: 585/596 looper letters, 82 selfloop transitions, 12 changer transitions 15/654 dead transitions. [2022-01-19 13:13:47,516 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 610 places, 654 transitions, 2159 flow [2022-01-19 13:13:47,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-19 13:13:47,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-01-19 13:13:47,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3179 transitions. [2022-01-19 13:13:47,518 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8889821029082774 [2022-01-19 13:13:47,518 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 3179 transitions. [2022-01-19 13:13:47,518 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 3179 transitions. [2022-01-19 13:13:47,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:13:47,519 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 3179 transitions. [2022-01-19 13:13:47,521 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 529.8333333333334) internal successors, (3179), 6 states have internal predecessors, (3179), 0 states have call successors, (0), 0 states have 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:13:47,523 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 596.0) internal successors, (4172), 7 states have internal predecessors, (4172), 0 states have call successors, (0), 0 states have 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:13:47,523 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 596.0) internal successors, (4172), 7 states have internal predecessors, (4172), 0 states have call successors, (0), 0 states have 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:13:47,523 INFO L186 Difference]: Start difference. First operand has 606 places, 615 transitions, 1753 flow. Second operand 6 states and 3179 transitions. [2022-01-19 13:13:47,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 610 places, 654 transitions, 2159 flow [2022-01-19 13:13:47,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 609 places, 654 transitions, 2155 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-01-19 13:13:47,543 INFO L242 Difference]: Finished difference. Result has 613 places, 621 transitions, 1855 flow [2022-01-19 13:13:47,543 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=1751, PETRI_DIFFERENCE_MINUEND_PLACES=604, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=615, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=604, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1855, PETRI_PLACES=613, PETRI_TRANSITIONS=621} [2022-01-19 13:13:47,544 INFO L334 CegarLoopForPetriNet]: 527 programPoint places, 86 predicate places. [2022-01-19 13:13:47,544 INFO L470 AbstractCegarLoop]: Abstraction has has 613 places, 621 transitions, 1855 flow [2022-01-19 13:13:47,544 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 518.8) internal successors, (2594), 5 states have internal predecessors, (2594), 0 states have call successors, (0), 0 states have 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:13:47,544 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:13:47,544 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:47,544 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-19 13:13:47,544 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 13:13:47,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:13:47,545 INFO L85 PathProgramCache]: Analyzing trace with hash 742915764, now seen corresponding path program 3 times [2022-01-19 13:13:47,545 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:13:47,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534351804] [2022-01-19 13:13:47,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:13:47,545 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:13:47,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:13:47,595 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-01-19 13:13:47,595 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:13:47,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534351804] [2022-01-19 13:13:47,596 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534351804] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:13:47,596 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:13:47,596 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-19 13:13:47,596 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598873537] [2022-01-19 13:13:47,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:13:47,596 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-19 13:13:47,596 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:13:47,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-19 13:13:47,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-19 13:13:47,598 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 512 out of 596 [2022-01-19 13:13:47,599 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 613 places, 621 transitions, 1855 flow. Second operand has 5 states, 5 states have (on average 517.2) internal successors, (2586), 5 states have internal predecessors, (2586), 0 states have call successors, (0), 0 states have 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:13:47,599 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:13:47,599 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 512 of 596 [2022-01-19 13:13:47,599 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:13:48,508 INFO L129 PetriNetUnfolder]: 978/6239 cut-off events. [2022-01-19 13:13:48,508 INFO L130 PetriNetUnfolder]: For 2859/2891 co-relation queries the response was YES. [2022-01-19 13:13:48,553 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10038 conditions, 6239 events. 978/6239 cut-off events. For 2859/2891 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 59455 event pairs, 396 based on Foata normal form. 20/5759 useless extension candidates. Maximal degree in co-relation 9992. Up to 772 conditions per place. [2022-01-19 13:13:48,566 INFO L132 encePairwiseOnDemand]: 581/596 looper letters, 82 selfloop transitions, 15 changer transitions 35/675 dead transitions. [2022-01-19 13:13:48,566 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 619 places, 675 transitions, 2349 flow [2022-01-19 13:13:48,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 13:13:48,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 13:13:48,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 3693 transitions. [2022-01-19 13:13:48,569 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8851869606903164 [2022-01-19 13:13:48,569 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 3693 transitions. [2022-01-19 13:13:48,569 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 3693 transitions. [2022-01-19 13:13:48,569 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:13:48,569 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 3693 transitions. [2022-01-19 13:13:48,572 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 527.5714285714286) internal successors, (3693), 7 states have internal predecessors, (3693), 0 states have call successors, (0), 0 states have 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:13:48,574 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 596.0) internal successors, (4768), 8 states have internal predecessors, (4768), 0 states have call successors, (0), 0 states have 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:13:48,575 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 596.0) internal successors, (4768), 8 states have internal predecessors, (4768), 0 states have call successors, (0), 0 states have 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:13:48,575 INFO L186 Difference]: Start difference. First operand has 613 places, 621 transitions, 1855 flow. Second operand 7 states and 3693 transitions. [2022-01-19 13:13:48,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 619 places, 675 transitions, 2349 flow [2022-01-19 13:13:48,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 619 places, 675 transitions, 2331 flow, removed 9 selfloop flow, removed 0 redundant places. [2022-01-19 13:13:48,599 INFO L242 Difference]: Finished difference. Result has 622 places, 616 transitions, 1843 flow [2022-01-19 13:13:48,599 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=1843, PETRI_DIFFERENCE_MINUEND_PLACES=613, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=621, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=606, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1843, PETRI_PLACES=622, PETRI_TRANSITIONS=616} [2022-01-19 13:13:48,600 INFO L334 CegarLoopForPetriNet]: 527 programPoint places, 95 predicate places. [2022-01-19 13:13:48,600 INFO L470 AbstractCegarLoop]: Abstraction has has 622 places, 616 transitions, 1843 flow [2022-01-19 13:13:48,600 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 517.2) internal successors, (2586), 5 states have internal predecessors, (2586), 0 states have call successors, (0), 0 states have 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:13:48,600 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:13:48,600 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:48,600 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-19 13:13:48,600 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 13:13:48,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:13:48,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1823887304, now seen corresponding path program 4 times [2022-01-19 13:13:48,601 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:13:48,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473589143] [2022-01-19 13:13:48,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:13:48,601 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:13:48,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:13:48,669 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-01-19 13:13:48,669 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:13:48,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473589143] [2022-01-19 13:13:48,669 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473589143] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:13:48,669 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:13:48,669 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-19 13:13:48,669 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181499195] [2022-01-19 13:13:48,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:13:48,671 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-19 13:13:48,671 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:13:48,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-19 13:13:48,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-19 13:13:48,673 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 514 out of 596 [2022-01-19 13:13:48,681 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 622 places, 616 transitions, 1843 flow. Second operand has 5 states, 5 states have (on average 518.8) internal successors, (2594), 5 states have internal predecessors, (2594), 0 states have call successors, (0), 0 states have 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:13:48,681 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:13:48,681 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 514 of 596 [2022-01-19 13:13:48,681 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:13:49,568 INFO L129 PetriNetUnfolder]: 891/5807 cut-off events. [2022-01-19 13:13:49,569 INFO L130 PetriNetUnfolder]: For 3132/3150 co-relation queries the response was YES. [2022-01-19 13:13:49,612 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9253 conditions, 5807 events. 891/5807 cut-off events. For 3132/3150 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 53568 event pairs, 203 based on Foata normal form. 14/5357 useless extension candidates. Maximal degree in co-relation 9203. Up to 794 conditions per place. [2022-01-19 13:13:49,625 INFO L132 encePairwiseOnDemand]: 567/596 looper letters, 75 selfloop transitions, 34 changer transitions 16/667 dead transitions. [2022-01-19 13:13:49,625 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 625 places, 667 transitions, 2267 flow [2022-01-19 13:13:49,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 13:13:49,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 13:13:49,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 3711 transitions. [2022-01-19 13:13:49,627 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8895014381591563 [2022-01-19 13:13:49,628 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 3711 transitions. [2022-01-19 13:13:49,628 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 3711 transitions. [2022-01-19 13:13:49,628 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:13:49,628 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 3711 transitions. [2022-01-19 13:13:49,631 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 530.1428571428571) internal successors, (3711), 7 states have internal predecessors, (3711), 0 states have call successors, (0), 0 states have 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:13:49,633 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 596.0) internal successors, (4768), 8 states have internal predecessors, (4768), 0 states have call successors, (0), 0 states have 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:13:49,633 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 596.0) internal successors, (4768), 8 states have internal predecessors, (4768), 0 states have call successors, (0), 0 states have 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:13:49,634 INFO L186 Difference]: Start difference. First operand has 622 places, 616 transitions, 1843 flow. Second operand 7 states and 3711 transitions. [2022-01-19 13:13:49,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 625 places, 667 transitions, 2267 flow [2022-01-19 13:13:49,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 619 places, 667 transitions, 2229 flow, removed 11 selfloop flow, removed 6 redundant places. [2022-01-19 13:13:49,657 INFO L242 Difference]: Finished difference. Result has 622 places, 625 transitions, 1938 flow [2022-01-19 13:13:49,658 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=1795, PETRI_DIFFERENCE_MINUEND_PLACES=613, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=614, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=585, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1938, PETRI_PLACES=622, PETRI_TRANSITIONS=625} [2022-01-19 13:13:49,658 INFO L334 CegarLoopForPetriNet]: 527 programPoint places, 95 predicate places. [2022-01-19 13:13:49,658 INFO L470 AbstractCegarLoop]: Abstraction has has 622 places, 625 transitions, 1938 flow [2022-01-19 13:13:49,659 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 518.8) internal successors, (2594), 5 states have internal predecessors, (2594), 0 states have call successors, (0), 0 states have 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:13:49,659 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:13:49,659 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:49,659 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-19 13:13:49,659 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 13:13:49,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:13:49,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1135082975, now seen corresponding path program 1 times [2022-01-19 13:13:49,659 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:13:49,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329577743] [2022-01-19 13:13:49,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:13:49,660 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:13:49,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:13:49,735 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-01-19 13:13:49,735 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:13:49,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329577743] [2022-01-19 13:13:49,735 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329577743] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:13:49,735 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:13:49,735 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-19 13:13:49,735 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291603516] [2022-01-19 13:13:49,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:13:49,736 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-19 13:13:49,736 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:13:49,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-19 13:13:49,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-19 13:13:49,738 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 512 out of 596 [2022-01-19 13:13:49,739 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 622 places, 625 transitions, 1938 flow. Second operand has 5 states, 5 states have (on average 517.2) internal successors, (2586), 5 states have internal predecessors, (2586), 0 states have call successors, (0), 0 states have 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:13:49,739 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:13:49,739 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 512 of 596 [2022-01-19 13:13:49,739 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:13:50,433 INFO L129 PetriNetUnfolder]: 619/4670 cut-off events. [2022-01-19 13:13:50,434 INFO L130 PetriNetUnfolder]: For 7560/8273 co-relation queries the response was YES. [2022-01-19 13:13:50,470 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7751 conditions, 4670 events. 619/4670 cut-off events. For 7560/8273 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 39167 event pairs, 79 based on Foata normal form. 155/4525 useless extension candidates. Maximal degree in co-relation 7703. Up to 565 conditions per place. [2022-01-19 13:13:50,479 INFO L132 encePairwiseOnDemand]: 588/596 looper letters, 82 selfloop transitions, 6 changer transitions 7/655 dead transitions. [2022-01-19 13:13:50,479 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 622 places, 655 transitions, 2354 flow [2022-01-19 13:13:50,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-19 13:13:50,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-01-19 13:13:50,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3159 transitions. [2022-01-19 13:13:50,482 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8833892617449665 [2022-01-19 13:13:50,482 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 3159 transitions. [2022-01-19 13:13:50,482 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 3159 transitions. [2022-01-19 13:13:50,482 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:13:50,482 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 3159 transitions. [2022-01-19 13:13:50,485 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 526.5) internal successors, (3159), 6 states have internal predecessors, (3159), 0 states have call successors, (0), 0 states have 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:13:50,486 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 596.0) internal successors, (4172), 7 states have internal predecessors, (4172), 0 states have call successors, (0), 0 states have 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:13:50,487 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 596.0) internal successors, (4172), 7 states have internal predecessors, (4172), 0 states have call successors, (0), 0 states have 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:13:50,487 INFO L186 Difference]: Start difference. First operand has 622 places, 625 transitions, 1938 flow. Second operand 6 states and 3159 transitions. [2022-01-19 13:13:50,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 622 places, 655 transitions, 2354 flow [2022-01-19 13:13:50,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 614 places, 655 transitions, 2291 flow, removed 8 selfloop flow, removed 8 redundant places. [2022-01-19 13:13:50,506 INFO L242 Difference]: Finished difference. Result has 615 places, 625 transitions, 1911 flow [2022-01-19 13:13:50,506 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=1894, PETRI_DIFFERENCE_MINUEND_PLACES=609, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=625, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=619, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1911, PETRI_PLACES=615, PETRI_TRANSITIONS=625} [2022-01-19 13:13:50,506 INFO L334 CegarLoopForPetriNet]: 527 programPoint places, 88 predicate places. [2022-01-19 13:13:50,507 INFO L470 AbstractCegarLoop]: Abstraction has has 615 places, 625 transitions, 1911 flow [2022-01-19 13:13:50,507 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 517.2) internal successors, (2586), 5 states have internal predecessors, (2586), 0 states have call successors, (0), 0 states have 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:13:50,507 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:13:50,507 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:50,507 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-19 13:13:50,507 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 13:13:50,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:13:50,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1888026411, now seen corresponding path program 2 times [2022-01-19 13:13:50,508 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:13:50,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402978495] [2022-01-19 13:13:50,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:13:50,508 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:13:50,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:13:50,555 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-01-19 13:13:50,555 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:13:50,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402978495] [2022-01-19 13:13:50,555 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402978495] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:13:50,555 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:13:50,556 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-19 13:13:50,556 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382192955] [2022-01-19 13:13:50,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:13:50,556 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-19 13:13:50,556 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:13:50,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-19 13:13:50,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-19 13:13:50,558 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 512 out of 596 [2022-01-19 13:13:50,559 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 615 places, 625 transitions, 1911 flow. Second operand has 5 states, 5 states have (on average 517.2) internal successors, (2586), 5 states have internal predecessors, (2586), 0 states have call successors, (0), 0 states have 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:13:50,559 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:13:50,559 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 512 of 596 [2022-01-19 13:13:50,559 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:13:51,301 INFO L129 PetriNetUnfolder]: 617/5089 cut-off events. [2022-01-19 13:13:51,301 INFO L130 PetriNetUnfolder]: For 3158/3871 co-relation queries the response was YES. [2022-01-19 13:13:51,336 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8401 conditions, 5089 events. 617/5089 cut-off events. For 3158/3871 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 44863 event pairs, 259 based on Foata normal form. 22/4834 useless extension candidates. Maximal degree in co-relation 8358. Up to 597 conditions per place. [2022-01-19 13:13:51,345 INFO L132 encePairwiseOnDemand]: 582/596 looper letters, 73 selfloop transitions, 15 changer transitions 22/670 dead transitions. [2022-01-19 13:13:51,345 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 621 places, 670 transitions, 2285 flow [2022-01-19 13:13:51,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 13:13:51,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 13:13:51,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 3685 transitions. [2022-01-19 13:13:51,348 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8832694151486098 [2022-01-19 13:13:51,348 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 3685 transitions. [2022-01-19 13:13:51,348 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 3685 transitions. [2022-01-19 13:13:51,348 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:13:51,348 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 3685 transitions. [2022-01-19 13:13:51,351 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 526.4285714285714) internal successors, (3685), 7 states have internal predecessors, (3685), 0 states have call successors, (0), 0 states have 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:13:51,353 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 596.0) internal successors, (4768), 8 states have internal predecessors, (4768), 0 states have call successors, (0), 0 states have 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:13:51,353 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 596.0) internal successors, (4768), 8 states have internal predecessors, (4768), 0 states have call successors, (0), 0 states have 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:13:51,353 INFO L186 Difference]: Start difference. First operand has 615 places, 625 transitions, 1911 flow. Second operand 7 states and 3685 transitions. [2022-01-19 13:13:51,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 621 places, 670 transitions, 2285 flow [2022-01-19 13:13:51,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 618 places, 670 transitions, 2269 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-01-19 13:13:51,373 INFO L242 Difference]: Finished difference. Result has 621 places, 625 transitions, 1946 flow [2022-01-19 13:13:51,374 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=1903, PETRI_DIFFERENCE_MINUEND_PLACES=612, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=625, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=610, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1946, PETRI_PLACES=621, PETRI_TRANSITIONS=625} [2022-01-19 13:13:51,374 INFO L334 CegarLoopForPetriNet]: 527 programPoint places, 94 predicate places. [2022-01-19 13:13:51,374 INFO L470 AbstractCegarLoop]: Abstraction has has 621 places, 625 transitions, 1946 flow [2022-01-19 13:13:51,374 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 517.2) internal successors, (2586), 5 states have internal predecessors, (2586), 0 states have call successors, (0), 0 states have 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:13:51,374 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:13:51,375 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:51,375 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-19 13:13:51,375 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 13:13:51,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:13:51,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1195017717, now seen corresponding path program 3 times [2022-01-19 13:13:51,375 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:13:51,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706252716] [2022-01-19 13:13:51,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:13:51,375 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:13:51,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:13:51,430 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-01-19 13:13:51,430 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:13:51,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706252716] [2022-01-19 13:13:51,430 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706252716] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:13:51,430 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:13:51,430 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-19 13:13:51,430 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091100777] [2022-01-19 13:13:51,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:13:51,431 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-19 13:13:51,431 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:13:51,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-19 13:13:51,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-19 13:13:51,433 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 514 out of 596 [2022-01-19 13:13:51,434 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 621 places, 625 transitions, 1946 flow. Second operand has 5 states, 5 states have (on average 518.8) internal successors, (2594), 5 states have internal predecessors, (2594), 0 states have call successors, (0), 0 states have 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:13:51,434 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:13:51,434 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 514 of 596 [2022-01-19 13:13:51,434 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:13:52,165 INFO L129 PetriNetUnfolder]: 611/4816 cut-off events. [2022-01-19 13:13:52,165 INFO L130 PetriNetUnfolder]: For 3622/4354 co-relation queries the response was YES. [2022-01-19 13:13:52,198 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8020 conditions, 4816 events. 611/4816 cut-off events. For 3622/4354 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 41166 event pairs, 234 based on Foata normal form. 84/4691 useless extension candidates. Maximal degree in co-relation 7974. Up to 655 conditions per place. [2022-01-19 13:13:52,206 INFO L132 encePairwiseOnDemand]: 573/596 looper letters, 71 selfloop transitions, 18 changer transitions 17/668 dead transitions. [2022-01-19 13:13:52,207 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 624 places, 668 transitions, 2406 flow [2022-01-19 13:13:52,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 13:13:52,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 13:13:52,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 3695 transitions. [2022-01-19 13:13:52,209 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8856663470757431 [2022-01-19 13:13:52,209 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 3695 transitions. [2022-01-19 13:13:52,209 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 3695 transitions. [2022-01-19 13:13:52,210 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:13:52,210 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 3695 transitions. [2022-01-19 13:13:52,212 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 527.8571428571429) internal successors, (3695), 7 states have internal predecessors, (3695), 0 states have call successors, (0), 0 states have 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:13:52,214 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 596.0) internal successors, (4768), 8 states have internal predecessors, (4768), 0 states have call successors, (0), 0 states have 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:13:52,214 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 596.0) internal successors, (4768), 8 states have internal predecessors, (4768), 0 states have call successors, (0), 0 states have 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:13:52,214 INFO L186 Difference]: Start difference. First operand has 621 places, 625 transitions, 1946 flow. Second operand 7 states and 3695 transitions. [2022-01-19 13:13:52,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 624 places, 668 transitions, 2406 flow [2022-01-19 13:13:52,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 622 places, 668 transitions, 2400 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-01-19 13:13:52,233 INFO L242 Difference]: Finished difference. Result has 627 places, 632 transitions, 2060 flow [2022-01-19 13:13:52,234 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=1942, PETRI_DIFFERENCE_MINUEND_PLACES=616, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=625, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=607, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2060, PETRI_PLACES=627, PETRI_TRANSITIONS=632} [2022-01-19 13:13:52,234 INFO L334 CegarLoopForPetriNet]: 527 programPoint places, 100 predicate places. [2022-01-19 13:13:52,234 INFO L470 AbstractCegarLoop]: Abstraction has has 627 places, 632 transitions, 2060 flow [2022-01-19 13:13:52,234 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 518.8) internal successors, (2594), 5 states have internal predecessors, (2594), 0 states have call successors, (0), 0 states have 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:13:52,235 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:13:52,235 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:52,235 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-19 13:13:52,235 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 13:13:52,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:13:52,235 INFO L85 PathProgramCache]: Analyzing trace with hash -266538759, now seen corresponding path program 4 times [2022-01-19 13:13:52,235 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:13:52,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933463250] [2022-01-19 13:13:52,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:13:52,235 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:13:52,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:13:52,285 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-01-19 13:13:52,285 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:13:52,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933463250] [2022-01-19 13:13:52,285 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933463250] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:13:52,285 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:13:52,285 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-19 13:13:52,285 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784965408] [2022-01-19 13:13:52,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:13:52,286 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-19 13:13:52,286 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:13:52,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-19 13:13:52,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-19 13:13:52,288 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 512 out of 596 [2022-01-19 13:13:52,288 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 627 places, 632 transitions, 2060 flow. Second operand has 5 states, 5 states have (on average 517.2) internal successors, (2586), 5 states have internal predecessors, (2586), 0 states have call successors, (0), 0 states have 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:13:52,288 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:13:52,289 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 512 of 596 [2022-01-19 13:13:52,289 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:13:53,072 INFO L129 PetriNetUnfolder]: 641/5341 cut-off events. [2022-01-19 13:13:53,073 INFO L130 PetriNetUnfolder]: For 3913/4253 co-relation queries the response was YES. [2022-01-19 13:13:53,109 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9040 conditions, 5341 events. 641/5341 cut-off events. For 3913/4253 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 47623 event pairs, 218 based on Foata normal form. 25/5105 useless extension candidates. Maximal degree in co-relation 8991. Up to 645 conditions per place. [2022-01-19 13:13:53,118 INFO L132 encePairwiseOnDemand]: 581/596 looper letters, 66 selfloop transitions, 14 changer transitions 18/655 dead transitions. [2022-01-19 13:13:53,118 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 633 places, 655 transitions, 2396 flow [2022-01-19 13:13:53,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 13:13:53,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 13:13:53,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 3665 transitions. [2022-01-19 13:13:53,120 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8784755512943433 [2022-01-19 13:13:53,120 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 3665 transitions. [2022-01-19 13:13:53,120 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 3665 transitions. [2022-01-19 13:13:53,121 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:13:53,121 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 3665 transitions. [2022-01-19 13:13:53,123 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 523.5714285714286) internal successors, (3665), 7 states have internal predecessors, (3665), 0 states have call successors, (0), 0 states have 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:13:53,125 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 596.0) internal successors, (4768), 8 states have internal predecessors, (4768), 0 states have call successors, (0), 0 states have 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:13:53,125 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 596.0) internal successors, (4768), 8 states have internal predecessors, (4768), 0 states have call successors, (0), 0 states have 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:13:53,125 INFO L186 Difference]: Start difference. First operand has 627 places, 632 transitions, 2060 flow. Second operand 7 states and 3665 transitions. [2022-01-19 13:13:53,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 633 places, 655 transitions, 2396 flow [2022-01-19 13:13:53,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 630 places, 655 transitions, 2372 flow, removed 5 selfloop flow, removed 3 redundant places. [2022-01-19 13:13:53,148 INFO L242 Difference]: Finished difference. Result has 632 places, 627 transitions, 2017 flow [2022-01-19 13:13:53,148 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=2038, PETRI_DIFFERENCE_MINUEND_PLACES=624, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=632, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=620, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2017, PETRI_PLACES=632, PETRI_TRANSITIONS=627} [2022-01-19 13:13:53,149 INFO L334 CegarLoopForPetriNet]: 527 programPoint places, 105 predicate places. [2022-01-19 13:13:53,149 INFO L470 AbstractCegarLoop]: Abstraction has has 632 places, 627 transitions, 2017 flow [2022-01-19 13:13:53,149 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 517.2) internal successors, (2586), 5 states have internal predecessors, (2586), 0 states have call successors, (0), 0 states have 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:13:53,149 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:13:53,149 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:53,149 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-19 13:13:53,149 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 13:13:53,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:13:53,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1985383172, now seen corresponding path program 1 times [2022-01-19 13:13:53,150 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:13:53,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147722464] [2022-01-19 13:13:53,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:13:53,150 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:13:53,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:13:53,204 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-01-19 13:13:53,204 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:13:53,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147722464] [2022-01-19 13:13:53,204 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147722464] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:13:53,204 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:13:53,204 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-19 13:13:53,204 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125350734] [2022-01-19 13:13:53,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:13:53,205 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-19 13:13:53,205 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:13:53,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-19 13:13:53,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-19 13:13:53,207 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 514 out of 596 [2022-01-19 13:13:53,207 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 632 places, 627 transitions, 2017 flow. Second operand has 5 states, 5 states have (on average 519.0) internal successors, (2595), 5 states have internal predecessors, (2595), 0 states have call successors, (0), 0 states have 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:13:53,207 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:13:53,207 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 514 of 596 [2022-01-19 13:13:53,208 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:13:53,944 INFO L129 PetriNetUnfolder]: 788/4876 cut-off events. [2022-01-19 13:13:53,944 INFO L130 PetriNetUnfolder]: For 3809/3810 co-relation queries the response was YES. [2022-01-19 13:13:53,974 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8235 conditions, 4876 events. 788/4876 cut-off events. For 3809/3810 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 43528 event pairs, 87 based on Foata normal form. 33/4521 useless extension candidates. Maximal degree in co-relation 8186. Up to 728 conditions per place. [2022-01-19 13:13:53,982 INFO L132 encePairwiseOnDemand]: 586/596 looper letters, 72 selfloop transitions, 12 changer transitions 6/635 dead transitions. [2022-01-19 13:13:53,982 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 632 places, 635 transitions, 2194 flow [2022-01-19 13:13:53,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-19 13:13:53,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-01-19 13:13:53,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3161 transitions. [2022-01-19 13:13:53,984 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8839485458612976 [2022-01-19 13:13:53,984 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 3161 transitions. [2022-01-19 13:13:53,984 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 3161 transitions. [2022-01-19 13:13:53,985 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:13:53,985 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 3161 transitions. [2022-01-19 13:13:53,986 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 526.8333333333334) internal successors, (3161), 6 states have internal predecessors, (3161), 0 states have call successors, (0), 0 states have 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:13:53,988 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 596.0) internal successors, (4172), 7 states have internal predecessors, (4172), 0 states have call successors, (0), 0 states have 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:13:53,988 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 596.0) internal successors, (4172), 7 states have internal predecessors, (4172), 0 states have call successors, (0), 0 states have 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:13:53,988 INFO L186 Difference]: Start difference. First operand has 632 places, 627 transitions, 2017 flow. Second operand 6 states and 3161 transitions. [2022-01-19 13:13:53,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 632 places, 635 transitions, 2194 flow [2022-01-19 13:13:53,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 620 places, 635 transitions, 2070 flow, removed 25 selfloop flow, removed 12 redundant places. [2022-01-19 13:13:54,004 INFO L242 Difference]: Finished difference. Result has 620 places, 612 transitions, 1819 flow [2022-01-19 13:13:54,005 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=1795, PETRI_DIFFERENCE_MINUEND_PLACES=615, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=612, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=600, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1819, PETRI_PLACES=620, PETRI_TRANSITIONS=612} [2022-01-19 13:13:54,005 INFO L334 CegarLoopForPetriNet]: 527 programPoint places, 93 predicate places. [2022-01-19 13:13:54,005 INFO L470 AbstractCegarLoop]: Abstraction has has 620 places, 612 transitions, 1819 flow [2022-01-19 13:13:54,005 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 519.0) internal successors, (2595), 5 states have internal predecessors, (2595), 0 states have call successors, (0), 0 states have 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:13:54,005 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:13:54,005 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:54,005 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-01-19 13:13:54,006 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 13:13:54,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:13:54,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1106359420, now seen corresponding path program 2 times [2022-01-19 13:13:54,006 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:13:54,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550930522] [2022-01-19 13:13:54,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:13:54,006 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:13:54,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:13:54,058 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-01-19 13:13:54,058 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:13:54,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550930522] [2022-01-19 13:13:54,058 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550930522] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:13:54,058 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:13:54,058 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-19 13:13:54,058 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113222154] [2022-01-19 13:13:54,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:13:54,059 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-19 13:13:54,059 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:13:54,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-19 13:13:54,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-19 13:13:54,060 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 514 out of 596 [2022-01-19 13:13:54,061 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 620 places, 612 transitions, 1819 flow. Second operand has 5 states, 5 states have (on average 519.0) internal successors, (2595), 5 states have internal predecessors, (2595), 0 states have call successors, (0), 0 states have 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:13:54,061 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:13:54,061 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 514 of 596 [2022-01-19 13:13:54,061 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:13:54,895 INFO L129 PetriNetUnfolder]: 823/5387 cut-off events. [2022-01-19 13:13:54,895 INFO L130 PetriNetUnfolder]: For 1445/1445 co-relation queries the response was YES. [2022-01-19 13:13:54,926 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8260 conditions, 5387 events. 823/5387 cut-off events. For 1445/1445 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 48586 event pairs, 207 based on Foata normal form. 2/4972 useless extension candidates. Maximal degree in co-relation 8217. Up to 780 conditions per place. [2022-01-19 13:13:54,935 INFO L132 encePairwiseOnDemand]: 577/596 looper letters, 65 selfloop transitions, 19 changer transitions 11/640 dead transitions. [2022-01-19 13:13:54,935 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 626 places, 640 transitions, 2125 flow [2022-01-19 13:13:54,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 13:13:54,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 13:13:54,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 3684 transitions. [2022-01-19 13:13:54,938 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8830297219558965 [2022-01-19 13:13:54,938 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 3684 transitions. [2022-01-19 13:13:54,938 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 3684 transitions. [2022-01-19 13:13:54,938 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:13:54,938 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 3684 transitions. [2022-01-19 13:13:54,940 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 526.2857142857143) internal successors, (3684), 7 states have internal predecessors, (3684), 0 states have call successors, (0), 0 states have 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:13:54,942 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 596.0) internal successors, (4768), 8 states have internal predecessors, (4768), 0 states have call successors, (0), 0 states have 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:13:54,943 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 596.0) internal successors, (4768), 8 states have internal predecessors, (4768), 0 states have call successors, (0), 0 states have 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:13:54,943 INFO L186 Difference]: Start difference. First operand has 620 places, 612 transitions, 1819 flow. Second operand 7 states and 3684 transitions. [2022-01-19 13:13:54,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 626 places, 640 transitions, 2125 flow [2022-01-19 13:13:54,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 621 places, 640 transitions, 2101 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-01-19 13:13:54,957 INFO L242 Difference]: Finished difference. Result has 622 places, 611 transitions, 1824 flow [2022-01-19 13:13:54,958 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=1795, PETRI_DIFFERENCE_MINUEND_PLACES=615, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=612, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=593, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1824, PETRI_PLACES=622, PETRI_TRANSITIONS=611} [2022-01-19 13:13:54,958 INFO L334 CegarLoopForPetriNet]: 527 programPoint places, 95 predicate places. [2022-01-19 13:13:54,958 INFO L470 AbstractCegarLoop]: Abstraction has has 622 places, 611 transitions, 1824 flow [2022-01-19 13:13:54,958 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 519.0) internal successors, (2595), 5 states have internal predecessors, (2595), 0 states have call successors, (0), 0 states have 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:13:54,958 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:13:54,959 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:54,959 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-01-19 13:13:54,959 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 13:13:54,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:13:54,959 INFO L85 PathProgramCache]: Analyzing trace with hash 2127604216, now seen corresponding path program 3 times [2022-01-19 13:13:54,959 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:13:54,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074645999] [2022-01-19 13:13:54,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:13:54,959 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:13:54,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:13:55,010 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-01-19 13:13:55,010 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:13:55,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074645999] [2022-01-19 13:13:55,010 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074645999] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:13:55,010 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:13:55,011 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-19 13:13:55,011 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424603720] [2022-01-19 13:13:55,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:13:55,011 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-19 13:13:55,011 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:13:55,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-19 13:13:55,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-19 13:13:55,013 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 514 out of 596 [2022-01-19 13:13:55,014 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 622 places, 611 transitions, 1824 flow. Second operand has 5 states, 5 states have (on average 519.0) internal successors, (2595), 5 states have internal predecessors, (2595), 0 states have call successors, (0), 0 states have 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:13:55,014 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:13:55,015 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 514 of 596 [2022-01-19 13:13:55,015 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:13:55,734 INFO L129 PetriNetUnfolder]: 748/4823 cut-off events. [2022-01-19 13:13:55,734 INFO L130 PetriNetUnfolder]: For 1631/1631 co-relation queries the response was YES. [2022-01-19 13:13:55,769 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7617 conditions, 4823 events. 748/4823 cut-off events. For 1631/1631 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 41905 event pairs, 221 based on Foata normal form. 2/4437 useless extension candidates. Maximal degree in co-relation 7574. Up to 717 conditions per place. [2022-01-19 13:13:55,779 INFO L132 encePairwiseOnDemand]: 579/596 looper letters, 55 selfloop transitions, 14 changer transitions 21/630 dead transitions. [2022-01-19 13:13:55,779 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 628 places, 630 transitions, 2068 flow [2022-01-19 13:13:55,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 13:13:55,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 13:13:55,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 3675 transitions. [2022-01-19 13:13:55,781 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8808724832214765 [2022-01-19 13:13:55,781 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 3675 transitions. [2022-01-19 13:13:55,781 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 3675 transitions. [2022-01-19 13:13:55,782 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:13:55,782 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 3675 transitions. [2022-01-19 13:13:55,784 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 525.0) internal successors, (3675), 7 states have internal predecessors, (3675), 0 states have call successors, (0), 0 states have 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:13:55,786 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 596.0) internal successors, (4768), 8 states have internal predecessors, (4768), 0 states have call successors, (0), 0 states have 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:13:55,786 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 596.0) internal successors, (4768), 8 states have internal predecessors, (4768), 0 states have call successors, (0), 0 states have 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:13:55,786 INFO L186 Difference]: Start difference. First operand has 622 places, 611 transitions, 1824 flow. Second operand 7 states and 3675 transitions. [2022-01-19 13:13:55,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 628 places, 630 transitions, 2068 flow [2022-01-19 13:13:55,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 622 places, 630 transitions, 2039 flow, removed 2 selfloop flow, removed 6 redundant places. [2022-01-19 13:13:55,802 INFO L242 Difference]: Finished difference. Result has 622 places, 601 transitions, 1754 flow [2022-01-19 13:13:55,802 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=1789, PETRI_DIFFERENCE_MINUEND_PLACES=616, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=610, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=596, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1754, PETRI_PLACES=622, PETRI_TRANSITIONS=601} [2022-01-19 13:13:55,803 INFO L334 CegarLoopForPetriNet]: 527 programPoint places, 95 predicate places. [2022-01-19 13:13:55,803 INFO L470 AbstractCegarLoop]: Abstraction has has 622 places, 601 transitions, 1754 flow [2022-01-19 13:13:55,803 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 519.0) internal successors, (2595), 5 states have internal predecessors, (2595), 0 states have call successors, (0), 0 states have 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:13:55,803 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:13:55,803 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:55,804 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-01-19 13:13:55,804 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 13:13:55,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:13:55,804 INFO L85 PathProgramCache]: Analyzing trace with hash 134093937, now seen corresponding path program 1 times [2022-01-19 13:13:55,804 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:13:55,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783728647] [2022-01-19 13:13:55,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:13:55,804 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:13:55,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:13:55,863 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-01-19 13:13:55,864 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:13:55,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783728647] [2022-01-19 13:13:55,864 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783728647] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:13:55,864 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:13:55,864 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-19 13:13:55,864 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313854859] [2022-01-19 13:13:55,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:13:55,864 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-19 13:13:55,864 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:13:55,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-19 13:13:55,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-19 13:13:55,869 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 512 out of 596 [2022-01-19 13:13:55,870 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 622 places, 601 transitions, 1754 flow. Second operand has 5 states, 5 states have (on average 517.4) internal successors, (2587), 5 states have internal predecessors, (2587), 0 states have call successors, (0), 0 states have 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:13:55,870 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:13:55,870 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 512 of 596 [2022-01-19 13:13:55,870 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:13:56,420 INFO L129 PetriNetUnfolder]: 499/3326 cut-off events. [2022-01-19 13:13:56,420 INFO L130 PetriNetUnfolder]: For 1856/1969 co-relation queries the response was YES. [2022-01-19 13:13:56,447 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5677 conditions, 3326 events. 499/3326 cut-off events. For 1856/1969 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 24933 event pairs, 229 based on Foata normal form. 7/3180 useless extension candidates. Maximal degree in co-relation 5637. Up to 531 conditions per place. [2022-01-19 13:13:56,454 INFO L132 encePairwiseOnDemand]: 580/596 looper letters, 67 selfloop transitions, 14 changer transitions 14/626 dead transitions. [2022-01-19 13:13:56,454 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 619 places, 626 transitions, 2063 flow [2022-01-19 13:13:56,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 13:13:56,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 13:13:56,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 3669 transitions. [2022-01-19 13:13:56,457 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8794343240651965 [2022-01-19 13:13:56,457 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 3669 transitions. [2022-01-19 13:13:56,457 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 3669 transitions. [2022-01-19 13:13:56,457 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:13:56,457 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 3669 transitions. [2022-01-19 13:13:56,459 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 524.1428571428571) internal successors, (3669), 7 states have internal predecessors, (3669), 0 states have call successors, (0), 0 states have 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:13:56,461 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 596.0) internal successors, (4768), 8 states have internal predecessors, (4768), 0 states have call successors, (0), 0 states have 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:13:56,461 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 596.0) internal successors, (4768), 8 states have internal predecessors, (4768), 0 states have call successors, (0), 0 states have 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:13:56,461 INFO L186 Difference]: Start difference. First operand has 622 places, 601 transitions, 1754 flow. Second operand 7 states and 3669 transitions. [2022-01-19 13:13:56,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 619 places, 626 transitions, 2063 flow [2022-01-19 13:13:56,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 603 places, 626 transitions, 1950 flow, removed 14 selfloop flow, removed 16 redundant places. [2022-01-19 13:13:56,477 INFO L242 Difference]: Finished difference. Result has 604 places, 593 transitions, 1656 flow [2022-01-19 13:13:56,478 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=1667, PETRI_DIFFERENCE_MINUEND_PLACES=597, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=599, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=585, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1656, PETRI_PLACES=604, PETRI_TRANSITIONS=593} [2022-01-19 13:13:56,478 INFO L334 CegarLoopForPetriNet]: 527 programPoint places, 77 predicate places. [2022-01-19 13:13:56,478 INFO L470 AbstractCegarLoop]: Abstraction has has 604 places, 593 transitions, 1656 flow [2022-01-19 13:13:56,478 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 517.4) internal successors, (2587), 5 states have internal predecessors, (2587), 0 states have call successors, (0), 0 states have 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:13:56,478 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:13:56,479 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:56,479 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-01-19 13:13:56,479 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 13:13:56,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:13:56,479 INFO L85 PathProgramCache]: Analyzing trace with hash -70398850, now seen corresponding path program 1 times [2022-01-19 13:13:56,479 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:13:56,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052996288] [2022-01-19 13:13:56,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:13:56,479 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:13:56,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:13:56,643 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-01-19 13:13:56,643 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:13:56,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052996288] [2022-01-19 13:13:56,643 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052996288] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:13:56,643 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:13:56,643 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-01-19 13:13:56,643 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986307032] [2022-01-19 13:13:56,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:13:56,644 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-19 13:13:56,644 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:13:56,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-19 13:13:56,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2022-01-19 13:13:56,648 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 480 out of 596 [2022-01-19 13:13:56,651 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 604 places, 593 transitions, 1656 flow. Second operand has 19 states, 19 states have (on average 482.42105263157896) internal successors, (9166), 19 states have internal predecessors, (9166), 0 states have call successors, (0), 0 states have 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:13:56,651 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:13:56,651 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 480 of 596 [2022-01-19 13:13:56,651 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:14:00,779 INFO L129 PetriNetUnfolder]: 3263/15475 cut-off events. [2022-01-19 13:14:00,780 INFO L130 PetriNetUnfolder]: For 562/563 co-relation queries the response was YES. [2022-01-19 13:14:00,835 INFO L84 FinitePrefix]: Finished finitePrefix Result has 23493 conditions, 15475 events. 3263/15475 cut-off events. For 562/563 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 165344 event pairs, 1461 based on Foata normal form. 0/14358 useless extension candidates. Maximal degree in co-relation 23463. Up to 3100 conditions per place. [2022-01-19 13:14:00,861 INFO L132 encePairwiseOnDemand]: 570/596 looper letters, 491 selfloop transitions, 91 changer transitions 3/1092 dead transitions. [2022-01-19 13:14:00,861 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 653 places, 1092 transitions, 3969 flow [2022-01-19 13:14:00,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-01-19 13:14:00,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2022-01-19 13:14:00,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 29387 transitions. [2022-01-19 13:14:00,875 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8217841163310962 [2022-01-19 13:14:00,875 INFO L72 ComplementDD]: Start complementDD. Operand 60 states and 29387 transitions. [2022-01-19 13:14:00,876 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 29387 transitions. [2022-01-19 13:14:00,879 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:14:00,880 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 60 states and 29387 transitions. [2022-01-19 13:14:00,896 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 61 states, 60 states have (on average 489.78333333333336) internal successors, (29387), 60 states have internal predecessors, (29387), 0 states have call successors, (0), 0 states have 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:14:00,915 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 61 states, 61 states have (on average 596.0) internal successors, (36356), 61 states have internal predecessors, (36356), 0 states have call successors, (0), 0 states have 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:14:00,921 INFO L81 ComplementDD]: Finished complementDD. Result has 61 states, 61 states have (on average 596.0) internal successors, (36356), 61 states have internal predecessors, (36356), 0 states have call successors, (0), 0 states have 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:14:00,921 INFO L186 Difference]: Start difference. First operand has 604 places, 593 transitions, 1656 flow. Second operand 60 states and 29387 transitions. [2022-01-19 13:14:00,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 653 places, 1092 transitions, 3969 flow [2022-01-19 13:14:00,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 640 places, 1092 transitions, 3805 flow, removed 67 selfloop flow, removed 13 redundant places. [2022-01-19 13:14:00,944 INFO L242 Difference]: Finished difference. Result has 686 places, 672 transitions, 2202 flow [2022-01-19 13:14:00,945 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=1612, PETRI_DIFFERENCE_MINUEND_PLACES=581, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=593, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=570, PETRI_DIFFERENCE_SUBTRAHEND_STATES=60, PETRI_FLOW=2202, PETRI_PLACES=686, PETRI_TRANSITIONS=672} [2022-01-19 13:14:00,945 INFO L334 CegarLoopForPetriNet]: 527 programPoint places, 159 predicate places. [2022-01-19 13:14:00,945 INFO L470 AbstractCegarLoop]: Abstraction has has 686 places, 672 transitions, 2202 flow [2022-01-19 13:14:00,946 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 482.42105263157896) internal successors, (9166), 19 states have internal predecessors, (9166), 0 states have call successors, (0), 0 states have 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:14:00,946 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:14:00,947 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:00,947 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-01-19 13:14:00,947 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 13:14:00,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:14:00,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1998660648, now seen corresponding path program 2 times [2022-01-19 13:14:00,948 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:14:00,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397196274] [2022-01-19 13:14:00,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:14:00,948 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:14:00,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:14:01,128 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-01-19 13:14:01,128 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:14:01,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397196274] [2022-01-19 13:14:01,128 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397196274] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:14:01,128 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:14:01,128 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-01-19 13:14:01,128 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183019432] [2022-01-19 13:14:01,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:14:01,129 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-19 13:14:01,129 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:14:01,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-19 13:14:01,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2022-01-19 13:14:01,133 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 480 out of 596 [2022-01-19 13:14:01,136 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 686 places, 672 transitions, 2202 flow. Second operand has 19 states, 19 states have (on average 482.42105263157896) internal successors, (9166), 19 states have internal predecessors, (9166), 0 states have call successors, (0), 0 states have 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:14:01,136 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:14:01,136 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 480 of 596 [2022-01-19 13:14:01,136 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:14:05,750 INFO L129 PetriNetUnfolder]: 3218/15196 cut-off events. [2022-01-19 13:14:05,750 INFO L130 PetriNetUnfolder]: For 5614/5614 co-relation queries the response was YES. [2022-01-19 13:14:05,848 INFO L84 FinitePrefix]: Finished finitePrefix Result has 26781 conditions, 15196 events. 3218/15196 cut-off events. For 5614/5614 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 161258 event pairs, 1461 based on Foata normal form. 2/13998 useless extension candidates. Maximal degree in co-relation 26713. Up to 3079 conditions per place. [2022-01-19 13:14:05,877 INFO L132 encePairwiseOnDemand]: 570/596 looper letters, 516 selfloop transitions, 138 changer transitions 3/1164 dead transitions. [2022-01-19 13:14:05,877 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 745 places, 1164 transitions, 5231 flow [2022-01-19 13:14:05,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-01-19 13:14:05,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2022-01-19 13:14:05,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 29379 transitions. [2022-01-19 13:14:05,897 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8215604026845638 [2022-01-19 13:14:05,897 INFO L72 ComplementDD]: Start complementDD. Operand 60 states and 29379 transitions. [2022-01-19 13:14:05,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 29379 transitions. [2022-01-19 13:14:05,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:14:05,902 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 60 states and 29379 transitions. [2022-01-19 13:14:05,926 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 61 states, 60 states have (on average 489.65) internal successors, (29379), 60 states have internal predecessors, (29379), 0 states have call successors, (0), 0 states have 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:14:05,948 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 61 states, 61 states have (on average 596.0) internal successors, (36356), 61 states have internal predecessors, (36356), 0 states have call successors, (0), 0 states have 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:14:05,954 INFO L81 ComplementDD]: Finished complementDD. Result has 61 states, 61 states have (on average 596.0) internal successors, (36356), 61 states have internal predecessors, (36356), 0 states have call successors, (0), 0 states have 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:14:05,954 INFO L186 Difference]: Start difference. First operand has 686 places, 672 transitions, 2202 flow. Second operand 60 states and 29379 transitions. [2022-01-19 13:14:05,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 745 places, 1164 transitions, 5231 flow [2022-01-19 13:14:05,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 734 places, 1164 transitions, 4847 flow, removed 6 selfloop flow, removed 11 redundant places. [2022-01-19 13:14:06,009 INFO L242 Difference]: Finished difference. Result has 780 places, 752 transitions, 3146 flow [2022-01-19 13:14:06,010 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=2122, PETRI_DIFFERENCE_MINUEND_PLACES=675, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=672, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=603, PETRI_DIFFERENCE_SUBTRAHEND_STATES=60, PETRI_FLOW=3146, PETRI_PLACES=780, PETRI_TRANSITIONS=752} [2022-01-19 13:14:06,011 INFO L334 CegarLoopForPetriNet]: 527 programPoint places, 253 predicate places. [2022-01-19 13:14:06,011 INFO L470 AbstractCegarLoop]: Abstraction has has 780 places, 752 transitions, 3146 flow [2022-01-19 13:14:06,012 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 482.42105263157896) internal successors, (9166), 19 states have internal predecessors, (9166), 0 states have call successors, (0), 0 states have 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:14:06,012 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:14:06,012 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:06,012 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-01-19 13:14:06,012 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 13:14:06,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:14:06,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1909265420, now seen corresponding path program 3 times [2022-01-19 13:14:06,013 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:14:06,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588798406] [2022-01-19 13:14:06,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:14:06,013 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:14:06,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:14:06,202 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-01-19 13:14:06,202 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:14:06,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588798406] [2022-01-19 13:14:06,202 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588798406] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:14:06,203 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:14:06,203 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-01-19 13:14:06,203 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145346642] [2022-01-19 13:14:06,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:14:06,203 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-19 13:14:06,203 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:14:06,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-19 13:14:06,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2022-01-19 13:14:06,208 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 480 out of 596 [2022-01-19 13:14:06,212 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 780 places, 752 transitions, 3146 flow. Second operand has 19 states, 19 states have (on average 482.42105263157896) internal successors, (9166), 19 states have internal predecessors, (9166), 0 states have call successors, (0), 0 states have 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:14:06,212 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:14:06,212 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 480 of 596 [2022-01-19 13:14:06,212 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:14:11,404 INFO L129 PetriNetUnfolder]: 3399/15884 cut-off events. [2022-01-19 13:14:11,404 INFO L130 PetriNetUnfolder]: For 17069/17069 co-relation queries the response was YES. [2022-01-19 13:14:11,554 INFO L84 FinitePrefix]: Finished finitePrefix Result has 31400 conditions, 15884 events. 3399/15884 cut-off events. For 17069/17069 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 171499 event pairs, 1434 based on Foata normal form. 2/14548 useless extension candidates. Maximal degree in co-relation 31286. Up to 3100 conditions per place. [2022-01-19 13:14:11,588 INFO L132 encePairwiseOnDemand]: 570/596 looper letters, 510 selfloop transitions, 167 changer transitions 3/1187 dead transitions. [2022-01-19 13:14:11,588 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 837 places, 1187 transitions, 7532 flow [2022-01-19 13:14:11,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-01-19 13:14:11,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2022-01-19 13:14:11,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 28365 transitions. [2022-01-19 13:14:11,601 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8205565841240453 [2022-01-19 13:14:11,602 INFO L72 ComplementDD]: Start complementDD. Operand 58 states and 28365 transitions. [2022-01-19 13:14:11,602 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 28365 transitions. [2022-01-19 13:14:11,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:14:11,606 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 58 states and 28365 transitions. [2022-01-19 13:14:11,622 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 59 states, 58 states have (on average 489.05172413793105) internal successors, (28365), 58 states have internal predecessors, (28365), 0 states have call successors, (0), 0 states have 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:14:11,640 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 59 states, 59 states have (on average 596.0) internal successors, (35164), 59 states have internal predecessors, (35164), 0 states have call successors, (0), 0 states have 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:14:11,646 INFO L81 ComplementDD]: Finished complementDD. Result has 59 states, 59 states have (on average 596.0) internal successors, (35164), 59 states have internal predecessors, (35164), 0 states have call successors, (0), 0 states have 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:14:11,646 INFO L186 Difference]: Start difference. First operand has 780 places, 752 transitions, 3146 flow. Second operand 58 states and 28365 transitions. [2022-01-19 13:14:11,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 837 places, 1187 transitions, 7532 flow [2022-01-19 13:14:11,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 826 places, 1187 transitions, 6793 flow, removed 140 selfloop flow, removed 11 redundant places. [2022-01-19 13:14:11,731 INFO L242 Difference]: Finished difference. Result has 870 places, 829 transitions, 4191 flow [2022-01-19 13:14:11,732 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=2722, PETRI_DIFFERENCE_MINUEND_PLACES=769, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=752, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=90, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=650, PETRI_DIFFERENCE_SUBTRAHEND_STATES=58, PETRI_FLOW=4191, PETRI_PLACES=870, PETRI_TRANSITIONS=829} [2022-01-19 13:14:11,732 INFO L334 CegarLoopForPetriNet]: 527 programPoint places, 343 predicate places. [2022-01-19 13:14:11,732 INFO L470 AbstractCegarLoop]: Abstraction has has 870 places, 829 transitions, 4191 flow [2022-01-19 13:14:11,733 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 482.42105263157896) internal successors, (9166), 19 states have internal predecessors, (9166), 0 states have call successors, (0), 0 states have 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:14:11,733 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:14:11,733 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:11,733 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-01-19 13:14:11,733 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 13:14:11,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:14:11,734 INFO L85 PathProgramCache]: Analyzing trace with hash -2003560772, now seen corresponding path program 4 times [2022-01-19 13:14:11,734 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:14:11,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607731496] [2022-01-19 13:14:11,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:14:11,734 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:14:11,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:14:11,902 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-01-19 13:14:11,902 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:14:11,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607731496] [2022-01-19 13:14:11,902 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607731496] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:14:11,902 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:14:11,902 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-01-19 13:14:11,902 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430893312] [2022-01-19 13:14:11,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:14:11,903 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-19 13:14:11,903 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:14:11,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-19 13:14:11,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2022-01-19 13:14:11,907 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 480 out of 596 [2022-01-19 13:14:11,909 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 870 places, 829 transitions, 4191 flow. Second operand has 19 states, 19 states have (on average 482.42105263157896) internal successors, (9166), 19 states have internal predecessors, (9166), 0 states have call successors, (0), 0 states have 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:14:11,909 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:14:11,909 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 480 of 596 [2022-01-19 13:14:11,910 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:14:17,749 INFO L129 PetriNetUnfolder]: 3456/16318 cut-off events. [2022-01-19 13:14:17,749 INFO L130 PetriNetUnfolder]: For 37279/37279 co-relation queries the response was YES. [2022-01-19 13:14:17,929 INFO L84 FinitePrefix]: Finished finitePrefix Result has 36434 conditions, 16318 events. 3456/16318 cut-off events. For 37279/37279 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 176424 event pairs, 1474 based on Foata normal form. 2/15094 useless extension candidates. Maximal degree in co-relation 36276. Up to 3079 conditions per place. [2022-01-19 13:14:17,960 INFO L132 encePairwiseOnDemand]: 570/596 looper letters, 569 selfloop transitions, 206 changer transitions 3/1285 dead transitions. [2022-01-19 13:14:17,960 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 927 places, 1285 transitions, 9487 flow [2022-01-19 13:14:17,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-01-19 13:14:17,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2022-01-19 13:14:17,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 28362 transitions. [2022-01-19 13:14:17,972 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8204697986577181 [2022-01-19 13:14:17,972 INFO L72 ComplementDD]: Start complementDD. Operand 58 states and 28362 transitions. [2022-01-19 13:14:17,972 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 28362 transitions. [2022-01-19 13:14:17,976 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:14:17,976 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 58 states and 28362 transitions. [2022-01-19 13:14:17,991 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 59 states, 58 states have (on average 489.0) internal successors, (28362), 58 states have internal predecessors, (28362), 0 states have call successors, (0), 0 states have 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:14:18,009 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 59 states, 59 states have (on average 596.0) internal successors, (35164), 59 states have internal predecessors, (35164), 0 states have call successors, (0), 0 states have 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:14:18,013 INFO L81 ComplementDD]: Finished complementDD. Result has 59 states, 59 states have (on average 596.0) internal successors, (35164), 59 states have internal predecessors, (35164), 0 states have call successors, (0), 0 states have 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:14:18,013 INFO L186 Difference]: Start difference. First operand has 870 places, 829 transitions, 4191 flow. Second operand 58 states and 28362 transitions. [2022-01-19 13:14:18,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 927 places, 1285 transitions, 9487 flow [2022-01-19 13:14:18,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 922 places, 1285 transitions, 8557 flow, removed 403 selfloop flow, removed 5 redundant places. [2022-01-19 13:14:18,244 INFO L242 Difference]: Finished difference. Result has 966 places, 906 transitions, 5450 flow [2022-01-19 13:14:18,244 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=3551, PETRI_DIFFERENCE_MINUEND_PLACES=865, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=829, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=129, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=688, PETRI_DIFFERENCE_SUBTRAHEND_STATES=58, PETRI_FLOW=5450, PETRI_PLACES=966, PETRI_TRANSITIONS=906} [2022-01-19 13:14:18,245 INFO L334 CegarLoopForPetriNet]: 527 programPoint places, 439 predicate places. [2022-01-19 13:14:18,245 INFO L470 AbstractCegarLoop]: Abstraction has has 966 places, 906 transitions, 5450 flow [2022-01-19 13:14:18,245 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 482.42105263157896) internal successors, (9166), 19 states have internal predecessors, (9166), 0 states have call successors, (0), 0 states have 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:14:18,246 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:14:18,246 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:18,246 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-01-19 13:14:18,246 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 13:14:18,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:14:18,246 INFO L85 PathProgramCache]: Analyzing trace with hash 102389314, now seen corresponding path program 5 times [2022-01-19 13:14:18,246 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:14:18,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290063070] [2022-01-19 13:14:18,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:14:18,246 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:14:18,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:14:18,433 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-01-19 13:14:18,434 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:14:18,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290063070] [2022-01-19 13:14:18,434 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290063070] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:14:18,434 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:14:18,434 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-01-19 13:14:18,434 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030257426] [2022-01-19 13:14:18,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:14:18,434 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-19 13:14:18,434 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:14:18,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-19 13:14:18,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2022-01-19 13:14:18,438 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 480 out of 596 [2022-01-19 13:14:18,441 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 966 places, 906 transitions, 5450 flow. Second operand has 19 states, 19 states have (on average 482.42105263157896) internal successors, (9166), 19 states have internal predecessors, (9166), 0 states have call successors, (0), 0 states have 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:14:18,441 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:14:18,442 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 480 of 596 [2022-01-19 13:14:18,442 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:14:24,952 INFO L129 PetriNetUnfolder]: 3676/17045 cut-off events. [2022-01-19 13:14:24,952 INFO L130 PetriNetUnfolder]: For 66191/66191 co-relation queries the response was YES. [2022-01-19 13:14:25,196 INFO L84 FinitePrefix]: Finished finitePrefix Result has 42224 conditions, 17045 events. 3676/17045 cut-off events. For 66191/66191 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 185542 event pairs, 1553 based on Foata normal form. 2/15691 useless extension candidates. Maximal degree in co-relation 42023. Up to 3100 conditions per place. [2022-01-19 13:14:25,340 INFO L132 encePairwiseOnDemand]: 570/596 looper letters, 629 selfloop transitions, 204 changer transitions 3/1343 dead transitions. [2022-01-19 13:14:25,340 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1023 places, 1343 transitions, 12289 flow [2022-01-19 13:14:25,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-01-19 13:14:25,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2022-01-19 13:14:25,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 28349 transitions. [2022-01-19 13:14:25,352 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8200937283036335 [2022-01-19 13:14:25,352 INFO L72 ComplementDD]: Start complementDD. Operand 58 states and 28349 transitions. [2022-01-19 13:14:25,352 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 28349 transitions. [2022-01-19 13:14:25,355 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:14:25,355 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 58 states and 28349 transitions. [2022-01-19 13:14:25,370 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 59 states, 58 states have (on average 488.7758620689655) internal successors, (28349), 58 states have internal predecessors, (28349), 0 states have call successors, (0), 0 states have 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:14:25,388 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 59 states, 59 states have (on average 596.0) internal successors, (35164), 59 states have internal predecessors, (35164), 0 states have call successors, (0), 0 states have 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:14:25,391 INFO L81 ComplementDD]: Finished complementDD. Result has 59 states, 59 states have (on average 596.0) internal successors, (35164), 59 states have internal predecessors, (35164), 0 states have call successors, (0), 0 states have 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:14:25,392 INFO L186 Difference]: Start difference. First operand has 966 places, 906 transitions, 5450 flow. Second operand 58 states and 28349 transitions. [2022-01-19 13:14:25,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1023 places, 1343 transitions, 12289 flow [2022-01-19 13:14:25,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1018 places, 1343 transitions, 10931 flow, removed 607 selfloop flow, removed 5 redundant places. [2022-01-19 13:14:25,777 INFO L242 Difference]: Finished difference. Result has 1063 places, 984 transitions, 6850 flow [2022-01-19 13:14:25,778 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=4508, PETRI_DIFFERENCE_MINUEND_PLACES=961, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=906, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=127, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=766, PETRI_DIFFERENCE_SUBTRAHEND_STATES=58, PETRI_FLOW=6850, PETRI_PLACES=1063, PETRI_TRANSITIONS=984} [2022-01-19 13:14:25,778 INFO L334 CegarLoopForPetriNet]: 527 programPoint places, 536 predicate places. [2022-01-19 13:14:25,778 INFO L470 AbstractCegarLoop]: Abstraction has has 1063 places, 984 transitions, 6850 flow [2022-01-19 13:14:25,779 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 482.42105263157896) internal successors, (9166), 19 states have internal predecessors, (9166), 0 states have call successors, (0), 0 states have 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:14:25,779 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:14:25,779 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:25,779 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-01-19 13:14:25,779 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 13:14:25,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:14:25,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1378121062, now seen corresponding path program 6 times [2022-01-19 13:14:25,780 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:14:25,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578233704] [2022-01-19 13:14:25,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:14:25,780 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:14:25,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:14:25,939 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-01-19 13:14:25,939 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:14:25,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578233704] [2022-01-19 13:14:25,939 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578233704] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:14:25,939 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:14:25,939 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-01-19 13:14:25,939 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968095760] [2022-01-19 13:14:25,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:14:25,940 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-19 13:14:25,940 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:14:25,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-19 13:14:25,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2022-01-19 13:14:25,944 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 480 out of 596 [2022-01-19 13:14:25,946 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1063 places, 984 transitions, 6850 flow. Second operand has 19 states, 19 states have (on average 482.42105263157896) internal successors, (9166), 19 states have internal predecessors, (9166), 0 states have call successors, (0), 0 states have 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:14:25,946 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:14:25,946 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 480 of 596 [2022-01-19 13:14:25,947 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:14:33,314 INFO L129 PetriNetUnfolder]: 3725/17547 cut-off events. [2022-01-19 13:14:33,315 INFO L130 PetriNetUnfolder]: For 108344/108344 co-relation queries the response was YES. [2022-01-19 13:14:33,614 INFO L84 FinitePrefix]: Finished finitePrefix Result has 48971 conditions, 17547 events. 3725/17547 cut-off events. For 108344/108344 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 192577 event pairs, 1517 based on Foata normal form. 2/16298 useless extension candidates. Maximal degree in co-relation 48726. Up to 3079 conditions per place. [2022-01-19 13:14:33,651 INFO L132 encePairwiseOnDemand]: 570/596 looper letters, 699 selfloop transitions, 235 changer transitions 3/1444 dead transitions. [2022-01-19 13:14:33,651 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1120 places, 1444 transitions, 14804 flow [2022-01-19 13:14:33,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-01-19 13:14:33,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2022-01-19 13:14:33,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 28347 transitions. [2022-01-19 13:14:33,662 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8200358713260819 [2022-01-19 13:14:33,662 INFO L72 ComplementDD]: Start complementDD. Operand 58 states and 28347 transitions. [2022-01-19 13:14:33,662 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 28347 transitions. [2022-01-19 13:14:33,666 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:14:33,666 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 58 states and 28347 transitions. [2022-01-19 13:14:33,682 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 59 states, 58 states have (on average 488.7413793103448) internal successors, (28347), 58 states have internal predecessors, (28347), 0 states have call successors, (0), 0 states have 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:14:33,700 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 59 states, 59 states have (on average 596.0) internal successors, (35164), 59 states have internal predecessors, (35164), 0 states have call successors, (0), 0 states have 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:14:33,704 INFO L81 ComplementDD]: Finished complementDD. Result has 59 states, 59 states have (on average 596.0) internal successors, (35164), 59 states have internal predecessors, (35164), 0 states have call successors, (0), 0 states have 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:14:33,704 INFO L186 Difference]: Start difference. First operand has 1063 places, 984 transitions, 6850 flow. Second operand 58 states and 28347 transitions. [2022-01-19 13:14:33,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1120 places, 1444 transitions, 14804 flow [2022-01-19 13:14:34,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1115 places, 1444 transitions, 13020 flow, removed 820 selfloop flow, removed 5 redundant places. [2022-01-19 13:14:34,511 INFO L242 Difference]: Finished difference. Result has 1160 places, 1062 transitions, 8336 flow [2022-01-19 13:14:34,512 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=5572, PETRI_DIFFERENCE_MINUEND_PLACES=1058, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=984, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=158, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=813, PETRI_DIFFERENCE_SUBTRAHEND_STATES=58, PETRI_FLOW=8336, PETRI_PLACES=1160, PETRI_TRANSITIONS=1062} [2022-01-19 13:14:34,512 INFO L334 CegarLoopForPetriNet]: 527 programPoint places, 633 predicate places. [2022-01-19 13:14:34,512 INFO L470 AbstractCegarLoop]: Abstraction has has 1160 places, 1062 transitions, 8336 flow [2022-01-19 13:14:34,513 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 482.42105263157896) internal successors, (9166), 19 states have internal predecessors, (9166), 0 states have call successors, (0), 0 states have 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:14:34,513 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:14:34,513 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:34,513 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-01-19 13:14:34,513 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 13:14:34,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:14:34,514 INFO L85 PathProgramCache]: Analyzing trace with hash -125973380, now seen corresponding path program 7 times [2022-01-19 13:14:34,514 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:14:34,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815011545] [2022-01-19 13:14:34,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:14:34,514 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:14:34,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:14:34,670 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-01-19 13:14:34,670 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:14:34,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815011545] [2022-01-19 13:14:34,670 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815011545] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:14:34,670 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:14:34,671 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-01-19 13:14:34,671 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120935838] [2022-01-19 13:14:34,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:14:34,671 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-19 13:14:34,671 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:14:34,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-19 13:14:34,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2022-01-19 13:14:34,675 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 480 out of 596 [2022-01-19 13:14:34,677 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1160 places, 1062 transitions, 8336 flow. Second operand has 19 states, 19 states have (on average 482.42105263157896) internal successors, (9166), 19 states have internal predecessors, (9166), 0 states have call successors, (0), 0 states have 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:14:34,677 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:14:34,677 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 480 of 596 [2022-01-19 13:14:34,677 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:14:42,609 INFO L129 PetriNetUnfolder]: 3939/18157 cut-off events. [2022-01-19 13:14:42,609 INFO L130 PetriNetUnfolder]: For 164417/164417 co-relation queries the response was YES. [2022-01-19 13:14:43,028 INFO L84 FinitePrefix]: Finished finitePrefix Result has 56249 conditions, 18157 events. 3939/18157 cut-off events. For 164417/164417 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 200828 event pairs, 1601 based on Foata normal form. 2/16804 useless extension candidates. Maximal degree in co-relation 55960. Up to 3100 conditions per place. [2022-01-19 13:14:43,078 INFO L132 encePairwiseOnDemand]: 570/596 looper letters, 785 selfloop transitions, 203 changer transitions 3/1498 dead transitions. [2022-01-19 13:14:43,078 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1217 places, 1498 transitions, 17729 flow [2022-01-19 13:14:43,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-01-19 13:14:43,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2022-01-19 13:14:43,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 28334 transitions. [2022-01-19 13:14:43,093 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8196598009719972 [2022-01-19 13:14:43,093 INFO L72 ComplementDD]: Start complementDD. Operand 58 states and 28334 transitions. [2022-01-19 13:14:43,094 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 28334 transitions. [2022-01-19 13:14:43,098 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:14:43,099 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 58 states and 28334 transitions. [2022-01-19 13:14:43,119 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 59 states, 58 states have (on average 488.51724137931035) internal successors, (28334), 58 states have internal predecessors, (28334), 0 states have call successors, (0), 0 states have 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:14:43,284 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 59 states, 59 states have (on average 596.0) internal successors, (35164), 59 states have internal predecessors, (35164), 0 states have call successors, (0), 0 states have 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:14:43,287 INFO L81 ComplementDD]: Finished complementDD. Result has 59 states, 59 states have (on average 596.0) internal successors, (35164), 59 states have internal predecessors, (35164), 0 states have call successors, (0), 0 states have 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:14:43,287 INFO L186 Difference]: Start difference. First operand has 1160 places, 1062 transitions, 8336 flow. Second operand 58 states and 28334 transitions. [2022-01-19 13:14:43,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1217 places, 1498 transitions, 17729 flow [2022-01-19 13:14:44,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1212 places, 1498 transitions, 15543 flow, removed 1011 selfloop flow, removed 5 redundant places. [2022-01-19 13:14:44,559 INFO L242 Difference]: Finished difference. Result has 1258 places, 1141 transitions, 9891 flow [2022-01-19 13:14:44,561 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=6732, PETRI_DIFFERENCE_MINUEND_PLACES=1155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1062, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=126, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=922, PETRI_DIFFERENCE_SUBTRAHEND_STATES=58, PETRI_FLOW=9891, PETRI_PLACES=1258, PETRI_TRANSITIONS=1141} [2022-01-19 13:14:44,561 INFO L334 CegarLoopForPetriNet]: 527 programPoint places, 731 predicate places. [2022-01-19 13:14:44,561 INFO L470 AbstractCegarLoop]: Abstraction has has 1258 places, 1141 transitions, 9891 flow [2022-01-19 13:14:44,562 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 482.42105263157896) internal successors, (9166), 19 states have internal predecessors, (9166), 0 states have call successors, (0), 0 states have 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:14:44,562 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:14:44,562 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:44,562 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-01-19 13:14:44,563 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 13:14:44,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:14:44,563 INFO L85 PathProgramCache]: Analyzing trace with hash 2073416232, now seen corresponding path program 8 times [2022-01-19 13:14:44,563 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:14:44,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482364099] [2022-01-19 13:14:44,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:14:44,563 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:14:44,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:14:44,737 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-01-19 13:14:44,737 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:14:44,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482364099] [2022-01-19 13:14:44,737 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482364099] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:14:44,737 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:14:44,737 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-01-19 13:14:44,737 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240906675] [2022-01-19 13:14:44,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:14:44,737 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-19 13:14:44,737 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:14:44,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-19 13:14:44,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2022-01-19 13:14:44,741 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 480 out of 596 [2022-01-19 13:14:44,744 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1258 places, 1141 transitions, 9891 flow. Second operand has 19 states, 19 states have (on average 482.42105263157896) internal successors, (9166), 19 states have internal predecessors, (9166), 0 states have call successors, (0), 0 states have 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:14:44,744 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:14:44,744 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 480 of 596 [2022-01-19 13:14:44,744 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:14:53,604 INFO L129 PetriNetUnfolder]: 4041/18768 cut-off events. [2022-01-19 13:14:53,605 INFO L130 PetriNetUnfolder]: For 235480/235480 co-relation queries the response was YES. [2022-01-19 13:14:54,200 INFO L84 FinitePrefix]: Finished finitePrefix Result has 64359 conditions, 18768 events. 4041/18768 cut-off events. For 235480/235480 co-relation queries the response was YES. Maximal size of possible extension queue 284. Compared 208498 event pairs, 1611 based on Foata normal form. 2/17511 useless extension candidates. Maximal degree in co-relation 64025. Up to 3079 conditions per place. [2022-01-19 13:14:54,245 INFO L132 encePairwiseOnDemand]: 570/596 looper letters, 864 selfloop transitions, 226 changer transitions 3/1600 dead transitions. [2022-01-19 13:14:54,245 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1315 places, 1600 transitions, 20457 flow [2022-01-19 13:14:54,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-01-19 13:14:54,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2022-01-19 13:14:54,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 28333 transitions. [2022-01-19 13:14:54,256 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8196308724832215 [2022-01-19 13:14:54,256 INFO L72 ComplementDD]: Start complementDD. Operand 58 states and 28333 transitions. [2022-01-19 13:14:54,256 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 28333 transitions. [2022-01-19 13:14:54,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:14:54,260 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 58 states and 28333 transitions. [2022-01-19 13:14:54,275 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 59 states, 58 states have (on average 488.5) internal successors, (28333), 58 states have internal predecessors, (28333), 0 states have call successors, (0), 0 states have 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:14:54,293 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 59 states, 59 states have (on average 596.0) internal successors, (35164), 59 states have internal predecessors, (35164), 0 states have call successors, (0), 0 states have 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:14:54,297 INFO L81 ComplementDD]: Finished complementDD. Result has 59 states, 59 states have (on average 596.0) internal successors, (35164), 59 states have internal predecessors, (35164), 0 states have call successors, (0), 0 states have 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:14:54,297 INFO L186 Difference]: Start difference. First operand has 1258 places, 1141 transitions, 9891 flow. Second operand 58 states and 28333 transitions. [2022-01-19 13:14:54,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1315 places, 1600 transitions, 20457 flow [2022-01-19 13:14:56,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1310 places, 1600 transitions, 17783 flow, removed 1255 selfloop flow, removed 5 redundant places. [2022-01-19 13:14:56,458 INFO L242 Difference]: Finished difference. Result has 1356 places, 1220 transitions, 11492 flow [2022-01-19 13:14:56,460 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=7919, PETRI_DIFFERENCE_MINUEND_PLACES=1253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=149, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=978, PETRI_DIFFERENCE_SUBTRAHEND_STATES=58, PETRI_FLOW=11492, PETRI_PLACES=1356, PETRI_TRANSITIONS=1220} [2022-01-19 13:14:56,460 INFO L334 CegarLoopForPetriNet]: 527 programPoint places, 829 predicate places. [2022-01-19 13:14:56,460 INFO L470 AbstractCegarLoop]: Abstraction has has 1356 places, 1220 transitions, 11492 flow [2022-01-19 13:14:56,461 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 482.42105263157896) internal successors, (9166), 19 states have internal predecessors, (9166), 0 states have call successors, (0), 0 states have 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:14:56,461 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:14:56,461 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:56,461 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-01-19 13:14:56,461 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 13:14:56,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:14:56,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1117320100, now seen corresponding path program 9 times [2022-01-19 13:14:56,462 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:14:56,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061997407] [2022-01-19 13:14:56,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:14:56,462 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:14:56,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:14:56,638 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-01-19 13:14:56,639 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:14:56,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061997407] [2022-01-19 13:14:56,639 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061997407] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:14:56,639 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:14:56,639 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-01-19 13:14:56,639 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594186142] [2022-01-19 13:14:56,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:14:56,639 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-19 13:14:56,639 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:14:56,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-19 13:14:56,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2022-01-19 13:14:56,643 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 480 out of 596 [2022-01-19 13:14:56,646 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1356 places, 1220 transitions, 11492 flow. Second operand has 19 states, 19 states have (on average 482.42105263157896) internal successors, (9166), 19 states have internal predecessors, (9166), 0 states have call successors, (0), 0 states have 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:14:56,646 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:14:56,646 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 480 of 596 [2022-01-19 13:14:56,646 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:15:07,041 INFO L129 PetriNetUnfolder]: 4357/20134 cut-off events. [2022-01-19 13:15:07,041 INFO L130 PetriNetUnfolder]: For 328217/328217 co-relation queries the response was YES. [2022-01-19 13:15:07,585 INFO L84 FinitePrefix]: Finished finitePrefix Result has 73628 conditions, 20134 events. 4357/20134 cut-off events. For 328217/328217 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 225953 event pairs, 1864 based on Foata normal form. 2/18656 useless extension candidates. Maximal degree in co-relation 73249. Up to 3100 conditions per place. [2022-01-19 13:15:07,639 INFO L132 encePairwiseOnDemand]: 570/596 looper letters, 983 selfloop transitions, 164 changer transitions 3/1657 dead transitions. [2022-01-19 13:15:07,639 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1414 places, 1657 transitions, 23392 flow [2022-01-19 13:15:07,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-01-19 13:15:07,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2022-01-19 13:15:07,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 28808 transitions. [2022-01-19 13:15:07,651 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8192469571152314 [2022-01-19 13:15:07,651 INFO L72 ComplementDD]: Start complementDD. Operand 59 states and 28808 transitions. [2022-01-19 13:15:07,651 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 28808 transitions. [2022-01-19 13:15:07,654 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:15:07,655 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 59 states and 28808 transitions. [2022-01-19 13:15:07,670 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 60 states, 59 states have (on average 488.271186440678) internal successors, (28808), 59 states have internal predecessors, (28808), 0 states have call successors, (0), 0 states have 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:15:07,689 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 60 states, 60 states have (on average 596.0) internal successors, (35760), 60 states have internal predecessors, (35760), 0 states have call successors, (0), 0 states have 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:15:07,693 INFO L81 ComplementDD]: Finished complementDD. Result has 60 states, 60 states have (on average 596.0) internal successors, (35760), 60 states have internal predecessors, (35760), 0 states have call successors, (0), 0 states have 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:15:07,693 INFO L186 Difference]: Start difference. First operand has 1356 places, 1220 transitions, 11492 flow. Second operand 59 states and 28808 transitions. [2022-01-19 13:15:07,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1414 places, 1657 transitions, 23392 flow [2022-01-19 13:15:10,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1409 places, 1657 transitions, 20374 flow, removed 1417 selfloop flow, removed 5 redundant places. [2022-01-19 13:15:10,859 INFO L242 Difference]: Finished difference. Result has 1456 places, 1300 transitions, 13045 flow [2022-01-19 13:15:10,860 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=9170, PETRI_DIFFERENCE_MINUEND_PLACES=1351, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=59, PETRI_FLOW=13045, PETRI_PLACES=1456, PETRI_TRANSITIONS=1300} [2022-01-19 13:15:10,860 INFO L334 CegarLoopForPetriNet]: 527 programPoint places, 929 predicate places. [2022-01-19 13:15:10,860 INFO L470 AbstractCegarLoop]: Abstraction has has 1456 places, 1300 transitions, 13045 flow [2022-01-19 13:15:10,861 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 482.42105263157896) internal successors, (9166), 19 states have internal predecessors, (9166), 0 states have call successors, (0), 0 states have 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:15:10,861 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:15:10,862 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:10,862 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-01-19 13:15:10,862 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 13:15:10,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:15:10,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1932896218, now seen corresponding path program 10 times [2022-01-19 13:15:10,862 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:15:10,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863229167] [2022-01-19 13:15:10,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:15:10,862 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:15:10,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:15:11,031 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-01-19 13:15:11,032 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:15:11,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863229167] [2022-01-19 13:15:11,032 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863229167] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:15:11,032 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:15:11,032 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-01-19 13:15:11,032 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683202473] [2022-01-19 13:15:11,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:15:11,032 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-19 13:15:11,032 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:15:11,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-19 13:15:11,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2022-01-19 13:15:11,037 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 480 out of 596 [2022-01-19 13:15:11,041 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1456 places, 1300 transitions, 13045 flow. Second operand has 19 states, 19 states have (on average 482.42105263157896) internal successors, (9166), 19 states have internal predecessors, (9166), 0 states have call successors, (0), 0 states have 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:15:11,041 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:15:11,041 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 480 of 596 [2022-01-19 13:15:11,041 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:15:23,037 INFO L129 PetriNetUnfolder]: 4403/20232 cut-off events. [2022-01-19 13:15:23,037 INFO L130 PetriNetUnfolder]: For 435276/435276 co-relation queries the response was YES. [2022-01-19 13:15:23,729 INFO L84 FinitePrefix]: Finished finitePrefix Result has 82641 conditions, 20232 events. 4403/20232 cut-off events. For 435276/435276 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 228558 event pairs, 1764 based on Foata normal form. 2/18949 useless extension candidates. Maximal degree in co-relation 82216. Up to 3079 conditions per place. [2022-01-19 13:15:23,780 INFO L132 encePairwiseOnDemand]: 570/596 looper letters, 1068 selfloop transitions, 179 changer transitions 3/1757 dead transitions. [2022-01-19 13:15:23,780 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1514 places, 1757 transitions, 26077 flow [2022-01-19 13:15:23,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-01-19 13:15:23,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2022-01-19 13:15:23,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 28807 transitions. [2022-01-19 13:15:23,792 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8192185189398248 [2022-01-19 13:15:23,792 INFO L72 ComplementDD]: Start complementDD. Operand 59 states and 28807 transitions. [2022-01-19 13:15:23,792 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 28807 transitions. [2022-01-19 13:15:23,796 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:15:23,796 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 59 states and 28807 transitions. [2022-01-19 13:15:23,811 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 60 states, 59 states have (on average 488.2542372881356) internal successors, (28807), 59 states have internal predecessors, (28807), 0 states have call successors, (0), 0 states have 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:15:23,828 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 60 states, 60 states have (on average 596.0) internal successors, (35760), 60 states have internal predecessors, (35760), 0 states have call successors, (0), 0 states have 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:15:23,832 INFO L81 ComplementDD]: Finished complementDD. Result has 60 states, 60 states have (on average 596.0) internal successors, (35760), 60 states have internal predecessors, (35760), 0 states have call successors, (0), 0 states have 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:15:23,832 INFO L186 Difference]: Start difference. First operand has 1456 places, 1300 transitions, 13045 flow. Second operand 59 states and 28807 transitions. [2022-01-19 13:15:23,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1514 places, 1757 transitions, 26077 flow [2022-01-19 13:15:29,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1509 places, 1757 transitions, 22533 flow, removed 1680 selfloop flow, removed 5 redundant places. [2022-01-19 13:15:29,207 INFO L242 Difference]: Finished difference. Result has 1556 places, 1380 transitions, 14600 flow [2022-01-19 13:15:29,208 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=10323, PETRI_DIFFERENCE_MINUEND_PLACES=1451, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=102, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=59, PETRI_FLOW=14600, PETRI_PLACES=1556, PETRI_TRANSITIONS=1380} [2022-01-19 13:15:29,208 INFO L334 CegarLoopForPetriNet]: 527 programPoint places, 1029 predicate places. [2022-01-19 13:15:29,208 INFO L470 AbstractCegarLoop]: Abstraction has has 1556 places, 1380 transitions, 14600 flow [2022-01-19 13:15:29,209 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 482.42105263157896) internal successors, (9166), 19 states have internal predecessors, (9166), 0 states have call successors, (0), 0 states have 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:15:29,209 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:15:29,210 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:29,210 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-01-19 13:15:29,210 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 13:15:29,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:15:29,210 INFO L85 PathProgramCache]: Analyzing trace with hash -709051800, now seen corresponding path program 11 times [2022-01-19 13:15:29,210 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:15:29,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578000378] [2022-01-19 13:15:29,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:15:29,210 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:15:29,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:15:29,392 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-01-19 13:15:29,392 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:15:29,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578000378] [2022-01-19 13:15:29,392 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578000378] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:15:29,392 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:15:29,392 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-01-19 13:15:29,392 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847793170] [2022-01-19 13:15:29,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:15:29,393 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-19 13:15:29,393 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:15:29,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-19 13:15:29,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2022-01-19 13:15:29,396 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 480 out of 596 [2022-01-19 13:15:29,399 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1556 places, 1380 transitions, 14600 flow. Second operand has 19 states, 19 states have (on average 482.42105263157896) internal successors, (9166), 19 states have internal predecessors, (9166), 0 states have call successors, (0), 0 states have 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:15:29,399 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:15:29,399 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 480 of 596 [2022-01-19 13:15:29,399 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:15:41,920 INFO L129 PetriNetUnfolder]: 4692/21162 cut-off events. [2022-01-19 13:15:41,920 INFO L130 PetriNetUnfolder]: For 578318/578322 co-relation queries the response was YES. [2022-01-19 13:15:42,733 INFO L84 FinitePrefix]: Finished finitePrefix Result has 93437 conditions, 21162 events. 4692/21162 cut-off events. For 578318/578322 co-relation queries the response was YES. Maximal size of possible extension queue 347. Compared 242340 event pairs, 1903 based on Foata normal form. 2/19732 useless extension candidates. Maximal degree in co-relation 92966. Up to 3100 conditions per place. [2022-01-19 13:15:42,792 INFO L132 encePairwiseOnDemand]: 570/596 looper letters, 1128 selfloop transitions, 162 changer transitions 3/1800 dead transitions. [2022-01-19 13:15:42,792 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1614 places, 1800 transitions, 28696 flow [2022-01-19 13:15:42,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-01-19 13:15:42,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2022-01-19 13:15:42,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 28793 transitions. [2022-01-19 13:15:42,804 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8188203844841315 [2022-01-19 13:15:42,804 INFO L72 ComplementDD]: Start complementDD. Operand 59 states and 28793 transitions. [2022-01-19 13:15:42,804 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 28793 transitions. [2022-01-19 13:15:42,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:15:42,807 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 59 states and 28793 transitions. [2022-01-19 13:15:42,822 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 60 states, 59 states have (on average 488.0169491525424) internal successors, (28793), 59 states have internal predecessors, (28793), 0 states have call successors, (0), 0 states have 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:15:42,838 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 60 states, 60 states have (on average 596.0) internal successors, (35760), 60 states have internal predecessors, (35760), 0 states have call successors, (0), 0 states have 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:15:42,842 INFO L81 ComplementDD]: Finished complementDD. Result has 60 states, 60 states have (on average 596.0) internal successors, (35760), 60 states have internal predecessors, (35760), 0 states have call successors, (0), 0 states have 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:15:42,842 INFO L186 Difference]: Start difference. First operand has 1556 places, 1380 transitions, 14600 flow. Second operand 59 states and 28793 transitions. [2022-01-19 13:15:42,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1614 places, 1800 transitions, 28696 flow [2022-01-19 13:15:50,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1609 places, 1800 transitions, 24910 flow, removed 1791 selfloop flow, removed 5 redundant places. [2022-01-19 13:15:50,449 INFO L242 Difference]: Finished difference. Result has 1657 places, 1461 transitions, 16204 flow [2022-01-19 13:15:50,450 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=11504, PETRI_DIFFERENCE_MINUEND_PLACES=1551, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1380, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=59, PETRI_FLOW=16204, PETRI_PLACES=1657, PETRI_TRANSITIONS=1461} [2022-01-19 13:15:50,456 INFO L334 CegarLoopForPetriNet]: 527 programPoint places, 1130 predicate places. [2022-01-19 13:15:50,456 INFO L470 AbstractCegarLoop]: Abstraction has has 1657 places, 1461 transitions, 16204 flow [2022-01-19 13:15:50,457 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 482.42105263157896) internal successors, (9166), 19 states have internal predecessors, (9166), 0 states have call successors, (0), 0 states have 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:15:50,457 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:15:50,457 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:50,457 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-01-19 13:15:50,457 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 13:15:50,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:15:50,458 INFO L85 PathProgramCache]: Analyzing trace with hash -931781678, now seen corresponding path program 12 times [2022-01-19 13:15:50,458 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:15:50,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899052118] [2022-01-19 13:15:50,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:15:50,459 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:15:50,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:15:50,633 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-01-19 13:15:50,633 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:15:50,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899052118] [2022-01-19 13:15:50,633 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899052118] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:15:50,633 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:15:50,633 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-01-19 13:15:50,633 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302748463] [2022-01-19 13:15:50,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:15:50,633 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-19 13:15:50,633 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:15:50,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-19 13:15:50,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2022-01-19 13:15:50,637 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 480 out of 596 [2022-01-19 13:15:50,640 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1657 places, 1461 transitions, 16204 flow. Second operand has 19 states, 19 states have (on average 482.42105263157896) internal successors, (9166), 19 states have internal predecessors, (9166), 0 states have call successors, (0), 0 states have 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:15:50,640 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:15:50,640 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 480 of 596 [2022-01-19 13:15:50,640 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:16:04,772 INFO L129 PetriNetUnfolder]: 4858/21997 cut-off events. [2022-01-19 13:16:04,772 INFO L130 PetriNetUnfolder]: For 737215/737225 co-relation queries the response was YES. [2022-01-19 13:16:05,915 INFO L84 FinitePrefix]: Finished finitePrefix Result has 105255 conditions, 21997 events. 4858/21997 cut-off events. For 737215/737225 co-relation queries the response was YES. Maximal size of possible extension queue 372. Compared 253782 event pairs, 1903 based on Foata normal form. 2/20680 useless extension candidates. Maximal degree in co-relation 104737. Up to 3079 conditions per place. [2022-01-19 13:16:05,980 INFO L132 encePairwiseOnDemand]: 570/596 looper letters, 1214 selfloop transitions, 173 changer transitions 3/1897 dead transitions. [2022-01-19 13:16:05,980 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1715 places, 1897 transitions, 31361 flow [2022-01-19 13:16:05,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-01-19 13:16:05,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2022-01-19 13:16:05,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 28793 transitions. [2022-01-19 13:16:05,992 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8188203844841315 [2022-01-19 13:16:05,992 INFO L72 ComplementDD]: Start complementDD. Operand 59 states and 28793 transitions. [2022-01-19 13:16:05,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 28793 transitions. [2022-01-19 13:16:05,996 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:16:05,996 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 59 states and 28793 transitions. [2022-01-19 13:16:06,012 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 60 states, 59 states have (on average 488.0169491525424) internal successors, (28793), 59 states have internal predecessors, (28793), 0 states have call successors, (0), 0 states have 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:16:06,031 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 60 states, 60 states have (on average 596.0) internal successors, (35760), 60 states have internal predecessors, (35760), 0 states have call successors, (0), 0 states have 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:16:06,037 INFO L81 ComplementDD]: Finished complementDD. Result has 60 states, 60 states have (on average 596.0) internal successors, (35760), 60 states have internal predecessors, (35760), 0 states have call successors, (0), 0 states have 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:16:06,037 INFO L186 Difference]: Start difference. First operand has 1657 places, 1461 transitions, 16204 flow. Second operand 59 states and 28793 transitions. [2022-01-19 13:16:06,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1715 places, 1897 transitions, 31361 flow [2022-01-19 13:16:17,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1711 places, 1897 transitions, 27107 flow, removed 2062 selfloop flow, removed 4 redundant places. [2022-01-19 13:16:17,144 INFO L242 Difference]: Finished difference. Result has 1759 places, 1542 transitions, 17826 flow [2022-01-19 13:16:17,145 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=12716, PETRI_DIFFERENCE_MINUEND_PLACES=1653, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1461, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1350, PETRI_DIFFERENCE_SUBTRAHEND_STATES=59, PETRI_FLOW=17826, PETRI_PLACES=1759, PETRI_TRANSITIONS=1542} [2022-01-19 13:16:17,145 INFO L334 CegarLoopForPetriNet]: 527 programPoint places, 1232 predicate places. [2022-01-19 13:16:17,145 INFO L470 AbstractCegarLoop]: Abstraction has has 1759 places, 1542 transitions, 17826 flow [2022-01-19 13:16:17,146 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 482.42105263157896) internal successors, (9166), 19 states have internal predecessors, (9166), 0 states have call successors, (0), 0 states have 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:16:17,146 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:16:17,147 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:17,147 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-01-19 13:16:17,147 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 13:16:17,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:16:17,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1453746146, now seen corresponding path program 13 times [2022-01-19 13:16:17,147 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:16:17,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316919810] [2022-01-19 13:16:17,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:16:17,147 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:16:17,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:16:17,306 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-01-19 13:16:17,307 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:16:17,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316919810] [2022-01-19 13:16:17,307 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316919810] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:16:17,307 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:16:17,307 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-01-19 13:16:17,307 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831117779] [2022-01-19 13:16:17,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:16:17,307 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-19 13:16:17,307 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:16:17,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-19 13:16:17,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2022-01-19 13:16:17,311 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 480 out of 596 [2022-01-19 13:16:17,314 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1759 places, 1542 transitions, 17826 flow. Second operand has 19 states, 19 states have (on average 482.42105263157896) internal successors, (9166), 19 states have internal predecessors, (9166), 0 states have call successors, (0), 0 states have 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:16:17,314 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:16:17,314 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 480 of 596 [2022-01-19 13:16:17,314 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:16:32,682 INFO L129 PetriNetUnfolder]: 5023/23123 cut-off events. [2022-01-19 13:16:32,682 INFO L130 PetriNetUnfolder]: For 823103/823119 co-relation queries the response was YES. [2022-01-19 13:16:35,487 INFO L84 FinitePrefix]: Finished finitePrefix Result has 108241 conditions, 23123 events. 5023/23123 cut-off events. For 823103/823119 co-relation queries the response was YES. Maximal size of possible extension queue 376. Compared 268740 event pairs, 1777 based on Foata normal form. 8/21573 useless extension candidates. Maximal degree in co-relation 107676. Up to 3100 conditions per place. [2022-01-19 13:16:35,559 INFO L132 encePairwiseOnDemand]: 570/596 looper letters, 1079 selfloop transitions, 542 changer transitions 3/2131 dead transitions. [2022-01-19 13:16:35,559 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1813 places, 2131 transitions, 35440 flow [2022-01-19 13:16:35,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-01-19 13:16:35,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2022-01-19 13:16:35,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 26907 transitions. [2022-01-19 13:16:35,571 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8208358755338621 [2022-01-19 13:16:35,571 INFO L72 ComplementDD]: Start complementDD. Operand 55 states and 26907 transitions. [2022-01-19 13:16:35,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 26907 transitions. [2022-01-19 13:16:35,574 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:16:35,574 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 55 states and 26907 transitions. [2022-01-19 13:16:35,592 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 56 states, 55 states have (on average 489.2181818181818) internal successors, (26907), 55 states have internal predecessors, (26907), 0 states have call successors, (0), 0 states have 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:16:35,610 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 56 states, 56 states have (on average 596.0) internal successors, (33376), 56 states have internal predecessors, (33376), 0 states have call successors, (0), 0 states have 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:16:35,614 INFO L81 ComplementDD]: Finished complementDD. Result has 56 states, 56 states have (on average 596.0) internal successors, (33376), 56 states have internal predecessors, (33376), 0 states have call successors, (0), 0 states have 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:16:35,615 INFO L186 Difference]: Start difference. First operand has 1759 places, 1542 transitions, 17826 flow. Second operand 55 states and 26907 transitions. [2022-01-19 13:16:35,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1813 places, 2131 transitions, 35440 flow [2022-01-19 13:16:46,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1809 places, 2131 transitions, 29030 flow, removed 3140 selfloop flow, removed 4 redundant places. [2022-01-19 13:16:46,746 INFO L242 Difference]: Finished difference. Result has 1849 places, 1611 transitions, 17873 flow [2022-01-19 13:16:46,747 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=13956, PETRI_DIFFERENCE_MINUEND_PLACES=1755, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1542, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=473, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1058, PETRI_DIFFERENCE_SUBTRAHEND_STATES=55, PETRI_FLOW=17873, PETRI_PLACES=1849, PETRI_TRANSITIONS=1611} [2022-01-19 13:16:46,747 INFO L334 CegarLoopForPetriNet]: 527 programPoint places, 1322 predicate places. [2022-01-19 13:16:46,747 INFO L470 AbstractCegarLoop]: Abstraction has has 1849 places, 1611 transitions, 17873 flow [2022-01-19 13:16:46,748 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 482.42105263157896) internal successors, (9166), 19 states have internal predecessors, (9166), 0 states have call successors, (0), 0 states have 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:16:46,749 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:16:46,749 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:46,749 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-01-19 13:16:46,749 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 13:16:46,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:16:46,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1129447238, now seen corresponding path program 14 times [2022-01-19 13:16:46,749 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:16:46,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085292878] [2022-01-19 13:16:46,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:16:46,750 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:16:46,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:16:46,954 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-01-19 13:16:46,954 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:16:46,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085292878] [2022-01-19 13:16:46,954 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085292878] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:16:46,954 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:16:46,954 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-01-19 13:16:46,955 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474087627] [2022-01-19 13:16:46,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:16:46,955 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-19 13:16:46,955 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:16:46,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-19 13:16:46,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2022-01-19 13:16:46,960 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 480 out of 596 [2022-01-19 13:16:46,964 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1849 places, 1611 transitions, 17873 flow. Second operand has 19 states, 19 states have (on average 482.42105263157896) internal successors, (9166), 19 states have internal predecessors, (9166), 0 states have call successors, (0), 0 states have 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:16:46,964 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:16:46,964 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 480 of 596 [2022-01-19 13:16:46,964 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:17:03,895 INFO L129 PetriNetUnfolder]: 5393/24036 cut-off events. [2022-01-19 13:17:03,895 INFO L130 PetriNetUnfolder]: For 1206226/1206264 co-relation queries the response was YES. [2022-01-19 13:17:05,608 INFO L84 FinitePrefix]: Finished finitePrefix Result has 134667 conditions, 24036 events. 5393/24036 cut-off events. For 1206226/1206264 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 281334 event pairs, 2355 based on Foata normal form. 5/22617 useless extension candidates. Maximal degree in co-relation 134063. Up to 3341 conditions per place. [2022-01-19 13:17:05,681 INFO L132 encePairwiseOnDemand]: 570/596 looper letters, 1357 selfloop transitions, 150 changer transitions 3/2017 dead transitions. [2022-01-19 13:17:05,681 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1906 places, 2017 transitions, 35061 flow [2022-01-19 13:17:05,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-01-19 13:17:05,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2022-01-19 13:17:05,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 28318 transitions. [2022-01-19 13:17:05,692 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8191969451515853 [2022-01-19 13:17:05,692 INFO L72 ComplementDD]: Start complementDD. Operand 58 states and 28318 transitions. [2022-01-19 13:17:05,693 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 28318 transitions. [2022-01-19 13:17:05,696 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:17:05,696 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 58 states and 28318 transitions. [2022-01-19 13:17:05,710 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 59 states, 58 states have (on average 488.2413793103448) internal successors, (28318), 58 states have internal predecessors, (28318), 0 states have call successors, (0), 0 states have 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:17:05,727 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 59 states, 59 states have (on average 596.0) internal successors, (35164), 59 states have internal predecessors, (35164), 0 states have call successors, (0), 0 states have 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:17:05,729 INFO L81 ComplementDD]: Finished complementDD. Result has 59 states, 59 states have (on average 596.0) internal successors, (35164), 59 states have internal predecessors, (35164), 0 states have call successors, (0), 0 states have 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:17:05,730 INFO L186 Difference]: Start difference. First operand has 1849 places, 1611 transitions, 17873 flow. Second operand 58 states and 28318 transitions. [2022-01-19 13:17:05,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1906 places, 2017 transitions, 35061 flow [2022-01-19 13:17:22,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1900 places, 2017 transitions, 32632 flow, removed 997 selfloop flow, removed 6 redundant places. [2022-01-19 13:17:22,810 INFO L242 Difference]: Finished difference. Result has 1946 places, 1695 transitions, 21597 flow [2022-01-19 13:17:22,811 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=15587, PETRI_DIFFERENCE_MINUEND_PLACES=1843, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1611, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1519, PETRI_DIFFERENCE_SUBTRAHEND_STATES=58, PETRI_FLOW=21597, PETRI_PLACES=1946, PETRI_TRANSITIONS=1695} [2022-01-19 13:17:22,811 INFO L334 CegarLoopForPetriNet]: 527 programPoint places, 1419 predicate places. [2022-01-19 13:17:22,811 INFO L470 AbstractCegarLoop]: Abstraction has has 1946 places, 1695 transitions, 21597 flow [2022-01-19 13:17:22,812 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 482.42105263157896) internal successors, (9166), 19 states have internal predecessors, (9166), 0 states have call successors, (0), 0 states have 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:17:22,812 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:17:22,812 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:22,812 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-01-19 13:17:22,812 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 13:17:22,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:17:22,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1579267606, now seen corresponding path program 15 times [2022-01-19 13:17:22,813 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:17:22,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389391200] [2022-01-19 13:17:22,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:17:22,813 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:17:22,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:17:22,985 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-01-19 13:17:22,985 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:17:22,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389391200] [2022-01-19 13:17:22,985 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389391200] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:17:22,985 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:17:22,985 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-01-19 13:17:22,985 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019881329] [2022-01-19 13:17:22,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:17:22,986 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-19 13:17:22,986 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:17:22,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-19 13:17:22,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2022-01-19 13:17:22,990 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 480 out of 596 [2022-01-19 13:17:22,992 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1946 places, 1695 transitions, 21597 flow. Second operand has 19 states, 19 states have (on average 482.42105263157896) internal successors, (9166), 19 states have internal predecessors, (9166), 0 states have call successors, (0), 0 states have 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:17:22,992 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:17:22,992 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 480 of 596 [2022-01-19 13:17:22,992 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:17:40,430 INFO L129 PetriNetUnfolder]: 5498/24658 cut-off events. [2022-01-19 13:17:40,430 INFO L130 PetriNetUnfolder]: For 1379596/1379638 co-relation queries the response was YES. [2022-01-19 13:17:42,301 INFO L84 FinitePrefix]: Finished finitePrefix Result has 141515 conditions, 24658 events. 5498/24658 cut-off events. For 1379596/1379638 co-relation queries the response was YES. Maximal size of possible extension queue 434. Compared 291454 event pairs, 1803 based on Foata normal form. 10/23081 useless extension candidates. Maximal degree in co-relation 140866. Up to 3100 conditions per place. [2022-01-19 13:17:42,382 INFO L132 encePairwiseOnDemand]: 570/596 looper letters, 1240 selfloop transitions, 460 changer transitions 3/2210 dead transitions. [2022-01-19 13:17:42,382 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1975 places, 2210 transitions, 39095 flow [2022-01-19 13:17:42,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-01-19 13:17:42,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-01-19 13:17:42,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 14800 transitions. [2022-01-19 13:17:42,389 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8277404921700223 [2022-01-19 13:17:42,389 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 14800 transitions. [2022-01-19 13:17:42,389 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 14800 transitions. [2022-01-19 13:17:42,390 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:17:42,390 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 14800 transitions. [2022-01-19 13:17:42,397 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 493.3333333333333) internal successors, (14800), 30 states have internal predecessors, (14800), 0 states have call successors, (0), 0 states have 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:17:42,405 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 596.0) internal successors, (18476), 31 states have internal predecessors, (18476), 0 states have call successors, (0), 0 states have 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:17:42,406 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 596.0) internal successors, (18476), 31 states have internal predecessors, (18476), 0 states have call successors, (0), 0 states have 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:17:42,406 INFO L186 Difference]: Start difference. First operand has 1946 places, 1695 transitions, 21597 flow. Second operand 30 states and 14800 transitions. [2022-01-19 13:17:42,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1975 places, 2210 transitions, 39095 flow [2022-01-19 13:18:04,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1972 places, 2210 transitions, 30650 flow, removed 4192 selfloop flow, removed 3 redundant places. [2022-01-19 13:18:04,531 INFO L242 Difference]: Finished difference. Result has 1988 places, 1729 transitions, 19221 flow [2022-01-19 13:18:04,532 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=17002, PETRI_DIFFERENCE_MINUEND_PLACES=1943, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1695, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=426, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=19221, PETRI_PLACES=1988, PETRI_TRANSITIONS=1729} [2022-01-19 13:18:04,532 INFO L334 CegarLoopForPetriNet]: 527 programPoint places, 1461 predicate places. [2022-01-19 13:18:04,532 INFO L470 AbstractCegarLoop]: Abstraction has has 1988 places, 1729 transitions, 19221 flow [2022-01-19 13:18:04,533 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 482.42105263157896) internal successors, (9166), 19 states have internal predecessors, (9166), 0 states have call successors, (0), 0 states have 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:18:04,533 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:18:04,534 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:04,534 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-01-19 13:18:04,534 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 13:18:04,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:18:04,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1417894316, now seen corresponding path program 16 times [2022-01-19 13:18:04,534 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:18:04,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639940353] [2022-01-19 13:18:04,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:18:04,535 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:18:04,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:18:04,703 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-01-19 13:18:04,703 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:18:04,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639940353] [2022-01-19 13:18:04,703 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639940353] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:18:04,703 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:18:04,704 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-01-19 13:18:04,704 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145953497] [2022-01-19 13:18:04,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:18:04,704 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-19 13:18:04,704 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:18:04,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-19 13:18:04,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2022-01-19 13:18:04,708 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 480 out of 596 [2022-01-19 13:18:04,710 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1988 places, 1729 transitions, 19221 flow. Second operand has 19 states, 19 states have (on average 482.42105263157896) internal successors, (9166), 19 states have internal predecessors, (9166), 0 states have call successors, (0), 0 states have 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:18:04,710 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:18:04,710 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 480 of 596 [2022-01-19 13:18:04,710 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:18:24,810 INFO L129 PetriNetUnfolder]: 6170/27545 cut-off events. [2022-01-19 13:18:24,810 INFO L130 PetriNetUnfolder]: For 1768968/1769032 co-relation queries the response was YES. [2022-01-19 13:18:27,253 INFO L84 FinitePrefix]: Finished finitePrefix Result has 167710 conditions, 27545 events. 6170/27545 cut-off events. For 1768968/1769032 co-relation queries the response was YES. Maximal size of possible extension queue 492. Compared 327860 event pairs, 3561 based on Foata normal form. 6/25813 useless extension candidates. Maximal degree in co-relation 167046. Up to 3961 conditions per place. [2022-01-19 13:18:27,356 INFO L132 encePairwiseOnDemand]: 570/596 looper letters, 1458 selfloop transitions, 131 changer transitions 3/2099 dead transitions. [2022-01-19 13:18:27,357 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 2045 places, 2099 transitions, 38229 flow [2022-01-19 13:18:27,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-01-19 13:18:27,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2022-01-19 13:18:27,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 28304 transitions. [2022-01-19 13:18:27,368 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8187919463087249 [2022-01-19 13:18:27,368 INFO L72 ComplementDD]: Start complementDD. Operand 58 states and 28304 transitions. [2022-01-19 13:18:27,368 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 28304 transitions. [2022-01-19 13:18:27,371 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:18:27,371 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 58 states and 28304 transitions. [2022-01-19 13:18:27,385 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 59 states, 58 states have (on average 488.0) internal successors, (28304), 58 states have internal predecessors, (28304), 0 states have call successors, (0), 0 states have 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:18:27,402 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 59 states, 59 states have (on average 596.0) internal successors, (35164), 59 states have internal predecessors, (35164), 0 states have call successors, (0), 0 states have 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:18:27,404 INFO L81 ComplementDD]: Finished complementDD. Result has 59 states, 59 states have (on average 596.0) internal successors, (35164), 59 states have internal predecessors, (35164), 0 states have call successors, (0), 0 states have 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:18:27,404 INFO L186 Difference]: Start difference. First operand has 1988 places, 1729 transitions, 19221 flow. Second operand 58 states and 28304 transitions. [2022-01-19 13:18:27,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 2045 places, 2099 transitions, 38229 flow [2022-01-19 13:18:49,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 2039 places, 2099 transitions, 37009 flow, removed 435 selfloop flow, removed 6 redundant places. [2022-01-19 13:18:49,421 INFO L242 Difference]: Finished difference. Result has 2086 places, 1814 transitions, 24741 flow [2022-01-19 13:18:49,423 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=18152, PETRI_DIFFERENCE_MINUEND_PLACES=1982, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1729, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1656, PETRI_DIFFERENCE_SUBTRAHEND_STATES=58, PETRI_FLOW=24741, PETRI_PLACES=2086, PETRI_TRANSITIONS=1814} [2022-01-19 13:18:49,423 INFO L334 CegarLoopForPetriNet]: 527 programPoint places, 1559 predicate places. [2022-01-19 13:18:49,423 INFO L470 AbstractCegarLoop]: Abstraction has has 2086 places, 1814 transitions, 24741 flow [2022-01-19 13:18:49,424 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 482.42105263157896) internal successors, (9166), 19 states have internal predecessors, (9166), 0 states have call successors, (0), 0 states have 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:18:49,424 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:18:49,424 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:49,424 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-01-19 13:18:49,424 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 13:18:49,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:18:49,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1999198820, now seen corresponding path program 17 times [2022-01-19 13:18:49,425 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:18:49,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885428522] [2022-01-19 13:18:49,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:18:49,426 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:18:49,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:18:49,585 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-01-19 13:18:49,585 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:18:49,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885428522] [2022-01-19 13:18:49,585 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885428522] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:18:49,585 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:18:49,585 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-01-19 13:18:49,585 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704946021] [2022-01-19 13:18:49,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:18:49,586 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-19 13:18:49,586 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:18:49,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-19 13:18:49,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2022-01-19 13:18:49,589 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 480 out of 596 [2022-01-19 13:18:49,592 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 2086 places, 1814 transitions, 24741 flow. Second operand has 19 states, 19 states have (on average 482.42105263157896) internal successors, (9166), 19 states have internal predecessors, (9166), 0 states have call successors, (0), 0 states have 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:18:49,592 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:18:49,592 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 480 of 596 [2022-01-19 13:18:49,592 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:19:11,979 INFO L129 PetriNetUnfolder]: 6076/26963 cut-off events. [2022-01-19 13:19:11,979 INFO L130 PetriNetUnfolder]: For 1926270/1926337 co-relation queries the response was YES. [2022-01-19 13:19:16,227 INFO L84 FinitePrefix]: Finished finitePrefix Result has 174509 conditions, 26963 events. 6076/26963 cut-off events. For 1926270/1926337 co-relation queries the response was YES. Maximal size of possible extension queue 501. Compared 323732 event pairs, 1928 based on Foata normal form. 17/25335 useless extension candidates. Maximal degree in co-relation 173799. Up to 3100 conditions per place. [2022-01-19 13:19:16,324 INFO L132 encePairwiseOnDemand]: 570/596 looper letters, 1333 selfloop transitions, 588 changer transitions 3/2431 dead transitions. [2022-01-19 13:19:16,324 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 2121 places, 2431 transitions, 44209 flow [2022-01-19 13:19:16,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-01-19 13:19:16,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2022-01-19 13:19:16,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 17681 transitions. [2022-01-19 13:19:16,331 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.824058538404176 [2022-01-19 13:19:16,331 INFO L72 ComplementDD]: Start complementDD. Operand 36 states and 17681 transitions. [2022-01-19 13:19:16,331 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 17681 transitions. [2022-01-19 13:19:16,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:19:16,468 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 36 states and 17681 transitions. [2022-01-19 13:19:16,482 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 37 states, 36 states have (on average 491.1388888888889) internal successors, (17681), 36 states have internal predecessors, (17681), 0 states have call successors, (0), 0 states have 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:19:16,494 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 37 states, 37 states have (on average 596.0) internal successors, (22052), 37 states have internal predecessors, (22052), 0 states have call successors, (0), 0 states have 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:19:16,496 INFO L81 ComplementDD]: Finished complementDD. Result has 37 states, 37 states have (on average 596.0) internal successors, (22052), 37 states have internal predecessors, (22052), 0 states have call successors, (0), 0 states have 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:19:16,496 INFO L186 Difference]: Start difference. First operand has 2086 places, 1814 transitions, 24741 flow. Second operand 36 states and 17681 transitions. [2022-01-19 13:19:16,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 2121 places, 2431 transitions, 44209 flow [2022-01-19 13:19:53,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 2119 places, 2431 transitions, 34630 flow, removed 4782 selfloop flow, removed 2 redundant places. [2022-01-19 13:19:53,435 INFO L242 Difference]: Finished difference. Result has 2143 places, 1873 transitions, 23211 flow [2022-01-19 13:19:53,436 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=19608, PETRI_DIFFERENCE_MINUEND_PLACES=2084, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1814, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=529, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=23211, PETRI_PLACES=2143, PETRI_TRANSITIONS=1873} [2022-01-19 13:19:53,436 INFO L334 CegarLoopForPetriNet]: 527 programPoint places, 1616 predicate places. [2022-01-19 13:19:53,436 INFO L470 AbstractCegarLoop]: Abstraction has has 2143 places, 1873 transitions, 23211 flow [2022-01-19 13:19:53,437 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 482.42105263157896) internal successors, (9166), 19 states have internal predecessors, (9166), 0 states have call successors, (0), 0 states have 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:19:53,437 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:19:53,437 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:53,437 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-01-19 13:19:53,438 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 13:19:53,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:19:53,438 INFO L85 PathProgramCache]: Analyzing trace with hash -2050598446, now seen corresponding path program 18 times [2022-01-19 13:19:53,438 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:19:53,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806776893] [2022-01-19 13:19:53,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:19:53,438 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:19:53,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:19:53,611 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-01-19 13:19:53,611 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:19:53,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806776893] [2022-01-19 13:19:53,612 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806776893] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:19:53,612 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:19:53,612 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-01-19 13:19:53,612 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270923594] [2022-01-19 13:19:53,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:19:53,612 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-19 13:19:53,612 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:19:53,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-19 13:19:53,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2022-01-19 13:19:53,616 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 480 out of 596 [2022-01-19 13:19:53,619 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 2143 places, 1873 transitions, 23211 flow. Second operand has 19 states, 19 states have (on average 482.42105263157896) internal successors, (9166), 19 states have internal predecessors, (9166), 0 states have call successors, (0), 0 states have 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:19:53,619 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:19:53,619 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 480 of 596 [2022-01-19 13:19:53,619 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 13:20:15,060 INFO L129 PetriNetUnfolder]: 6081/26444 cut-off events. [2022-01-19 13:20:15,060 INFO L130 PetriNetUnfolder]: For 1925762/1925863 co-relation queries the response was YES. [2022-01-19 13:20:17,557 INFO L84 FinitePrefix]: Finished finitePrefix Result has 171325 conditions, 26444 events. 6081/26444 cut-off events. For 1925762/1925863 co-relation queries the response was YES. Maximal size of possible extension queue 505. Compared 315812 event pairs, 2848 based on Foata normal form. 9/24915 useless extension candidates. Maximal degree in co-relation 170592. Up to 5340 conditions per place. [2022-01-19 13:20:17,653 INFO L132 encePairwiseOnDemand]: 570/596 looper letters, 1523 selfloop transitions, 449 changer transitions 3/2482 dead transitions. [2022-01-19 13:20:17,654 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 2200 places, 2482 transitions, 47081 flow [2022-01-19 13:20:17,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-01-19 13:20:17,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2022-01-19 13:20:17,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 28265 transitions. [2022-01-19 13:20:17,665 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8176637352464707 [2022-01-19 13:20:17,665 INFO L72 ComplementDD]: Start complementDD. Operand 58 states and 28265 transitions. [2022-01-19 13:20:17,665 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 28265 transitions. [2022-01-19 13:20:17,668 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 13:20:17,669 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 58 states and 28265 transitions. [2022-01-19 13:20:17,684 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 59 states, 58 states have (on average 487.32758620689657) internal successors, (28265), 58 states have internal predecessors, (28265), 0 states have call successors, (0), 0 states have 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:20:17,702 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 59 states, 59 states have (on average 596.0) internal successors, (35164), 59 states have internal predecessors, (35164), 0 states have call successors, (0), 0 states have 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:20:17,706 INFO L81 ComplementDD]: Finished complementDD. Result has 59 states, 59 states have (on average 596.0) internal successors, (35164), 59 states have internal predecessors, (35164), 0 states have call successors, (0), 0 states have 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:20:17,706 INFO L186 Difference]: Start difference. First operand has 2143 places, 1873 transitions, 23211 flow. Second operand 58 states and 28265 transitions. [2022-01-19 13:20:17,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 2200 places, 2482 transitions, 47081 flow [2022-01-19 13:20:49,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 2195 places, 2482 transitions, 45299 flow, removed 707 selfloop flow, removed 5 redundant places. [2022-01-19 13:20:49,357 INFO L242 Difference]: Finished difference. Result has 2245 places, 1955 transitions, 29952 flow [2022-01-19 13:20:49,358 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=596, PETRI_DIFFERENCE_MINUEND_FLOW=21758, PETRI_DIFFERENCE_MINUEND_PLACES=2138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1873, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=370, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1485, PETRI_DIFFERENCE_SUBTRAHEND_STATES=58, PETRI_FLOW=29952, PETRI_PLACES=2245, PETRI_TRANSITIONS=1955} [2022-01-19 13:20:49,358 INFO L334 CegarLoopForPetriNet]: 527 programPoint places, 1718 predicate places. [2022-01-19 13:20:49,358 INFO L470 AbstractCegarLoop]: Abstraction has has 2245 places, 1955 transitions, 29952 flow [2022-01-19 13:20:49,359 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 482.42105263157896) internal successors, (9166), 19 states have internal predecessors, (9166), 0 states have call successors, (0), 0 states have 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:20:49,359 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 13:20:49,359 INFO L254 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:49,359 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-01-19 13:20:49,359 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-01-19 13:20:49,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 13:20:49,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1554308756, now seen corresponding path program 19 times [2022-01-19 13:20:49,360 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 13:20:49,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688501468] [2022-01-19 13:20:49,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 13:20:49,360 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 13:20:49,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 13:20:49,508 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2022-01-19 13:20:49,509 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 13:20:49,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688501468] [2022-01-19 13:20:49,509 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688501468] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 13:20:49,509 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 13:20:49,509 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-01-19 13:20:49,509 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866838348] [2022-01-19 13:20:49,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 13:20:49,509 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-19 13:20:49,509 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 13:20:49,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-19 13:20:49,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2022-01-19 13:20:49,513 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 480 out of 596 [2022-01-19 13:20:49,515 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 2245 places, 1955 transitions, 29952 flow. Second operand has 19 states, 19 states have (on average 482.42105263157896) internal successors, (9166), 19 states have internal predecessors, (9166), 0 states have call successors, (0), 0 states have 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:20:49,515 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 13:20:49,515 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 480 of 596 [2022-01-19 13:20:49,515 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand