/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/chl-match-subst.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bf34d27 [2022-01-19 00:40:13,261 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-19 00:40:13,263 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-19 00:40:13,298 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-19 00:40:13,298 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-19 00:40:13,299 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-19 00:40:13,300 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-19 00:40:13,302 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-19 00:40:13,303 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-19 00:40:13,304 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-19 00:40:13,305 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-19 00:40:13,306 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-19 00:40:13,320 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-19 00:40:13,321 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-19 00:40:13,322 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-19 00:40:13,323 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-19 00:40:13,324 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-19 00:40:13,324 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-19 00:40:13,326 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-19 00:40:13,327 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-19 00:40:13,328 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-19 00:40:13,330 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-19 00:40:13,331 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-19 00:40:13,332 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-19 00:40:13,334 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-19 00:40:13,334 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-19 00:40:13,335 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-19 00:40:13,335 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-19 00:40:13,336 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-19 00:40:13,336 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-19 00:40:13,336 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-19 00:40:13,337 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-19 00:40:13,337 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-19 00:40:13,338 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-19 00:40:13,338 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-19 00:40:13,338 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-19 00:40:13,339 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-19 00:40:13,339 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-19 00:40:13,339 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-19 00:40:13,340 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-19 00:40:13,346 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-19 00:40:13,347 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2022-01-19 00:40:13,376 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-19 00:40:13,377 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-19 00:40:13,377 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-19 00:40:13,378 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-19 00:40:13,378 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-19 00:40:13,378 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-19 00:40:13,378 INFO L138 SettingsManager]: * Use SBE=true [2022-01-19 00:40:13,378 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-19 00:40:13,379 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-19 00:40:13,379 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-19 00:40:13,379 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-19 00:40:13,379 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-19 00:40:13,379 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-19 00:40:13,379 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-19 00:40:13,379 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-19 00:40:13,380 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-19 00:40:13,380 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-19 00:40:13,380 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-19 00:40:13,380 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-19 00:40:13,380 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-19 00:40:13,380 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-19 00:40:13,380 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-19 00:40:13,380 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-19 00:40:13,381 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 00:40:13,381 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-19 00:40:13,381 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-19 00:40:13,381 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-19 00:40:13,381 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-19 00:40:13,381 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-19 00:40:13,381 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-19 00:40:13,381 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-19 00:40:13,382 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-01-19 00:40:13,590 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-19 00:40:13,609 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-19 00:40:13,611 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-19 00:40:13,611 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-19 00:40:13,612 INFO L275 PluginConnector]: CDTParser initialized [2022-01-19 00:40:13,613 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-match-subst.wvr.c [2022-01-19 00:40:13,670 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28f433960/d4c87e14226249b5ba9edb9da70a7f28/FLAGd4f01755b [2022-01-19 00:40:14,019 INFO L306 CDTParser]: Found 1 translation units. [2022-01-19 00:40:14,020 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-match-subst.wvr.c [2022-01-19 00:40:14,029 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28f433960/d4c87e14226249b5ba9edb9da70a7f28/FLAGd4f01755b [2022-01-19 00:40:14,040 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28f433960/d4c87e14226249b5ba9edb9da70a7f28 [2022-01-19 00:40:14,042 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-19 00:40:14,043 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-19 00:40:14,044 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-19 00:40:14,045 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-19 00:40:14,047 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-19 00:40:14,047 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 12:40:14" (1/1) ... [2022-01-19 00:40:14,048 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d645563 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:40:14, skipping insertion in model container [2022-01-19 00:40:14,048 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 12:40:14" (1/1) ... [2022-01-19 00:40:14,054 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-19 00:40:14,070 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-19 00:40:14,218 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-match-subst.wvr.c[3017,3030] [2022-01-19 00:40:14,223 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 00:40:14,228 INFO L203 MainTranslator]: Completed pre-run [2022-01-19 00:40:14,261 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-match-subst.wvr.c[3017,3030] [2022-01-19 00:40:14,263 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 00:40:14,286 INFO L208 MainTranslator]: Completed translation [2022-01-19 00:40:14,287 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:40:14 WrapperNode [2022-01-19 00:40:14,287 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-19 00:40:14,289 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-19 00:40:14,289 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-19 00:40:14,289 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-19 00:40:14,294 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:40:14" (1/1) ... [2022-01-19 00:40:14,311 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:40:14" (1/1) ... [2022-01-19 00:40:14,347 INFO L137 Inliner]: procedures = 23, calls = 34, calls flagged for inlining = 12, calls inlined = 22, statements flattened = 254 [2022-01-19 00:40:14,347 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-19 00:40:14,348 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-19 00:40:14,348 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-19 00:40:14,348 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-19 00:40:14,355 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:40:14" (1/1) ... [2022-01-19 00:40:14,355 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:40:14" (1/1) ... [2022-01-19 00:40:14,371 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:40:14" (1/1) ... [2022-01-19 00:40:14,372 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:40:14" (1/1) ... [2022-01-19 00:40:14,377 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:40:14" (1/1) ... [2022-01-19 00:40:14,379 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:40:14" (1/1) ... [2022-01-19 00:40:14,381 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:40:14" (1/1) ... [2022-01-19 00:40:14,388 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-19 00:40:14,388 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-19 00:40:14,388 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-19 00:40:14,389 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-19 00:40:14,393 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:40:14" (1/1) ... [2022-01-19 00:40:14,398 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 00:40:14,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 00:40:14,418 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-19 00:40:14,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-19 00:40:14,447 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-19 00:40:14,447 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-01-19 00:40:14,447 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-01-19 00:40:14,447 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-01-19 00:40:14,447 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-01-19 00:40:14,447 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-01-19 00:40:14,448 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-01-19 00:40:14,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-19 00:40:14,448 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-19 00:40:14,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-19 00:40:14,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-19 00:40:14,448 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-19 00:40:14,448 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-19 00:40:14,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-19 00:40:14,449 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-19 00:40:14,526 INFO L234 CfgBuilder]: Building ICFG [2022-01-19 00:40:14,527 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-19 00:40:14,889 INFO L275 CfgBuilder]: Performing block encoding [2022-01-19 00:40:14,901 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-19 00:40:14,902 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-01-19 00:40:14,904 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 12:40:14 BoogieIcfgContainer [2022-01-19 00:40:14,904 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-19 00:40:14,908 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-19 00:40:14,908 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-19 00:40:14,910 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-19 00:40:14,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.01 12:40:14" (1/3) ... [2022-01-19 00:40:14,911 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13d2a41b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 12:40:14, skipping insertion in model container [2022-01-19 00:40:14,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:40:14" (2/3) ... [2022-01-19 00:40:14,911 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13d2a41b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 12:40:14, skipping insertion in model container [2022-01-19 00:40:14,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 12:40:14" (3/3) ... [2022-01-19 00:40:14,913 INFO L111 eAbstractionObserver]: Analyzing ICFG chl-match-subst.wvr.c [2022-01-19 00:40:14,916 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-19 00:40:14,916 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-19 00:40:14,917 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-19 00:40:14,972 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:14,972 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:14,973 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:14,973 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:14,973 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:14,973 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:14,973 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:14,973 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:14,973 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:14,974 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:14,974 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:14,974 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:14,974 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:14,974 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:14,974 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:14,974 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:14,975 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:14,975 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:14,975 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:14,975 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:14,975 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:14,983 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:14,983 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:14,983 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:14,984 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:14,984 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:14,984 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:14,984 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:14,984 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:14,984 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:14,985 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:14,985 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:14,985 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:14,985 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:14,985 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:14,985 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:14,985 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:14,986 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:14,986 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:14,986 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:14,987 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:14,987 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:14,987 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:14,987 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:14,987 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:14,987 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:14,987 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:14,987 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:14,988 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:14,988 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:14,988 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:14,988 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:14,988 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:14,988 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:14,989 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:14,989 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:14,989 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:14,989 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:14,991 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:14,991 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:14,992 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:14,995 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:14,996 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:14,996 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~s1~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:14,996 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:14,996 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~s1~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:14,996 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:14,996 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:14,996 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:14,996 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:14,997 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:14,997 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:14,997 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:14,997 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:14,997 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:14,997 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:14,997 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:14,997 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:14,998 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:14,998 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:14,998 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:14,998 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:14,998 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:14,998 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:14,998 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:14,998 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:14,999 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:14,999 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:14,999 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:14,999 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:14,999 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,000 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,000 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,000 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,000 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,000 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,001 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,001 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,001 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,001 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,001 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,001 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,002 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,002 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,002 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,002 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,002 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,003 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,003 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,003 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,003 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,003 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,003 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,004 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,004 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,004 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,004 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,004 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,004 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,004 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,005 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,005 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,005 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,005 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,005 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,005 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,006 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,006 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,006 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,006 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,007 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,007 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~s2~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,007 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,007 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~s2~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,007 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,008 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,008 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,008 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,009 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,009 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,009 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,009 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,009 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~s2~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,009 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~s1~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,010 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~s2~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,010 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~s1~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,010 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~s2~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,010 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~s1~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,010 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~s2~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,010 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~s1~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,011 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,011 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,011 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,011 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,011 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,011 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,011 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,012 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,012 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~s2~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,012 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~s1~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,012 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~s2~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,012 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~s1~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,012 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~s2~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,013 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~s1~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,013 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~s2~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,013 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~s1~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,013 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,013 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,013 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,014 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,014 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,014 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,014 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,014 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,014 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,014 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,015 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,015 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,015 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,015 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,015 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,015 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,015 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,016 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,016 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,016 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,016 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,016 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,017 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,017 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,017 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,017 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,018 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,018 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,018 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,018 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,018 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,018 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,019 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,019 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,019 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,019 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,019 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,019 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,019 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,020 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,020 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,020 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,020 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,020 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,021 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,021 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,021 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,021 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,021 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,021 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,022 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,022 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,022 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,022 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,022 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,022 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,023 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,023 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,023 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,023 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,023 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,023 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,024 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,024 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,024 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,024 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,024 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,024 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,025 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,025 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,025 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,025 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,025 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,025 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,026 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,026 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,026 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,026 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,026 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,026 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,027 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,027 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,027 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,031 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,033 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,033 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~s1~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,034 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,034 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~s1~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,034 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,034 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,035 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,035 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,035 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,035 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,035 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,035 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,036 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,036 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,036 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,036 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,036 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,036 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,036 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,036 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,037 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,037 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,037 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,037 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,037 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,037 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,037 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,038 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,038 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,038 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,040 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,040 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,040 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,040 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,040 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,041 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,041 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,041 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,041 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,041 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,042 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,042 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,042 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,043 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,043 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,043 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,043 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,043 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,043 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,044 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,044 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,044 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,044 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,044 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,045 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,045 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,046 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,051 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,051 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,051 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,051 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,052 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,052 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,052 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,052 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,052 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,052 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,054 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,057 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,057 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~s2~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,057 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,057 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~s2~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,058 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,058 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,058 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,059 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,059 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,059 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,059 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,060 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,060 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~s2~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,060 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~s1~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,060 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~s2~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,061 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~s1~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,061 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~s2~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,061 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~s1~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,061 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~s2~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,061 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~s1~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,061 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,062 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,062 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,062 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,062 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,062 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,062 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,062 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,063 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~s2~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,063 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~s1~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,063 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~s2~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,063 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~s1~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,063 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~s2~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,064 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~s1~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,064 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~s2~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,064 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~s1~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,064 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,064 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,064 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,065 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,065 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,065 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,065 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,065 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,065 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,066 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,066 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,066 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,066 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,066 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,066 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,066 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,066 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,067 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,067 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,067 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,067 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,067 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,070 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,070 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,070 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,070 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,071 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,071 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,071 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,071 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,071 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,071 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,071 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,072 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,072 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,072 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,072 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,072 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,072 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,072 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,073 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,073 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,073 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,073 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,073 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,074 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,074 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,074 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,074 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,074 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,074 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,074 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,075 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,075 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,075 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,075 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,075 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,075 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,075 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,076 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,076 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,076 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,076 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,076 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,077 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,077 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,077 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,077 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,077 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,077 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,078 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,078 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,078 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,078 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,078 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,078 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,078 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,079 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,079 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,079 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,082 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,082 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,083 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,083 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,090 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,090 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~s1~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,090 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,090 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~s1~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,091 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,091 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,091 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,091 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,091 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,091 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,092 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,092 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,092 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,092 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,092 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,092 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,092 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,093 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,093 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,093 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,093 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,093 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,093 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,093 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,093 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,094 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,094 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,094 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,094 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,094 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,095 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,095 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,095 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,095 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,095 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,095 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,095 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,095 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,096 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,100 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,103 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,103 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,103 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,104 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,104 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,104 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,104 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,104 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,104 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,104 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,104 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,105 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,105 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,105 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,105 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,105 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,105 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,105 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,105 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,106 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,106 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,106 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,106 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,106 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,106 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,106 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,106 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,107 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,107 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,107 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~s2~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,107 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,107 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~s2~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,107 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,108 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,108 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,108 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,108 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,108 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,108 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,109 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,109 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~s2~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,109 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~s1~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,109 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~s2~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,109 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~s1~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,109 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~s2~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,109 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~s1~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,109 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~s2~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,110 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~s1~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,110 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,110 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,110 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,110 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,110 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,110 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,110 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,111 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,111 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~s2~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,111 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~s1~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,111 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~s2~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,111 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~s1~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,111 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~s2~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,111 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~s1~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,111 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~s2~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,112 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~s1~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,112 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,112 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,112 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,112 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,112 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,112 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,112 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,113 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,113 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,113 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,113 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,113 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,113 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,113 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,113 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,113 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,114 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,114 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,114 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,114 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,114 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,114 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,128 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,129 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,129 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,129 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,129 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~s1~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,129 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,129 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,129 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,129 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,130 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~s2~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,130 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ite11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,130 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,130 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,130 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,130 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,130 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,131 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~ret8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,134 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,134 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,137 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,137 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,137 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite16#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,137 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,138 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite18#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,138 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,138 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,138 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~s1~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,138 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_~s2~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,138 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,139 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,139 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,139 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,139 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ite17#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,139 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~ret13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,140 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,140 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,140 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~s2~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,140 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,140 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,140 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,141 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_~s1~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,141 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,141 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ret2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,142 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,142 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,142 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,142 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,143 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,143 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,143 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,143 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 00:40:15,146 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-01-19 00:40:15,184 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 00:40:15,190 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-19 00:40:15,190 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-01-19 00:40:15,202 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 333 places, 349 transitions, 722 flow [2022-01-19 00:40:15,344 INFO L129 PetriNetUnfolder]: 26/346 cut-off events. [2022-01-19 00:40:15,344 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-01-19 00:40:15,358 INFO L84 FinitePrefix]: Finished finitePrefix Result has 359 conditions, 346 events. 26/346 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 633 event pairs, 0 based on Foata normal form. 0/319 useless extension candidates. Maximal degree in co-relation 256. Up to 2 conditions per place. [2022-01-19 00:40:15,359 INFO L82 GeneralOperation]: Start removeDead. Operand has 333 places, 349 transitions, 722 flow [2022-01-19 00:40:15,372 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 319 places, 335 transitions, 688 flow [2022-01-19 00:40:15,468 INFO L129 PetriNetUnfolder]: 26/334 cut-off events. [2022-01-19 00:40:15,468 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-01-19 00:40:15,468 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:40:15,470 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:40:15,470 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:40:15,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:40:15,477 INFO L85 PathProgramCache]: Analyzing trace with hash -742994273, now seen corresponding path program 1 times [2022-01-19 00:40:15,483 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:40:15,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350638048] [2022-01-19 00:40:15,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:40:15,484 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:40:15,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:40:16,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:40:16,054 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:40:16,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350638048] [2022-01-19 00:40:16,055 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350638048] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:40:16,055 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:40:16,055 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 00:40:16,056 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902314245] [2022-01-19 00:40:16,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:40:16,068 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 00:40:16,068 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:40:16,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 00:40:16,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-19 00:40:16,104 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 313 out of 349 [2022-01-19 00:40:16,112 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 335 transitions, 688 flow. Second operand has 6 states, 6 states have (on average 316.0) internal successors, (1896), 6 states have internal predecessors, (1896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:16,112 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:40:16,112 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 313 of 349 [2022-01-19 00:40:16,113 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:40:16,332 INFO L129 PetriNetUnfolder]: 31/543 cut-off events. [2022-01-19 00:40:16,333 INFO L130 PetriNetUnfolder]: For 33/39 co-relation queries the response was YES. [2022-01-19 00:40:16,338 INFO L84 FinitePrefix]: Finished finitePrefix Result has 638 conditions, 543 events. 31/543 cut-off events. For 33/39 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1602 event pairs, 6 based on Foata normal form. 77/572 useless extension candidates. Maximal degree in co-relation 509. Up to 31 conditions per place. [2022-01-19 00:40:16,342 INFO L132 encePairwiseOnDemand]: 327/349 looper letters, 26 selfloop transitions, 3 changer transitions 7/336 dead transitions. [2022-01-19 00:40:16,342 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 336 transitions, 789 flow [2022-01-19 00:40:16,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-19 00:40:16,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-01-19 00:40:16,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 2580 transitions. [2022-01-19 00:40:16,365 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9240687679083095 [2022-01-19 00:40:16,366 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 2580 transitions. [2022-01-19 00:40:16,366 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 2580 transitions. [2022-01-19 00:40:16,377 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:40:16,379 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 2580 transitions. [2022-01-19 00:40:16,388 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 322.5) internal successors, (2580), 8 states have internal predecessors, (2580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:16,402 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 349.0) internal successors, (3141), 9 states have internal predecessors, (3141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:16,403 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 349.0) internal successors, (3141), 9 states have internal predecessors, (3141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:16,405 INFO L186 Difference]: Start difference. First operand has 319 places, 335 transitions, 688 flow. Second operand 8 states and 2580 transitions. [2022-01-19 00:40:16,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 336 transitions, 789 flow [2022-01-19 00:40:16,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 336 transitions, 759 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-01-19 00:40:16,415 INFO L242 Difference]: Finished difference. Result has 325 places, 321 transitions, 669 flow [2022-01-19 00:40:16,417 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=648, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=321, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=318, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=669, PETRI_PLACES=325, PETRI_TRANSITIONS=321} [2022-01-19 00:40:16,420 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 6 predicate places. [2022-01-19 00:40:16,420 INFO L470 AbstractCegarLoop]: Abstraction has has 325 places, 321 transitions, 669 flow [2022-01-19 00:40:16,421 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 316.0) internal successors, (1896), 6 states have internal predecessors, (1896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:16,421 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:40:16,422 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:40:16,422 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-19 00:40:16,422 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:40:16,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:40:16,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1186332343, now seen corresponding path program 1 times [2022-01-19 00:40:16,423 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:40:16,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828860250] [2022-01-19 00:40:16,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:40:16,423 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:40:16,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:40:16,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:40:16,594 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:40:16,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828860250] [2022-01-19 00:40:16,594 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828860250] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:40:16,594 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:40:16,594 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 00:40:16,594 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879002909] [2022-01-19 00:40:16,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:40:16,596 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 00:40:16,596 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:40:16,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 00:40:16,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-19 00:40:16,599 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 349 [2022-01-19 00:40:16,602 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 321 transitions, 669 flow. Second operand has 7 states, 7 states have (on average 312.85714285714283) internal successors, (2190), 7 states have internal predecessors, (2190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:16,602 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:40:16,602 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 349 [2022-01-19 00:40:16,602 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:40:16,888 INFO L129 PetriNetUnfolder]: 54/751 cut-off events. [2022-01-19 00:40:16,888 INFO L130 PetriNetUnfolder]: For 26/44 co-relation queries the response was YES. [2022-01-19 00:40:16,894 INFO L84 FinitePrefix]: Finished finitePrefix Result has 916 conditions, 751 events. 54/751 cut-off events. For 26/44 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 3042 event pairs, 18 based on Foata normal form. 1/683 useless extension candidates. Maximal degree in co-relation 893. Up to 64 conditions per place. [2022-01-19 00:40:16,897 INFO L132 encePairwiseOnDemand]: 341/349 looper letters, 33 selfloop transitions, 5 changer transitions 6/341 dead transitions. [2022-01-19 00:40:16,897 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 328 places, 341 transitions, 818 flow [2022-01-19 00:40:16,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-19 00:40:16,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-01-19 00:40:16,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2833 transitions. [2022-01-19 00:40:16,902 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9019420566698504 [2022-01-19 00:40:16,902 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2833 transitions. [2022-01-19 00:40:16,902 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2833 transitions. [2022-01-19 00:40:16,904 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:40:16,904 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2833 transitions. [2022-01-19 00:40:16,910 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 314.77777777777777) internal successors, (2833), 9 states have internal predecessors, (2833), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:16,915 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 349.0) internal successors, (3490), 10 states have internal predecessors, (3490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:16,917 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 349.0) internal successors, (3490), 10 states have internal predecessors, (3490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:16,917 INFO L186 Difference]: Start difference. First operand has 325 places, 321 transitions, 669 flow. Second operand 9 states and 2833 transitions. [2022-01-19 00:40:16,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 328 places, 341 transitions, 818 flow [2022-01-19 00:40:16,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 325 places, 341 transitions, 811 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-01-19 00:40:16,929 INFO L242 Difference]: Finished difference. Result has 332 places, 323 transitions, 697 flow [2022-01-19 00:40:16,929 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=664, PETRI_DIFFERENCE_MINUEND_PLACES=317, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=321, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=316, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=697, PETRI_PLACES=332, PETRI_TRANSITIONS=323} [2022-01-19 00:40:16,930 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 13 predicate places. [2022-01-19 00:40:16,930 INFO L470 AbstractCegarLoop]: Abstraction has has 332 places, 323 transitions, 697 flow [2022-01-19 00:40:16,931 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 312.85714285714283) internal successors, (2190), 7 states have internal predecessors, (2190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:16,931 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:40:16,931 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:40:16,932 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-19 00:40:16,932 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:40:16,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:40:16,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1589507655, now seen corresponding path program 1 times [2022-01-19 00:40:16,933 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:40:16,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066033437] [2022-01-19 00:40:16,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:40:16,933 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:40:17,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:40:17,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:40:17,167 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:40:17,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066033437] [2022-01-19 00:40:17,167 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066033437] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:40:17,167 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:40:17,167 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 00:40:17,167 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921164682] [2022-01-19 00:40:17,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:40:17,169 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 00:40:17,169 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:40:17,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 00:40:17,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-19 00:40:17,173 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 307 out of 349 [2022-01-19 00:40:17,176 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 323 transitions, 697 flow. Second operand has 8 states, 8 states have (on average 309.75) internal successors, (2478), 8 states have internal predecessors, (2478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:17,176 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:40:17,176 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 307 of 349 [2022-01-19 00:40:17,176 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:40:17,457 INFO L129 PetriNetUnfolder]: 67/775 cut-off events. [2022-01-19 00:40:17,457 INFO L130 PetriNetUnfolder]: For 51/77 co-relation queries the response was YES. [2022-01-19 00:40:17,464 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1041 conditions, 775 events. 67/775 cut-off events. For 51/77 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 3273 event pairs, 26 based on Foata normal form. 1/704 useless extension candidates. Maximal degree in co-relation 1013. Up to 84 conditions per place. [2022-01-19 00:40:17,468 INFO L132 encePairwiseOnDemand]: 338/349 looper letters, 41 selfloop transitions, 8 changer transitions 8/351 dead transitions. [2022-01-19 00:40:17,469 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 351 transitions, 904 flow [2022-01-19 00:40:17,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-19 00:40:17,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-01-19 00:40:17,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 3738 transitions. [2022-01-19 00:40:17,476 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8925501432664756 [2022-01-19 00:40:17,476 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 3738 transitions. [2022-01-19 00:40:17,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 3738 transitions. [2022-01-19 00:40:17,478 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:40:17,478 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 3738 transitions. [2022-01-19 00:40:17,487 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 311.5) internal successors, (3738), 12 states have internal predecessors, (3738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:17,493 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 349.0) internal successors, (4537), 13 states have internal predecessors, (4537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:17,495 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 349.0) internal successors, (4537), 13 states have internal predecessors, (4537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:17,495 INFO L186 Difference]: Start difference. First operand has 332 places, 323 transitions, 697 flow. Second operand 12 states and 3738 transitions. [2022-01-19 00:40:17,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 339 places, 351 transitions, 904 flow [2022-01-19 00:40:17,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 334 places, 351 transitions, 885 flow, removed 9 selfloop flow, removed 5 redundant places. [2022-01-19 00:40:17,502 INFO L242 Difference]: Finished difference. Result has 343 places, 325 transitions, 729 flow [2022-01-19 00:40:17,503 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=684, PETRI_DIFFERENCE_MINUEND_PLACES=323, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=323, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=315, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=729, PETRI_PLACES=343, PETRI_TRANSITIONS=325} [2022-01-19 00:40:17,503 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 24 predicate places. [2022-01-19 00:40:17,503 INFO L470 AbstractCegarLoop]: Abstraction has has 343 places, 325 transitions, 729 flow [2022-01-19 00:40:17,504 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 309.75) internal successors, (2478), 8 states have internal predecessors, (2478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:17,504 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:40:17,505 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:40:17,505 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-19 00:40:17,505 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:40:17,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:40:17,505 INFO L85 PathProgramCache]: Analyzing trace with hash -232079166, now seen corresponding path program 1 times [2022-01-19 00:40:17,506 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:40:17,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020448974] [2022-01-19 00:40:17,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:40:17,506 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:40:17,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:40:17,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:40:17,691 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:40:17,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020448974] [2022-01-19 00:40:17,691 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020448974] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:40:17,691 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:40:17,691 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-19 00:40:17,692 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669905949] [2022-01-19 00:40:17,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:40:17,692 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-19 00:40:17,693 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:40:17,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-19 00:40:17,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-01-19 00:40:17,699 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 304 out of 349 [2022-01-19 00:40:17,701 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 325 transitions, 729 flow. Second operand has 9 states, 9 states have (on average 306.6666666666667) internal successors, (2760), 9 states have internal predecessors, (2760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:17,702 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:40:17,702 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 304 of 349 [2022-01-19 00:40:17,702 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:40:18,026 INFO L129 PetriNetUnfolder]: 88/957 cut-off events. [2022-01-19 00:40:18,026 INFO L130 PetriNetUnfolder]: For 96/130 co-relation queries the response was YES. [2022-01-19 00:40:18,037 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1334 conditions, 957 events. 88/957 cut-off events. For 96/130 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 4751 event pairs, 36 based on Foata normal form. 1/868 useless extension candidates. Maximal degree in co-relation 1301. Up to 109 conditions per place. [2022-01-19 00:40:18,041 INFO L132 encePairwiseOnDemand]: 336/349 looper letters, 48 selfloop transitions, 10 changer transitions 10/359 dead transitions. [2022-01-19 00:40:18,041 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 350 places, 359 transitions, 984 flow [2022-01-19 00:40:18,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-19 00:40:18,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-01-19 00:40:18,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 4319 transitions. [2022-01-19 00:40:18,050 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8839541547277937 [2022-01-19 00:40:18,050 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 4319 transitions. [2022-01-19 00:40:18,050 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 4319 transitions. [2022-01-19 00:40:18,052 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:40:18,052 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 4319 transitions. [2022-01-19 00:40:18,108 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 308.5) internal successors, (4319), 14 states have internal predecessors, (4319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:18,114 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 349.0) internal successors, (5235), 15 states have internal predecessors, (5235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:18,115 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 349.0) internal successors, (5235), 15 states have internal predecessors, (5235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:18,116 INFO L186 Difference]: Start difference. First operand has 343 places, 325 transitions, 729 flow. Second operand 14 states and 4319 transitions. [2022-01-19 00:40:18,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 350 places, 359 transitions, 984 flow [2022-01-19 00:40:18,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 359 transitions, 950 flow, removed 16 selfloop flow, removed 7 redundant places. [2022-01-19 00:40:18,123 INFO L242 Difference]: Finished difference. Result has 354 places, 327 transitions, 760 flow [2022-01-19 00:40:18,123 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=705, PETRI_DIFFERENCE_MINUEND_PLACES=330, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=315, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=760, PETRI_PLACES=354, PETRI_TRANSITIONS=327} [2022-01-19 00:40:18,124 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 35 predicate places. [2022-01-19 00:40:18,124 INFO L470 AbstractCegarLoop]: Abstraction has has 354 places, 327 transitions, 760 flow [2022-01-19 00:40:18,125 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 306.6666666666667) internal successors, (2760), 9 states have internal predecessors, (2760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:18,125 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:40:18,125 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:40:18,125 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-19 00:40:18,126 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:40:18,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:40:18,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1840379948, now seen corresponding path program 1 times [2022-01-19 00:40:18,126 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:40:18,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248525054] [2022-01-19 00:40:18,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:40:18,127 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:40:18,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:40:18,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:40:18,257 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:40:18,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248525054] [2022-01-19 00:40:18,258 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248525054] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:40:18,258 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:40:18,258 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 00:40:18,258 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697462022] [2022-01-19 00:40:18,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:40:18,259 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 00:40:18,259 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:40:18,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 00:40:18,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-01-19 00:40:18,262 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 308 out of 349 [2022-01-19 00:40:18,264 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 354 places, 327 transitions, 760 flow. Second operand has 8 states, 8 states have (on average 310.75) internal successors, (2486), 8 states have internal predecessors, (2486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:18,264 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:40:18,264 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 308 of 349 [2022-01-19 00:40:18,264 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:40:18,558 INFO L129 PetriNetUnfolder]: 179/969 cut-off events. [2022-01-19 00:40:18,558 INFO L130 PetriNetUnfolder]: For 127/143 co-relation queries the response was YES. [2022-01-19 00:40:18,568 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1392 conditions, 969 events. 179/969 cut-off events. For 127/143 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 5687 event pairs, 66 based on Foata normal form. 5/899 useless extension candidates. Maximal degree in co-relation 1328. Up to 154 conditions per place. [2022-01-19 00:40:18,572 INFO L132 encePairwiseOnDemand]: 340/349 looper letters, 49 selfloop transitions, 3 changer transitions 26/381 dead transitions. [2022-01-19 00:40:18,572 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 381 transitions, 1058 flow [2022-01-19 00:40:18,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-19 00:40:18,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-01-19 00:40:18,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 4083 transitions. [2022-01-19 00:40:18,581 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.899933877011241 [2022-01-19 00:40:18,581 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 4083 transitions. [2022-01-19 00:40:18,581 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 4083 transitions. [2022-01-19 00:40:18,583 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:40:18,583 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 4083 transitions. [2022-01-19 00:40:18,591 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 314.0769230769231) internal successors, (4083), 13 states have internal predecessors, (4083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:18,598 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 349.0) internal successors, (4886), 14 states have internal predecessors, (4886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:18,599 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 349.0) internal successors, (4886), 14 states have internal predecessors, (4886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:18,599 INFO L186 Difference]: Start difference. First operand has 354 places, 327 transitions, 760 flow. Second operand 13 states and 4083 transitions. [2022-01-19 00:40:18,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 358 places, 381 transitions, 1058 flow [2022-01-19 00:40:18,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 349 places, 381 transitions, 1012 flow, removed 22 selfloop flow, removed 9 redundant places. [2022-01-19 00:40:18,606 INFO L242 Difference]: Finished difference. Result has 360 places, 329 transitions, 769 flow [2022-01-19 00:40:18,607 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=726, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=324, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=769, PETRI_PLACES=360, PETRI_TRANSITIONS=329} [2022-01-19 00:40:18,607 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 41 predicate places. [2022-01-19 00:40:18,607 INFO L470 AbstractCegarLoop]: Abstraction has has 360 places, 329 transitions, 769 flow [2022-01-19 00:40:18,608 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 310.75) internal successors, (2486), 8 states have internal predecessors, (2486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:18,608 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:40:18,609 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:40:18,609 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-19 00:40:18,609 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:40:18,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:40:18,609 INFO L85 PathProgramCache]: Analyzing trace with hash -27308194, now seen corresponding path program 2 times [2022-01-19 00:40:18,609 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:40:18,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519622438] [2022-01-19 00:40:18,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:40:18,610 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:40:18,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:40:18,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:40:18,736 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:40:18,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519622438] [2022-01-19 00:40:18,736 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519622438] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:40:18,736 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:40:18,736 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 00:40:18,736 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369996516] [2022-01-19 00:40:18,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:40:18,737 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 00:40:18,737 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:40:18,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 00:40:18,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-01-19 00:40:18,741 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 308 out of 349 [2022-01-19 00:40:18,743 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 329 transitions, 769 flow. Second operand has 8 states, 8 states have (on average 310.75) internal successors, (2486), 8 states have internal predecessors, (2486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:18,743 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:40:18,743 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 308 of 349 [2022-01-19 00:40:18,743 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:40:19,176 INFO L129 PetriNetUnfolder]: 255/1411 cut-off events. [2022-01-19 00:40:19,176 INFO L130 PetriNetUnfolder]: For 780/805 co-relation queries the response was YES. [2022-01-19 00:40:19,188 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2497 conditions, 1411 events. 255/1411 cut-off events. For 780/805 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 10442 event pairs, 130 based on Foata normal form. 1/1299 useless extension candidates. Maximal degree in co-relation 2451. Up to 257 conditions per place. [2022-01-19 00:40:19,195 INFO L132 encePairwiseOnDemand]: 340/349 looper letters, 56 selfloop transitions, 3 changer transitions 25/387 dead transitions. [2022-01-19 00:40:19,195 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 387 transitions, 1182 flow [2022-01-19 00:40:19,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-19 00:40:19,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-01-19 00:40:19,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 4081 transitions. [2022-01-19 00:40:19,203 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8994930570861803 [2022-01-19 00:40:19,203 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 4081 transitions. [2022-01-19 00:40:19,203 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 4081 transitions. [2022-01-19 00:40:19,205 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:40:19,205 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 4081 transitions. [2022-01-19 00:40:19,213 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 313.9230769230769) internal successors, (4081), 13 states have internal predecessors, (4081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:19,220 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 349.0) internal successors, (4886), 14 states have internal predecessors, (4886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:19,221 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 349.0) internal successors, (4886), 14 states have internal predecessors, (4886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:19,221 INFO L186 Difference]: Start difference. First operand has 360 places, 329 transitions, 769 flow. Second operand 13 states and 4081 transitions. [2022-01-19 00:40:19,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 387 transitions, 1182 flow [2022-01-19 00:40:19,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 387 transitions, 1140 flow, removed 19 selfloop flow, removed 7 redundant places. [2022-01-19 00:40:19,233 INFO L242 Difference]: Finished difference. Result has 368 places, 331 transitions, 803 flow [2022-01-19 00:40:19,233 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=756, PETRI_DIFFERENCE_MINUEND_PLACES=345, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=329, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=326, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=803, PETRI_PLACES=368, PETRI_TRANSITIONS=331} [2022-01-19 00:40:19,235 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 49 predicate places. [2022-01-19 00:40:19,235 INFO L470 AbstractCegarLoop]: Abstraction has has 368 places, 331 transitions, 803 flow [2022-01-19 00:40:19,236 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 310.75) internal successors, (2486), 8 states have internal predecessors, (2486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:19,236 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:40:19,236 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:40:19,236 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-19 00:40:19,236 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:40:19,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:40:19,237 INFO L85 PathProgramCache]: Analyzing trace with hash 157564496, now seen corresponding path program 3 times [2022-01-19 00:40:19,237 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:40:19,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496299734] [2022-01-19 00:40:19,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:40:19,238 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:40:19,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:40:19,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:40:19,369 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:40:19,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496299734] [2022-01-19 00:40:19,369 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496299734] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:40:19,369 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:40:19,369 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 00:40:19,369 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222462777] [2022-01-19 00:40:19,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:40:19,373 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 00:40:19,373 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:40:19,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 00:40:19,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-01-19 00:40:19,377 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 308 out of 349 [2022-01-19 00:40:19,378 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 331 transitions, 803 flow. Second operand has 8 states, 8 states have (on average 310.75) internal successors, (2486), 8 states have internal predecessors, (2486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:19,378 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:40:19,379 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 308 of 349 [2022-01-19 00:40:19,379 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:40:19,791 INFO L129 PetriNetUnfolder]: 270/1432 cut-off events. [2022-01-19 00:40:19,791 INFO L130 PetriNetUnfolder]: For 1504/1523 co-relation queries the response was YES. [2022-01-19 00:40:19,807 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2904 conditions, 1432 events. 270/1432 cut-off events. For 1504/1523 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 10660 event pairs, 163 based on Foata normal form. 1/1312 useless extension candidates. Maximal degree in co-relation 2853. Up to 350 conditions per place. [2022-01-19 00:40:19,814 INFO L132 encePairwiseOnDemand]: 340/349 looper letters, 38 selfloop transitions, 8 changer transitions 20/369 dead transitions. [2022-01-19 00:40:19,814 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 369 transitions, 1143 flow [2022-01-19 00:40:19,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-19 00:40:19,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-01-19 00:40:19,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 3759 transitions. [2022-01-19 00:40:19,821 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8975644699140402 [2022-01-19 00:40:19,821 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 3759 transitions. [2022-01-19 00:40:19,821 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 3759 transitions. [2022-01-19 00:40:19,823 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:40:19,824 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 3759 transitions. [2022-01-19 00:40:19,831 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 313.25) internal successors, (3759), 12 states have internal predecessors, (3759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:19,837 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 349.0) internal successors, (4537), 13 states have internal predecessors, (4537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:19,837 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 349.0) internal successors, (4537), 13 states have internal predecessors, (4537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:19,838 INFO L186 Difference]: Start difference. First operand has 368 places, 331 transitions, 803 flow. Second operand 12 states and 3759 transitions. [2022-01-19 00:40:19,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 371 places, 369 transitions, 1143 flow [2022-01-19 00:40:19,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 369 transitions, 1115 flow, removed 13 selfloop flow, removed 7 redundant places. [2022-01-19 00:40:19,850 INFO L242 Difference]: Finished difference. Result has 371 places, 338 transitions, 893 flow [2022-01-19 00:40:19,851 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=790, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=326, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=893, PETRI_PLACES=371, PETRI_TRANSITIONS=338} [2022-01-19 00:40:19,852 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 52 predicate places. [2022-01-19 00:40:19,852 INFO L470 AbstractCegarLoop]: Abstraction has has 371 places, 338 transitions, 893 flow [2022-01-19 00:40:19,853 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 310.75) internal successors, (2486), 8 states have internal predecessors, (2486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:19,853 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:40:19,853 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:40:19,853 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-19 00:40:19,854 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:40:19,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:40:19,854 INFO L85 PathProgramCache]: Analyzing trace with hash -2047788938, now seen corresponding path program 4 times [2022-01-19 00:40:19,854 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:40:19,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551136395] [2022-01-19 00:40:19,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:40:19,855 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:40:19,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:40:19,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:40:19,998 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:40:19,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551136395] [2022-01-19 00:40:19,999 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551136395] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:40:19,999 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:40:19,999 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 00:40:19,999 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189290705] [2022-01-19 00:40:19,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:40:20,000 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 00:40:20,000 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:40:20,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 00:40:20,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-01-19 00:40:20,013 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 308 out of 349 [2022-01-19 00:40:20,016 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 338 transitions, 893 flow. Second operand has 8 states, 8 states have (on average 310.75) internal successors, (2486), 8 states have internal predecessors, (2486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:20,016 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:40:20,016 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 308 of 349 [2022-01-19 00:40:20,016 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:40:20,460 INFO L129 PetriNetUnfolder]: 262/1412 cut-off events. [2022-01-19 00:40:20,460 INFO L130 PetriNetUnfolder]: For 1807/1837 co-relation queries the response was YES. [2022-01-19 00:40:20,477 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3015 conditions, 1412 events. 262/1412 cut-off events. For 1807/1837 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 10482 event pairs, 151 based on Foata normal form. 2/1297 useless extension candidates. Maximal degree in co-relation 2963. Up to 346 conditions per place. [2022-01-19 00:40:20,487 INFO L132 encePairwiseOnDemand]: 340/349 looper letters, 38 selfloop transitions, 12 changer transitions 19/372 dead transitions. [2022-01-19 00:40:20,487 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 372 transitions, 1231 flow [2022-01-19 00:40:20,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-19 00:40:20,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-01-19 00:40:20,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 3450 transitions. [2022-01-19 00:40:20,494 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8986715290440219 [2022-01-19 00:40:20,494 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 3450 transitions. [2022-01-19 00:40:20,494 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 3450 transitions. [2022-01-19 00:40:20,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:40:20,496 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 3450 transitions. [2022-01-19 00:40:20,502 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 313.6363636363636) internal successors, (3450), 11 states have internal predecessors, (3450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:20,508 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 349.0) internal successors, (4188), 12 states have internal predecessors, (4188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:20,509 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 349.0) internal successors, (4188), 12 states have internal predecessors, (4188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:20,509 INFO L186 Difference]: Start difference. First operand has 371 places, 338 transitions, 893 flow. Second operand 11 states and 3450 transitions. [2022-01-19 00:40:20,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 372 transitions, 1231 flow [2022-01-19 00:40:20,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 372 places, 372 transitions, 1209 flow, removed 11 selfloop flow, removed 3 redundant places. [2022-01-19 00:40:20,523 INFO L242 Difference]: Finished difference. Result has 380 places, 343 transitions, 984 flow [2022-01-19 00:40:20,524 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=875, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=328, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=984, PETRI_PLACES=380, PETRI_TRANSITIONS=343} [2022-01-19 00:40:20,526 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 61 predicate places. [2022-01-19 00:40:20,526 INFO L470 AbstractCegarLoop]: Abstraction has has 380 places, 343 transitions, 984 flow [2022-01-19 00:40:20,527 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 310.75) internal successors, (2486), 8 states have internal predecessors, (2486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:20,527 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:40:20,527 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:40:20,527 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-19 00:40:20,527 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:40:20,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:40:20,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1545102218, now seen corresponding path program 5 times [2022-01-19 00:40:20,528 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:40:20,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653710220] [2022-01-19 00:40:20,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:40:20,528 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:40:20,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:40:20,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:40:20,673 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:40:20,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653710220] [2022-01-19 00:40:20,673 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653710220] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:40:20,674 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:40:20,674 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 00:40:20,674 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117010570] [2022-01-19 00:40:20,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:40:20,675 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 00:40:20,675 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:40:20,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 00:40:20,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-01-19 00:40:20,678 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 308 out of 349 [2022-01-19 00:40:20,680 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 343 transitions, 984 flow. Second operand has 8 states, 8 states have (on average 310.75) internal successors, (2486), 8 states have internal predecessors, (2486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:20,680 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:40:20,680 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 308 of 349 [2022-01-19 00:40:20,680 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:40:21,095 INFO L129 PetriNetUnfolder]: 247/1398 cut-off events. [2022-01-19 00:40:21,095 INFO L130 PetriNetUnfolder]: For 2357/2376 co-relation queries the response was YES. [2022-01-19 00:40:21,113 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3115 conditions, 1398 events. 247/1398 cut-off events. For 2357/2376 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 10446 event pairs, 155 based on Foata normal form. 1/1283 useless extension candidates. Maximal degree in co-relation 3057. Up to 347 conditions per place. [2022-01-19 00:40:21,119 INFO L132 encePairwiseOnDemand]: 340/349 looper letters, 36 selfloop transitions, 4 changer transitions 26/369 dead transitions. [2022-01-19 00:40:21,119 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 385 places, 369 transitions, 1263 flow [2022-01-19 00:40:21,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-19 00:40:21,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-01-19 00:40:21,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 3446 transitions. [2022-01-19 00:40:21,128 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8976295910393332 [2022-01-19 00:40:21,128 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 3446 transitions. [2022-01-19 00:40:21,128 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 3446 transitions. [2022-01-19 00:40:21,130 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:40:21,130 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 3446 transitions. [2022-01-19 00:40:21,139 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 313.27272727272725) internal successors, (3446), 11 states have internal predecessors, (3446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:21,146 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 349.0) internal successors, (4188), 12 states have internal predecessors, (4188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:21,147 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 349.0) internal successors, (4188), 12 states have internal predecessors, (4188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:21,147 INFO L186 Difference]: Start difference. First operand has 380 places, 343 transitions, 984 flow. Second operand 11 states and 3446 transitions. [2022-01-19 00:40:21,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 385 places, 369 transitions, 1263 flow [2022-01-19 00:40:21,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 380 places, 369 transitions, 1220 flow, removed 17 selfloop flow, removed 5 redundant places. [2022-01-19 00:40:21,161 INFO L242 Difference]: Finished difference. Result has 385 places, 337 transitions, 898 flow [2022-01-19 00:40:21,161 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=947, PETRI_DIFFERENCE_MINUEND_PLACES=370, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=343, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=339, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=898, PETRI_PLACES=385, PETRI_TRANSITIONS=337} [2022-01-19 00:40:21,162 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 66 predicate places. [2022-01-19 00:40:21,162 INFO L470 AbstractCegarLoop]: Abstraction has has 385 places, 337 transitions, 898 flow [2022-01-19 00:40:21,163 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 310.75) internal successors, (2486), 8 states have internal predecessors, (2486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:21,163 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:40:21,163 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:40:21,163 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-19 00:40:21,164 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:40:21,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:40:21,164 INFO L85 PathProgramCache]: Analyzing trace with hash 2112607538, now seen corresponding path program 6 times [2022-01-19 00:40:21,164 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:40:21,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57115779] [2022-01-19 00:40:21,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:40:21,165 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:40:21,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:40:21,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:40:21,308 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:40:21,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57115779] [2022-01-19 00:40:21,308 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57115779] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:40:21,309 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:40:21,309 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 00:40:21,309 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267341082] [2022-01-19 00:40:21,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:40:21,310 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 00:40:21,310 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:40:21,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 00:40:21,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-01-19 00:40:21,314 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 308 out of 349 [2022-01-19 00:40:21,315 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 385 places, 337 transitions, 898 flow. Second operand has 8 states, 8 states have (on average 310.75) internal successors, (2486), 8 states have internal predecessors, (2486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:21,316 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:40:21,316 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 308 of 349 [2022-01-19 00:40:21,316 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:40:21,684 INFO L129 PetriNetUnfolder]: 221/1226 cut-off events. [2022-01-19 00:40:21,685 INFO L130 PetriNetUnfolder]: For 2122/2146 co-relation queries the response was YES. [2022-01-19 00:40:21,699 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2672 conditions, 1226 events. 221/1226 cut-off events. For 2122/2146 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 8559 event pairs, 145 based on Foata normal form. 2/1121 useless extension candidates. Maximal degree in co-relation 2618. Up to 300 conditions per place. [2022-01-19 00:40:21,704 INFO L132 encePairwiseOnDemand]: 340/349 looper letters, 31 selfloop transitions, 2 changer transitions 28/364 dead transitions. [2022-01-19 00:40:21,704 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 385 places, 364 transitions, 1162 flow [2022-01-19 00:40:21,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-19 00:40:21,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-01-19 00:40:21,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 3756 transitions. [2022-01-19 00:40:21,711 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8968481375358166 [2022-01-19 00:40:21,711 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 3756 transitions. [2022-01-19 00:40:21,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 3756 transitions. [2022-01-19 00:40:21,712 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:40:21,713 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 3756 transitions. [2022-01-19 00:40:21,718 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 313.0) internal successors, (3756), 12 states have internal predecessors, (3756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:21,724 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 349.0) internal successors, (4537), 13 states have internal predecessors, (4537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:21,725 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 349.0) internal successors, (4537), 13 states have internal predecessors, (4537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:21,725 INFO L186 Difference]: Start difference. First operand has 385 places, 337 transitions, 898 flow. Second operand 12 states and 3756 transitions. [2022-01-19 00:40:21,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 385 places, 364 transitions, 1162 flow [2022-01-19 00:40:21,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 364 transitions, 1112 flow, removed 16 selfloop flow, removed 11 redundant places. [2022-01-19 00:40:21,738 INFO L242 Difference]: Finished difference. Result has 380 places, 331 transitions, 826 flow [2022-01-19 00:40:21,739 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=868, PETRI_DIFFERENCE_MINUEND_PLACES=363, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=337, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=335, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=826, PETRI_PLACES=380, PETRI_TRANSITIONS=331} [2022-01-19 00:40:21,740 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 61 predicate places. [2022-01-19 00:40:21,740 INFO L470 AbstractCegarLoop]: Abstraction has has 380 places, 331 transitions, 826 flow [2022-01-19 00:40:21,741 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 310.75) internal successors, (2486), 8 states have internal predecessors, (2486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:21,741 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:40:21,741 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:40:21,741 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-19 00:40:21,741 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:40:21,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:40:21,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1595665028, now seen corresponding path program 1 times [2022-01-19 00:40:21,742 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:40:21,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265640333] [2022-01-19 00:40:21,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:40:21,744 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:40:21,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:40:21,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:40:21,814 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:40:21,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265640333] [2022-01-19 00:40:21,814 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265640333] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:40:21,814 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:40:21,814 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 00:40:21,814 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399214479] [2022-01-19 00:40:21,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:40:21,815 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 00:40:21,815 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:40:21,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 00:40:21,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 00:40:21,817 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 349 [2022-01-19 00:40:21,818 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 331 transitions, 826 flow. Second operand has 4 states, 4 states have (on average 314.25) internal successors, (1257), 4 states have internal predecessors, (1257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:21,818 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:40:21,818 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 349 [2022-01-19 00:40:21,818 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:40:22,432 INFO L129 PetriNetUnfolder]: 560/3302 cut-off events. [2022-01-19 00:40:22,432 INFO L130 PetriNetUnfolder]: For 2780/2878 co-relation queries the response was YES. [2022-01-19 00:40:22,467 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5970 conditions, 3302 events. 560/3302 cut-off events. For 2780/2878 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 29590 event pairs, 318 based on Foata normal form. 7/2795 useless extension candidates. Maximal degree in co-relation 5917. Up to 427 conditions per place. [2022-01-19 00:40:22,477 INFO L132 encePairwiseOnDemand]: 345/349 looper letters, 37 selfloop transitions, 2 changer transitions 4/348 dead transitions. [2022-01-19 00:40:22,477 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 348 transitions, 949 flow [2022-01-19 00:40:22,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-19 00:40:22,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-01-19 00:40:22,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1283 transitions. [2022-01-19 00:40:22,479 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.919054441260745 [2022-01-19 00:40:22,479 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1283 transitions. [2022-01-19 00:40:22,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1283 transitions. [2022-01-19 00:40:22,480 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:40:22,480 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1283 transitions. [2022-01-19 00:40:22,481 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 320.75) internal successors, (1283), 4 states have internal predecessors, (1283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:22,483 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 349.0) internal successors, (1745), 5 states have internal predecessors, (1745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:22,484 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 349.0) internal successors, (1745), 5 states have internal predecessors, (1745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:22,484 INFO L186 Difference]: Start difference. First operand has 380 places, 331 transitions, 826 flow. Second operand 4 states and 1283 transitions. [2022-01-19 00:40:22,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 371 places, 348 transitions, 949 flow [2022-01-19 00:40:22,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 348 transitions, 921 flow, removed 10 selfloop flow, removed 13 redundant places. [2022-01-19 00:40:22,511 INFO L242 Difference]: Finished difference. Result has 360 places, 330 transitions, 803 flow [2022-01-19 00:40:22,512 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=798, PETRI_DIFFERENCE_MINUEND_PLACES=355, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=329, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=803, PETRI_PLACES=360, PETRI_TRANSITIONS=330} [2022-01-19 00:40:22,512 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 41 predicate places. [2022-01-19 00:40:22,512 INFO L470 AbstractCegarLoop]: Abstraction has has 360 places, 330 transitions, 803 flow [2022-01-19 00:40:22,513 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 314.25) internal successors, (1257), 4 states have internal predecessors, (1257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:22,513 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:40:22,513 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:40:22,513 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-19 00:40:22,513 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:40:22,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:40:22,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1521460524, now seen corresponding path program 2 times [2022-01-19 00:40:22,514 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:40:22,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248022335] [2022-01-19 00:40:22,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:40:22,514 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:40:22,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:40:22,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:40:22,580 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:40:22,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248022335] [2022-01-19 00:40:22,580 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248022335] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:40:22,580 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:40:22,580 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 00:40:22,580 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367060631] [2022-01-19 00:40:22,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:40:22,581 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 00:40:22,581 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:40:22,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 00:40:22,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 00:40:22,583 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 349 [2022-01-19 00:40:22,584 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 330 transitions, 803 flow. Second operand has 4 states, 4 states have (on average 314.25) internal successors, (1257), 4 states have internal predecessors, (1257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:22,584 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:40:22,584 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 349 [2022-01-19 00:40:22,584 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:40:23,188 INFO L129 PetriNetUnfolder]: 477/3426 cut-off events. [2022-01-19 00:40:23,188 INFO L130 PetriNetUnfolder]: For 1643/1728 co-relation queries the response was YES. [2022-01-19 00:40:23,223 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6146 conditions, 3426 events. 477/3426 cut-off events. For 1643/1728 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 32829 event pairs, 140 based on Foata normal form. 16/3146 useless extension candidates. Maximal degree in co-relation 5362. Up to 314 conditions per place. [2022-01-19 00:40:23,234 INFO L132 encePairwiseOnDemand]: 341/349 looper letters, 47 selfloop transitions, 8 changer transitions 1/361 dead transitions. [2022-01-19 00:40:23,234 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 361 transitions, 1003 flow [2022-01-19 00:40:23,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 00:40:23,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 00:40:23,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1607 transitions. [2022-01-19 00:40:23,236 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9209169054441261 [2022-01-19 00:40:23,236 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1607 transitions. [2022-01-19 00:40:23,237 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1607 transitions. [2022-01-19 00:40:23,237 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:40:23,237 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1607 transitions. [2022-01-19 00:40:23,239 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 321.4) internal successors, (1607), 5 states have internal predecessors, (1607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:23,241 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 349.0) internal successors, (2094), 6 states have internal predecessors, (2094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:23,242 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 349.0) internal successors, (2094), 6 states have internal predecessors, (2094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:23,242 INFO L186 Difference]: Start difference. First operand has 360 places, 330 transitions, 803 flow. Second operand 5 states and 1607 transitions. [2022-01-19 00:40:23,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 361 transitions, 1003 flow [2022-01-19 00:40:23,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 361 transitions, 997 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-01-19 00:40:23,259 INFO L242 Difference]: Finished difference. Result has 360 places, 337 transitions, 864 flow [2022-01-19 00:40:23,260 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=798, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=330, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=324, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=864, PETRI_PLACES=360, PETRI_TRANSITIONS=337} [2022-01-19 00:40:23,260 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 41 predicate places. [2022-01-19 00:40:23,260 INFO L470 AbstractCegarLoop]: Abstraction has has 360 places, 337 transitions, 864 flow [2022-01-19 00:40:23,261 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 314.25) internal successors, (1257), 4 states have internal predecessors, (1257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:23,261 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:40:23,261 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:40:23,261 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-19 00:40:23,261 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:40:23,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:40:23,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1161190256, now seen corresponding path program 3 times [2022-01-19 00:40:23,262 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:40:23,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622448283] [2022-01-19 00:40:23,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:40:23,262 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:40:23,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:40:23,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:40:23,314 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:40:23,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622448283] [2022-01-19 00:40:23,315 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622448283] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:40:23,315 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:40:23,315 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 00:40:23,315 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564507327] [2022-01-19 00:40:23,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:40:23,316 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 00:40:23,316 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:40:23,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 00:40:23,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 00:40:23,318 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 349 [2022-01-19 00:40:23,319 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 337 transitions, 864 flow. Second operand has 4 states, 4 states have (on average 314.25) internal successors, (1257), 4 states have internal predecessors, (1257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:23,319 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:40:23,319 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 349 [2022-01-19 00:40:23,319 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:40:24,110 INFO L129 PetriNetUnfolder]: 619/4557 cut-off events. [2022-01-19 00:40:24,111 INFO L130 PetriNetUnfolder]: For 3052/3180 co-relation queries the response was YES. [2022-01-19 00:40:24,151 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8185 conditions, 4557 events. 619/4557 cut-off events. For 3052/3180 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 45101 event pairs, 408 based on Foata normal form. 14/4147 useless extension candidates. Maximal degree in co-relation 6982. Up to 475 conditions per place. [2022-01-19 00:40:24,168 INFO L132 encePairwiseOnDemand]: 345/349 looper letters, 45 selfloop transitions, 4 changer transitions 1/355 dead transitions. [2022-01-19 00:40:24,168 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 355 transitions, 1036 flow [2022-01-19 00:40:24,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-19 00:40:24,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-01-19 00:40:24,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1282 transitions. [2022-01-19 00:40:24,171 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9183381088825215 [2022-01-19 00:40:24,171 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1282 transitions. [2022-01-19 00:40:24,171 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1282 transitions. [2022-01-19 00:40:24,171 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:40:24,171 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1282 transitions. [2022-01-19 00:40:24,175 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 320.5) internal successors, (1282), 4 states have internal predecessors, (1282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:24,176 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 349.0) internal successors, (1745), 5 states have internal predecessors, (1745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:24,177 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 349.0) internal successors, (1745), 5 states have internal predecessors, (1745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:24,177 INFO L186 Difference]: Start difference. First operand has 360 places, 337 transitions, 864 flow. Second operand 4 states and 1282 transitions. [2022-01-19 00:40:24,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 355 transitions, 1036 flow [2022-01-19 00:40:24,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 355 transitions, 1026 flow, removed 5 selfloop flow, removed 0 redundant places. [2022-01-19 00:40:24,193 INFO L242 Difference]: Finished difference. Result has 365 places, 338 transitions, 883 flow [2022-01-19 00:40:24,193 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=858, PETRI_DIFFERENCE_MINUEND_PLACES=360, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=337, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=333, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=883, PETRI_PLACES=365, PETRI_TRANSITIONS=338} [2022-01-19 00:40:24,194 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 46 predicate places. [2022-01-19 00:40:24,194 INFO L470 AbstractCegarLoop]: Abstraction has has 365 places, 338 transitions, 883 flow [2022-01-19 00:40:24,195 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 314.25) internal successors, (1257), 4 states have internal predecessors, (1257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:24,195 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:40:24,195 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:40:24,195 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-19 00:40:24,195 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:40:24,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:40:24,196 INFO L85 PathProgramCache]: Analyzing trace with hash -773437546, now seen corresponding path program 4 times [2022-01-19 00:40:24,196 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:40:24,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704469731] [2022-01-19 00:40:24,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:40:24,196 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:40:24,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:40:24,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:40:24,271 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:40:24,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704469731] [2022-01-19 00:40:24,271 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704469731] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:40:24,271 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:40:24,271 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 00:40:24,271 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071278419] [2022-01-19 00:40:24,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:40:24,272 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 00:40:24,272 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:40:24,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 00:40:24,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 00:40:24,274 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 349 [2022-01-19 00:40:24,275 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 338 transitions, 883 flow. Second operand has 4 states, 4 states have (on average 314.25) internal successors, (1257), 4 states have internal predecessors, (1257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:24,275 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:40:24,275 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 349 [2022-01-19 00:40:24,275 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:40:25,052 INFO L129 PetriNetUnfolder]: 547/4175 cut-off events. [2022-01-19 00:40:25,053 INFO L130 PetriNetUnfolder]: For 3851/3952 co-relation queries the response was YES. [2022-01-19 00:40:25,092 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8323 conditions, 4175 events. 547/4175 cut-off events. For 3851/3952 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 42253 event pairs, 246 based on Foata normal form. 24/3952 useless extension candidates. Maximal degree in co-relation 7106. Up to 361 conditions per place. [2022-01-19 00:40:25,104 INFO L132 encePairwiseOnDemand]: 341/349 looper letters, 48 selfloop transitions, 12 changer transitions 5/370 dead transitions. [2022-01-19 00:40:25,104 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 370 transitions, 1162 flow [2022-01-19 00:40:25,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 00:40:25,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 00:40:25,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1606 transitions. [2022-01-19 00:40:25,106 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9203438395415473 [2022-01-19 00:40:25,106 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1606 transitions. [2022-01-19 00:40:25,106 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1606 transitions. [2022-01-19 00:40:25,107 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:40:25,107 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1606 transitions. [2022-01-19 00:40:25,109 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 321.2) internal successors, (1606), 5 states have internal predecessors, (1606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:25,111 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 349.0) internal successors, (2094), 6 states have internal predecessors, (2094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:25,112 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 349.0) internal successors, (2094), 6 states have internal predecessors, (2094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:25,112 INFO L186 Difference]: Start difference. First operand has 365 places, 338 transitions, 883 flow. Second operand 5 states and 1606 transitions. [2022-01-19 00:40:25,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 369 places, 370 transitions, 1162 flow [2022-01-19 00:40:25,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 370 transitions, 1158 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-01-19 00:40:25,135 INFO L242 Difference]: Finished difference. Result has 372 places, 346 transitions, 987 flow [2022-01-19 00:40:25,136 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=880, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=329, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=987, PETRI_PLACES=372, PETRI_TRANSITIONS=346} [2022-01-19 00:40:25,137 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 53 predicate places. [2022-01-19 00:40:25,137 INFO L470 AbstractCegarLoop]: Abstraction has has 372 places, 346 transitions, 987 flow [2022-01-19 00:40:25,137 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 314.25) internal successors, (1257), 4 states have internal predecessors, (1257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:25,137 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:40:25,138 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:40:25,138 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-19 00:40:25,138 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:40:25,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:40:25,139 INFO L85 PathProgramCache]: Analyzing trace with hash 90776712, now seen corresponding path program 5 times [2022-01-19 00:40:25,139 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:40:25,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459453703] [2022-01-19 00:40:25,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:40:25,139 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:40:25,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:40:25,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:40:25,200 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:40:25,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459453703] [2022-01-19 00:40:25,201 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459453703] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:40:25,201 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:40:25,201 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 00:40:25,201 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601971130] [2022-01-19 00:40:25,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:40:25,202 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 00:40:25,202 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:40:25,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 00:40:25,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 00:40:25,204 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 349 [2022-01-19 00:40:25,205 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 346 transitions, 987 flow. Second operand has 4 states, 4 states have (on average 314.25) internal successors, (1257), 4 states have internal predecessors, (1257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:25,205 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:40:25,205 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 349 [2022-01-19 00:40:25,205 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:40:26,015 INFO L129 PetriNetUnfolder]: 569/4622 cut-off events. [2022-01-19 00:40:26,015 INFO L130 PetriNetUnfolder]: For 4614/4690 co-relation queries the response was YES. [2022-01-19 00:40:26,061 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9089 conditions, 4622 events. 569/4622 cut-off events. For 4614/4690 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 46908 event pairs, 333 based on Foata normal form. 22/4303 useless extension candidates. Maximal degree in co-relation 8034. Up to 393 conditions per place. [2022-01-19 00:40:26,072 INFO L132 encePairwiseOnDemand]: 339/349 looper letters, 57 selfloop transitions, 10 changer transitions 7/379 dead transitions. [2022-01-19 00:40:26,073 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 379 transitions, 1291 flow [2022-01-19 00:40:26,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 00:40:26,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 00:40:26,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1612 transitions. [2022-01-19 00:40:26,075 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.92378223495702 [2022-01-19 00:40:26,075 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1612 transitions. [2022-01-19 00:40:26,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1612 transitions. [2022-01-19 00:40:26,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:40:26,076 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1612 transitions. [2022-01-19 00:40:26,078 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 322.4) internal successors, (1612), 5 states have internal predecessors, (1612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:26,080 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 349.0) internal successors, (2094), 6 states have internal predecessors, (2094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:26,080 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 349.0) internal successors, (2094), 6 states have internal predecessors, (2094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:26,080 INFO L186 Difference]: Start difference. First operand has 372 places, 346 transitions, 987 flow. Second operand 5 states and 1612 transitions. [2022-01-19 00:40:26,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 379 transitions, 1291 flow [2022-01-19 00:40:26,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 379 transitions, 1273 flow, removed 9 selfloop flow, removed 1 redundant places. [2022-01-19 00:40:26,105 INFO L242 Difference]: Finished difference. Result has 377 places, 349 transitions, 1038 flow [2022-01-19 00:40:26,106 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=965, PETRI_DIFFERENCE_MINUEND_PLACES=370, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=345, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=335, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1038, PETRI_PLACES=377, PETRI_TRANSITIONS=349} [2022-01-19 00:40:26,106 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 58 predicate places. [2022-01-19 00:40:26,106 INFO L470 AbstractCegarLoop]: Abstraction has has 377 places, 349 transitions, 1038 flow [2022-01-19 00:40:26,107 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 314.25) internal successors, (1257), 4 states have internal predecessors, (1257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:26,107 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:40:26,107 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:40:26,107 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-19 00:40:26,107 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:40:26,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:40:26,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1887567964, now seen corresponding path program 1 times [2022-01-19 00:40:26,108 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:40:26,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175761989] [2022-01-19 00:40:26,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:40:26,108 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:40:26,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:40:26,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:40:26,168 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:40:26,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175761989] [2022-01-19 00:40:26,170 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175761989] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:40:26,170 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:40:26,170 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 00:40:26,170 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513609095] [2022-01-19 00:40:26,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:40:26,171 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 00:40:26,171 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:40:26,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 00:40:26,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 00:40:26,173 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 349 [2022-01-19 00:40:26,174 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 377 places, 349 transitions, 1038 flow. Second operand has 4 states, 4 states have (on average 314.25) internal successors, (1257), 4 states have internal predecessors, (1257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:26,174 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:40:26,174 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 349 [2022-01-19 00:40:26,175 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:40:26,966 INFO L129 PetriNetUnfolder]: 512/4437 cut-off events. [2022-01-19 00:40:26,967 INFO L130 PetriNetUnfolder]: For 4786/5070 co-relation queries the response was YES. [2022-01-19 00:40:27,000 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8878 conditions, 4437 events. 512/4437 cut-off events. For 4786/5070 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 46298 event pairs, 221 based on Foata normal form. 12/4117 useless extension candidates. Maximal degree in co-relation 7690. Up to 301 conditions per place. [2022-01-19 00:40:27,010 INFO L132 encePairwiseOnDemand]: 340/349 looper letters, 67 selfloop transitions, 14 changer transitions 5/391 dead transitions. [2022-01-19 00:40:27,010 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 381 places, 391 transitions, 1516 flow [2022-01-19 00:40:27,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 00:40:27,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 00:40:27,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1608 transitions. [2022-01-19 00:40:27,014 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9214899713467049 [2022-01-19 00:40:27,014 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1608 transitions. [2022-01-19 00:40:27,014 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1608 transitions. [2022-01-19 00:40:27,015 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:40:27,015 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1608 transitions. [2022-01-19 00:40:27,017 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 321.6) internal successors, (1608), 5 states have internal predecessors, (1608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:27,018 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 349.0) internal successors, (2094), 6 states have internal predecessors, (2094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:27,019 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 349.0) internal successors, (2094), 6 states have internal predecessors, (2094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:27,019 INFO L186 Difference]: Start difference. First operand has 377 places, 349 transitions, 1038 flow. Second operand 5 states and 1608 transitions. [2022-01-19 00:40:27,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 381 places, 391 transitions, 1516 flow [2022-01-19 00:40:27,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 377 places, 391 transitions, 1498 flow, removed 6 selfloop flow, removed 4 redundant places. [2022-01-19 00:40:27,042 INFO L242 Difference]: Finished difference. Result has 380 places, 360 transitions, 1184 flow [2022-01-19 00:40:27,043 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=1022, PETRI_DIFFERENCE_MINUEND_PLACES=373, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=349, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=339, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1184, PETRI_PLACES=380, PETRI_TRANSITIONS=360} [2022-01-19 00:40:27,043 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 61 predicate places. [2022-01-19 00:40:27,043 INFO L470 AbstractCegarLoop]: Abstraction has has 380 places, 360 transitions, 1184 flow [2022-01-19 00:40:27,044 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 314.25) internal successors, (1257), 4 states have internal predecessors, (1257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:27,044 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:40:27,044 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:40:27,044 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-19 00:40:27,044 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:40:27,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:40:27,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1134796298, now seen corresponding path program 2 times [2022-01-19 00:40:27,045 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:40:27,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216500743] [2022-01-19 00:40:27,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:40:27,045 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:40:27,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:40:27,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:40:27,096 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:40:27,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216500743] [2022-01-19 00:40:27,096 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216500743] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:40:27,096 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:40:27,097 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 00:40:27,097 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837239097] [2022-01-19 00:40:27,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:40:27,098 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 00:40:27,098 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:40:27,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 00:40:27,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 00:40:27,099 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 349 [2022-01-19 00:40:27,100 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 360 transitions, 1184 flow. Second operand has 4 states, 4 states have (on average 314.25) internal successors, (1257), 4 states have internal predecessors, (1257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:27,100 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:40:27,100 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 349 [2022-01-19 00:40:27,100 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:40:27,835 INFO L129 PetriNetUnfolder]: 547/4727 cut-off events. [2022-01-19 00:40:27,835 INFO L130 PetriNetUnfolder]: For 5598/5914 co-relation queries the response was YES. [2022-01-19 00:40:27,876 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9128 conditions, 4727 events. 547/4727 cut-off events. For 5598/5914 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 47793 event pairs, 318 based on Foata normal form. 30/4358 useless extension candidates. Maximal degree in co-relation 9062. Up to 391 conditions per place. [2022-01-19 00:40:27,888 INFO L132 encePairwiseOnDemand]: 339/349 looper letters, 66 selfloop transitions, 16 changer transitions 4/391 dead transitions. [2022-01-19 00:40:27,888 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 391 transitions, 1530 flow [2022-01-19 00:40:27,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 00:40:27,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 00:40:27,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1612 transitions. [2022-01-19 00:40:27,891 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.92378223495702 [2022-01-19 00:40:27,891 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1612 transitions. [2022-01-19 00:40:27,891 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1612 transitions. [2022-01-19 00:40:27,891 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:40:27,891 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1612 transitions. [2022-01-19 00:40:27,893 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 322.4) internal successors, (1612), 5 states have internal predecessors, (1612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:27,895 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 349.0) internal successors, (2094), 6 states have internal predecessors, (2094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:27,895 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 349.0) internal successors, (2094), 6 states have internal predecessors, (2094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:27,896 INFO L186 Difference]: Start difference. First operand has 380 places, 360 transitions, 1184 flow. Second operand 5 states and 1612 transitions. [2022-01-19 00:40:27,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 383 places, 391 transitions, 1530 flow [2022-01-19 00:40:27,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 382 places, 391 transitions, 1514 flow, removed 8 selfloop flow, removed 1 redundant places. [2022-01-19 00:40:27,920 INFO L242 Difference]: Finished difference. Result has 386 places, 365 transitions, 1287 flow [2022-01-19 00:40:27,920 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=1134, PETRI_DIFFERENCE_MINUEND_PLACES=378, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=344, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1287, PETRI_PLACES=386, PETRI_TRANSITIONS=365} [2022-01-19 00:40:27,921 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 67 predicate places. [2022-01-19 00:40:27,921 INFO L470 AbstractCegarLoop]: Abstraction has has 386 places, 365 transitions, 1287 flow [2022-01-19 00:40:27,921 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 314.25) internal successors, (1257), 4 states have internal predecessors, (1257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:27,921 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:40:27,922 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:40:27,922 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-19 00:40:27,922 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:40:27,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:40:27,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1721851518, now seen corresponding path program 3 times [2022-01-19 00:40:27,922 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:40:27,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044597472] [2022-01-19 00:40:27,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:40:27,923 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:40:27,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:40:27,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:40:27,975 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:40:27,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044597472] [2022-01-19 00:40:27,975 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044597472] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:40:27,975 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:40:27,975 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 00:40:27,976 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901489560] [2022-01-19 00:40:27,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:40:27,976 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 00:40:27,976 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:40:27,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 00:40:27,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 00:40:27,978 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 349 [2022-01-19 00:40:27,979 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 386 places, 365 transitions, 1287 flow. Second operand has 4 states, 4 states have (on average 314.25) internal successors, (1257), 4 states have internal predecessors, (1257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:27,979 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:40:27,979 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 349 [2022-01-19 00:40:27,979 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:40:28,598 INFO L129 PetriNetUnfolder]: 441/3936 cut-off events. [2022-01-19 00:40:28,598 INFO L130 PetriNetUnfolder]: For 6155/6468 co-relation queries the response was YES. [2022-01-19 00:40:28,633 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8493 conditions, 3936 events. 441/3936 cut-off events. For 6155/6468 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 39176 event pairs, 204 based on Foata normal form. 11/3664 useless extension candidates. Maximal degree in co-relation 7279. Up to 281 conditions per place. [2022-01-19 00:40:28,646 INFO L132 encePairwiseOnDemand]: 341/349 looper letters, 68 selfloop transitions, 20 changer transitions 1/394 dead transitions. [2022-01-19 00:40:28,646 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 390 places, 394 transitions, 1702 flow [2022-01-19 00:40:28,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 00:40:28,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 00:40:28,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1604 transitions. [2022-01-19 00:40:28,649 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9191977077363896 [2022-01-19 00:40:28,649 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1604 transitions. [2022-01-19 00:40:28,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1604 transitions. [2022-01-19 00:40:28,649 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:40:28,649 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1604 transitions. [2022-01-19 00:40:28,651 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 320.8) internal successors, (1604), 5 states have internal predecessors, (1604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:28,652 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 349.0) internal successors, (2094), 6 states have internal predecessors, (2094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:28,653 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 349.0) internal successors, (2094), 6 states have internal predecessors, (2094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:28,653 INFO L186 Difference]: Start difference. First operand has 386 places, 365 transitions, 1287 flow. Second operand 5 states and 1604 transitions. [2022-01-19 00:40:28,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 390 places, 394 transitions, 1702 flow [2022-01-19 00:40:28,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 390 places, 394 transitions, 1684 flow, removed 9 selfloop flow, removed 0 redundant places. [2022-01-19 00:40:28,685 INFO L242 Difference]: Finished difference. Result has 393 places, 374 transitions, 1460 flow [2022-01-19 00:40:28,685 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=1271, PETRI_DIFFERENCE_MINUEND_PLACES=386, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=365, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=349, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1460, PETRI_PLACES=393, PETRI_TRANSITIONS=374} [2022-01-19 00:40:28,685 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 74 predicate places. [2022-01-19 00:40:28,686 INFO L470 AbstractCegarLoop]: Abstraction has has 393 places, 374 transitions, 1460 flow [2022-01-19 00:40:28,686 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 314.25) internal successors, (1257), 4 states have internal predecessors, (1257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:28,686 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:40:28,686 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:40:28,686 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-19 00:40:28,686 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:40:28,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:40:28,687 INFO L85 PathProgramCache]: Analyzing trace with hash 332516982, now seen corresponding path program 4 times [2022-01-19 00:40:28,687 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:40:28,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788980786] [2022-01-19 00:40:28,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:40:28,687 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:40:28,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:40:28,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:40:28,744 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:40:28,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788980786] [2022-01-19 00:40:28,744 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788980786] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:40:28,744 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:40:28,744 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 00:40:28,744 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241819460] [2022-01-19 00:40:28,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:40:28,746 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 00:40:28,746 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:40:28,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 00:40:28,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 00:40:28,747 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 349 [2022-01-19 00:40:28,748 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 393 places, 374 transitions, 1460 flow. Second operand has 4 states, 4 states have (on average 314.25) internal successors, (1257), 4 states have internal predecessors, (1257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:28,748 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:40:28,748 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 349 [2022-01-19 00:40:28,748 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:40:29,418 INFO L129 PetriNetUnfolder]: 510/4611 cut-off events. [2022-01-19 00:40:29,418 INFO L130 PetriNetUnfolder]: For 8247/8827 co-relation queries the response was YES. [2022-01-19 00:40:29,456 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9553 conditions, 4611 events. 510/4611 cut-off events. For 8247/8827 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 46563 event pairs, 330 based on Foata normal form. 7/4247 useless extension candidates. Maximal degree in co-relation 8193. Up to 524 conditions per place. [2022-01-19 00:40:29,468 INFO L132 encePairwiseOnDemand]: 346/349 looper letters, 67 selfloop transitions, 4 changer transitions 7/383 dead transitions. [2022-01-19 00:40:29,468 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 396 places, 383 transitions, 1688 flow [2022-01-19 00:40:29,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-19 00:40:29,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-01-19 00:40:29,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1277 transitions. [2022-01-19 00:40:29,470 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.914756446991404 [2022-01-19 00:40:29,470 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1277 transitions. [2022-01-19 00:40:29,470 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1277 transitions. [2022-01-19 00:40:29,470 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:40:29,470 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1277 transitions. [2022-01-19 00:40:29,472 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 319.25) internal successors, (1277), 4 states have internal predecessors, (1277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:29,473 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 349.0) internal successors, (1745), 5 states have internal predecessors, (1745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:29,473 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 349.0) internal successors, (1745), 5 states have internal predecessors, (1745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:29,473 INFO L186 Difference]: Start difference. First operand has 393 places, 374 transitions, 1460 flow. Second operand 4 states and 1277 transitions. [2022-01-19 00:40:29,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 396 places, 383 transitions, 1688 flow [2022-01-19 00:40:29,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 396 places, 383 transitions, 1672 flow, removed 8 selfloop flow, removed 0 redundant places. [2022-01-19 00:40:29,505 INFO L242 Difference]: Finished difference. Result has 398 places, 370 transitions, 1405 flow [2022-01-19 00:40:29,506 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=1444, PETRI_DIFFERENCE_MINUEND_PLACES=393, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=374, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=370, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1405, PETRI_PLACES=398, PETRI_TRANSITIONS=370} [2022-01-19 00:40:29,506 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 79 predicate places. [2022-01-19 00:40:29,506 INFO L470 AbstractCegarLoop]: Abstraction has has 398 places, 370 transitions, 1405 flow [2022-01-19 00:40:29,507 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 314.25) internal successors, (1257), 4 states have internal predecessors, (1257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:29,507 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:40:29,507 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:40:29,507 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-19 00:40:29,507 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:40:29,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:40:29,508 INFO L85 PathProgramCache]: Analyzing trace with hash 2139981444, now seen corresponding path program 5 times [2022-01-19 00:40:29,508 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:40:29,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855167033] [2022-01-19 00:40:29,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:40:29,508 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:40:29,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:40:29,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:40:29,558 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:40:29,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855167033] [2022-01-19 00:40:29,558 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855167033] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:40:29,559 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:40:29,559 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 00:40:29,559 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786788292] [2022-01-19 00:40:29,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:40:29,559 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 00:40:29,559 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:40:29,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 00:40:29,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 00:40:29,561 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 349 [2022-01-19 00:40:29,562 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 398 places, 370 transitions, 1405 flow. Second operand has 4 states, 4 states have (on average 314.25) internal successors, (1257), 4 states have internal predecessors, (1257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:29,562 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:40:29,562 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 349 [2022-01-19 00:40:29,562 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:40:30,276 INFO L129 PetriNetUnfolder]: 490/4282 cut-off events. [2022-01-19 00:40:30,276 INFO L130 PetriNetUnfolder]: For 8466/9151 co-relation queries the response was YES. [2022-01-19 00:40:30,303 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8841 conditions, 4282 events. 490/4282 cut-off events. For 8466/9151 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 41809 event pairs, 300 based on Foata normal form. 10/3936 useless extension candidates. Maximal degree in co-relation 8792. Up to 462 conditions per place. [2022-01-19 00:40:30,312 INFO L132 encePairwiseOnDemand]: 346/349 looper letters, 65 selfloop transitions, 6 changer transitions 4/380 dead transitions. [2022-01-19 00:40:30,312 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 400 places, 380 transitions, 1625 flow [2022-01-19 00:40:30,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-19 00:40:30,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-01-19 00:40:30,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1279 transitions. [2022-01-19 00:40:30,314 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.916189111747851 [2022-01-19 00:40:30,314 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1279 transitions. [2022-01-19 00:40:30,315 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1279 transitions. [2022-01-19 00:40:30,315 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:40:30,315 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1279 transitions. [2022-01-19 00:40:30,316 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 319.75) internal successors, (1279), 4 states have internal predecessors, (1279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:30,317 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 349.0) internal successors, (1745), 5 states have internal predecessors, (1745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:30,318 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 349.0) internal successors, (1745), 5 states have internal predecessors, (1745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:30,318 INFO L186 Difference]: Start difference. First operand has 398 places, 370 transitions, 1405 flow. Second operand 4 states and 1279 transitions. [2022-01-19 00:40:30,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 400 places, 380 transitions, 1625 flow [2022-01-19 00:40:30,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 399 places, 380 transitions, 1618 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-01-19 00:40:30,344 INFO L242 Difference]: Finished difference. Result has 400 places, 367 transitions, 1374 flow [2022-01-19 00:40:30,344 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=1381, PETRI_DIFFERENCE_MINUEND_PLACES=396, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=363, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1374, PETRI_PLACES=400, PETRI_TRANSITIONS=367} [2022-01-19 00:40:30,344 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 81 predicate places. [2022-01-19 00:40:30,345 INFO L470 AbstractCegarLoop]: Abstraction has has 400 places, 367 transitions, 1374 flow [2022-01-19 00:40:30,345 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 314.25) internal successors, (1257), 4 states have internal predecessors, (1257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:30,345 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:40:30,345 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:40:30,345 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-19 00:40:30,345 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:40:30,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:40:30,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1581629290, now seen corresponding path program 1 times [2022-01-19 00:40:30,346 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:40:30,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605616113] [2022-01-19 00:40:30,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:40:30,346 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:40:30,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:40:30,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:40:30,395 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:40:30,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605616113] [2022-01-19 00:40:30,395 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605616113] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:40:30,395 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:40:30,395 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 00:40:30,395 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343608136] [2022-01-19 00:40:30,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:40:30,396 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 00:40:30,396 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:40:30,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 00:40:30,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 00:40:30,398 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 349 [2022-01-19 00:40:30,398 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 400 places, 367 transitions, 1374 flow. Second operand has 4 states, 4 states have (on average 314.25) internal successors, (1257), 4 states have internal predecessors, (1257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:30,398 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:40:30,399 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 349 [2022-01-19 00:40:30,399 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:40:31,103 INFO L129 PetriNetUnfolder]: 510/4189 cut-off events. [2022-01-19 00:40:31,104 INFO L130 PetriNetUnfolder]: For 9021/9134 co-relation queries the response was YES. [2022-01-19 00:40:31,131 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9015 conditions, 4189 events. 510/4189 cut-off events. For 9021/9134 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 41226 event pairs, 151 based on Foata normal form. 20/3913 useless extension candidates. Maximal degree in co-relation 8965. Up to 408 conditions per place. [2022-01-19 00:40:31,138 INFO L132 encePairwiseOnDemand]: 341/349 looper letters, 87 selfloop transitions, 16 changer transitions 14/422 dead transitions. [2022-01-19 00:40:31,138 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 422 transitions, 2227 flow [2022-01-19 00:40:31,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 00:40:31,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 00:40:31,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1608 transitions. [2022-01-19 00:40:31,141 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9214899713467049 [2022-01-19 00:40:31,141 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1608 transitions. [2022-01-19 00:40:31,141 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1608 transitions. [2022-01-19 00:40:31,141 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:40:31,141 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1608 transitions. [2022-01-19 00:40:31,143 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 321.6) internal successors, (1608), 5 states have internal predecessors, (1608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:31,145 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 349.0) internal successors, (2094), 6 states have internal predecessors, (2094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:31,145 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 349.0) internal successors, (2094), 6 states have internal predecessors, (2094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:31,145 INFO L186 Difference]: Start difference. First operand has 400 places, 367 transitions, 1374 flow. Second operand 5 states and 1608 transitions. [2022-01-19 00:40:31,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 403 places, 422 transitions, 2227 flow [2022-01-19 00:40:31,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 402 places, 422 transitions, 2206 flow, removed 6 selfloop flow, removed 1 redundant places. [2022-01-19 00:40:31,178 INFO L242 Difference]: Finished difference. Result has 405 places, 377 transitions, 1556 flow [2022-01-19 00:40:31,178 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=1362, PETRI_DIFFERENCE_MINUEND_PLACES=398, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=367, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=353, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1556, PETRI_PLACES=405, PETRI_TRANSITIONS=377} [2022-01-19 00:40:31,178 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 86 predicate places. [2022-01-19 00:40:31,179 INFO L470 AbstractCegarLoop]: Abstraction has has 405 places, 377 transitions, 1556 flow [2022-01-19 00:40:31,179 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 314.25) internal successors, (1257), 4 states have internal predecessors, (1257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:31,179 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:40:31,179 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:40:31,179 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-19 00:40:31,180 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:40:31,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:40:31,180 INFO L85 PathProgramCache]: Analyzing trace with hash 4879054, now seen corresponding path program 2 times [2022-01-19 00:40:31,180 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:40:31,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121362145] [2022-01-19 00:40:31,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:40:31,181 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:40:31,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:40:31,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:40:31,241 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:40:31,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121362145] [2022-01-19 00:40:31,241 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121362145] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:40:31,241 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:40:31,242 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 00:40:31,242 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683404676] [2022-01-19 00:40:31,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:40:31,242 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 00:40:31,243 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:40:31,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 00:40:31,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 00:40:31,244 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 349 [2022-01-19 00:40:31,245 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 405 places, 377 transitions, 1556 flow. Second operand has 4 states, 4 states have (on average 314.25) internal successors, (1257), 4 states have internal predecessors, (1257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:31,245 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:40:31,245 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 349 [2022-01-19 00:40:31,245 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:40:31,976 INFO L129 PetriNetUnfolder]: 509/4129 cut-off events. [2022-01-19 00:40:31,976 INFO L130 PetriNetUnfolder]: For 10638/11294 co-relation queries the response was YES. [2022-01-19 00:40:32,033 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9065 conditions, 4129 events. 509/4129 cut-off events. For 10638/11294 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 40226 event pairs, 169 based on Foata normal form. 30/3836 useless extension candidates. Maximal degree in co-relation 9012. Up to 361 conditions per place. [2022-01-19 00:40:32,045 INFO L132 encePairwiseOnDemand]: 340/349 looper letters, 81 selfloop transitions, 25 changer transitions 6/417 dead transitions. [2022-01-19 00:40:32,046 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 417 transitions, 2255 flow [2022-01-19 00:40:32,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 00:40:32,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 00:40:32,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1606 transitions. [2022-01-19 00:40:32,048 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9203438395415473 [2022-01-19 00:40:32,048 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1606 transitions. [2022-01-19 00:40:32,048 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1606 transitions. [2022-01-19 00:40:32,048 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:40:32,049 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1606 transitions. [2022-01-19 00:40:32,050 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 321.2) internal successors, (1606), 5 states have internal predecessors, (1606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:32,051 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 349.0) internal successors, (2094), 6 states have internal predecessors, (2094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:32,051 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 349.0) internal successors, (2094), 6 states have internal predecessors, (2094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:32,051 INFO L186 Difference]: Start difference. First operand has 405 places, 377 transitions, 1556 flow. Second operand 5 states and 1606 transitions. [2022-01-19 00:40:32,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 409 places, 417 transitions, 2255 flow [2022-01-19 00:40:32,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 417 transitions, 2229 flow, removed 13 selfloop flow, removed 0 redundant places. [2022-01-19 00:40:32,089 INFO L242 Difference]: Finished difference. Result has 413 places, 387 transitions, 1785 flow [2022-01-19 00:40:32,089 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=1530, PETRI_DIFFERENCE_MINUEND_PLACES=405, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=376, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=353, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1785, PETRI_PLACES=413, PETRI_TRANSITIONS=387} [2022-01-19 00:40:32,090 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 94 predicate places. [2022-01-19 00:40:32,090 INFO L470 AbstractCegarLoop]: Abstraction has has 413 places, 387 transitions, 1785 flow [2022-01-19 00:40:32,090 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 314.25) internal successors, (1257), 4 states have internal predecessors, (1257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:32,090 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:40:32,091 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:40:32,091 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-19 00:40:32,091 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:40:32,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:40:32,091 INFO L85 PathProgramCache]: Analyzing trace with hash 757831568, now seen corresponding path program 1 times [2022-01-19 00:40:32,091 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:40:32,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936688282] [2022-01-19 00:40:32,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:40:32,092 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:40:32,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:40:32,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:40:32,218 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:40:32,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936688282] [2022-01-19 00:40:32,219 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936688282] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:40:32,219 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:40:32,219 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 00:40:32,220 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002264660] [2022-01-19 00:40:32,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:40:32,222 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 00:40:32,222 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:40:32,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 00:40:32,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-01-19 00:40:32,224 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 349 [2022-01-19 00:40:32,226 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 413 places, 387 transitions, 1785 flow. Second operand has 10 states, 10 states have (on average 304.6) internal successors, (3046), 10 states have internal predecessors, (3046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:32,226 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:40:32,226 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 349 [2022-01-19 00:40:32,226 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:40:33,702 INFO L129 PetriNetUnfolder]: 2277/7802 cut-off events. [2022-01-19 00:40:33,702 INFO L130 PetriNetUnfolder]: For 9907/10179 co-relation queries the response was YES. [2022-01-19 00:40:33,774 INFO L84 FinitePrefix]: Finished finitePrefix Result has 17755 conditions, 7802 events. 2277/7802 cut-off events. For 9907/10179 co-relation queries the response was YES. Maximal size of possible extension queue 649. Compared 82356 event pairs, 1433 based on Foata normal form. 8/6970 useless extension candidates. Maximal degree in co-relation 17698. Up to 2942 conditions per place. [2022-01-19 00:40:33,795 INFO L132 encePairwiseOnDemand]: 336/349 looper letters, 80 selfloop transitions, 30 changer transitions 28/491 dead transitions. [2022-01-19 00:40:33,795 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 436 places, 491 transitions, 2440 flow [2022-01-19 00:40:33,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-01-19 00:40:33,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-01-19 00:40:33,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 7383 transitions. [2022-01-19 00:40:33,802 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8814469914040115 [2022-01-19 00:40:33,803 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 7383 transitions. [2022-01-19 00:40:33,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 7383 transitions. [2022-01-19 00:40:33,804 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:40:33,804 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 7383 transitions. [2022-01-19 00:40:33,811 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 307.625) internal successors, (7383), 24 states have internal predecessors, (7383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:33,817 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 349.0) internal successors, (8725), 25 states have internal predecessors, (8725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:33,817 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 349.0) internal successors, (8725), 25 states have internal predecessors, (8725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:33,817 INFO L186 Difference]: Start difference. First operand has 413 places, 387 transitions, 1785 flow. Second operand 24 states and 7383 transitions. [2022-01-19 00:40:33,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 436 places, 491 transitions, 2440 flow [2022-01-19 00:40:33,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 436 places, 491 transitions, 2412 flow, removed 14 selfloop flow, removed 0 redundant places. [2022-01-19 00:40:33,865 INFO L242 Difference]: Finished difference. Result has 456 places, 416 transitions, 2047 flow [2022-01-19 00:40:33,866 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=1757, PETRI_DIFFERENCE_MINUEND_PLACES=413, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=387, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=377, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=2047, PETRI_PLACES=456, PETRI_TRANSITIONS=416} [2022-01-19 00:40:33,866 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 137 predicate places. [2022-01-19 00:40:33,866 INFO L470 AbstractCegarLoop]: Abstraction has has 456 places, 416 transitions, 2047 flow [2022-01-19 00:40:33,867 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 304.6) internal successors, (3046), 10 states have internal predecessors, (3046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:33,867 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:40:33,867 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:40:33,867 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-19 00:40:33,867 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:40:33,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:40:33,868 INFO L85 PathProgramCache]: Analyzing trace with hash 2144117028, now seen corresponding path program 2 times [2022-01-19 00:40:33,868 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:40:33,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617770058] [2022-01-19 00:40:33,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:40:33,868 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:40:33,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:40:33,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:40:33,990 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:40:33,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617770058] [2022-01-19 00:40:33,991 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617770058] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:40:33,991 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:40:33,991 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 00:40:33,991 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35967877] [2022-01-19 00:40:33,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:40:33,992 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 00:40:33,992 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:40:33,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 00:40:33,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-01-19 00:40:33,994 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 349 [2022-01-19 00:40:33,996 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 456 places, 416 transitions, 2047 flow. Second operand has 10 states, 10 states have (on average 304.6) internal successors, (3046), 10 states have internal predecessors, (3046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:33,996 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:40:33,996 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 349 [2022-01-19 00:40:33,996 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:40:35,962 INFO L129 PetriNetUnfolder]: 2368/8386 cut-off events. [2022-01-19 00:40:35,962 INFO L130 PetriNetUnfolder]: For 23901/24541 co-relation queries the response was YES. [2022-01-19 00:40:36,041 INFO L84 FinitePrefix]: Finished finitePrefix Result has 24974 conditions, 8386 events. 2368/8386 cut-off events. For 23901/24541 co-relation queries the response was YES. Maximal size of possible extension queue 673. Compared 89120 event pairs, 1328 based on Foata normal form. 10/7520 useless extension candidates. Maximal degree in co-relation 24896. Up to 2658 conditions per place. [2022-01-19 00:40:36,067 INFO L132 encePairwiseOnDemand]: 336/349 looper letters, 113 selfloop transitions, 45 changer transitions 26/537 dead transitions. [2022-01-19 00:40:36,067 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 477 places, 537 transitions, 3124 flow [2022-01-19 00:40:36,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-01-19 00:40:36,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-01-19 00:40:36,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 7380 transitions. [2022-01-19 00:40:36,073 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8810888252148997 [2022-01-19 00:40:36,073 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 7380 transitions. [2022-01-19 00:40:36,073 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 7380 transitions. [2022-01-19 00:40:36,075 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:40:36,075 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 7380 transitions. [2022-01-19 00:40:36,084 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 307.5) internal successors, (7380), 24 states have internal predecessors, (7380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:36,090 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 349.0) internal successors, (8725), 25 states have internal predecessors, (8725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:36,091 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 349.0) internal successors, (8725), 25 states have internal predecessors, (8725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:36,091 INFO L186 Difference]: Start difference. First operand has 456 places, 416 transitions, 2047 flow. Second operand 24 states and 7380 transitions. [2022-01-19 00:40:36,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 477 places, 537 transitions, 3124 flow [2022-01-19 00:40:36,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 475 places, 537 transitions, 3012 flow, removed 56 selfloop flow, removed 2 redundant places. [2022-01-19 00:40:36,222 INFO L242 Difference]: Finished difference. Result has 495 places, 445 transitions, 2451 flow [2022-01-19 00:40:36,222 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=1973, PETRI_DIFFERENCE_MINUEND_PLACES=452, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=416, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=391, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=2451, PETRI_PLACES=495, PETRI_TRANSITIONS=445} [2022-01-19 00:40:36,223 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 176 predicate places. [2022-01-19 00:40:36,223 INFO L470 AbstractCegarLoop]: Abstraction has has 495 places, 445 transitions, 2451 flow [2022-01-19 00:40:36,223 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 304.6) internal successors, (3046), 10 states have internal predecessors, (3046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:36,223 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:40:36,224 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:40:36,224 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-19 00:40:36,224 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:40:36,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:40:36,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1078131910, now seen corresponding path program 3 times [2022-01-19 00:40:36,225 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:40:36,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478352883] [2022-01-19 00:40:36,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:40:36,225 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:40:36,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:40:36,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:40:36,364 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:40:36,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478352883] [2022-01-19 00:40:36,365 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478352883] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:40:36,365 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:40:36,365 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 00:40:36,365 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852842648] [2022-01-19 00:40:36,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:40:36,366 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 00:40:36,366 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:40:36,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 00:40:36,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-01-19 00:40:36,369 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 349 [2022-01-19 00:40:36,371 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 495 places, 445 transitions, 2451 flow. Second operand has 10 states, 10 states have (on average 304.6) internal successors, (3046), 10 states have internal predecessors, (3046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:36,371 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:40:36,371 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 349 [2022-01-19 00:40:36,371 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:40:38,680 INFO L129 PetriNetUnfolder]: 2540/8738 cut-off events. [2022-01-19 00:40:38,680 INFO L130 PetriNetUnfolder]: For 39420/39738 co-relation queries the response was YES. [2022-01-19 00:40:38,768 INFO L84 FinitePrefix]: Finished finitePrefix Result has 30805 conditions, 8738 events. 2540/8738 cut-off events. For 39420/39738 co-relation queries the response was YES. Maximal size of possible extension queue 725. Compared 93968 event pairs, 1604 based on Foata normal form. 14/7810 useless extension candidates. Maximal degree in co-relation 30708. Up to 3411 conditions per place. [2022-01-19 00:40:38,793 INFO L132 encePairwiseOnDemand]: 336/349 looper letters, 101 selfloop transitions, 56 changer transitions 24/534 dead transitions. [2022-01-19 00:40:38,793 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 514 places, 534 transitions, 3699 flow [2022-01-19 00:40:38,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-01-19 00:40:38,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-01-19 00:40:38,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 6761 transitions. [2022-01-19 00:40:38,799 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8805678562125554 [2022-01-19 00:40:38,799 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 6761 transitions. [2022-01-19 00:40:38,799 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 6761 transitions. [2022-01-19 00:40:38,801 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:40:38,801 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 6761 transitions. [2022-01-19 00:40:38,808 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 307.3181818181818) internal successors, (6761), 22 states have internal predecessors, (6761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:38,813 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 349.0) internal successors, (8027), 23 states have internal predecessors, (8027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:38,813 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 349.0) internal successors, (8027), 23 states have internal predecessors, (8027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:38,813 INFO L186 Difference]: Start difference. First operand has 495 places, 445 transitions, 2451 flow. Second operand 22 states and 6761 transitions. [2022-01-19 00:40:38,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 514 places, 534 transitions, 3699 flow [2022-01-19 00:40:39,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 512 places, 534 transitions, 3429 flow, removed 135 selfloop flow, removed 2 redundant places. [2022-01-19 00:40:39,131 INFO L242 Difference]: Finished difference. Result has 526 places, 475 transitions, 2896 flow [2022-01-19 00:40:39,131 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=2303, PETRI_DIFFERENCE_MINUEND_PLACES=491, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=445, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=411, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=2896, PETRI_PLACES=526, PETRI_TRANSITIONS=475} [2022-01-19 00:40:39,132 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 207 predicate places. [2022-01-19 00:40:39,132 INFO L470 AbstractCegarLoop]: Abstraction has has 526 places, 475 transitions, 2896 flow [2022-01-19 00:40:39,132 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 304.6) internal successors, (3046), 10 states have internal predecessors, (3046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:39,132 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:40:39,133 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:40:39,133 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-19 00:40:39,133 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:40:39,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:40:39,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1289019372, now seen corresponding path program 4 times [2022-01-19 00:40:39,133 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:40:39,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903451799] [2022-01-19 00:40:39,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:40:39,134 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:40:39,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:40:39,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:40:39,318 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:40:39,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903451799] [2022-01-19 00:40:39,319 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903451799] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:40:39,319 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:40:39,319 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 00:40:39,319 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801814637] [2022-01-19 00:40:39,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:40:39,320 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 00:40:39,320 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:40:39,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 00:40:39,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-01-19 00:40:39,323 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 349 [2022-01-19 00:40:39,324 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 526 places, 475 transitions, 2896 flow. Second operand has 10 states, 10 states have (on average 304.6) internal successors, (3046), 10 states have internal predecessors, (3046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:39,324 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:40:39,324 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 349 [2022-01-19 00:40:39,324 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:40:41,985 INFO L129 PetriNetUnfolder]: 2744/9522 cut-off events. [2022-01-19 00:40:41,986 INFO L130 PetriNetUnfolder]: For 51212/52096 co-relation queries the response was YES. [2022-01-19 00:40:42,090 INFO L84 FinitePrefix]: Finished finitePrefix Result has 34355 conditions, 9522 events. 2744/9522 cut-off events. For 51212/52096 co-relation queries the response was YES. Maximal size of possible extension queue 793. Compared 103517 event pairs, 1599 based on Foata normal form. 10/8546 useless extension candidates. Maximal degree in co-relation 34245. Up to 3196 conditions per place. [2022-01-19 00:40:42,119 INFO L132 encePairwiseOnDemand]: 336/349 looper letters, 120 selfloop transitions, 61 changer transitions 22/556 dead transitions. [2022-01-19 00:40:42,119 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 543 places, 556 transitions, 4212 flow [2022-01-19 00:40:42,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-19 00:40:42,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-01-19 00:40:42,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 6152 transitions. [2022-01-19 00:40:42,123 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8813753581661891 [2022-01-19 00:40:42,123 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 6152 transitions. [2022-01-19 00:40:42,123 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 6152 transitions. [2022-01-19 00:40:42,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:40:42,124 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 6152 transitions. [2022-01-19 00:40:42,230 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 307.6) internal successors, (6152), 20 states have internal predecessors, (6152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:42,234 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 349.0) internal successors, (7329), 21 states have internal predecessors, (7329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:42,234 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 349.0) internal successors, (7329), 21 states have internal predecessors, (7329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:42,235 INFO L186 Difference]: Start difference. First operand has 526 places, 475 transitions, 2896 flow. Second operand 20 states and 6152 transitions. [2022-01-19 00:40:42,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 543 places, 556 transitions, 4212 flow [2022-01-19 00:40:42,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 541 places, 556 transitions, 3962 flow, removed 125 selfloop flow, removed 2 redundant places. [2022-01-19 00:40:42,518 INFO L242 Difference]: Finished difference. Result has 556 places, 507 transitions, 3422 flow [2022-01-19 00:40:42,519 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=2686, PETRI_DIFFERENCE_MINUEND_PLACES=522, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=475, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=434, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=3422, PETRI_PLACES=556, PETRI_TRANSITIONS=507} [2022-01-19 00:40:42,519 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 237 predicate places. [2022-01-19 00:40:42,519 INFO L470 AbstractCegarLoop]: Abstraction has has 556 places, 507 transitions, 3422 flow [2022-01-19 00:40:42,520 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 304.6) internal successors, (3046), 10 states have internal predecessors, (3046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:42,520 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:40:42,520 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:40:42,520 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-19 00:40:42,520 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:40:42,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:40:42,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1782446198, now seen corresponding path program 5 times [2022-01-19 00:40:42,521 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:40:42,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565810838] [2022-01-19 00:40:42,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:40:42,521 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:40:42,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:40:42,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:40:42,665 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:40:42,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565810838] [2022-01-19 00:40:42,665 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565810838] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:40:42,665 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:40:42,665 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 00:40:42,666 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863740715] [2022-01-19 00:40:42,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:40:42,666 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 00:40:42,666 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:40:42,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 00:40:42,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-01-19 00:40:42,669 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 349 [2022-01-19 00:40:42,670 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 556 places, 507 transitions, 3422 flow. Second operand has 10 states, 10 states have (on average 304.6) internal successors, (3046), 10 states have internal predecessors, (3046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:42,670 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:40:42,670 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 349 [2022-01-19 00:40:42,670 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:40:45,343 INFO L129 PetriNetUnfolder]: 2810/9678 cut-off events. [2022-01-19 00:40:45,343 INFO L130 PetriNetUnfolder]: For 68924/69292 co-relation queries the response was YES. [2022-01-19 00:40:45,598 INFO L84 FinitePrefix]: Finished finitePrefix Result has 37936 conditions, 9678 events. 2810/9678 cut-off events. For 68924/69292 co-relation queries the response was YES. Maximal size of possible extension queue 821. Compared 106602 event pairs, 1672 based on Foata normal form. 13/8667 useless extension candidates. Maximal degree in co-relation 37812. Up to 3693 conditions per place. [2022-01-19 00:40:45,625 INFO L132 encePairwiseOnDemand]: 336/349 looper letters, 139 selfloop transitions, 78 changer transitions 19/589 dead transitions. [2022-01-19 00:40:45,625 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 573 places, 589 transitions, 4901 flow [2022-01-19 00:40:45,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-19 00:40:45,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-01-19 00:40:45,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 6148 transitions. [2022-01-19 00:40:45,630 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8808022922636103 [2022-01-19 00:40:45,630 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 6148 transitions. [2022-01-19 00:40:45,630 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 6148 transitions. [2022-01-19 00:40:45,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:40:45,631 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 6148 transitions. [2022-01-19 00:40:45,638 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 307.4) internal successors, (6148), 20 states have internal predecessors, (6148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:45,642 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 349.0) internal successors, (7329), 21 states have internal predecessors, (7329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:45,643 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 349.0) internal successors, (7329), 21 states have internal predecessors, (7329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:45,643 INFO L186 Difference]: Start difference. First operand has 556 places, 507 transitions, 3422 flow. Second operand 20 states and 6148 transitions. [2022-01-19 00:40:45,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 573 places, 589 transitions, 4901 flow [2022-01-19 00:40:46,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 571 places, 589 transitions, 4517 flow, removed 192 selfloop flow, removed 2 redundant places. [2022-01-19 00:40:46,076 INFO L242 Difference]: Finished difference. Result has 586 places, 538 transitions, 3957 flow [2022-01-19 00:40:46,076 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=3168, PETRI_DIFFERENCE_MINUEND_PLACES=552, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=507, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=450, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=3957, PETRI_PLACES=586, PETRI_TRANSITIONS=538} [2022-01-19 00:40:46,076 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 267 predicate places. [2022-01-19 00:40:46,077 INFO L470 AbstractCegarLoop]: Abstraction has has 586 places, 538 transitions, 3957 flow [2022-01-19 00:40:46,077 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 304.6) internal successors, (3046), 10 states have internal predecessors, (3046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:46,077 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:40:46,078 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:40:46,078 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-01-19 00:40:46,078 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:40:46,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:40:46,078 INFO L85 PathProgramCache]: Analyzing trace with hash 907104584, now seen corresponding path program 6 times [2022-01-19 00:40:46,078 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:40:46,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891362033] [2022-01-19 00:40:46,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:40:46,079 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:40:46,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:40:46,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:40:46,195 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:40:46,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891362033] [2022-01-19 00:40:46,195 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891362033] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:40:46,195 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:40:46,195 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 00:40:46,196 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562696630] [2022-01-19 00:40:46,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:40:46,196 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 00:40:46,196 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:40:46,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 00:40:46,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-01-19 00:40:46,199 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 349 [2022-01-19 00:40:46,200 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 586 places, 538 transitions, 3957 flow. Second operand has 10 states, 10 states have (on average 304.6) internal successors, (3046), 10 states have internal predecessors, (3046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:46,200 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:40:46,201 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 349 [2022-01-19 00:40:46,201 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:40:49,076 INFO L129 PetriNetUnfolder]: 2850/9990 cut-off events. [2022-01-19 00:40:49,076 INFO L130 PetriNetUnfolder]: For 77438/77826 co-relation queries the response was YES. [2022-01-19 00:40:49,202 INFO L84 FinitePrefix]: Finished finitePrefix Result has 39780 conditions, 9990 events. 2850/9990 cut-off events. For 77438/77826 co-relation queries the response was YES. Maximal size of possible extension queue 839. Compared 111681 event pairs, 1660 based on Foata normal form. 24/9002 useless extension candidates. Maximal degree in co-relation 39642. Up to 3717 conditions per place. [2022-01-19 00:40:49,243 INFO L132 encePairwiseOnDemand]: 336/349 looper letters, 140 selfloop transitions, 96 changer transitions 17/606 dead transitions. [2022-01-19 00:40:49,243 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 601 places, 606 transitions, 5344 flow [2022-01-19 00:40:49,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-19 00:40:49,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-01-19 00:40:49,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 5537 transitions. [2022-01-19 00:40:49,247 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8814071951607768 [2022-01-19 00:40:49,247 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 5537 transitions. [2022-01-19 00:40:49,247 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 5537 transitions. [2022-01-19 00:40:49,248 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:40:49,248 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 5537 transitions. [2022-01-19 00:40:49,252 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 307.6111111111111) internal successors, (5537), 18 states have internal predecessors, (5537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:49,255 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 349.0) internal successors, (6631), 19 states have internal predecessors, (6631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:49,256 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 349.0) internal successors, (6631), 19 states have internal predecessors, (6631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:49,256 INFO L186 Difference]: Start difference. First operand has 586 places, 538 transitions, 3957 flow. Second operand 18 states and 5537 transitions. [2022-01-19 00:40:49,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 601 places, 606 transitions, 5344 flow [2022-01-19 00:40:49,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 599 places, 606 transitions, 4928 flow, removed 208 selfloop flow, removed 2 redundant places. [2022-01-19 00:40:49,890 INFO L242 Difference]: Finished difference. Result has 607 places, 559 transitions, 4350 flow [2022-01-19 00:40:49,890 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=3735, PETRI_DIFFERENCE_MINUEND_PLACES=582, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=538, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=456, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=4350, PETRI_PLACES=607, PETRI_TRANSITIONS=559} [2022-01-19 00:40:49,890 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 288 predicate places. [2022-01-19 00:40:49,890 INFO L470 AbstractCegarLoop]: Abstraction has has 607 places, 559 transitions, 4350 flow [2022-01-19 00:40:49,891 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 304.6) internal successors, (3046), 10 states have internal predecessors, (3046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:49,891 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:40:49,891 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:40:49,891 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-01-19 00:40:49,891 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:40:49,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:40:49,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1145114812, now seen corresponding path program 7 times [2022-01-19 00:40:49,892 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:40:49,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081166217] [2022-01-19 00:40:49,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:40:49,892 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:40:49,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:40:50,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:40:50,003 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:40:50,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081166217] [2022-01-19 00:40:50,003 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081166217] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:40:50,003 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:40:50,003 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 00:40:50,003 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267878808] [2022-01-19 00:40:50,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:40:50,004 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 00:40:50,004 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:40:50,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 00:40:50,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-01-19 00:40:50,006 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 349 [2022-01-19 00:40:50,008 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 607 places, 559 transitions, 4350 flow. Second operand has 10 states, 10 states have (on average 304.6) internal successors, (3046), 10 states have internal predecessors, (3046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:50,008 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:40:50,008 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 349 [2022-01-19 00:40:50,008 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:40:53,074 INFO L129 PetriNetUnfolder]: 2946/10266 cut-off events. [2022-01-19 00:40:53,074 INFO L130 PetriNetUnfolder]: For 61426/61810 co-relation queries the response was YES. [2022-01-19 00:40:53,204 INFO L84 FinitePrefix]: Finished finitePrefix Result has 40314 conditions, 10266 events. 2946/10266 cut-off events. For 61426/61810 co-relation queries the response was YES. Maximal size of possible extension queue 873. Compared 115471 event pairs, 1680 based on Foata normal form. 19/9243 useless extension candidates. Maximal degree in co-relation 40169. Up to 3795 conditions per place. [2022-01-19 00:40:53,232 INFO L132 encePairwiseOnDemand]: 336/349 looper letters, 151 selfloop transitions, 100 changer transitions 16/620 dead transitions. [2022-01-19 00:40:53,232 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 621 places, 620 transitions, 5603 flow [2022-01-19 00:40:53,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-19 00:40:53,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-01-19 00:40:53,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 5234 transitions. [2022-01-19 00:40:53,234 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8821843923815945 [2022-01-19 00:40:53,235 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 5234 transitions. [2022-01-19 00:40:53,235 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 5234 transitions. [2022-01-19 00:40:53,235 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:40:53,235 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 5234 transitions. [2022-01-19 00:40:53,238 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 307.88235294117646) internal successors, (5234), 17 states have internal predecessors, (5234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:53,241 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 349.0) internal successors, (6282), 18 states have internal predecessors, (6282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:53,242 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 349.0) internal successors, (6282), 18 states have internal predecessors, (6282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:53,242 INFO L186 Difference]: Start difference. First operand has 607 places, 559 transitions, 4350 flow. Second operand 17 states and 5234 transitions. [2022-01-19 00:40:53,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 621 places, 620 transitions, 5603 flow [2022-01-19 00:40:53,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 619 places, 620 transitions, 5421 flow, removed 91 selfloop flow, removed 2 redundant places. [2022-01-19 00:40:53,641 INFO L242 Difference]: Finished difference. Result has 628 places, 580 transitions, 4857 flow [2022-01-19 00:40:53,642 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=4202, PETRI_DIFFERENCE_MINUEND_PLACES=603, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=559, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=474, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=4857, PETRI_PLACES=628, PETRI_TRANSITIONS=580} [2022-01-19 00:40:53,642 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 309 predicate places. [2022-01-19 00:40:53,642 INFO L470 AbstractCegarLoop]: Abstraction has has 628 places, 580 transitions, 4857 flow [2022-01-19 00:40:53,642 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 304.6) internal successors, (3046), 10 states have internal predecessors, (3046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:53,643 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:40:53,643 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:40:53,643 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-01-19 00:40:53,643 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:40:53,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:40:53,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1457870368, now seen corresponding path program 8 times [2022-01-19 00:40:53,644 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:40:53,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802369567] [2022-01-19 00:40:53,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:40:53,644 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:40:53,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:40:53,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:40:53,760 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:40:53,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802369567] [2022-01-19 00:40:53,760 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802369567] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:40:53,760 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:40:53,760 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 00:40:53,761 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945641548] [2022-01-19 00:40:53,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:40:53,761 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 00:40:53,761 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:40:53,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 00:40:53,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-01-19 00:40:53,764 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 349 [2022-01-19 00:40:53,778 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 628 places, 580 transitions, 4857 flow. Second operand has 10 states, 10 states have (on average 304.6) internal successors, (3046), 10 states have internal predecessors, (3046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:53,778 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:40:53,779 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 349 [2022-01-19 00:40:53,779 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:40:56,911 INFO L129 PetriNetUnfolder]: 2948/10438 cut-off events. [2022-01-19 00:40:56,911 INFO L130 PetriNetUnfolder]: For 67266/67651 co-relation queries the response was YES. [2022-01-19 00:40:57,050 INFO L84 FinitePrefix]: Finished finitePrefix Result has 41743 conditions, 10438 events. 2948/10438 cut-off events. For 67266/67651 co-relation queries the response was YES. Maximal size of possible extension queue 881. Compared 118466 event pairs, 1674 based on Foata normal form. 24/9431 useless extension candidates. Maximal degree in co-relation 41590. Up to 3849 conditions per place. [2022-01-19 00:40:57,080 INFO L132 encePairwiseOnDemand]: 336/349 looper letters, 151 selfloop transitions, 107 changer transitions 19/630 dead transitions. [2022-01-19 00:40:57,080 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 641 places, 630 transitions, 5875 flow [2022-01-19 00:40:57,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-19 00:40:57,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-01-19 00:40:57,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 4926 transitions. [2022-01-19 00:40:57,083 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8821633237822349 [2022-01-19 00:40:57,083 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 4926 transitions. [2022-01-19 00:40:57,083 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 4926 transitions. [2022-01-19 00:40:57,084 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:40:57,084 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 4926 transitions. [2022-01-19 00:40:57,088 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 307.875) internal successors, (4926), 16 states have internal predecessors, (4926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:57,091 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 349.0) internal successors, (5933), 17 states have internal predecessors, (5933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:57,091 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 349.0) internal successors, (5933), 17 states have internal predecessors, (5933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:57,091 INFO L186 Difference]: Start difference. First operand has 628 places, 580 transitions, 4857 flow. Second operand 16 states and 4926 transitions. [2022-01-19 00:40:57,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 641 places, 630 transitions, 5875 flow [2022-01-19 00:40:57,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 639 places, 630 transitions, 5727 flow, removed 74 selfloop flow, removed 2 redundant places. [2022-01-19 00:40:57,750 INFO L242 Difference]: Finished difference. Result has 646 places, 588 transitions, 5123 flow [2022-01-19 00:40:57,751 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=4713, PETRI_DIFFERENCE_MINUEND_PLACES=624, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=580, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=99, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=477, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=5123, PETRI_PLACES=646, PETRI_TRANSITIONS=588} [2022-01-19 00:40:57,751 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 327 predicate places. [2022-01-19 00:40:57,751 INFO L470 AbstractCegarLoop]: Abstraction has has 646 places, 588 transitions, 5123 flow [2022-01-19 00:40:57,752 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 304.6) internal successors, (3046), 10 states have internal predecessors, (3046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:57,752 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:40:57,752 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:40:57,752 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-01-19 00:40:57,752 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:40:57,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:40:57,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1919101692, now seen corresponding path program 9 times [2022-01-19 00:40:57,753 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:40:57,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837585846] [2022-01-19 00:40:57,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:40:57,753 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:40:57,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:40:57,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:40:57,863 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:40:57,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837585846] [2022-01-19 00:40:57,864 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837585846] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:40:57,864 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:40:57,864 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 00:40:57,864 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807562807] [2022-01-19 00:40:57,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:40:57,864 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 00:40:57,864 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:40:57,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 00:40:57,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-01-19 00:40:57,867 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 349 [2022-01-19 00:40:57,869 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 646 places, 588 transitions, 5123 flow. Second operand has 10 states, 10 states have (on average 304.6) internal successors, (3046), 10 states have internal predecessors, (3046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:40:57,869 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:40:57,869 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 349 [2022-01-19 00:40:57,869 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:41:01,325 INFO L129 PetriNetUnfolder]: 3008/10670 cut-off events. [2022-01-19 00:41:01,325 INFO L130 PetriNetUnfolder]: For 73009/73394 co-relation queries the response was YES. [2022-01-19 00:41:01,463 INFO L84 FinitePrefix]: Finished finitePrefix Result has 43956 conditions, 10670 events. 3008/10670 cut-off events. For 73009/73394 co-relation queries the response was YES. Maximal size of possible extension queue 905. Compared 121864 event pairs, 1670 based on Foata normal form. 19/9627 useless extension candidates. Maximal degree in co-relation 43797. Up to 3745 conditions per place. [2022-01-19 00:41:01,493 INFO L132 encePairwiseOnDemand]: 336/349 looper letters, 185 selfloop transitions, 98 changer transitions 23/659 dead transitions. [2022-01-19 00:41:01,493 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 664 places, 659 transitions, 6641 flow [2022-01-19 00:41:01,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-01-19 00:41:01,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-01-19 00:41:01,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 6458 transitions. [2022-01-19 00:41:01,496 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8811570473461591 [2022-01-19 00:41:01,496 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 6458 transitions. [2022-01-19 00:41:01,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 6458 transitions. [2022-01-19 00:41:01,497 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:41:01,497 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 6458 transitions. [2022-01-19 00:41:01,502 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 307.5238095238095) internal successors, (6458), 21 states have internal predecessors, (6458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:01,506 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 349.0) internal successors, (7678), 22 states have internal predecessors, (7678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:01,506 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 349.0) internal successors, (7678), 22 states have internal predecessors, (7678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:01,507 INFO L186 Difference]: Start difference. First operand has 646 places, 588 transitions, 5123 flow. Second operand 21 states and 6458 transitions. [2022-01-19 00:41:01,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 664 places, 659 transitions, 6641 flow [2022-01-19 00:41:01,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 661 places, 659 transitions, 6522 flow, removed 37 selfloop flow, removed 3 redundant places. [2022-01-19 00:41:01,990 INFO L242 Difference]: Finished difference. Result has 675 places, 612 transitions, 5858 flow [2022-01-19 00:41:01,990 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=5036, PETRI_DIFFERENCE_MINUEND_PLACES=641, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=588, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=504, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=5858, PETRI_PLACES=675, PETRI_TRANSITIONS=612} [2022-01-19 00:41:01,991 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 356 predicate places. [2022-01-19 00:41:01,991 INFO L470 AbstractCegarLoop]: Abstraction has has 675 places, 612 transitions, 5858 flow [2022-01-19 00:41:01,991 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 304.6) internal successors, (3046), 10 states have internal predecessors, (3046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:01,992 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:41:01,992 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:41:01,992 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-01-19 00:41:01,992 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:41:01,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:41:01,992 INFO L85 PathProgramCache]: Analyzing trace with hash -2078172640, now seen corresponding path program 10 times [2022-01-19 00:41:01,993 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:41:01,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798755080] [2022-01-19 00:41:01,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:41:01,993 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:41:02,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:41:02,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:41:02,103 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:41:02,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798755080] [2022-01-19 00:41:02,103 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798755080] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:41:02,104 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:41:02,104 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 00:41:02,104 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461424801] [2022-01-19 00:41:02,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:41:02,104 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 00:41:02,104 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:41:02,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 00:41:02,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-01-19 00:41:02,107 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 349 [2022-01-19 00:41:02,108 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 675 places, 612 transitions, 5858 flow. Second operand has 10 states, 10 states have (on average 304.6) internal successors, (3046), 10 states have internal predecessors, (3046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:02,108 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:41:02,108 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 349 [2022-01-19 00:41:02,109 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:41:05,490 INFO L129 PetriNetUnfolder]: 3038/10836 cut-off events. [2022-01-19 00:41:05,491 INFO L130 PetriNetUnfolder]: For 83989/84386 co-relation queries the response was YES. [2022-01-19 00:41:05,660 INFO L84 FinitePrefix]: Finished finitePrefix Result has 46368 conditions, 10836 events. 3038/10836 cut-off events. For 83989/84386 co-relation queries the response was YES. Maximal size of possible extension queue 921. Compared 124256 event pairs, 1718 based on Foata normal form. 19/9775 useless extension candidates. Maximal degree in co-relation 46197. Up to 3953 conditions per place. [2022-01-19 00:41:05,697 INFO L132 encePairwiseOnDemand]: 336/349 looper letters, 167 selfloop transitions, 120 changer transitions 20/660 dead transitions. [2022-01-19 00:41:05,697 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 690 places, 660 transitions, 7031 flow [2022-01-19 00:41:05,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-19 00:41:05,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-01-19 00:41:05,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 5537 transitions. [2022-01-19 00:41:05,702 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8814071951607768 [2022-01-19 00:41:05,702 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 5537 transitions. [2022-01-19 00:41:05,702 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 5537 transitions. [2022-01-19 00:41:05,703 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:41:05,703 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 5537 transitions. [2022-01-19 00:41:05,708 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 307.6111111111111) internal successors, (5537), 18 states have internal predecessors, (5537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:05,711 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 349.0) internal successors, (6631), 19 states have internal predecessors, (6631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:05,712 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 349.0) internal successors, (6631), 19 states have internal predecessors, (6631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:05,712 INFO L186 Difference]: Start difference. First operand has 675 places, 612 transitions, 5858 flow. Second operand 18 states and 5537 transitions. [2022-01-19 00:41:05,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 690 places, 660 transitions, 7031 flow [2022-01-19 00:41:06,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 688 places, 660 transitions, 6773 flow, removed 129 selfloop flow, removed 2 redundant places. [2022-01-19 00:41:06,359 INFO L242 Difference]: Finished difference. Result has 696 places, 626 transitions, 6232 flow [2022-01-19 00:41:06,360 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=5646, PETRI_DIFFERENCE_MINUEND_PLACES=671, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=612, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=107, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=500, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=6232, PETRI_PLACES=696, PETRI_TRANSITIONS=626} [2022-01-19 00:41:06,360 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 377 predicate places. [2022-01-19 00:41:06,361 INFO L470 AbstractCegarLoop]: Abstraction has has 696 places, 626 transitions, 6232 flow [2022-01-19 00:41:06,361 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 304.6) internal successors, (3046), 10 states have internal predecessors, (3046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:06,361 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:41:06,361 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:41:06,362 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-01-19 00:41:06,362 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:41:06,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:41:06,362 INFO L85 PathProgramCache]: Analyzing trace with hash 2085660946, now seen corresponding path program 11 times [2022-01-19 00:41:06,362 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:41:06,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227562347] [2022-01-19 00:41:06,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:41:06,363 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:41:06,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:41:06,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:41:06,486 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:41:06,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227562347] [2022-01-19 00:41:06,486 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227562347] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:41:06,486 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:41:06,487 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 00:41:06,487 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879174252] [2022-01-19 00:41:06,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:41:06,487 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 00:41:06,487 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:41:06,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 00:41:06,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-01-19 00:41:06,490 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 349 [2022-01-19 00:41:06,492 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 696 places, 626 transitions, 6232 flow. Second operand has 10 states, 10 states have (on average 304.6) internal successors, (3046), 10 states have internal predecessors, (3046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:06,492 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:41:06,492 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 349 [2022-01-19 00:41:06,492 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:41:09,909 INFO L129 PetriNetUnfolder]: 3078/11112 cut-off events. [2022-01-19 00:41:09,910 INFO L130 PetriNetUnfolder]: For 85922/86331 co-relation queries the response was YES. [2022-01-19 00:41:10,087 INFO L84 FinitePrefix]: Finished finitePrefix Result has 47790 conditions, 11112 events. 3078/11112 cut-off events. For 85922/86331 co-relation queries the response was YES. Maximal size of possible extension queue 939. Compared 128684 event pairs, 1716 based on Foata normal form. 19/10040 useless extension candidates. Maximal degree in co-relation 47612. Up to 4005 conditions per place. [2022-01-19 00:41:10,351 INFO L132 encePairwiseOnDemand]: 336/349 looper letters, 197 selfloop transitions, 113 changer transitions 15/678 dead transitions. [2022-01-19 00:41:10,351 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 710 places, 678 transitions, 7567 flow [2022-01-19 00:41:10,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-19 00:41:10,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-01-19 00:41:10,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 5234 transitions. [2022-01-19 00:41:10,355 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8821843923815945 [2022-01-19 00:41:10,355 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 5234 transitions. [2022-01-19 00:41:10,355 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 5234 transitions. [2022-01-19 00:41:10,356 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:41:10,356 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 5234 transitions. [2022-01-19 00:41:10,360 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 307.88235294117646) internal successors, (5234), 17 states have internal predecessors, (5234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:10,363 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 349.0) internal successors, (6282), 18 states have internal predecessors, (6282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:10,364 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 349.0) internal successors, (6282), 18 states have internal predecessors, (6282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:10,364 INFO L186 Difference]: Start difference. First operand has 696 places, 626 transitions, 6232 flow. Second operand 17 states and 5234 transitions. [2022-01-19 00:41:10,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 710 places, 678 transitions, 7567 flow [2022-01-19 00:41:10,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 706 places, 678 transitions, 7382 flow, removed 43 selfloop flow, removed 4 redundant places. [2022-01-19 00:41:10,976 INFO L242 Difference]: Finished difference. Result has 714 places, 644 transitions, 6785 flow [2022-01-19 00:41:10,977 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=6059, PETRI_DIFFERENCE_MINUEND_PLACES=690, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=626, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=526, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=6785, PETRI_PLACES=714, PETRI_TRANSITIONS=644} [2022-01-19 00:41:10,977 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 395 predicate places. [2022-01-19 00:41:10,977 INFO L470 AbstractCegarLoop]: Abstraction has has 714 places, 644 transitions, 6785 flow [2022-01-19 00:41:10,978 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 304.6) internal successors, (3046), 10 states have internal predecessors, (3046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:10,978 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:41:10,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:41:10,978 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-01-19 00:41:10,979 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:41:10,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:41:10,979 INFO L85 PathProgramCache]: Analyzing trace with hash -732126942, now seen corresponding path program 12 times [2022-01-19 00:41:10,979 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:41:10,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633986885] [2022-01-19 00:41:10,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:41:10,980 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:41:11,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:41:11,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:41:11,103 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:41:11,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633986885] [2022-01-19 00:41:11,103 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633986885] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:41:11,103 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:41:11,103 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 00:41:11,103 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205239011] [2022-01-19 00:41:11,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:41:11,104 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 00:41:11,104 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:41:11,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 00:41:11,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-01-19 00:41:11,107 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 349 [2022-01-19 00:41:11,109 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 714 places, 644 transitions, 6785 flow. Second operand has 10 states, 10 states have (on average 304.6) internal successors, (3046), 10 states have internal predecessors, (3046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:11,109 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:41:11,109 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 349 [2022-01-19 00:41:11,109 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:41:14,891 INFO L129 PetriNetUnfolder]: 3074/11304 cut-off events. [2022-01-19 00:41:14,892 INFO L130 PetriNetUnfolder]: For 86741/87158 co-relation queries the response was YES. [2022-01-19 00:41:15,064 INFO L84 FinitePrefix]: Finished finitePrefix Result has 48497 conditions, 11304 events. 3074/11304 cut-off events. For 86741/87158 co-relation queries the response was YES. Maximal size of possible extension queue 941. Compared 131624 event pairs, 1702 based on Foata normal form. 19/10241 useless extension candidates. Maximal degree in co-relation 48313. Up to 3987 conditions per place. [2022-01-19 00:41:15,096 INFO L132 encePairwiseOnDemand]: 336/349 looper letters, 195 selfloop transitions, 116 changer transitions 24/688 dead transitions. [2022-01-19 00:41:15,097 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 729 places, 688 transitions, 7906 flow [2022-01-19 00:41:15,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-19 00:41:15,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-01-19 00:41:15,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 5541 transitions. [2022-01-19 00:41:15,099 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8820439350525311 [2022-01-19 00:41:15,099 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 5541 transitions. [2022-01-19 00:41:15,099 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 5541 transitions. [2022-01-19 00:41:15,100 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:41:15,100 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 5541 transitions. [2022-01-19 00:41:15,104 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 307.8333333333333) internal successors, (5541), 18 states have internal predecessors, (5541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:15,106 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 349.0) internal successors, (6631), 19 states have internal predecessors, (6631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:15,107 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 349.0) internal successors, (6631), 19 states have internal predecessors, (6631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:15,107 INFO L186 Difference]: Start difference. First operand has 714 places, 644 transitions, 6785 flow. Second operand 18 states and 5541 transitions. [2022-01-19 00:41:15,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 729 places, 688 transitions, 7906 flow [2022-01-19 00:41:15,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 726 places, 688 transitions, 7644 flow, removed 106 selfloop flow, removed 3 redundant places. [2022-01-19 00:41:15,753 INFO L242 Difference]: Finished difference. Result has 733 places, 653 transitions, 7049 flow [2022-01-19 00:41:15,753 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=6563, PETRI_DIFFERENCE_MINUEND_PLACES=709, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=644, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=531, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=7049, PETRI_PLACES=733, PETRI_TRANSITIONS=653} [2022-01-19 00:41:15,754 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 414 predicate places. [2022-01-19 00:41:15,754 INFO L470 AbstractCegarLoop]: Abstraction has has 733 places, 653 transitions, 7049 flow [2022-01-19 00:41:15,754 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 304.6) internal successors, (3046), 10 states have internal predecessors, (3046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:15,754 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:41:15,755 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:41:15,755 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-01-19 00:41:15,755 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:41:15,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:41:15,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1594563102, now seen corresponding path program 13 times [2022-01-19 00:41:15,755 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:41:15,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809578678] [2022-01-19 00:41:15,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:41:15,756 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:41:15,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:41:15,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:41:15,868 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:41:15,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809578678] [2022-01-19 00:41:15,868 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809578678] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:41:15,868 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:41:15,868 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 00:41:15,868 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712999245] [2022-01-19 00:41:15,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:41:15,869 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 00:41:15,869 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:41:15,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 00:41:15,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-01-19 00:41:15,872 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 349 [2022-01-19 00:41:15,873 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 733 places, 653 transitions, 7049 flow. Second operand has 10 states, 10 states have (on average 304.6) internal successors, (3046), 10 states have internal predecessors, (3046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:15,873 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:41:15,873 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 349 [2022-01-19 00:41:15,873 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:41:19,771 INFO L129 PetriNetUnfolder]: 3236/11920 cut-off events. [2022-01-19 00:41:19,771 INFO L130 PetriNetUnfolder]: For 108705/110718 co-relation queries the response was YES. [2022-01-19 00:41:19,963 INFO L84 FinitePrefix]: Finished finitePrefix Result has 52138 conditions, 11920 events. 3236/11920 cut-off events. For 108705/110718 co-relation queries the response was YES. Maximal size of possible extension queue 1001. Compared 139539 event pairs, 1563 based on Foata normal form. 15/10857 useless extension candidates. Maximal degree in co-relation 51949. Up to 3628 conditions per place. [2022-01-19 00:41:19,997 INFO L132 encePairwiseOnDemand]: 336/349 looper letters, 219 selfloop transitions, 143 changer transitions 23/738 dead transitions. [2022-01-19 00:41:19,997 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 752 places, 738 transitions, 8856 flow [2022-01-19 00:41:19,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-01-19 00:41:19,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-01-19 00:41:20,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 6759 transitions. [2022-01-19 00:41:20,221 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8803073717113832 [2022-01-19 00:41:20,221 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 6759 transitions. [2022-01-19 00:41:20,221 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 6759 transitions. [2022-01-19 00:41:20,222 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:41:20,222 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 6759 transitions. [2022-01-19 00:41:20,226 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 307.22727272727275) internal successors, (6759), 22 states have internal predecessors, (6759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:20,240 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 349.0) internal successors, (8027), 23 states have internal predecessors, (8027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:20,241 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 349.0) internal successors, (8027), 23 states have internal predecessors, (8027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:20,241 INFO L186 Difference]: Start difference. First operand has 733 places, 653 transitions, 7049 flow. Second operand 22 states and 6759 transitions. [2022-01-19 00:41:20,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 752 places, 738 transitions, 8856 flow [2022-01-19 00:41:20,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 749 places, 738 transitions, 8668 flow, removed 63 selfloop flow, removed 3 redundant places. [2022-01-19 00:41:20,882 INFO L242 Difference]: Finished difference. Result has 763 places, 685 transitions, 7931 flow [2022-01-19 00:41:20,882 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=6876, PETRI_DIFFERENCE_MINUEND_PLACES=728, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=653, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=114, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=531, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=7931, PETRI_PLACES=763, PETRI_TRANSITIONS=685} [2022-01-19 00:41:20,883 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 444 predicate places. [2022-01-19 00:41:20,883 INFO L470 AbstractCegarLoop]: Abstraction has has 763 places, 685 transitions, 7931 flow [2022-01-19 00:41:20,883 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 304.6) internal successors, (3046), 10 states have internal predecessors, (3046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:20,883 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:41:20,883 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:41:20,883 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-01-19 00:41:20,883 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:41:20,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:41:20,884 INFO L85 PathProgramCache]: Analyzing trace with hash 405814724, now seen corresponding path program 14 times [2022-01-19 00:41:20,884 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:41:20,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688480788] [2022-01-19 00:41:20,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:41:20,884 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:41:20,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:41:21,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:41:21,028 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:41:21,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688480788] [2022-01-19 00:41:21,028 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688480788] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:41:21,028 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:41:21,028 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 00:41:21,028 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372787666] [2022-01-19 00:41:21,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:41:21,029 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 00:41:21,029 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:41:21,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 00:41:21,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-01-19 00:41:21,031 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 349 [2022-01-19 00:41:21,032 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 763 places, 685 transitions, 7931 flow. Second operand has 10 states, 10 states have (on average 304.6) internal successors, (3046), 10 states have internal predecessors, (3046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:21,033 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:41:21,033 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 349 [2022-01-19 00:41:21,033 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:41:25,366 INFO L129 PetriNetUnfolder]: 3294/12092 cut-off events. [2022-01-19 00:41:25,366 INFO L130 PetriNetUnfolder]: For 124248/126482 co-relation queries the response was YES. [2022-01-19 00:41:25,563 INFO L84 FinitePrefix]: Finished finitePrefix Result has 55642 conditions, 12092 events. 3294/12092 cut-off events. For 124248/126482 co-relation queries the response was YES. Maximal size of possible extension queue 1025. Compared 141771 event pairs, 1591 based on Foata normal form. 15/10987 useless extension candidates. Maximal degree in co-relation 55440. Up to 3666 conditions per place. [2022-01-19 00:41:25,599 INFO L132 encePairwiseOnDemand]: 336/349 looper letters, 273 selfloop transitions, 105 changer transitions 21/752 dead transitions. [2022-01-19 00:41:25,599 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 781 places, 752 transitions, 9648 flow [2022-01-19 00:41:25,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-01-19 00:41:25,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-01-19 00:41:25,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 6455 transitions. [2022-01-19 00:41:25,602 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8807477145586028 [2022-01-19 00:41:25,602 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 6455 transitions. [2022-01-19 00:41:25,602 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 6455 transitions. [2022-01-19 00:41:25,603 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:41:25,603 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 6455 transitions. [2022-01-19 00:41:25,606 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 307.3809523809524) internal successors, (6455), 21 states have internal predecessors, (6455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:25,609 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 349.0) internal successors, (7678), 22 states have internal predecessors, (7678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:25,609 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 349.0) internal successors, (7678), 22 states have internal predecessors, (7678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:25,609 INFO L186 Difference]: Start difference. First operand has 763 places, 685 transitions, 7931 flow. Second operand 21 states and 6455 transitions. [2022-01-19 00:41:25,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 781 places, 752 transitions, 9648 flow [2022-01-19 00:41:26,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 779 places, 752 transitions, 9454 flow, removed 97 selfloop flow, removed 2 redundant places. [2022-01-19 00:41:26,592 INFO L242 Difference]: Finished difference. Result has 793 places, 709 transitions, 8615 flow [2022-01-19 00:41:26,593 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=7751, PETRI_DIFFERENCE_MINUEND_PLACES=759, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=685, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=595, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=8615, PETRI_PLACES=793, PETRI_TRANSITIONS=709} [2022-01-19 00:41:26,593 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 474 predicate places. [2022-01-19 00:41:26,593 INFO L470 AbstractCegarLoop]: Abstraction has has 793 places, 709 transitions, 8615 flow [2022-01-19 00:41:26,594 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 304.6) internal successors, (3046), 10 states have internal predecessors, (3046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:26,594 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:41:26,594 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:41:26,594 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-01-19 00:41:26,594 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:41:26,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:41:26,594 INFO L85 PathProgramCache]: Analyzing trace with hash 992327226, now seen corresponding path program 15 times [2022-01-19 00:41:26,594 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:41:26,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11472649] [2022-01-19 00:41:26,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:41:26,595 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:41:26,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:41:26,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:41:26,722 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:41:26,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11472649] [2022-01-19 00:41:26,722 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11472649] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:41:26,722 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:41:26,722 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 00:41:26,722 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494824907] [2022-01-19 00:41:26,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:41:26,723 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 00:41:26,723 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:41:26,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 00:41:26,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-01-19 00:41:26,726 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 349 [2022-01-19 00:41:26,727 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 793 places, 709 transitions, 8615 flow. Second operand has 10 states, 10 states have (on average 304.6) internal successors, (3046), 10 states have internal predecessors, (3046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:26,727 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:41:26,727 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 349 [2022-01-19 00:41:26,728 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:41:31,194 INFO L129 PetriNetUnfolder]: 3334/12328 cut-off events. [2022-01-19 00:41:31,194 INFO L130 PetriNetUnfolder]: For 137683/140006 co-relation queries the response was YES. [2022-01-19 00:41:31,405 INFO L84 FinitePrefix]: Finished finitePrefix Result has 58057 conditions, 12328 events. 3334/12328 cut-off events. For 137683/140006 co-relation queries the response was YES. Maximal size of possible extension queue 1043. Compared 145748 event pairs, 1571 based on Foata normal form. 15/11240 useless extension candidates. Maximal degree in co-relation 57842. Up to 3776 conditions per place. [2022-01-19 00:41:31,442 INFO L132 encePairwiseOnDemand]: 336/349 looper letters, 240 selfloop transitions, 161 changer transitions 18/772 dead transitions. [2022-01-19 00:41:31,442 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 808 places, 772 transitions, 10235 flow [2022-01-19 00:41:31,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-19 00:41:31,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-01-19 00:41:31,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 5537 transitions. [2022-01-19 00:41:31,444 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8814071951607768 [2022-01-19 00:41:31,444 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 5537 transitions. [2022-01-19 00:41:31,444 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 5537 transitions. [2022-01-19 00:41:31,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:41:31,445 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 5537 transitions. [2022-01-19 00:41:31,448 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 307.6111111111111) internal successors, (5537), 18 states have internal predecessors, (5537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:31,450 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 349.0) internal successors, (6631), 19 states have internal predecessors, (6631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:31,451 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 349.0) internal successors, (6631), 19 states have internal predecessors, (6631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:31,451 INFO L186 Difference]: Start difference. First operand has 793 places, 709 transitions, 8615 flow. Second operand 18 states and 5537 transitions. [2022-01-19 00:41:31,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 808 places, 772 transitions, 10235 flow [2022-01-19 00:41:32,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 806 places, 772 transitions, 10037 flow, removed 99 selfloop flow, removed 2 redundant places. [2022-01-19 00:41:32,470 INFO L242 Difference]: Finished difference. Result has 814 places, 730 transitions, 9301 flow [2022-01-19 00:41:32,470 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=8419, PETRI_DIFFERENCE_MINUEND_PLACES=789, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=709, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=143, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=562, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=9301, PETRI_PLACES=814, PETRI_TRANSITIONS=730} [2022-01-19 00:41:32,471 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 495 predicate places. [2022-01-19 00:41:32,471 INFO L470 AbstractCegarLoop]: Abstraction has has 814 places, 730 transitions, 9301 flow [2022-01-19 00:41:32,471 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 304.6) internal successors, (3046), 10 states have internal predecessors, (3046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:32,471 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:41:32,472 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:41:32,472 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-01-19 00:41:32,472 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:41:32,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:41:32,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1700939714, now seen corresponding path program 16 times [2022-01-19 00:41:32,472 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:41:32,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023743902] [2022-01-19 00:41:32,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:41:32,472 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:41:32,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:41:32,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:41:32,606 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:41:32,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023743902] [2022-01-19 00:41:32,606 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023743902] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:41:32,606 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:41:32,607 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 00:41:32,607 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560410801] [2022-01-19 00:41:32,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:41:32,608 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 00:41:32,608 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:41:32,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 00:41:32,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-01-19 00:41:32,611 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 349 [2022-01-19 00:41:32,612 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 814 places, 730 transitions, 9301 flow. Second operand has 10 states, 10 states have (on average 304.6) internal successors, (3046), 10 states have internal predecessors, (3046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:32,612 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:41:32,612 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 349 [2022-01-19 00:41:32,612 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:41:37,389 INFO L129 PetriNetUnfolder]: 3426/12628 cut-off events. [2022-01-19 00:41:37,389 INFO L130 PetriNetUnfolder]: For 146796/149147 co-relation queries the response was YES. [2022-01-19 00:41:37,605 INFO L84 FinitePrefix]: Finished finitePrefix Result has 61446 conditions, 12628 events. 3426/12628 cut-off events. For 146796/149147 co-relation queries the response was YES. Maximal size of possible extension queue 1086. Compared 150703 event pairs, 1601 based on Foata normal form. 15/11499 useless extension candidates. Maximal degree in co-relation 61224. Up to 3842 conditions per place. [2022-01-19 00:41:37,642 INFO L132 encePairwiseOnDemand]: 336/349 looper letters, 283 selfloop transitions, 134 changer transitions 16/786 dead transitions. [2022-01-19 00:41:37,642 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 828 places, 786 transitions, 10957 flow [2022-01-19 00:41:37,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-19 00:41:37,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-01-19 00:41:37,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 5233 transitions. [2022-01-19 00:41:37,645 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8820158435867184 [2022-01-19 00:41:37,645 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 5233 transitions. [2022-01-19 00:41:37,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 5233 transitions. [2022-01-19 00:41:37,646 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:41:37,646 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 5233 transitions. [2022-01-19 00:41:37,648 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 307.8235294117647) internal successors, (5233), 17 states have internal predecessors, (5233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:37,651 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 349.0) internal successors, (6282), 18 states have internal predecessors, (6282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:37,651 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 349.0) internal successors, (6282), 18 states have internal predecessors, (6282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:37,651 INFO L186 Difference]: Start difference. First operand has 814 places, 730 transitions, 9301 flow. Second operand 17 states and 5233 transitions. [2022-01-19 00:41:37,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 828 places, 786 transitions, 10957 flow [2022-01-19 00:41:38,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 826 places, 786 transitions, 10699 flow, removed 129 selfloop flow, removed 2 redundant places. [2022-01-19 00:41:38,854 INFO L242 Difference]: Finished difference. Result has 835 places, 751 transitions, 9927 flow [2022-01-19 00:41:38,854 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=9087, PETRI_DIFFERENCE_MINUEND_PLACES=810, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=730, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=114, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=611, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=9927, PETRI_PLACES=835, PETRI_TRANSITIONS=751} [2022-01-19 00:41:38,855 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 516 predicate places. [2022-01-19 00:41:38,855 INFO L470 AbstractCegarLoop]: Abstraction has has 835 places, 751 transitions, 9927 flow [2022-01-19 00:41:38,855 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 304.6) internal successors, (3046), 10 states have internal predecessors, (3046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:38,855 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:41:38,856 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:41:38,856 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-01-19 00:41:38,856 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:41:38,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:41:38,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1869694260, now seen corresponding path program 17 times [2022-01-19 00:41:38,856 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:41:38,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939237463] [2022-01-19 00:41:38,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:41:38,857 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:41:38,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:41:38,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:41:38,973 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:41:38,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939237463] [2022-01-19 00:41:38,974 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939237463] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:41:38,974 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:41:38,974 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 00:41:38,974 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265423508] [2022-01-19 00:41:38,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:41:38,974 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 00:41:38,974 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:41:38,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 00:41:38,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-01-19 00:41:38,977 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 349 [2022-01-19 00:41:38,978 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 835 places, 751 transitions, 9927 flow. Second operand has 10 states, 10 states have (on average 304.6) internal successors, (3046), 10 states have internal predecessors, (3046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:38,978 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:41:38,978 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 349 [2022-01-19 00:41:38,978 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:41:43,795 INFO L129 PetriNetUnfolder]: 3466/12864 cut-off events. [2022-01-19 00:41:43,795 INFO L130 PetriNetUnfolder]: For 154633/157205 co-relation queries the response was YES. [2022-01-19 00:41:44,047 INFO L84 FinitePrefix]: Finished finitePrefix Result has 63638 conditions, 12864 events. 3466/12864 cut-off events. For 154633/157205 co-relation queries the response was YES. Maximal size of possible extension queue 1122. Compared 154724 event pairs, 1599 based on Foata normal form. 15/11724 useless extension candidates. Maximal degree in co-relation 63408. Up to 3896 conditions per place. [2022-01-19 00:41:44,086 INFO L132 encePairwiseOnDemand]: 336/349 looper letters, 308 selfloop transitions, 126 changer transitions 17/804 dead transitions. [2022-01-19 00:41:44,086 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 850 places, 804 transitions, 11584 flow [2022-01-19 00:41:44,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-19 00:41:44,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-01-19 00:41:44,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 5540 transitions. [2022-01-19 00:41:44,089 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8818847500795924 [2022-01-19 00:41:44,089 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 5540 transitions. [2022-01-19 00:41:44,089 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 5540 transitions. [2022-01-19 00:41:44,090 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:41:44,090 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 5540 transitions. [2022-01-19 00:41:44,093 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 307.77777777777777) internal successors, (5540), 18 states have internal predecessors, (5540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:44,096 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 349.0) internal successors, (6631), 19 states have internal predecessors, (6631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:44,096 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 349.0) internal successors, (6631), 19 states have internal predecessors, (6631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:44,096 INFO L186 Difference]: Start difference. First operand has 835 places, 751 transitions, 9927 flow. Second operand 18 states and 5540 transitions. [2022-01-19 00:41:44,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 850 places, 804 transitions, 11584 flow [2022-01-19 00:41:45,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 848 places, 804 transitions, 11414 flow, removed 85 selfloop flow, removed 2 redundant places. [2022-01-19 00:41:45,297 INFO L242 Difference]: Finished difference. Result has 856 places, 770 transitions, 10584 flow [2022-01-19 00:41:45,298 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=9761, PETRI_DIFFERENCE_MINUEND_PLACES=831, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=751, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=638, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=10584, PETRI_PLACES=856, PETRI_TRANSITIONS=770} [2022-01-19 00:41:45,298 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 537 predicate places. [2022-01-19 00:41:45,298 INFO L470 AbstractCegarLoop]: Abstraction has has 856 places, 770 transitions, 10584 flow [2022-01-19 00:41:45,299 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 304.6) internal successors, (3046), 10 states have internal predecessors, (3046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:45,299 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:41:45,299 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:41:45,299 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-01-19 00:41:45,299 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:41:45,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:41:45,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1197953896, now seen corresponding path program 18 times [2022-01-19 00:41:45,300 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:41:45,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535396880] [2022-01-19 00:41:45,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:41:45,300 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:41:45,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:41:45,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:41:45,403 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:41:45,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535396880] [2022-01-19 00:41:45,403 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535396880] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:41:45,403 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:41:45,404 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 00:41:45,404 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617319218] [2022-01-19 00:41:45,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:41:45,404 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 00:41:45,404 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:41:45,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 00:41:45,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-01-19 00:41:45,406 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 349 [2022-01-19 00:41:45,408 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 856 places, 770 transitions, 10584 flow. Second operand has 10 states, 10 states have (on average 304.6) internal successors, (3046), 10 states have internal predecessors, (3046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:45,408 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:41:45,408 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 349 [2022-01-19 00:41:45,408 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:41:50,474 INFO L129 PetriNetUnfolder]: 3474/13044 cut-off events. [2022-01-19 00:41:50,475 INFO L130 PetriNetUnfolder]: For 165434/168194 co-relation queries the response was YES. [2022-01-19 00:41:50,703 INFO L84 FinitePrefix]: Finished finitePrefix Result has 65101 conditions, 13044 events. 3474/13044 cut-off events. For 165434/168194 co-relation queries the response was YES. Maximal size of possible extension queue 1143. Compared 157524 event pairs, 1581 based on Foata normal form. 15/11928 useless extension candidates. Maximal degree in co-relation 64864. Up to 3936 conditions per place. [2022-01-19 00:41:50,740 INFO L132 encePairwiseOnDemand]: 336/349 looper letters, 264 selfloop transitions, 178 changer transitions 22/817 dead transitions. [2022-01-19 00:41:50,740 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 869 places, 817 transitions, 11931 flow [2022-01-19 00:41:50,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-19 00:41:50,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-01-19 00:41:50,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 4929 transitions. [2022-01-19 00:41:50,742 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8827005730659025 [2022-01-19 00:41:50,742 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 4929 transitions. [2022-01-19 00:41:50,742 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 4929 transitions. [2022-01-19 00:41:50,743 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:41:50,743 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 4929 transitions. [2022-01-19 00:41:50,746 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 308.0625) internal successors, (4929), 16 states have internal predecessors, (4929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:50,748 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 349.0) internal successors, (5933), 17 states have internal predecessors, (5933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:50,748 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 349.0) internal successors, (5933), 17 states have internal predecessors, (5933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:50,748 INFO L186 Difference]: Start difference. First operand has 856 places, 770 transitions, 10584 flow. Second operand 16 states and 4929 transitions. [2022-01-19 00:41:50,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 869 places, 817 transitions, 11931 flow [2022-01-19 00:41:51,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 867 places, 817 transitions, 11717 flow, removed 107 selfloop flow, removed 2 redundant places. [2022-01-19 00:41:51,794 INFO L242 Difference]: Finished difference. Result has 874 places, 778 transitions, 10950 flow [2022-01-19 00:41:51,795 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=10372, PETRI_DIFFERENCE_MINUEND_PLACES=852, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=770, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=170, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=596, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=10950, PETRI_PLACES=874, PETRI_TRANSITIONS=778} [2022-01-19 00:41:51,795 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 555 predicate places. [2022-01-19 00:41:51,795 INFO L470 AbstractCegarLoop]: Abstraction has has 874 places, 778 transitions, 10950 flow [2022-01-19 00:41:51,796 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 304.6) internal successors, (3046), 10 states have internal predecessors, (3046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:51,796 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:41:51,796 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:41:51,796 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-01-19 00:41:51,796 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:41:51,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:41:51,796 INFO L85 PathProgramCache]: Analyzing trace with hash 2002777388, now seen corresponding path program 19 times [2022-01-19 00:41:51,796 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:41:51,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009817669] [2022-01-19 00:41:51,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:41:51,797 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:41:51,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:41:51,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:41:51,925 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:41:51,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009817669] [2022-01-19 00:41:51,925 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009817669] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:41:51,925 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:41:51,925 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 00:41:51,925 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917558465] [2022-01-19 00:41:51,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:41:51,925 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 00:41:51,925 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:41:51,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 00:41:51,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-01-19 00:41:51,929 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 349 [2022-01-19 00:41:51,930 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 874 places, 778 transitions, 10950 flow. Second operand has 10 states, 10 states have (on average 304.6) internal successors, (3046), 10 states have internal predecessors, (3046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:51,930 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:41:51,930 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 349 [2022-01-19 00:41:51,930 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:41:56,959 INFO L129 PetriNetUnfolder]: 3508/13142 cut-off events. [2022-01-19 00:41:56,959 INFO L130 PetriNetUnfolder]: For 172540/175300 co-relation queries the response was YES. [2022-01-19 00:41:57,197 INFO L84 FinitePrefix]: Finished finitePrefix Result has 67430 conditions, 13142 events. 3508/13142 cut-off events. For 172540/175300 co-relation queries the response was YES. Maximal size of possible extension queue 1167. Compared 159320 event pairs, 1621 based on Foata normal form. 15/11978 useless extension candidates. Maximal degree in co-relation 67187. Up to 3968 conditions per place. [2022-01-19 00:41:57,236 INFO L132 encePairwiseOnDemand]: 336/349 looper letters, 297 selfloop transitions, 152 changer transitions 23/825 dead transitions. [2022-01-19 00:41:57,236 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 889 places, 825 transitions, 12446 flow [2022-01-19 00:41:57,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-19 00:41:57,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-01-19 00:41:57,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 5540 transitions. [2022-01-19 00:41:57,241 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8818847500795924 [2022-01-19 00:41:57,241 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 5540 transitions. [2022-01-19 00:41:57,241 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 5540 transitions. [2022-01-19 00:41:57,242 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:41:57,242 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 5540 transitions. [2022-01-19 00:41:57,246 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 307.77777777777777) internal successors, (5540), 18 states have internal predecessors, (5540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:57,249 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 349.0) internal successors, (6631), 19 states have internal predecessors, (6631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:57,249 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 349.0) internal successors, (6631), 19 states have internal predecessors, (6631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:57,249 INFO L186 Difference]: Start difference. First operand has 874 places, 778 transitions, 10950 flow. Second operand 18 states and 5540 transitions. [2022-01-19 00:41:57,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 889 places, 825 transitions, 12446 flow [2022-01-19 00:41:58,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 884 places, 825 transitions, 12136 flow, removed 39 selfloop flow, removed 5 redundant places. [2022-01-19 00:41:58,473 INFO L242 Difference]: Finished difference. Result has 891 places, 792 transitions, 11376 flow [2022-01-19 00:41:58,474 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=10660, PETRI_DIFFERENCE_MINUEND_PLACES=867, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=778, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=140, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=634, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=11376, PETRI_PLACES=891, PETRI_TRANSITIONS=792} [2022-01-19 00:41:58,474 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 572 predicate places. [2022-01-19 00:41:58,474 INFO L470 AbstractCegarLoop]: Abstraction has has 891 places, 792 transitions, 11376 flow [2022-01-19 00:41:58,475 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 304.6) internal successors, (3046), 10 states have internal predecessors, (3046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:58,475 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:41:58,475 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:41:58,475 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-01-19 00:41:58,475 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:41:58,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:41:58,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1661105862, now seen corresponding path program 20 times [2022-01-19 00:41:58,476 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:41:58,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575528034] [2022-01-19 00:41:58,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:41:58,476 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:41:58,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:41:58,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:41:58,586 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:41:58,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575528034] [2022-01-19 00:41:58,586 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575528034] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:41:58,586 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:41:58,586 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-19 00:41:58,586 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365387306] [2022-01-19 00:41:58,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:41:58,587 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-19 00:41:58,587 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:41:58,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-19 00:41:58,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-01-19 00:41:58,589 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 349 [2022-01-19 00:41:58,590 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 891 places, 792 transitions, 11376 flow. Second operand has 10 states, 10 states have (on average 304.6) internal successors, (3046), 10 states have internal predecessors, (3046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:41:58,590 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:41:58,590 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 349 [2022-01-19 00:41:58,591 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:42:04,405 INFO L129 PetriNetUnfolder]: 3508/13260 cut-off events. [2022-01-19 00:42:04,406 INFO L130 PetriNetUnfolder]: For 172604/175364 co-relation queries the response was YES. [2022-01-19 00:42:04,652 INFO L84 FinitePrefix]: Finished finitePrefix Result has 67808 conditions, 13260 events. 3508/13260 cut-off events. For 172604/175364 co-relation queries the response was YES. Maximal size of possible extension queue 1173. Compared 161275 event pairs, 1605 based on Foata normal form. 15/12112 useless extension candidates. Maximal degree in co-relation 67560. Up to 3964 conditions per place. [2022-01-19 00:42:04,689 INFO L132 encePairwiseOnDemand]: 336/349 looper letters, 318 selfloop transitions, 137 changer transitions 27/832 dead transitions. [2022-01-19 00:42:04,689 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 905 places, 832 transitions, 12705 flow [2022-01-19 00:42:04,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-19 00:42:04,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-01-19 00:42:04,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 5237 transitions. [2022-01-19 00:42:04,692 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8826900387662229 [2022-01-19 00:42:04,692 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 5237 transitions. [2022-01-19 00:42:04,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 5237 transitions. [2022-01-19 00:42:04,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:42:04,693 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 5237 transitions. [2022-01-19 00:42:04,695 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 308.05882352941177) internal successors, (5237), 17 states have internal predecessors, (5237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:04,698 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 349.0) internal successors, (6282), 18 states have internal predecessors, (6282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:04,698 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 349.0) internal successors, (6282), 18 states have internal predecessors, (6282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:04,698 INFO L186 Difference]: Start difference. First operand has 891 places, 792 transitions, 11376 flow. Second operand 17 states and 5237 transitions. [2022-01-19 00:42:04,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 905 places, 832 transitions, 12705 flow [2022-01-19 00:42:06,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 901 places, 832 transitions, 12514 flow, removed 58 selfloop flow, removed 4 redundant places. [2022-01-19 00:42:06,219 INFO L242 Difference]: Finished difference. Result has 908 places, 797 transitions, 11669 flow [2022-01-19 00:42:06,219 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=11191, PETRI_DIFFERENCE_MINUEND_PLACES=885, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=792, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=130, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=658, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=11669, PETRI_PLACES=908, PETRI_TRANSITIONS=797} [2022-01-19 00:42:06,220 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 589 predicate places. [2022-01-19 00:42:06,220 INFO L470 AbstractCegarLoop]: Abstraction has has 908 places, 797 transitions, 11669 flow [2022-01-19 00:42:06,220 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 304.6) internal successors, (3046), 10 states have internal predecessors, (3046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:06,220 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:42:06,220 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:42:06,220 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-01-19 00:42:06,221 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:42:06,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:42:06,221 INFO L85 PathProgramCache]: Analyzing trace with hash -492528208, now seen corresponding path program 1 times [2022-01-19 00:42:06,221 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:42:06,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161710097] [2022-01-19 00:42:06,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:42:06,221 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:42:06,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:42:06,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:42:06,273 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:42:06,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161710097] [2022-01-19 00:42:06,273 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161710097] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:42:06,273 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:42:06,274 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 00:42:06,274 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804053807] [2022-01-19 00:42:06,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:42:06,274 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 00:42:06,274 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:42:06,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 00:42:06,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 00:42:06,276 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 349 [2022-01-19 00:42:06,276 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 908 places, 797 transitions, 11669 flow. Second operand has 4 states, 4 states have (on average 314.25) internal successors, (1257), 4 states have internal predecessors, (1257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:06,276 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:42:06,276 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 349 [2022-01-19 00:42:06,276 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:42:09,000 INFO L129 PetriNetUnfolder]: 1295/9118 cut-off events. [2022-01-19 00:42:09,000 INFO L130 PetriNetUnfolder]: For 116110/116168 co-relation queries the response was YES. [2022-01-19 00:42:09,169 INFO L84 FinitePrefix]: Finished finitePrefix Result has 46894 conditions, 9118 events. 1295/9118 cut-off events. For 116110/116168 co-relation queries the response was YES. Maximal size of possible extension queue 409. Compared 107907 event pairs, 129 based on Foata normal form. 35/8911 useless extension candidates. Maximal degree in co-relation 46642. Up to 579 conditions per place. [2022-01-19 00:42:09,182 INFO L132 encePairwiseOnDemand]: 341/349 looper letters, 77 selfloop transitions, 19 changer transitions 421/830 dead transitions. [2022-01-19 00:42:09,182 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 910 places, 830 transitions, 12225 flow [2022-01-19 00:42:09,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 00:42:09,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 00:42:09,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1605 transitions. [2022-01-19 00:42:09,183 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9197707736389685 [2022-01-19 00:42:09,183 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1605 transitions. [2022-01-19 00:42:09,183 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1605 transitions. [2022-01-19 00:42:09,183 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:42:09,183 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1605 transitions. [2022-01-19 00:42:09,184 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 321.0) internal successors, (1605), 5 states have internal predecessors, (1605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:09,185 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 349.0) internal successors, (2094), 6 states have internal predecessors, (2094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:09,186 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 349.0) internal successors, (2094), 6 states have internal predecessors, (2094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:09,186 INFO L186 Difference]: Start difference. First operand has 908 places, 797 transitions, 11669 flow. Second operand 5 states and 1605 transitions. [2022-01-19 00:42:09,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 910 places, 830 transitions, 12225 flow [2022-01-19 00:42:10,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 907 places, 830 transitions, 12037 flow, removed 58 selfloop flow, removed 3 redundant places. [2022-01-19 00:42:10,340 INFO L242 Difference]: Finished difference. Result has 911 places, 391 transitions, 2103 flow [2022-01-19 00:42:10,341 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=11435, PETRI_DIFFERENCE_MINUEND_PLACES=903, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=795, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=778, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2103, PETRI_PLACES=911, PETRI_TRANSITIONS=391} [2022-01-19 00:42:10,342 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 592 predicate places. [2022-01-19 00:42:10,342 INFO L470 AbstractCegarLoop]: Abstraction has has 911 places, 391 transitions, 2103 flow [2022-01-19 00:42:10,342 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 314.25) internal successors, (1257), 4 states have internal predecessors, (1257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:10,342 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:42:10,342 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:42:10,343 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-01-19 00:42:10,343 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:42:10,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:42:10,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1249328010, now seen corresponding path program 3 times [2022-01-19 00:42:10,343 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:42:10,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431956282] [2022-01-19 00:42:10,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:42:10,344 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:42:10,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:42:10,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:42:10,387 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:42:10,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431956282] [2022-01-19 00:42:10,387 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431956282] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:42:10,387 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:42:10,387 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 00:42:10,387 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048991972] [2022-01-19 00:42:10,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:42:10,388 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 00:42:10,388 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:42:10,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 00:42:10,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 00:42:10,389 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 349 [2022-01-19 00:42:10,390 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 911 places, 391 transitions, 2103 flow. Second operand has 4 states, 4 states have (on average 314.25) internal successors, (1257), 4 states have internal predecessors, (1257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:10,390 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:42:10,390 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 349 [2022-01-19 00:42:10,390 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:42:11,443 INFO L129 PetriNetUnfolder]: 361/3193 cut-off events. [2022-01-19 00:42:11,443 INFO L130 PetriNetUnfolder]: For 28480/28883 co-relation queries the response was YES. [2022-01-19 00:42:11,495 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11263 conditions, 3193 events. 361/3193 cut-off events. For 28480/28883 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 29119 event pairs, 165 based on Foata normal form. 22/2980 useless extension candidates. Maximal degree in co-relation 11010. Up to 383 conditions per place. [2022-01-19 00:42:11,502 INFO L132 encePairwiseOnDemand]: 342/349 looper letters, 91 selfloop transitions, 12 changer transitions 0/416 dead transitions. [2022-01-19 00:42:11,502 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 647 places, 416 transitions, 2590 flow [2022-01-19 00:42:11,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 00:42:11,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 00:42:11,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1601 transitions. [2022-01-19 00:42:11,503 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9174785100286533 [2022-01-19 00:42:11,503 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1601 transitions. [2022-01-19 00:42:11,503 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1601 transitions. [2022-01-19 00:42:11,503 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:42:11,503 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1601 transitions. [2022-01-19 00:42:11,504 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 320.2) internal successors, (1601), 5 states have internal predecessors, (1601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:11,505 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 349.0) internal successors, (2094), 6 states have internal predecessors, (2094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:11,505 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 349.0) internal successors, (2094), 6 states have internal predecessors, (2094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:11,505 INFO L186 Difference]: Start difference. First operand has 911 places, 391 transitions, 2103 flow. Second operand 5 states and 1601 transitions. [2022-01-19 00:42:11,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 647 places, 416 transitions, 2590 flow [2022-01-19 00:42:11,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 529 places, 416 transitions, 2256 flow, removed 114 selfloop flow, removed 118 redundant places. [2022-01-19 00:42:11,577 INFO L242 Difference]: Finished difference. Result has 532 places, 398 transitions, 1938 flow [2022-01-19 00:42:11,578 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=1779, PETRI_DIFFERENCE_MINUEND_PLACES=525, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=391, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=381, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1938, PETRI_PLACES=532, PETRI_TRANSITIONS=398} [2022-01-19 00:42:11,578 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 213 predicate places. [2022-01-19 00:42:11,578 INFO L470 AbstractCegarLoop]: Abstraction has has 532 places, 398 transitions, 1938 flow [2022-01-19 00:42:11,578 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 314.25) internal successors, (1257), 4 states have internal predecessors, (1257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:11,578 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:42:11,578 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:42:11,578 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-01-19 00:42:11,579 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:42:11,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:42:11,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1669880470, now seen corresponding path program 4 times [2022-01-19 00:42:11,579 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:42:11,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504019712] [2022-01-19 00:42:11,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:42:11,579 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:42:11,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:42:11,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:42:11,623 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:42:11,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504019712] [2022-01-19 00:42:11,623 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504019712] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:42:11,623 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:42:11,624 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 00:42:11,624 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123913905] [2022-01-19 00:42:11,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:42:11,624 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 00:42:11,624 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:42:11,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 00:42:11,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 00:42:11,625 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 349 [2022-01-19 00:42:11,626 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 532 places, 398 transitions, 1938 flow. Second operand has 4 states, 4 states have (on average 314.25) internal successors, (1257), 4 states have internal predecessors, (1257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:11,626 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:42:11,626 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 349 [2022-01-19 00:42:11,626 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:42:12,236 INFO L129 PetriNetUnfolder]: 384/3178 cut-off events. [2022-01-19 00:42:12,236 INFO L130 PetriNetUnfolder]: For 8918/9065 co-relation queries the response was YES. [2022-01-19 00:42:12,281 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7857 conditions, 3178 events. 384/3178 cut-off events. For 8918/9065 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 29099 event pairs, 135 based on Foata normal form. 20/2964 useless extension candidates. Maximal degree in co-relation 7698. Up to 289 conditions per place. [2022-01-19 00:42:12,288 INFO L132 encePairwiseOnDemand]: 343/349 looper letters, 78 selfloop transitions, 13 changer transitions 23/427 dead transitions. [2022-01-19 00:42:12,288 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 536 places, 427 transitions, 2530 flow [2022-01-19 00:42:12,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 00:42:12,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 00:42:12,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1604 transitions. [2022-01-19 00:42:12,289 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9191977077363896 [2022-01-19 00:42:12,289 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1604 transitions. [2022-01-19 00:42:12,289 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1604 transitions. [2022-01-19 00:42:12,290 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:42:12,290 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1604 transitions. [2022-01-19 00:42:12,290 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 320.8) internal successors, (1604), 5 states have internal predecessors, (1604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:12,291 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 349.0) internal successors, (2094), 6 states have internal predecessors, (2094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:12,292 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 349.0) internal successors, (2094), 6 states have internal predecessors, (2094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:12,292 INFO L186 Difference]: Start difference. First operand has 532 places, 398 transitions, 1938 flow. Second operand 5 states and 1604 transitions. [2022-01-19 00:42:12,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 536 places, 427 transitions, 2530 flow [2022-01-19 00:42:12,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 536 places, 427 transitions, 2488 flow, removed 21 selfloop flow, removed 0 redundant places. [2022-01-19 00:42:12,326 INFO L242 Difference]: Finished difference. Result has 538 places, 390 transitions, 1822 flow [2022-01-19 00:42:12,326 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=1887, PETRI_DIFFERENCE_MINUEND_PLACES=532, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=397, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=386, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1822, PETRI_PLACES=538, PETRI_TRANSITIONS=390} [2022-01-19 00:42:12,326 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 219 predicate places. [2022-01-19 00:42:12,326 INFO L470 AbstractCegarLoop]: Abstraction has has 538 places, 390 transitions, 1822 flow [2022-01-19 00:42:12,327 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 314.25) internal successors, (1257), 4 states have internal predecessors, (1257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:12,327 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:42:12,327 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:42:12,327 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-01-19 00:42:12,327 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:42:12,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:42:12,327 INFO L85 PathProgramCache]: Analyzing trace with hash 916627046, now seen corresponding path program 2 times [2022-01-19 00:42:12,327 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:42:12,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171351718] [2022-01-19 00:42:12,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:42:12,328 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:42:12,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:42:12,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:42:12,380 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:42:12,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171351718] [2022-01-19 00:42:12,380 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171351718] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:42:12,380 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:42:12,380 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 00:42:12,380 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302169358] [2022-01-19 00:42:12,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:42:12,381 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 00:42:12,381 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:42:12,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 00:42:12,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 00:42:12,383 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 349 [2022-01-19 00:42:12,383 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 538 places, 390 transitions, 1822 flow. Second operand has 4 states, 4 states have (on average 314.25) internal successors, (1257), 4 states have internal predecessors, (1257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:12,383 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:42:12,383 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 349 [2022-01-19 00:42:12,383 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:42:13,026 INFO L129 PetriNetUnfolder]: 313/2808 cut-off events. [2022-01-19 00:42:13,027 INFO L130 PetriNetUnfolder]: For 9347/9761 co-relation queries the response was YES. [2022-01-19 00:42:13,075 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7030 conditions, 2808 events. 313/2808 cut-off events. For 9347/9761 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 24654 event pairs, 159 based on Foata normal form. 14/2617 useless extension candidates. Maximal degree in co-relation 6869. Up to 367 conditions per place. [2022-01-19 00:42:13,082 INFO L132 encePairwiseOnDemand]: 343/349 looper letters, 73 selfloop transitions, 10 changer transitions 6/402 dead transitions. [2022-01-19 00:42:13,082 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 542 places, 402 transitions, 2092 flow [2022-01-19 00:42:13,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 00:42:13,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 00:42:13,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1593 transitions. [2022-01-19 00:42:13,083 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9128939828080229 [2022-01-19 00:42:13,083 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1593 transitions. [2022-01-19 00:42:13,083 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1593 transitions. [2022-01-19 00:42:13,084 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:42:13,084 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1593 transitions. [2022-01-19 00:42:13,084 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 318.6) internal successors, (1593), 5 states have internal predecessors, (1593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:13,085 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 349.0) internal successors, (2094), 6 states have internal predecessors, (2094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:13,085 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 349.0) internal successors, (2094), 6 states have internal predecessors, (2094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:13,086 INFO L186 Difference]: Start difference. First operand has 538 places, 390 transitions, 1822 flow. Second operand 5 states and 1593 transitions. [2022-01-19 00:42:13,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 542 places, 402 transitions, 2092 flow [2022-01-19 00:42:13,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 538 places, 402 transitions, 2058 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-01-19 00:42:13,118 INFO L242 Difference]: Finished difference. Result has 540 places, 387 transitions, 1786 flow [2022-01-19 00:42:13,118 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=1778, PETRI_DIFFERENCE_MINUEND_PLACES=534, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=389, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=379, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1786, PETRI_PLACES=540, PETRI_TRANSITIONS=387} [2022-01-19 00:42:13,118 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 221 predicate places. [2022-01-19 00:42:13,118 INFO L470 AbstractCegarLoop]: Abstraction has has 540 places, 387 transitions, 1786 flow [2022-01-19 00:42:13,119 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 314.25) internal successors, (1257), 4 states have internal predecessors, (1257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:13,119 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:42:13,119 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:42:13,119 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-01-19 00:42:13,119 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:42:13,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:42:13,120 INFO L85 PathProgramCache]: Analyzing trace with hash -2006279322, now seen corresponding path program 3 times [2022-01-19 00:42:13,120 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:42:13,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330328149] [2022-01-19 00:42:13,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:42:13,120 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:42:13,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:42:13,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:42:13,170 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:42:13,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330328149] [2022-01-19 00:42:13,171 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330328149] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:42:13,171 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:42:13,171 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 00:42:13,171 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464380895] [2022-01-19 00:42:13,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:42:13,171 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 00:42:13,171 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:42:13,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 00:42:13,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 00:42:13,173 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 349 [2022-01-19 00:42:13,173 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 540 places, 387 transitions, 1786 flow. Second operand has 4 states, 4 states have (on average 314.25) internal successors, (1257), 4 states have internal predecessors, (1257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:13,173 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:42:13,173 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 349 [2022-01-19 00:42:13,174 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:42:13,786 INFO L129 PetriNetUnfolder]: 329/2788 cut-off events. [2022-01-19 00:42:13,787 INFO L130 PetriNetUnfolder]: For 9066/9469 co-relation queries the response was YES. [2022-01-19 00:42:13,820 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6876 conditions, 2788 events. 329/2788 cut-off events. For 9066/9469 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 24038 event pairs, 111 based on Foata normal form. 19/2593 useless extension candidates. Maximal degree in co-relation 6715. Up to 256 conditions per place. [2022-01-19 00:42:13,825 INFO L132 encePairwiseOnDemand]: 345/349 looper letters, 71 selfloop transitions, 15 changer transitions 2/401 dead transitions. [2022-01-19 00:42:13,825 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 543 places, 401 transitions, 2128 flow [2022-01-19 00:42:13,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 00:42:13,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 00:42:13,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1591 transitions. [2022-01-19 00:42:13,827 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9117478510028654 [2022-01-19 00:42:13,827 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1591 transitions. [2022-01-19 00:42:13,827 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1591 transitions. [2022-01-19 00:42:13,827 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:42:13,827 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1591 transitions. [2022-01-19 00:42:13,828 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 318.2) internal successors, (1591), 5 states have internal predecessors, (1591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:13,829 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 349.0) internal successors, (2094), 6 states have internal predecessors, (2094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:13,829 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 349.0) internal successors, (2094), 6 states have internal predecessors, (2094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:13,829 INFO L186 Difference]: Start difference. First operand has 540 places, 387 transitions, 1786 flow. Second operand 5 states and 1591 transitions. [2022-01-19 00:42:13,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 543 places, 401 transitions, 2128 flow [2022-01-19 00:42:13,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 537 places, 401 transitions, 2088 flow, removed 10 selfloop flow, removed 6 redundant places. [2022-01-19 00:42:13,860 INFO L242 Difference]: Finished difference. Result has 537 places, 386 transitions, 1755 flow [2022-01-19 00:42:13,860 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=1717, PETRI_DIFFERENCE_MINUEND_PLACES=533, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=385, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=371, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1755, PETRI_PLACES=537, PETRI_TRANSITIONS=386} [2022-01-19 00:42:13,861 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 218 predicate places. [2022-01-19 00:42:13,861 INFO L470 AbstractCegarLoop]: Abstraction has has 537 places, 386 transitions, 1755 flow [2022-01-19 00:42:13,861 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 314.25) internal successors, (1257), 4 states have internal predecessors, (1257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:13,861 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:42:13,861 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:42:13,861 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-01-19 00:42:13,862 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:42:13,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:42:13,862 INFO L85 PathProgramCache]: Analyzing trace with hash 293277038, now seen corresponding path program 1 times [2022-01-19 00:42:13,862 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:42:13,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129913503] [2022-01-19 00:42:13,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:42:13,862 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:42:13,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:42:13,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:42:13,906 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:42:13,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129913503] [2022-01-19 00:42:13,907 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129913503] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:42:13,907 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:42:13,907 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 00:42:13,907 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602739711] [2022-01-19 00:42:13,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:42:13,907 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 00:42:13,907 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:42:13,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 00:42:13,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 00:42:13,908 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 349 [2022-01-19 00:42:13,909 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 537 places, 386 transitions, 1755 flow. Second operand has 4 states, 4 states have (on average 314.5) internal successors, (1258), 4 states have internal predecessors, (1258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:13,909 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:42:13,909 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 349 [2022-01-19 00:42:13,909 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:42:14,539 INFO L129 PetriNetUnfolder]: 373/2913 cut-off events. [2022-01-19 00:42:14,539 INFO L130 PetriNetUnfolder]: For 8402/8449 co-relation queries the response was YES. [2022-01-19 00:42:14,588 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7337 conditions, 2913 events. 373/2913 cut-off events. For 8402/8449 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 25867 event pairs, 122 based on Foata normal form. 29/2730 useless extension candidates. Maximal degree in co-relation 7180. Up to 202 conditions per place. [2022-01-19 00:42:14,594 INFO L132 encePairwiseOnDemand]: 341/349 looper letters, 83 selfloop transitions, 21 changer transitions 13/427 dead transitions. [2022-01-19 00:42:14,594 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 541 places, 427 transitions, 2531 flow [2022-01-19 00:42:14,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 00:42:14,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 00:42:14,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1604 transitions. [2022-01-19 00:42:14,596 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9191977077363896 [2022-01-19 00:42:14,596 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1604 transitions. [2022-01-19 00:42:14,596 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1604 transitions. [2022-01-19 00:42:14,596 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:42:14,596 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1604 transitions. [2022-01-19 00:42:14,597 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 320.8) internal successors, (1604), 5 states have internal predecessors, (1604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:14,598 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 349.0) internal successors, (2094), 6 states have internal predecessors, (2094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:14,598 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 349.0) internal successors, (2094), 6 states have internal predecessors, (2094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:14,598 INFO L186 Difference]: Start difference. First operand has 537 places, 386 transitions, 1755 flow. Second operand 5 states and 1604 transitions. [2022-01-19 00:42:14,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 541 places, 427 transitions, 2531 flow [2022-01-19 00:42:14,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 541 places, 427 transitions, 2523 flow, removed 4 selfloop flow, removed 0 redundant places. [2022-01-19 00:42:14,627 INFO L242 Difference]: Finished difference. Result has 545 places, 391 transitions, 1963 flow [2022-01-19 00:42:14,628 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=1747, PETRI_DIFFERENCE_MINUEND_PLACES=537, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=386, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1963, PETRI_PLACES=545, PETRI_TRANSITIONS=391} [2022-01-19 00:42:14,628 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 226 predicate places. [2022-01-19 00:42:14,628 INFO L470 AbstractCegarLoop]: Abstraction has has 545 places, 391 transitions, 1963 flow [2022-01-19 00:42:14,628 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 314.5) internal successors, (1258), 4 states have internal predecessors, (1258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:14,628 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:42:14,629 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:42:14,629 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-01-19 00:42:14,629 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:42:14,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:42:14,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1851766016, now seen corresponding path program 1 times [2022-01-19 00:42:14,629 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:42:14,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604359140] [2022-01-19 00:42:14,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:42:14,630 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:42:14,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:42:14,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:42:14,680 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:42:14,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604359140] [2022-01-19 00:42:14,681 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604359140] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:42:14,681 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:42:14,681 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 00:42:14,681 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149972054] [2022-01-19 00:42:14,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:42:14,681 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 00:42:14,681 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:42:14,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 00:42:14,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 00:42:14,683 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 349 [2022-01-19 00:42:14,683 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 545 places, 391 transitions, 1963 flow. Second operand has 4 states, 4 states have (on average 314.5) internal successors, (1258), 4 states have internal predecessors, (1258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:14,683 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:42:14,683 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 349 [2022-01-19 00:42:14,683 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:42:15,306 INFO L129 PetriNetUnfolder]: 371/3171 cut-off events. [2022-01-19 00:42:15,306 INFO L130 PetriNetUnfolder]: For 11078/11713 co-relation queries the response was YES. [2022-01-19 00:42:15,351 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7813 conditions, 3171 events. 371/3171 cut-off events. For 11078/11713 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 28369 event pairs, 121 based on Foata normal form. 43/2963 useless extension candidates. Maximal degree in co-relation 7652. Up to 198 conditions per place. [2022-01-19 00:42:15,358 INFO L132 encePairwiseOnDemand]: 340/349 looper letters, 97 selfloop transitions, 26 changer transitions 10/443 dead transitions. [2022-01-19 00:42:15,358 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 545 places, 443 transitions, 3002 flow [2022-01-19 00:42:15,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 00:42:15,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 00:42:15,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1605 transitions. [2022-01-19 00:42:15,359 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9197707736389685 [2022-01-19 00:42:15,359 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1605 transitions. [2022-01-19 00:42:15,359 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1605 transitions. [2022-01-19 00:42:15,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:42:15,360 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1605 transitions. [2022-01-19 00:42:15,361 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 321.0) internal successors, (1605), 5 states have internal predecessors, (1605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:15,362 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 349.0) internal successors, (2094), 6 states have internal predecessors, (2094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:15,362 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 349.0) internal successors, (2094), 6 states have internal predecessors, (2094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:15,362 INFO L186 Difference]: Start difference. First operand has 545 places, 391 transitions, 1963 flow. Second operand 5 states and 1605 transitions. [2022-01-19 00:42:15,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 545 places, 443 transitions, 3002 flow [2022-01-19 00:42:15,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 542 places, 443 transitions, 2918 flow, removed 42 selfloop flow, removed 3 redundant places. [2022-01-19 00:42:15,402 INFO L242 Difference]: Finished difference. Result has 546 places, 402 transitions, 2254 flow [2022-01-19 00:42:15,402 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=1921, PETRI_DIFFERENCE_MINUEND_PLACES=538, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=391, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=369, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2254, PETRI_PLACES=546, PETRI_TRANSITIONS=402} [2022-01-19 00:42:15,402 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 227 predicate places. [2022-01-19 00:42:15,403 INFO L470 AbstractCegarLoop]: Abstraction has has 546 places, 402 transitions, 2254 flow [2022-01-19 00:42:15,403 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 314.5) internal successors, (1258), 4 states have internal predecessors, (1258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:15,403 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:42:15,403 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:42:15,403 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-01-19 00:42:15,403 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:42:15,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:42:15,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1708910834, now seen corresponding path program 2 times [2022-01-19 00:42:15,404 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:42:15,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466647033] [2022-01-19 00:42:15,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:42:15,404 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:42:15,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:42:15,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:42:15,443 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:42:15,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466647033] [2022-01-19 00:42:15,444 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466647033] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:42:15,444 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:42:15,444 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 00:42:15,444 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550637859] [2022-01-19 00:42:15,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:42:15,444 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 00:42:15,444 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:42:15,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 00:42:15,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 00:42:15,446 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 349 [2022-01-19 00:42:15,446 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 546 places, 402 transitions, 2254 flow. Second operand has 4 states, 4 states have (on average 314.5) internal successors, (1258), 4 states have internal predecessors, (1258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:15,446 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:42:15,447 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 349 [2022-01-19 00:42:15,447 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:42:16,109 INFO L129 PetriNetUnfolder]: 363/3151 cut-off events. [2022-01-19 00:42:16,109 INFO L130 PetriNetUnfolder]: For 11393/11990 co-relation queries the response was YES. [2022-01-19 00:42:16,149 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7806 conditions, 3151 events. 363/3151 cut-off events. For 11393/11990 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 28417 event pairs, 127 based on Foata normal form. 37/2949 useless extension candidates. Maximal degree in co-relation 7644. Up to 326 conditions per place. [2022-01-19 00:42:16,156 INFO L132 encePairwiseOnDemand]: 343/349 looper letters, 95 selfloop transitions, 13 changer transitions 7/425 dead transitions. [2022-01-19 00:42:16,156 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 550 places, 425 transitions, 2772 flow [2022-01-19 00:42:16,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 00:42:16,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 00:42:16,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1599 transitions. [2022-01-19 00:42:16,157 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9163323782234957 [2022-01-19 00:42:16,157 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1599 transitions. [2022-01-19 00:42:16,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1599 transitions. [2022-01-19 00:42:16,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:42:16,157 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1599 transitions. [2022-01-19 00:42:16,158 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 319.8) internal successors, (1599), 5 states have internal predecessors, (1599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:16,159 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 349.0) internal successors, (2094), 6 states have internal predecessors, (2094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:16,159 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 349.0) internal successors, (2094), 6 states have internal predecessors, (2094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:16,159 INFO L186 Difference]: Start difference. First operand has 546 places, 402 transitions, 2254 flow. Second operand 5 states and 1599 transitions. [2022-01-19 00:42:16,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 550 places, 425 transitions, 2772 flow [2022-01-19 00:42:16,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 549 places, 425 transitions, 2726 flow, removed 23 selfloop flow, removed 1 redundant places. [2022-01-19 00:42:16,197 INFO L242 Difference]: Finished difference. Result has 552 places, 405 transitions, 2308 flow [2022-01-19 00:42:16,197 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=2214, PETRI_DIFFERENCE_MINUEND_PLACES=545, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=402, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=391, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2308, PETRI_PLACES=552, PETRI_TRANSITIONS=405} [2022-01-19 00:42:16,197 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 233 predicate places. [2022-01-19 00:42:16,197 INFO L470 AbstractCegarLoop]: Abstraction has has 552 places, 405 transitions, 2308 flow [2022-01-19 00:42:16,198 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 314.5) internal successors, (1258), 4 states have internal predecessors, (1258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:16,198 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:42:16,198 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:42:16,198 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-01-19 00:42:16,198 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:42:16,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:42:16,199 INFO L85 PathProgramCache]: Analyzing trace with hash -333599300, now seen corresponding path program 3 times [2022-01-19 00:42:16,199 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:42:16,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779743840] [2022-01-19 00:42:16,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:42:16,199 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:42:16,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:42:16,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:42:16,239 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:42:16,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779743840] [2022-01-19 00:42:16,239 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779743840] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:42:16,239 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:42:16,240 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 00:42:16,240 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750944080] [2022-01-19 00:42:16,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:42:16,240 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 00:42:16,240 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:42:16,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 00:42:16,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 00:42:16,241 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 349 [2022-01-19 00:42:16,242 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 552 places, 405 transitions, 2308 flow. Second operand has 4 states, 4 states have (on average 314.5) internal successors, (1258), 4 states have internal predecessors, (1258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:16,242 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:42:16,242 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 349 [2022-01-19 00:42:16,242 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:42:16,891 INFO L129 PetriNetUnfolder]: 320/2815 cut-off events. [2022-01-19 00:42:16,891 INFO L130 PetriNetUnfolder]: For 11102/11873 co-relation queries the response was YES. [2022-01-19 00:42:17,006 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6950 conditions, 2815 events. 320/2815 cut-off events. For 11102/11873 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 24669 event pairs, 88 based on Foata normal form. 43/2647 useless extension candidates. Maximal degree in co-relation 6785. Up to 163 conditions per place. [2022-01-19 00:42:17,011 INFO L132 encePairwiseOnDemand]: 339/349 looper letters, 92 selfloop transitions, 28 changer transitions 23/453 dead transitions. [2022-01-19 00:42:17,011 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 555 places, 453 transitions, 3324 flow [2022-01-19 00:42:17,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 00:42:17,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 00:42:17,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1607 transitions. [2022-01-19 00:42:17,012 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9209169054441261 [2022-01-19 00:42:17,012 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1607 transitions. [2022-01-19 00:42:17,012 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1607 transitions. [2022-01-19 00:42:17,013 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:42:17,013 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1607 transitions. [2022-01-19 00:42:17,013 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 321.4) internal successors, (1607), 5 states have internal predecessors, (1607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:17,014 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 349.0) internal successors, (2094), 6 states have internal predecessors, (2094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:17,014 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 349.0) internal successors, (2094), 6 states have internal predecessors, (2094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:17,014 INFO L186 Difference]: Start difference. First operand has 552 places, 405 transitions, 2308 flow. Second operand 5 states and 1607 transitions. [2022-01-19 00:42:17,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 555 places, 453 transitions, 3324 flow [2022-01-19 00:42:17,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 555 places, 453 transitions, 3290 flow, removed 17 selfloop flow, removed 0 redundant places. [2022-01-19 00:42:17,050 INFO L242 Difference]: Finished difference. Result has 558 places, 406 transitions, 2434 flow [2022-01-19 00:42:17,050 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=2267, PETRI_DIFFERENCE_MINUEND_PLACES=551, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=404, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=380, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2434, PETRI_PLACES=558, PETRI_TRANSITIONS=406} [2022-01-19 00:42:17,051 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 239 predicate places. [2022-01-19 00:42:17,051 INFO L470 AbstractCegarLoop]: Abstraction has has 558 places, 406 transitions, 2434 flow [2022-01-19 00:42:17,051 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 314.5) internal successors, (1258), 4 states have internal predecessors, (1258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:17,051 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:42:17,051 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:42:17,051 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-01-19 00:42:17,051 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:42:17,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:42:17,052 INFO L85 PathProgramCache]: Analyzing trace with hash -814484826, now seen corresponding path program 4 times [2022-01-19 00:42:17,052 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:42:17,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513418328] [2022-01-19 00:42:17,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:42:17,052 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:42:17,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:42:17,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:42:17,091 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:42:17,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513418328] [2022-01-19 00:42:17,092 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513418328] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:42:17,092 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:42:17,092 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 00:42:17,092 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432985444] [2022-01-19 00:42:17,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:42:17,092 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 00:42:17,093 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:42:17,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 00:42:17,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 00:42:17,094 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 349 [2022-01-19 00:42:17,095 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 558 places, 406 transitions, 2434 flow. Second operand has 4 states, 4 states have (on average 314.5) internal successors, (1258), 4 states have internal predecessors, (1258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:17,095 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:42:17,095 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 349 [2022-01-19 00:42:17,095 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:42:17,592 INFO L129 PetriNetUnfolder]: 286/2409 cut-off events. [2022-01-19 00:42:17,592 INFO L130 PetriNetUnfolder]: For 10319/11149 co-relation queries the response was YES. [2022-01-19 00:42:17,630 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5967 conditions, 2409 events. 286/2409 cut-off events. For 10319/11149 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 19575 event pairs, 84 based on Foata normal form. 25/2233 useless extension candidates. Maximal degree in co-relation 5799. Up to 194 conditions per place. [2022-01-19 00:42:17,636 INFO L132 encePairwiseOnDemand]: 344/349 looper letters, 80 selfloop transitions, 24 changer transitions 10/424 dead transitions. [2022-01-19 00:42:17,636 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 562 places, 424 transitions, 2890 flow [2022-01-19 00:42:17,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 00:42:17,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 00:42:17,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1593 transitions. [2022-01-19 00:42:17,637 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9128939828080229 [2022-01-19 00:42:17,637 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1593 transitions. [2022-01-19 00:42:17,637 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1593 transitions. [2022-01-19 00:42:17,638 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:42:17,638 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1593 transitions. [2022-01-19 00:42:17,639 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 318.6) internal successors, (1593), 5 states have internal predecessors, (1593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:17,640 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 349.0) internal successors, (2094), 6 states have internal predecessors, (2094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:17,640 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 349.0) internal successors, (2094), 6 states have internal predecessors, (2094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:17,640 INFO L186 Difference]: Start difference. First operand has 558 places, 406 transitions, 2434 flow. Second operand 5 states and 1593 transitions. [2022-01-19 00:42:17,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 562 places, 424 transitions, 2890 flow [2022-01-19 00:42:17,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 559 places, 424 transitions, 2762 flow, removed 61 selfloop flow, removed 3 redundant places. [2022-01-19 00:42:17,687 INFO L242 Difference]: Finished difference. Result has 560 places, 406 transitions, 2376 flow [2022-01-19 00:42:17,687 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=2302, PETRI_DIFFERENCE_MINUEND_PLACES=555, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=405, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=383, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2376, PETRI_PLACES=560, PETRI_TRANSITIONS=406} [2022-01-19 00:42:17,688 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 241 predicate places. [2022-01-19 00:42:17,688 INFO L470 AbstractCegarLoop]: Abstraction has has 560 places, 406 transitions, 2376 flow [2022-01-19 00:42:17,688 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 314.5) internal successors, (1258), 4 states have internal predecessors, (1258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:17,688 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:42:17,688 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:42:17,688 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-01-19 00:42:17,688 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:42:17,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:42:17,689 INFO L85 PathProgramCache]: Analyzing trace with hash 26134532, now seen corresponding path program 2 times [2022-01-19 00:42:17,689 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:42:17,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542503906] [2022-01-19 00:42:17,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:42:17,689 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:42:17,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:42:17,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:42:17,736 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:42:17,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542503906] [2022-01-19 00:42:17,736 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542503906] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:42:17,736 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:42:17,736 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 00:42:17,736 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168540133] [2022-01-19 00:42:17,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:42:17,737 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 00:42:17,737 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:42:17,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 00:42:17,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 00:42:17,738 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 349 [2022-01-19 00:42:17,739 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 560 places, 406 transitions, 2376 flow. Second operand has 4 states, 4 states have (on average 314.5) internal successors, (1258), 4 states have internal predecessors, (1258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:17,739 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:42:17,739 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 349 [2022-01-19 00:42:17,739 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:42:18,243 INFO L129 PetriNetUnfolder]: 255/2244 cut-off events. [2022-01-19 00:42:18,243 INFO L130 PetriNetUnfolder]: For 7634/8061 co-relation queries the response was YES. [2022-01-19 00:42:18,273 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5423 conditions, 2244 events. 255/2244 cut-off events. For 7634/8061 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 17817 event pairs, 69 based on Foata normal form. 22/2082 useless extension candidates. Maximal degree in co-relation 5257. Up to 141 conditions per place. [2022-01-19 00:42:18,277 INFO L132 encePairwiseOnDemand]: 344/349 looper letters, 84 selfloop transitions, 22 changer transitions 1/417 dead transitions. [2022-01-19 00:42:18,277 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 564 places, 417 transitions, 2714 flow [2022-01-19 00:42:18,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 00:42:18,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 00:42:18,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1589 transitions. [2022-01-19 00:42:18,278 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9106017191977077 [2022-01-19 00:42:18,278 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1589 transitions. [2022-01-19 00:42:18,279 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1589 transitions. [2022-01-19 00:42:18,279 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:42:18,279 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1589 transitions. [2022-01-19 00:42:18,280 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 317.8) internal successors, (1589), 5 states have internal predecessors, (1589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:18,280 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 349.0) internal successors, (2094), 6 states have internal predecessors, (2094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:18,280 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 349.0) internal successors, (2094), 6 states have internal predecessors, (2094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:18,281 INFO L186 Difference]: Start difference. First operand has 560 places, 406 transitions, 2376 flow. Second operand 5 states and 1589 transitions. [2022-01-19 00:42:18,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 564 places, 417 transitions, 2714 flow [2022-01-19 00:42:18,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 554 places, 417 transitions, 2555 flow, removed 53 selfloop flow, removed 10 redundant places. [2022-01-19 00:42:18,309 INFO L242 Difference]: Finished difference. Result has 556 places, 406 transitions, 2295 flow [2022-01-19 00:42:18,309 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=2199, PETRI_DIFFERENCE_MINUEND_PLACES=550, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=404, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=383, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2295, PETRI_PLACES=556, PETRI_TRANSITIONS=406} [2022-01-19 00:42:18,310 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 237 predicate places. [2022-01-19 00:42:18,310 INFO L470 AbstractCegarLoop]: Abstraction has has 556 places, 406 transitions, 2295 flow [2022-01-19 00:42:18,310 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 314.5) internal successors, (1258), 4 states have internal predecessors, (1258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:18,310 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:42:18,310 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:42:18,310 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-01-19 00:42:18,310 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:42:18,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:42:18,310 INFO L85 PathProgramCache]: Analyzing trace with hash 2052984068, now seen corresponding path program 3 times [2022-01-19 00:42:18,311 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:42:18,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378612049] [2022-01-19 00:42:18,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:42:18,311 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:42:18,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:42:18,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:42:18,351 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:42:18,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378612049] [2022-01-19 00:42:18,352 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378612049] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:42:18,352 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:42:18,352 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-19 00:42:18,352 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148977090] [2022-01-19 00:42:18,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:42:18,352 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-19 00:42:18,352 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:42:18,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-19 00:42:18,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-19 00:42:18,354 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 310 out of 349 [2022-01-19 00:42:18,354 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 556 places, 406 transitions, 2295 flow. Second operand has 4 states, 4 states have (on average 314.5) internal successors, (1258), 4 states have internal predecessors, (1258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:18,354 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:42:18,354 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 310 of 349 [2022-01-19 00:42:18,355 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:42:18,799 INFO L129 PetriNetUnfolder]: 262/2200 cut-off events. [2022-01-19 00:42:18,799 INFO L130 PetriNetUnfolder]: For 7344/7704 co-relation queries the response was YES. [2022-01-19 00:42:18,831 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5216 conditions, 2200 events. 262/2200 cut-off events. For 7344/7704 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 17360 event pairs, 90 based on Foata normal form. 8/2019 useless extension candidates. Maximal degree in co-relation 5055. Up to 266 conditions per place. [2022-01-19 00:42:18,837 INFO L132 encePairwiseOnDemand]: 344/349 looper letters, 86 selfloop transitions, 13 changer transitions 1/410 dead transitions. [2022-01-19 00:42:18,837 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 559 places, 410 transitions, 2531 flow [2022-01-19 00:42:18,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-19 00:42:18,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-01-19 00:42:18,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1584 transitions. [2022-01-19 00:42:18,838 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9077363896848137 [2022-01-19 00:42:18,838 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1584 transitions. [2022-01-19 00:42:18,838 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1584 transitions. [2022-01-19 00:42:18,839 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:42:18,839 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1584 transitions. [2022-01-19 00:42:18,840 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 316.8) internal successors, (1584), 5 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:18,841 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 349.0) internal successors, (2094), 6 states have internal predecessors, (2094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:18,842 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 349.0) internal successors, (2094), 6 states have internal predecessors, (2094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:18,842 INFO L186 Difference]: Start difference. First operand has 556 places, 406 transitions, 2295 flow. Second operand 5 states and 1584 transitions. [2022-01-19 00:42:18,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 559 places, 410 transitions, 2531 flow [2022-01-19 00:42:18,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 558 places, 410 transitions, 2510 flow, removed 6 selfloop flow, removed 1 redundant places. [2022-01-19 00:42:18,872 INFO L242 Difference]: Finished difference. Result has 559 places, 405 transitions, 2292 flow [2022-01-19 00:42:18,872 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=2241, PETRI_DIFFERENCE_MINUEND_PLACES=554, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=404, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=391, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2292, PETRI_PLACES=559, PETRI_TRANSITIONS=405} [2022-01-19 00:42:18,872 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 240 predicate places. [2022-01-19 00:42:18,872 INFO L470 AbstractCegarLoop]: Abstraction has has 559 places, 405 transitions, 2292 flow [2022-01-19 00:42:18,873 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 314.5) internal successors, (1258), 4 states have internal predecessors, (1258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:18,873 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:42:18,873 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:42:18,873 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-01-19 00:42:18,873 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:42:18,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:42:18,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1168206114, now seen corresponding path program 1 times [2022-01-19 00:42:18,873 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:42:18,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730846204] [2022-01-19 00:42:18,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:42:18,874 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:42:18,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:42:18,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:42:18,992 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:42:18,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730846204] [2022-01-19 00:42:18,992 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730846204] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:42:18,992 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:42:18,992 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-19 00:42:18,992 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228605697] [2022-01-19 00:42:18,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:42:18,993 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-19 00:42:18,993 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:42:18,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-19 00:42:18,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-01-19 00:42:18,995 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 349 [2022-01-19 00:42:18,996 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 559 places, 405 transitions, 2292 flow. Second operand has 12 states, 12 states have (on average 298.5) internal successors, (3582), 12 states have internal predecessors, (3582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:18,997 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:42:18,997 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 349 [2022-01-19 00:42:18,997 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:42:21,342 INFO L129 PetriNetUnfolder]: 2842/7869 cut-off events. [2022-01-19 00:42:21,343 INFO L130 PetriNetUnfolder]: For 10931/11141 co-relation queries the response was YES. [2022-01-19 00:42:21,478 INFO L84 FinitePrefix]: Finished finitePrefix Result has 20074 conditions, 7869 events. 2842/7869 cut-off events. For 10931/11141 co-relation queries the response was YES. Maximal size of possible extension queue 422. Compared 74910 event pairs, 1141 based on Foata normal form. 15/7204 useless extension candidates. Maximal degree in co-relation 19912. Up to 2638 conditions per place. [2022-01-19 00:42:21,502 INFO L132 encePairwiseOnDemand]: 331/349 looper letters, 180 selfloop transitions, 74 changer transitions 44/657 dead transitions. [2022-01-19 00:42:21,502 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 605 places, 657 transitions, 4009 flow [2022-01-19 00:42:21,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-01-19 00:42:21,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2022-01-19 00:42:21,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 14158 transitions. [2022-01-19 00:42:21,508 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8631347924160214 [2022-01-19 00:42:21,508 INFO L72 ComplementDD]: Start complementDD. Operand 47 states and 14158 transitions. [2022-01-19 00:42:21,508 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 14158 transitions. [2022-01-19 00:42:21,509 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:42:21,509 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 47 states and 14158 transitions. [2022-01-19 00:42:21,516 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 48 states, 47 states have (on average 301.2340425531915) internal successors, (14158), 47 states have internal predecessors, (14158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:21,523 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 48 states, 48 states have (on average 349.0) internal successors, (16752), 48 states have internal predecessors, (16752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:21,524 INFO L81 ComplementDD]: Finished complementDD. Result has 48 states, 48 states have (on average 349.0) internal successors, (16752), 48 states have internal predecessors, (16752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:21,524 INFO L186 Difference]: Start difference. First operand has 559 places, 405 transitions, 2292 flow. Second operand 47 states and 14158 transitions. [2022-01-19 00:42:21,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 605 places, 657 transitions, 4009 flow [2022-01-19 00:42:21,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 604 places, 657 transitions, 3999 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-01-19 00:42:21,564 INFO L242 Difference]: Finished difference. Result has 646 places, 477 transitions, 3011 flow [2022-01-19 00:42:21,564 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=2282, PETRI_DIFFERENCE_MINUEND_PLACES=558, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=405, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=388, PETRI_DIFFERENCE_SUBTRAHEND_STATES=47, PETRI_FLOW=3011, PETRI_PLACES=646, PETRI_TRANSITIONS=477} [2022-01-19 00:42:21,564 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 327 predicate places. [2022-01-19 00:42:21,564 INFO L470 AbstractCegarLoop]: Abstraction has has 646 places, 477 transitions, 3011 flow [2022-01-19 00:42:21,565 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 298.5) internal successors, (3582), 12 states have internal predecessors, (3582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:21,565 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:42:21,565 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:42:21,565 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-01-19 00:42:21,565 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:42:21,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:42:21,565 INFO L85 PathProgramCache]: Analyzing trace with hash -563903552, now seen corresponding path program 2 times [2022-01-19 00:42:21,565 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:42:21,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122196013] [2022-01-19 00:42:21,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:42:21,566 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:42:21,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:42:21,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:42:21,681 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:42:21,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122196013] [2022-01-19 00:42:21,681 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122196013] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:42:21,681 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:42:21,681 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-19 00:42:21,682 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141217557] [2022-01-19 00:42:21,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:42:21,682 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-19 00:42:21,682 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:42:21,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-19 00:42:21,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-01-19 00:42:21,684 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 349 [2022-01-19 00:42:21,686 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 646 places, 477 transitions, 3011 flow. Second operand has 12 states, 12 states have (on average 298.5) internal successors, (3582), 12 states have internal predecessors, (3582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:21,686 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:42:21,686 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 349 [2022-01-19 00:42:21,686 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:42:26,021 INFO L129 PetriNetUnfolder]: 4276/12103 cut-off events. [2022-01-19 00:42:26,021 INFO L130 PetriNetUnfolder]: For 59026/60137 co-relation queries the response was YES. [2022-01-19 00:42:26,225 INFO L84 FinitePrefix]: Finished finitePrefix Result has 48620 conditions, 12103 events. 4276/12103 cut-off events. For 59026/60137 co-relation queries the response was YES. Maximal size of possible extension queue 740. Compared 127161 event pairs, 1848 based on Foata normal form. 14/11268 useless extension candidates. Maximal degree in co-relation 48416. Up to 3920 conditions per place. [2022-01-19 00:42:26,272 INFO L132 encePairwiseOnDemand]: 331/349 looper letters, 239 selfloop transitions, 101 changer transitions 82/781 dead transitions. [2022-01-19 00:42:26,272 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 691 places, 781 transitions, 5967 flow [2022-01-19 00:42:26,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-01-19 00:42:26,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2022-01-19 00:42:26,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 14468 transitions. [2022-01-19 00:42:26,278 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8636580706781279 [2022-01-19 00:42:26,278 INFO L72 ComplementDD]: Start complementDD. Operand 48 states and 14468 transitions. [2022-01-19 00:42:26,278 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 14468 transitions. [2022-01-19 00:42:26,279 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:42:26,279 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 48 states and 14468 transitions. [2022-01-19 00:42:26,286 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 49 states, 48 states have (on average 301.4166666666667) internal successors, (14468), 48 states have internal predecessors, (14468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:26,293 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 49 states, 49 states have (on average 349.0) internal successors, (17101), 49 states have internal predecessors, (17101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:26,294 INFO L81 ComplementDD]: Finished complementDD. Result has 49 states, 49 states have (on average 349.0) internal successors, (17101), 49 states have internal predecessors, (17101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:26,294 INFO L186 Difference]: Start difference. First operand has 646 places, 477 transitions, 3011 flow. Second operand 48 states and 14468 transitions. [2022-01-19 00:42:26,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 691 places, 781 transitions, 5967 flow [2022-01-19 00:42:26,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 689 places, 781 transitions, 5629 flow, removed 169 selfloop flow, removed 2 redundant places. [2022-01-19 00:42:26,746 INFO L242 Difference]: Finished difference. Result has 732 places, 528 transitions, 3858 flow [2022-01-19 00:42:26,746 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=2819, PETRI_DIFFERENCE_MINUEND_PLACES=642, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=477, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=432, PETRI_DIFFERENCE_SUBTRAHEND_STATES=48, PETRI_FLOW=3858, PETRI_PLACES=732, PETRI_TRANSITIONS=528} [2022-01-19 00:42:26,747 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 413 predicate places. [2022-01-19 00:42:26,747 INFO L470 AbstractCegarLoop]: Abstraction has has 732 places, 528 transitions, 3858 flow [2022-01-19 00:42:26,747 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 298.5) internal successors, (3582), 12 states have internal predecessors, (3582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:26,747 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:42:26,748 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:42:26,748 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-01-19 00:42:26,748 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:42:26,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:42:26,748 INFO L85 PathProgramCache]: Analyzing trace with hash -221499084, now seen corresponding path program 3 times [2022-01-19 00:42:26,748 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:42:26,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568656095] [2022-01-19 00:42:26,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:42:26,749 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:42:26,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:42:26,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:42:26,873 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:42:26,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568656095] [2022-01-19 00:42:26,873 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568656095] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:42:26,873 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:42:26,873 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-19 00:42:26,873 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621252755] [2022-01-19 00:42:26,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:42:26,873 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-19 00:42:26,874 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:42:26,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-19 00:42:26,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-01-19 00:42:26,876 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 349 [2022-01-19 00:42:26,877 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 732 places, 528 transitions, 3858 flow. Second operand has 12 states, 12 states have (on average 298.5) internal successors, (3582), 12 states have internal predecessors, (3582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:26,877 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:42:26,877 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 349 [2022-01-19 00:42:26,877 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:42:32,119 INFO L129 PetriNetUnfolder]: 5085/13495 cut-off events. [2022-01-19 00:42:32,119 INFO L130 PetriNetUnfolder]: For 159017/160064 co-relation queries the response was YES. [2022-01-19 00:42:32,404 INFO L84 FinitePrefix]: Finished finitePrefix Result has 72304 conditions, 13495 events. 5085/13495 cut-off events. For 159017/160064 co-relation queries the response was YES. Maximal size of possible extension queue 884. Compared 141921 event pairs, 2235 based on Foata normal form. 50/12291 useless extension candidates. Maximal degree in co-relation 72058. Up to 5008 conditions per place. [2022-01-19 00:42:32,474 INFO L132 encePairwiseOnDemand]: 332/349 looper letters, 208 selfloop transitions, 111 changer transitions 38/716 dead transitions. [2022-01-19 00:42:32,474 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 757 places, 716 transitions, 6886 flow [2022-01-19 00:42:32,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-01-19 00:42:32,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2022-01-19 00:42:32,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 10851 transitions. [2022-01-19 00:42:32,478 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8636580706781279 [2022-01-19 00:42:32,478 INFO L72 ComplementDD]: Start complementDD. Operand 36 states and 10851 transitions. [2022-01-19 00:42:32,478 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 10851 transitions. [2022-01-19 00:42:32,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:42:32,480 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 36 states and 10851 transitions. [2022-01-19 00:42:32,485 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 37 states, 36 states have (on average 301.4166666666667) internal successors, (10851), 36 states have internal predecessors, (10851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:32,489 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 37 states, 37 states have (on average 349.0) internal successors, (12913), 37 states have internal predecessors, (12913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:32,490 INFO L81 ComplementDD]: Finished complementDD. Result has 37 states, 37 states have (on average 349.0) internal successors, (12913), 37 states have internal predecessors, (12913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:32,490 INFO L186 Difference]: Start difference. First operand has 732 places, 528 transitions, 3858 flow. Second operand 36 states and 10851 transitions. [2022-01-19 00:42:32,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 757 places, 716 transitions, 6886 flow [2022-01-19 00:42:33,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 744 places, 716 transitions, 6172 flow, removed 338 selfloop flow, removed 13 redundant places. [2022-01-19 00:42:33,715 INFO L242 Difference]: Finished difference. Result has 769 places, 583 transitions, 4697 flow [2022-01-19 00:42:33,715 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=3458, PETRI_DIFFERENCE_MINUEND_PLACES=709, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=528, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=461, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=4697, PETRI_PLACES=769, PETRI_TRANSITIONS=583} [2022-01-19 00:42:33,716 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 450 predicate places. [2022-01-19 00:42:33,716 INFO L470 AbstractCegarLoop]: Abstraction has has 769 places, 583 transitions, 4697 flow [2022-01-19 00:42:33,716 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 298.5) internal successors, (3582), 12 states have internal predecessors, (3582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:33,716 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:42:33,716 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:42:33,716 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-01-19 00:42:33,716 INFO L402 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:42:33,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:42:33,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1347417692, now seen corresponding path program 4 times [2022-01-19 00:42:33,717 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:42:33,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048642604] [2022-01-19 00:42:33,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:42:33,717 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:42:33,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:42:33,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:42:33,834 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:42:33,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048642604] [2022-01-19 00:42:33,834 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048642604] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:42:33,834 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:42:33,834 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-19 00:42:33,834 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641582479] [2022-01-19 00:42:33,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:42:33,835 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-19 00:42:33,835 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:42:33,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-19 00:42:33,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-01-19 00:42:33,837 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 349 [2022-01-19 00:42:33,838 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 769 places, 583 transitions, 4697 flow. Second operand has 12 states, 12 states have (on average 298.5) internal successors, (3582), 12 states have internal predecessors, (3582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:33,838 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:42:33,838 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 349 [2022-01-19 00:42:33,839 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:42:39,926 INFO L129 PetriNetUnfolder]: 5527/15293 cut-off events. [2022-01-19 00:42:39,927 INFO L130 PetriNetUnfolder]: For 226905/228561 co-relation queries the response was YES. [2022-01-19 00:42:40,272 INFO L84 FinitePrefix]: Finished finitePrefix Result has 88045 conditions, 15293 events. 5527/15293 cut-off events. For 226905/228561 co-relation queries the response was YES. Maximal size of possible extension queue 1047. Compared 165770 event pairs, 2672 based on Foata normal form. 22/14152 useless extension candidates. Maximal degree in co-relation 87784. Up to 5365 conditions per place. [2022-01-19 00:42:40,354 INFO L132 encePairwiseOnDemand]: 332/349 looper letters, 235 selfloop transitions, 104 changer transitions 35/733 dead transitions. [2022-01-19 00:42:40,354 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 799 places, 733 transitions, 7592 flow [2022-01-19 00:42:40,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-01-19 00:42:40,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2022-01-19 00:42:40,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 9950 transitions. [2022-01-19 00:42:40,358 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8639402622210645 [2022-01-19 00:42:40,358 INFO L72 ComplementDD]: Start complementDD. Operand 33 states and 9950 transitions. [2022-01-19 00:42:40,358 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 9950 transitions. [2022-01-19 00:42:40,359 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:42:40,359 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 33 states and 9950 transitions. [2022-01-19 00:42:40,364 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 34 states, 33 states have (on average 301.5151515151515) internal successors, (9950), 33 states have internal predecessors, (9950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:40,369 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 34 states, 34 states have (on average 349.0) internal successors, (11866), 34 states have internal predecessors, (11866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:40,369 INFO L81 ComplementDD]: Finished complementDD. Result has 34 states, 34 states have (on average 349.0) internal successors, (11866), 34 states have internal predecessors, (11866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:40,369 INFO L186 Difference]: Start difference. First operand has 769 places, 583 transitions, 4697 flow. Second operand 33 states and 9950 transitions. [2022-01-19 00:42:40,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 799 places, 733 transitions, 7592 flow [2022-01-19 00:42:42,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 797 places, 733 transitions, 7080 flow, removed 256 selfloop flow, removed 2 redundant places. [2022-01-19 00:42:42,146 INFO L242 Difference]: Finished difference. Result has 824 places, 642 transitions, 5800 flow [2022-01-19 00:42:42,146 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=4187, PETRI_DIFFERENCE_MINUEND_PLACES=765, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=583, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=520, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=5800, PETRI_PLACES=824, PETRI_TRANSITIONS=642} [2022-01-19 00:42:42,146 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 505 predicate places. [2022-01-19 00:42:42,146 INFO L470 AbstractCegarLoop]: Abstraction has has 824 places, 642 transitions, 5800 flow [2022-01-19 00:42:42,147 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 298.5) internal successors, (3582), 12 states have internal predecessors, (3582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:42,147 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:42:42,147 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:42:42,147 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2022-01-19 00:42:42,147 INFO L402 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:42:42,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:42:42,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1230362342, now seen corresponding path program 5 times [2022-01-19 00:42:42,147 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:42:42,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459418416] [2022-01-19 00:42:42,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:42:42,148 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:42:42,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:42:42,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:42:42,276 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:42:42,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459418416] [2022-01-19 00:42:42,277 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459418416] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:42:42,277 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:42:42,277 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-19 00:42:42,277 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049629800] [2022-01-19 00:42:42,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:42:42,277 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-19 00:42:42,277 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:42:42,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-19 00:42:42,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-01-19 00:42:42,280 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 349 [2022-01-19 00:42:42,281 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 824 places, 642 transitions, 5800 flow. Second operand has 12 states, 12 states have (on average 298.5) internal successors, (3582), 12 states have internal predecessors, (3582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:42,281 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:42:42,281 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 349 [2022-01-19 00:42:42,281 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:42:49,417 INFO L129 PetriNetUnfolder]: 6251/16271 cut-off events. [2022-01-19 00:42:49,418 INFO L130 PetriNetUnfolder]: For 303658/305831 co-relation queries the response was YES. [2022-01-19 00:42:49,803 INFO L84 FinitePrefix]: Finished finitePrefix Result has 101936 conditions, 16271 events. 6251/16271 cut-off events. For 303658/305831 co-relation queries the response was YES. Maximal size of possible extension queue 1100. Compared 174784 event pairs, 2465 based on Foata normal form. 30/14742 useless extension candidates. Maximal degree in co-relation 101649. Up to 5681 conditions per place. [2022-01-19 00:42:49,891 INFO L132 encePairwiseOnDemand]: 331/349 looper letters, 300 selfloop transitions, 154 changer transitions 30/843 dead transitions. [2022-01-19 00:42:49,891 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 861 places, 843 transitions, 9986 flow [2022-01-19 00:42:49,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-01-19 00:42:49,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2022-01-19 00:42:49,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 12053 transitions. [2022-01-19 00:42:49,896 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8633954154727793 [2022-01-19 00:42:49,896 INFO L72 ComplementDD]: Start complementDD. Operand 40 states and 12053 transitions. [2022-01-19 00:42:49,896 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 12053 transitions. [2022-01-19 00:42:49,898 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:42:49,898 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 40 states and 12053 transitions. [2022-01-19 00:42:49,903 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 41 states, 40 states have (on average 301.325) internal successors, (12053), 40 states have internal predecessors, (12053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:49,909 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 41 states, 41 states have (on average 349.0) internal successors, (14309), 41 states have internal predecessors, (14309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:49,909 INFO L81 ComplementDD]: Finished complementDD. Result has 41 states, 41 states have (on average 349.0) internal successors, (14309), 41 states have internal predecessors, (14309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:49,909 INFO L186 Difference]: Start difference. First operand has 824 places, 642 transitions, 5800 flow. Second operand 40 states and 12053 transitions. [2022-01-19 00:42:49,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 861 places, 843 transitions, 9986 flow [2022-01-19 00:42:52,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 859 places, 843 transitions, 8848 flow, removed 569 selfloop flow, removed 2 redundant places. [2022-01-19 00:42:52,719 INFO L242 Difference]: Finished difference. Result has 892 places, 720 transitions, 7098 flow [2022-01-19 00:42:52,719 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=5048, PETRI_DIFFERENCE_MINUEND_PLACES=820, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=642, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=544, PETRI_DIFFERENCE_SUBTRAHEND_STATES=40, PETRI_FLOW=7098, PETRI_PLACES=892, PETRI_TRANSITIONS=720} [2022-01-19 00:42:52,719 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 573 predicate places. [2022-01-19 00:42:52,720 INFO L470 AbstractCegarLoop]: Abstraction has has 892 places, 720 transitions, 7098 flow [2022-01-19 00:42:52,720 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 298.5) internal successors, (3582), 12 states have internal predecessors, (3582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:52,720 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:42:52,720 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:42:52,720 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-01-19 00:42:52,720 INFO L402 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:42:52,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:42:52,721 INFO L85 PathProgramCache]: Analyzing trace with hash 931605594, now seen corresponding path program 6 times [2022-01-19 00:42:52,721 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:42:52,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545339251] [2022-01-19 00:42:52,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:42:52,721 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:42:52,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:42:52,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:42:52,847 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:42:52,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545339251] [2022-01-19 00:42:52,848 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545339251] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:42:52,848 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:42:52,848 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-19 00:42:52,848 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109413933] [2022-01-19 00:42:52,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:42:52,849 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-19 00:42:52,849 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:42:52,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-19 00:42:52,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-01-19 00:42:52,851 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 349 [2022-01-19 00:42:52,853 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 892 places, 720 transitions, 7098 flow. Second operand has 12 states, 12 states have (on average 298.5) internal successors, (3582), 12 states have internal predecessors, (3582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:42:52,853 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:42:52,853 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 349 [2022-01-19 00:42:52,853 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:43:00,949 INFO L129 PetriNetUnfolder]: 6449/17040 cut-off events. [2022-01-19 00:43:00,949 INFO L130 PetriNetUnfolder]: For 349822/352714 co-relation queries the response was YES. [2022-01-19 00:43:01,386 INFO L84 FinitePrefix]: Finished finitePrefix Result has 108553 conditions, 17040 events. 6449/17040 cut-off events. For 349822/352714 co-relation queries the response was YES. Maximal size of possible extension queue 1195. Compared 186533 event pairs, 2355 based on Foata normal form. 94/15553 useless extension candidates. Maximal degree in co-relation 108234. Up to 5708 conditions per place. [2022-01-19 00:43:01,483 INFO L132 encePairwiseOnDemand]: 332/349 looper letters, 306 selfloop transitions, 194 changer transitions 29/888 dead transitions. [2022-01-19 00:43:01,483 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 919 places, 888 transitions, 10970 flow [2022-01-19 00:43:01,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-01-19 00:43:01,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-01-19 00:43:01,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 9052 transitions. [2022-01-19 00:43:01,487 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8645654250238778 [2022-01-19 00:43:01,487 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 9052 transitions. [2022-01-19 00:43:01,487 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 9052 transitions. [2022-01-19 00:43:01,488 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:43:01,488 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 9052 transitions. [2022-01-19 00:43:01,492 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 301.73333333333335) internal successors, (9052), 30 states have internal predecessors, (9052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:43:01,497 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 349.0) internal successors, (10819), 31 states have internal predecessors, (10819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:43:01,497 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 349.0) internal successors, (10819), 31 states have internal predecessors, (10819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:43:01,497 INFO L186 Difference]: Start difference. First operand has 892 places, 720 transitions, 7098 flow. Second operand 30 states and 9052 transitions. [2022-01-19 00:43:01,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 919 places, 888 transitions, 10970 flow [2022-01-19 00:43:05,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 917 places, 888 transitions, 9496 flow, removed 737 selfloop flow, removed 2 redundant places. [2022-01-19 00:43:05,048 INFO L242 Difference]: Finished difference. Result has 934 places, 763 transitions, 7637 flow [2022-01-19 00:43:05,049 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=6342, PETRI_DIFFERENCE_MINUEND_PLACES=888, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=720, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=155, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=557, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=7637, PETRI_PLACES=934, PETRI_TRANSITIONS=763} [2022-01-19 00:43:05,049 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 615 predicate places. [2022-01-19 00:43:05,049 INFO L470 AbstractCegarLoop]: Abstraction has has 934 places, 763 transitions, 7637 flow [2022-01-19 00:43:05,050 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 298.5) internal successors, (3582), 12 states have internal predecessors, (3582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:43:05,050 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:43:05,050 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:43:05,050 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2022-01-19 00:43:05,050 INFO L402 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:43:05,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:43:05,050 INFO L85 PathProgramCache]: Analyzing trace with hash -241786468, now seen corresponding path program 7 times [2022-01-19 00:43:05,051 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:43:05,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342462212] [2022-01-19 00:43:05,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:43:05,051 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:43:05,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:43:05,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:43:05,181 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:43:05,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342462212] [2022-01-19 00:43:05,181 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342462212] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:43:05,181 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:43:05,181 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-19 00:43:05,181 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465152223] [2022-01-19 00:43:05,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:43:05,182 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-19 00:43:05,182 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:43:05,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-19 00:43:05,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-01-19 00:43:05,183 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 349 [2022-01-19 00:43:05,184 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 934 places, 763 transitions, 7637 flow. Second operand has 12 states, 12 states have (on average 298.5) internal successors, (3582), 12 states have internal predecessors, (3582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:43:05,184 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:43:05,184 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 349 [2022-01-19 00:43:05,185 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:43:13,346 INFO L129 PetriNetUnfolder]: 6655/17537 cut-off events. [2022-01-19 00:43:13,346 INFO L130 PetriNetUnfolder]: For 250542/253600 co-relation queries the response was YES. [2022-01-19 00:43:13,817 INFO L84 FinitePrefix]: Finished finitePrefix Result has 105595 conditions, 17537 events. 6655/17537 cut-off events. For 250542/253600 co-relation queries the response was YES. Maximal size of possible extension queue 1233. Compared 193223 event pairs, 2385 based on Foata normal form. 94/15995 useless extension candidates. Maximal degree in co-relation 105260. Up to 5942 conditions per place. [2022-01-19 00:43:13,908 INFO L132 encePairwiseOnDemand]: 331/349 looper letters, 325 selfloop transitions, 219 changer transitions 16/919 dead transitions. [2022-01-19 00:43:13,908 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 955 places, 919 transitions, 10951 flow [2022-01-19 00:43:13,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-01-19 00:43:13,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-01-19 00:43:13,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 7255 transitions. [2022-01-19 00:43:13,911 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8661652340019103 [2022-01-19 00:43:13,911 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 7255 transitions. [2022-01-19 00:43:13,911 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 7255 transitions. [2022-01-19 00:43:13,912 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:43:13,912 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 7255 transitions. [2022-01-19 00:43:13,916 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 302.2916666666667) internal successors, (7255), 24 states have internal predecessors, (7255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:43:13,919 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 349.0) internal successors, (8725), 25 states have internal predecessors, (8725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:43:13,919 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 349.0) internal successors, (8725), 25 states have internal predecessors, (8725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:43:13,919 INFO L186 Difference]: Start difference. First operand has 934 places, 763 transitions, 7637 flow. Second operand 24 states and 7255 transitions. [2022-01-19 00:43:13,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 955 places, 919 transitions, 10951 flow [2022-01-19 00:43:16,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 953 places, 919 transitions, 10545 flow, removed 203 selfloop flow, removed 2 redundant places. [2022-01-19 00:43:16,707 INFO L242 Difference]: Finished difference. Result has 967 places, 798 transitions, 8579 flow [2022-01-19 00:43:16,708 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=7287, PETRI_DIFFERENCE_MINUEND_PLACES=930, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=763, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=184, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=570, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=8579, PETRI_PLACES=967, PETRI_TRANSITIONS=798} [2022-01-19 00:43:16,709 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 648 predicate places. [2022-01-19 00:43:16,709 INFO L470 AbstractCegarLoop]: Abstraction has has 967 places, 798 transitions, 8579 flow [2022-01-19 00:43:16,709 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 298.5) internal successors, (3582), 12 states have internal predecessors, (3582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:43:16,709 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:43:16,709 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:43:16,709 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2022-01-19 00:43:16,709 INFO L402 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:43:16,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:43:16,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1039084578, now seen corresponding path program 8 times [2022-01-19 00:43:16,710 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:43:16,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72640398] [2022-01-19 00:43:16,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:43:16,710 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:43:16,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:43:16,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:43:16,843 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:43:16,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72640398] [2022-01-19 00:43:16,843 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72640398] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:43:16,843 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:43:16,843 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-19 00:43:16,843 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43444521] [2022-01-19 00:43:16,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:43:16,844 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-19 00:43:16,844 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:43:16,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-19 00:43:16,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-01-19 00:43:16,846 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 349 [2022-01-19 00:43:16,848 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 967 places, 798 transitions, 8579 flow. Second operand has 12 states, 12 states have (on average 298.5) internal successors, (3582), 12 states have internal predecessors, (3582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:43:16,848 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:43:16,848 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 349 [2022-01-19 00:43:16,848 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:43:27,083 INFO L129 PetriNetUnfolder]: 7172/18753 cut-off events. [2022-01-19 00:43:27,083 INFO L130 PetriNetUnfolder]: For 319766/322852 co-relation queries the response was YES. [2022-01-19 00:43:27,614 INFO L84 FinitePrefix]: Finished finitePrefix Result has 121160 conditions, 18753 events. 7172/18753 cut-off events. For 319766/322852 co-relation queries the response was YES. Maximal size of possible extension queue 1327. Compared 207149 event pairs, 2596 based on Foata normal form. 47/17024 useless extension candidates. Maximal degree in co-relation 120812. Up to 6069 conditions per place. [2022-01-19 00:43:27,716 INFO L132 encePairwiseOnDemand]: 331/349 looper letters, 357 selfloop transitions, 218 changer transitions 26/960 dead transitions. [2022-01-19 00:43:27,716 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1001 places, 960 transitions, 12786 flow [2022-01-19 00:43:27,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-01-19 00:43:27,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2022-01-19 00:43:27,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 11157 transitions. [2022-01-19 00:43:27,721 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8640130101448154 [2022-01-19 00:43:27,721 INFO L72 ComplementDD]: Start complementDD. Operand 37 states and 11157 transitions. [2022-01-19 00:43:27,721 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 11157 transitions. [2022-01-19 00:43:27,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:43:27,722 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 37 states and 11157 transitions. [2022-01-19 00:43:27,727 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 38 states, 37 states have (on average 301.5405405405405) internal successors, (11157), 37 states have internal predecessors, (11157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:43:27,732 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 38 states, 38 states have (on average 349.0) internal successors, (13262), 38 states have internal predecessors, (13262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:43:27,733 INFO L81 ComplementDD]: Finished complementDD. Result has 38 states, 38 states have (on average 349.0) internal successors, (13262), 38 states have internal predecessors, (13262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:43:27,733 INFO L186 Difference]: Start difference. First operand has 967 places, 798 transitions, 8579 flow. Second operand 37 states and 11157 transitions. [2022-01-19 00:43:27,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1001 places, 960 transitions, 12786 flow [2022-01-19 00:43:31,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 998 places, 960 transitions, 12463 flow, removed 130 selfloop flow, removed 3 redundant places. [2022-01-19 00:43:31,200 INFO L242 Difference]: Finished difference. Result has 1020 places, 859 transitions, 10337 flow [2022-01-19 00:43:31,200 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=8277, PETRI_DIFFERENCE_MINUEND_PLACES=962, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=798, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=162, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=629, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=10337, PETRI_PLACES=1020, PETRI_TRANSITIONS=859} [2022-01-19 00:43:31,200 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 701 predicate places. [2022-01-19 00:43:31,200 INFO L470 AbstractCegarLoop]: Abstraction has has 1020 places, 859 transitions, 10337 flow [2022-01-19 00:43:31,201 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 298.5) internal successors, (3582), 12 states have internal predecessors, (3582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:43:31,201 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:43:31,201 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:43:31,201 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2022-01-19 00:43:31,201 INFO L402 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:43:31,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:43:31,202 INFO L85 PathProgramCache]: Analyzing trace with hash -702535186, now seen corresponding path program 9 times [2022-01-19 00:43:31,202 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:43:31,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727606593] [2022-01-19 00:43:31,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:43:31,202 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:43:31,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:43:31,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:43:31,316 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:43:31,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727606593] [2022-01-19 00:43:31,317 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727606593] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:43:31,317 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:43:31,317 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-19 00:43:31,317 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889929788] [2022-01-19 00:43:31,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:43:31,317 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-19 00:43:31,317 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:43:31,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-19 00:43:31,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-01-19 00:43:31,319 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 349 [2022-01-19 00:43:31,320 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1020 places, 859 transitions, 10337 flow. Second operand has 12 states, 12 states have (on average 298.5) internal successors, (3582), 12 states have internal predecessors, (3582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:43:31,320 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:43:31,320 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 349 [2022-01-19 00:43:31,320 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:43:42,359 INFO L129 PetriNetUnfolder]: 7753/20206 cut-off events. [2022-01-19 00:43:42,359 INFO L130 PetriNetUnfolder]: For 453090/456518 co-relation queries the response was YES. [2022-01-19 00:43:42,990 INFO L84 FinitePrefix]: Finished finitePrefix Result has 141496 conditions, 20206 events. 7753/20206 cut-off events. For 453090/456518 co-relation queries the response was YES. Maximal size of possible extension queue 1461. Compared 227154 event pairs, 2557 based on Foata normal form. 73/18386 useless extension candidates. Maximal degree in co-relation 141128. Up to 6196 conditions per place. [2022-01-19 00:43:43,109 INFO L132 encePairwiseOnDemand]: 331/349 looper letters, 401 selfloop transitions, 255 changer transitions 23/1038 dead transitions. [2022-01-19 00:43:43,109 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1049 places, 1038 transitions, 15211 flow [2022-01-19 00:43:43,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-01-19 00:43:43,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2022-01-19 00:43:43,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 9654 transitions. [2022-01-19 00:43:43,113 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8644340974212035 [2022-01-19 00:43:43,113 INFO L72 ComplementDD]: Start complementDD. Operand 32 states and 9654 transitions. [2022-01-19 00:43:43,113 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 9654 transitions. [2022-01-19 00:43:43,114 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:43:43,114 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 32 states and 9654 transitions. [2022-01-19 00:43:43,119 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 33 states, 32 states have (on average 301.6875) internal successors, (9654), 32 states have internal predecessors, (9654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:43:43,123 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 33 states, 33 states have (on average 349.0) internal successors, (11517), 33 states have internal predecessors, (11517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:43:43,124 INFO L81 ComplementDD]: Finished complementDD. Result has 33 states, 33 states have (on average 349.0) internal successors, (11517), 33 states have internal predecessors, (11517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:43:43,124 INFO L186 Difference]: Start difference. First operand has 1020 places, 859 transitions, 10337 flow. Second operand 32 states and 9654 transitions. [2022-01-19 00:43:43,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1049 places, 1038 transitions, 15211 flow [2022-01-19 00:43:47,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1046 places, 1038 transitions, 14379 flow, removed 382 selfloop flow, removed 3 redundant places. [2022-01-19 00:43:47,976 INFO L242 Difference]: Finished difference. Result has 1069 places, 925 transitions, 12072 flow [2022-01-19 00:43:47,976 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=9610, PETRI_DIFFERENCE_MINUEND_PLACES=1015, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=859, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=198, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=651, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=12072, PETRI_PLACES=1069, PETRI_TRANSITIONS=925} [2022-01-19 00:43:47,977 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 750 predicate places. [2022-01-19 00:43:47,977 INFO L470 AbstractCegarLoop]: Abstraction has has 1069 places, 925 transitions, 12072 flow [2022-01-19 00:43:47,977 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 298.5) internal successors, (3582), 12 states have internal predecessors, (3582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:43:47,977 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:43:47,977 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:43:47,977 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2022-01-19 00:43:47,977 INFO L402 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:43:47,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:43:47,978 INFO L85 PathProgramCache]: Analyzing trace with hash -828883500, now seen corresponding path program 10 times [2022-01-19 00:43:47,978 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:43:47,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193789770] [2022-01-19 00:43:47,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:43:47,978 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:43:48,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:43:48,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:43:48,125 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:43:48,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193789770] [2022-01-19 00:43:48,125 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193789770] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:43:48,125 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:43:48,125 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-19 00:43:48,125 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129474260] [2022-01-19 00:43:48,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:43:48,126 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-19 00:43:48,126 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:43:48,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-19 00:43:48,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-01-19 00:43:48,128 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 349 [2022-01-19 00:43:48,130 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1069 places, 925 transitions, 12072 flow. Second operand has 12 states, 12 states have (on average 298.5) internal successors, (3582), 12 states have internal predecessors, (3582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:43:48,130 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:43:48,130 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 349 [2022-01-19 00:43:48,130 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:44:00,518 INFO L129 PetriNetUnfolder]: 8245/21480 cut-off events. [2022-01-19 00:44:00,519 INFO L130 PetriNetUnfolder]: For 602298/606131 co-relation queries the response was YES. [2022-01-19 00:44:01,217 INFO L84 FinitePrefix]: Finished finitePrefix Result has 159501 conditions, 21480 events. 8245/21480 cut-off events. For 602298/606131 co-relation queries the response was YES. Maximal size of possible extension queue 1580. Compared 243503 event pairs, 2705 based on Foata normal form. 54/19513 useless extension candidates. Maximal degree in co-relation 159112. Up to 6323 conditions per place. [2022-01-19 00:44:01,350 INFO L132 encePairwiseOnDemand]: 332/349 looper letters, 454 selfloop transitions, 207 changer transitions 25/1045 dead transitions. [2022-01-19 00:44:01,350 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1095 places, 1045 transitions, 16096 flow [2022-01-19 00:44:01,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-01-19 00:44:01,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2022-01-19 00:44:01,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 8751 transitions. [2022-01-19 00:44:01,354 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8646378816322497 [2022-01-19 00:44:01,354 INFO L72 ComplementDD]: Start complementDD. Operand 29 states and 8751 transitions. [2022-01-19 00:44:01,354 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 8751 transitions. [2022-01-19 00:44:01,355 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:44:01,355 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 29 states and 8751 transitions. [2022-01-19 00:44:01,359 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 30 states, 29 states have (on average 301.7586206896552) internal successors, (8751), 29 states have internal predecessors, (8751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:44:01,363 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 30 states, 30 states have (on average 349.0) internal successors, (10470), 30 states have internal predecessors, (10470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:44:01,364 INFO L81 ComplementDD]: Finished complementDD. Result has 30 states, 30 states have (on average 349.0) internal successors, (10470), 30 states have internal predecessors, (10470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:44:01,364 INFO L186 Difference]: Start difference. First operand has 1069 places, 925 transitions, 12072 flow. Second operand 29 states and 8751 transitions. [2022-01-19 00:44:01,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1095 places, 1045 transitions, 16096 flow [2022-01-19 00:44:08,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1092 places, 1045 transitions, 15226 flow, removed 399 selfloop flow, removed 3 redundant places. [2022-01-19 00:44:08,293 INFO L242 Difference]: Finished difference. Result has 1110 places, 970 transitions, 13160 flow [2022-01-19 00:44:08,294 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=11308, PETRI_DIFFERENCE_MINUEND_PLACES=1064, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=925, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=167, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=751, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=13160, PETRI_PLACES=1110, PETRI_TRANSITIONS=970} [2022-01-19 00:44:08,294 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 791 predicate places. [2022-01-19 00:44:08,294 INFO L470 AbstractCegarLoop]: Abstraction has has 1110 places, 970 transitions, 13160 flow [2022-01-19 00:44:08,295 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 298.5) internal successors, (3582), 12 states have internal predecessors, (3582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:44:08,295 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:44:08,295 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:44:08,295 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2022-01-19 00:44:08,295 INFO L402 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:44:08,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:44:08,296 INFO L85 PathProgramCache]: Analyzing trace with hash -21424074, now seen corresponding path program 11 times [2022-01-19 00:44:08,296 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:44:08,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243327115] [2022-01-19 00:44:08,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:44:08,296 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:44:08,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:44:08,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:44:08,418 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:44:08,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243327115] [2022-01-19 00:44:08,418 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243327115] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:44:08,418 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:44:08,418 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-19 00:44:08,418 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240785793] [2022-01-19 00:44:08,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:44:08,419 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-19 00:44:08,419 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:44:08,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-19 00:44:08,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-01-19 00:44:08,421 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 349 [2022-01-19 00:44:08,423 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1110 places, 970 transitions, 13160 flow. Second operand has 12 states, 12 states have (on average 298.5) internal successors, (3582), 12 states have internal predecessors, (3582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:44:08,423 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:44:08,423 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 349 [2022-01-19 00:44:08,423 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:44:21,450 INFO L129 PetriNetUnfolder]: 8268/21733 cut-off events. [2022-01-19 00:44:21,450 INFO L130 PetriNetUnfolder]: For 651841/656052 co-relation queries the response was YES. [2022-01-19 00:44:22,188 INFO L84 FinitePrefix]: Finished finitePrefix Result has 162340 conditions, 21733 events. 8268/21733 cut-off events. For 651841/656052 co-relation queries the response was YES. Maximal size of possible extension queue 1610. Compared 248555 event pairs, 2595 based on Foata normal form. 134/19856 useless extension candidates. Maximal degree in co-relation 161935. Up to 6298 conditions per place. [2022-01-19 00:44:22,318 INFO L132 encePairwiseOnDemand]: 331/349 looper letters, 405 selfloop transitions, 330 changer transitions 28/1122 dead transitions. [2022-01-19 00:44:22,318 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1134 places, 1122 transitions, 16799 flow [2022-01-19 00:44:22,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-01-19 00:44:22,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2022-01-19 00:44:22,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 8151 transitions. [2022-01-19 00:44:22,321 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8650111429481057 [2022-01-19 00:44:22,321 INFO L72 ComplementDD]: Start complementDD. Operand 27 states and 8151 transitions. [2022-01-19 00:44:22,321 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 8151 transitions. [2022-01-19 00:44:22,322 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:44:22,322 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 8151 transitions. [2022-01-19 00:44:22,326 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 28 states, 27 states have (on average 301.8888888888889) internal successors, (8151), 27 states have internal predecessors, (8151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:44:22,330 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 28 states, 28 states have (on average 349.0) internal successors, (9772), 28 states have internal predecessors, (9772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:44:22,330 INFO L81 ComplementDD]: Finished complementDD. Result has 28 states, 28 states have (on average 349.0) internal successors, (9772), 28 states have internal predecessors, (9772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:44:22,330 INFO L186 Difference]: Start difference. First operand has 1110 places, 970 transitions, 13160 flow. Second operand 27 states and 8151 transitions. [2022-01-19 00:44:22,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1134 places, 1122 transitions, 16799 flow [2022-01-19 00:44:29,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1131 places, 1122 transitions, 16087 flow, removed 318 selfloop flow, removed 3 redundant places. [2022-01-19 00:44:29,404 INFO L242 Difference]: Finished difference. Result has 1142 places, 1000 transitions, 13905 flow [2022-01-19 00:44:29,405 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=12477, PETRI_DIFFERENCE_MINUEND_PLACES=1105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=970, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=304, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=654, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=13905, PETRI_PLACES=1142, PETRI_TRANSITIONS=1000} [2022-01-19 00:44:29,405 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 823 predicate places. [2022-01-19 00:44:29,405 INFO L470 AbstractCegarLoop]: Abstraction has has 1142 places, 1000 transitions, 13905 flow [2022-01-19 00:44:29,406 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 298.5) internal successors, (3582), 12 states have internal predecessors, (3582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:44:29,406 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:44:29,406 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:44:29,406 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2022-01-19 00:44:29,406 INFO L402 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:44:29,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:44:29,407 INFO L85 PathProgramCache]: Analyzing trace with hash 624961142, now seen corresponding path program 12 times [2022-01-19 00:44:29,407 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:44:29,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676887254] [2022-01-19 00:44:29,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:44:29,407 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:44:29,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:44:29,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:44:29,534 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:44:29,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676887254] [2022-01-19 00:44:29,534 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676887254] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:44:29,534 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:44:29,534 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-19 00:44:29,534 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780164155] [2022-01-19 00:44:29,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:44:29,535 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-19 00:44:29,535 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:44:29,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-19 00:44:29,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-01-19 00:44:29,537 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 349 [2022-01-19 00:44:29,538 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1142 places, 1000 transitions, 13905 flow. Second operand has 12 states, 12 states have (on average 298.5) internal successors, (3582), 12 states have internal predecessors, (3582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:44:29,538 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:44:29,538 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 349 [2022-01-19 00:44:29,538 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:44:43,606 INFO L129 PetriNetUnfolder]: 8464/22185 cut-off events. [2022-01-19 00:44:43,606 INFO L130 PetriNetUnfolder]: For 693969/698285 co-relation queries the response was YES. [2022-01-19 00:44:45,271 INFO L84 FinitePrefix]: Finished finitePrefix Result has 169486 conditions, 22185 events. 8464/22185 cut-off events. For 693969/698285 co-relation queries the response was YES. Maximal size of possible extension queue 1645. Compared 252755 event pairs, 2881 based on Foata normal form. 54/20158 useless extension candidates. Maximal degree in co-relation 169072. Up to 6478 conditions per place. [2022-01-19 00:44:45,463 INFO L132 encePairwiseOnDemand]: 332/349 looper letters, 539 selfloop transitions, 190 changer transitions 24/1112 dead transitions. [2022-01-19 00:44:45,464 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1167 places, 1112 transitions, 18187 flow [2022-01-19 00:44:45,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-01-19 00:44:45,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2022-01-19 00:44:45,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 8454 transitions. [2022-01-19 00:44:45,469 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8651248465002047 [2022-01-19 00:44:45,469 INFO L72 ComplementDD]: Start complementDD. Operand 28 states and 8454 transitions. [2022-01-19 00:44:45,469 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 8454 transitions. [2022-01-19 00:44:45,470 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:44:45,471 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 28 states and 8454 transitions. [2022-01-19 00:44:45,478 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 29 states, 28 states have (on average 301.92857142857144) internal successors, (8454), 28 states have internal predecessors, (8454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:44:45,483 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 29 states, 29 states have (on average 349.0) internal successors, (10121), 29 states have internal predecessors, (10121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:44:45,484 INFO L81 ComplementDD]: Finished complementDD. Result has 29 states, 29 states have (on average 349.0) internal successors, (10121), 29 states have internal predecessors, (10121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:44:45,484 INFO L186 Difference]: Start difference. First operand has 1142 places, 1000 transitions, 13905 flow. Second operand 28 states and 8454 transitions. [2022-01-19 00:44:45,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1167 places, 1112 transitions, 18187 flow [2022-01-19 00:44:53,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1164 places, 1112 transitions, 17871 flow, removed 112 selfloop flow, removed 3 redundant places. [2022-01-19 00:44:53,508 INFO L242 Difference]: Finished difference. Result has 1183 places, 1038 transitions, 15524 flow [2022-01-19 00:44:53,509 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=13610, PETRI_DIFFERENCE_MINUEND_PLACES=1137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1000, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=153, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=839, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=15524, PETRI_PLACES=1183, PETRI_TRANSITIONS=1038} [2022-01-19 00:44:53,509 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 864 predicate places. [2022-01-19 00:44:53,509 INFO L470 AbstractCegarLoop]: Abstraction has has 1183 places, 1038 transitions, 15524 flow [2022-01-19 00:44:53,510 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 298.5) internal successors, (3582), 12 states have internal predecessors, (3582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:44:53,510 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:44:53,510 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:44:53,510 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2022-01-19 00:44:53,510 INFO L402 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:44:53,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:44:53,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1889722502, now seen corresponding path program 13 times [2022-01-19 00:44:53,511 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:44:53,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489268211] [2022-01-19 00:44:53,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:44:53,511 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:44:53,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:44:53,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:44:53,639 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:44:53,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489268211] [2022-01-19 00:44:53,639 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489268211] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:44:53,639 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:44:53,640 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-19 00:44:53,640 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882475022] [2022-01-19 00:44:53,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:44:53,640 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-19 00:44:53,640 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:44:53,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-19 00:44:53,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-01-19 00:44:53,642 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 349 [2022-01-19 00:44:53,644 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1183 places, 1038 transitions, 15524 flow. Second operand has 12 states, 12 states have (on average 298.5) internal successors, (3582), 12 states have internal predecessors, (3582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:44:53,644 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:44:53,644 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 349 [2022-01-19 00:44:53,644 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:45:08,443 INFO L129 PetriNetUnfolder]: 8846/23307 cut-off events. [2022-01-19 00:45:08,443 INFO L130 PetriNetUnfolder]: For 895520/900378 co-relation queries the response was YES. [2022-01-19 00:45:09,308 INFO L84 FinitePrefix]: Finished finitePrefix Result has 188461 conditions, 23307 events. 8846/23307 cut-off events. For 895520/900378 co-relation queries the response was YES. Maximal size of possible extension queue 1763. Compared 269263 event pairs, 2761 based on Foata normal form. 94/21228 useless extension candidates. Maximal degree in co-relation 188029. Up to 6584 conditions per place. [2022-01-19 00:45:09,463 INFO L132 encePairwiseOnDemand]: 332/349 looper letters, 502 selfloop transitions, 274 changer transitions 18/1153 dead transitions. [2022-01-19 00:45:09,464 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1203 places, 1153 transitions, 19610 flow [2022-01-19 00:45:09,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-01-19 00:45:09,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-01-19 00:45:09,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 6954 transitions. [2022-01-19 00:45:09,467 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8663261492462938 [2022-01-19 00:45:09,467 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 6954 transitions. [2022-01-19 00:45:09,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 6954 transitions. [2022-01-19 00:45:09,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:45:09,468 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 6954 transitions. [2022-01-19 00:45:09,471 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 302.3478260869565) internal successors, (6954), 23 states have internal predecessors, (6954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:09,474 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 349.0) internal successors, (8376), 24 states have internal predecessors, (8376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:09,474 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 349.0) internal successors, (8376), 24 states have internal predecessors, (8376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:09,474 INFO L186 Difference]: Start difference. First operand has 1183 places, 1038 transitions, 15524 flow. Second operand 23 states and 6954 transitions. [2022-01-19 00:45:09,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1203 places, 1153 transitions, 19610 flow [2022-01-19 00:45:19,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1200 places, 1153 transitions, 18786 flow, removed 370 selfloop flow, removed 3 redundant places. [2022-01-19 00:45:19,767 INFO L242 Difference]: Finished difference. Result has 1211 places, 1074 transitions, 16788 flow [2022-01-19 00:45:19,768 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=14706, PETRI_DIFFERENCE_MINUEND_PLACES=1178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1038, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=242, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=791, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=16788, PETRI_PLACES=1211, PETRI_TRANSITIONS=1074} [2022-01-19 00:45:19,768 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 892 predicate places. [2022-01-19 00:45:19,768 INFO L470 AbstractCegarLoop]: Abstraction has has 1211 places, 1074 transitions, 16788 flow [2022-01-19 00:45:19,768 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 298.5) internal successors, (3582), 12 states have internal predecessors, (3582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:19,768 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:45:19,769 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:45:19,769 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2022-01-19 00:45:19,769 INFO L402 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:45:19,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:45:19,769 INFO L85 PathProgramCache]: Analyzing trace with hash 992734804, now seen corresponding path program 14 times [2022-01-19 00:45:19,769 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:45:19,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751384496] [2022-01-19 00:45:19,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:45:19,770 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:45:19,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:45:19,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:45:19,895 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:45:19,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751384496] [2022-01-19 00:45:19,896 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751384496] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:45:19,896 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:45:19,896 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-19 00:45:19,896 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41913935] [2022-01-19 00:45:19,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:45:19,896 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-19 00:45:19,896 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:45:19,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-19 00:45:19,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-01-19 00:45:19,899 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 349 [2022-01-19 00:45:19,900 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1211 places, 1074 transitions, 16788 flow. Second operand has 12 states, 12 states have (on average 298.5) internal successors, (3582), 12 states have internal predecessors, (3582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:19,900 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:45:19,900 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 349 [2022-01-19 00:45:19,900 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:45:35,666 INFO L129 PetriNetUnfolder]: 9032/23947 cut-off events. [2022-01-19 00:45:35,666 INFO L130 PetriNetUnfolder]: For 977974/982940 co-relation queries the response was YES. [2022-01-19 00:45:36,620 INFO L84 FinitePrefix]: Finished finitePrefix Result has 196264 conditions, 23947 events. 9032/23947 cut-off events. For 977974/982940 co-relation queries the response was YES. Maximal size of possible extension queue 1841. Compared 279100 event pairs, 2775 based on Foata normal form. 94/21819 useless extension candidates. Maximal degree in co-relation 195823. Up to 6690 conditions per place. [2022-01-19 00:45:36,779 INFO L132 encePairwiseOnDemand]: 332/349 looper letters, 531 selfloop transitions, 275 changer transitions 17/1182 dead transitions. [2022-01-19 00:45:36,779 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1230 places, 1182 transitions, 20749 flow [2022-01-19 00:45:36,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-01-19 00:45:36,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-01-19 00:45:36,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 6657 transitions. [2022-01-19 00:45:36,782 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.867022662151602 [2022-01-19 00:45:36,782 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 6657 transitions. [2022-01-19 00:45:36,782 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 6657 transitions. [2022-01-19 00:45:36,783 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:45:36,783 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 6657 transitions. [2022-01-19 00:45:36,786 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 302.59090909090907) internal successors, (6657), 22 states have internal predecessors, (6657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:36,789 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 349.0) internal successors, (8027), 23 states have internal predecessors, (8027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:36,790 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 349.0) internal successors, (8027), 23 states have internal predecessors, (8027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:36,790 INFO L186 Difference]: Start difference. First operand has 1211 places, 1074 transitions, 16788 flow. Second operand 22 states and 6657 transitions. [2022-01-19 00:45:36,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1230 places, 1182 transitions, 20749 flow [2022-01-19 00:45:47,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1227 places, 1182 transitions, 19599 flow, removed 531 selfloop flow, removed 3 redundant places. [2022-01-19 00:45:47,851 INFO L242 Difference]: Finished difference. Result has 1239 places, 1105 transitions, 17660 flow [2022-01-19 00:45:47,852 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=15878, PETRI_DIFFERENCE_MINUEND_PLACES=1206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1074, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=245, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=823, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=17660, PETRI_PLACES=1239, PETRI_TRANSITIONS=1105} [2022-01-19 00:45:47,852 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 920 predicate places. [2022-01-19 00:45:47,852 INFO L470 AbstractCegarLoop]: Abstraction has has 1239 places, 1105 transitions, 17660 flow [2022-01-19 00:45:47,853 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 298.5) internal successors, (3582), 12 states have internal predecessors, (3582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:47,853 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:45:47,853 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:45:47,853 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2022-01-19 00:45:47,853 INFO L402 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:45:47,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:45:47,853 INFO L85 PathProgramCache]: Analyzing trace with hash -434978776, now seen corresponding path program 15 times [2022-01-19 00:45:47,853 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:45:47,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559466853] [2022-01-19 00:45:47,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:45:47,854 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:45:47,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:45:47,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:45:47,981 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:45:47,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559466853] [2022-01-19 00:45:47,981 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559466853] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:45:47,981 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:45:47,981 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-19 00:45:47,982 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994696103] [2022-01-19 00:45:47,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:45:47,982 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-19 00:45:47,982 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:45:47,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-19 00:45:47,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-01-19 00:45:47,984 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 349 [2022-01-19 00:45:47,986 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1239 places, 1105 transitions, 17660 flow. Second operand has 12 states, 12 states have (on average 298.5) internal successors, (3582), 12 states have internal predecessors, (3582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:45:47,986 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:45:47,986 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 349 [2022-01-19 00:45:47,986 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:46:05,390 INFO L129 PetriNetUnfolder]: 9206/24535 cut-off events. [2022-01-19 00:46:05,391 INFO L130 PetriNetUnfolder]: For 998483/1003629 co-relation queries the response was YES. [2022-01-19 00:46:07,319 INFO L84 FinitePrefix]: Finished finitePrefix Result has 200631 conditions, 24535 events. 9206/24535 cut-off events. For 998483/1003629 co-relation queries the response was YES. Maximal size of possible extension queue 1895. Compared 288205 event pairs, 2733 based on Foata normal form. 94/22363 useless extension candidates. Maximal degree in co-relation 200180. Up to 6796 conditions per place. [2022-01-19 00:46:07,542 INFO L132 encePairwiseOnDemand]: 331/349 looper letters, 508 selfloop transitions, 349 changer transitions 19/1235 dead transitions. [2022-01-19 00:46:07,543 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1265 places, 1235 transitions, 22310 flow [2022-01-19 00:46:07,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-01-19 00:46:07,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2022-01-19 00:46:07,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 8754 transitions. [2022-01-19 00:46:07,548 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8649342950301354 [2022-01-19 00:46:07,548 INFO L72 ComplementDD]: Start complementDD. Operand 29 states and 8754 transitions. [2022-01-19 00:46:07,548 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 8754 transitions. [2022-01-19 00:46:07,549 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:46:07,549 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 29 states and 8754 transitions. [2022-01-19 00:46:07,554 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 30 states, 29 states have (on average 301.86206896551727) internal successors, (8754), 29 states have internal predecessors, (8754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:46:07,559 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 30 states, 30 states have (on average 349.0) internal successors, (10470), 30 states have internal predecessors, (10470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:46:07,560 INFO L81 ComplementDD]: Finished complementDD. Result has 30 states, 30 states have (on average 349.0) internal successors, (10470), 30 states have internal predecessors, (10470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:46:07,560 INFO L186 Difference]: Start difference. First operand has 1239 places, 1105 transitions, 17660 flow. Second operand 29 states and 8754 transitions. [2022-01-19 00:46:07,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1265 places, 1235 transitions, 22310 flow [2022-01-19 00:46:19,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1262 places, 1235 transitions, 21629 flow, removed 294 selfloop flow, removed 3 redundant places. [2022-01-19 00:46:19,039 INFO L242 Difference]: Finished difference. Result has 1274 places, 1146 transitions, 19417 flow [2022-01-19 00:46:19,040 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=16994, PETRI_DIFFERENCE_MINUEND_PLACES=1234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=311, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=789, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=19417, PETRI_PLACES=1274, PETRI_TRANSITIONS=1146} [2022-01-19 00:46:19,040 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 955 predicate places. [2022-01-19 00:46:19,041 INFO L470 AbstractCegarLoop]: Abstraction has has 1274 places, 1146 transitions, 19417 flow [2022-01-19 00:46:19,041 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 298.5) internal successors, (3582), 12 states have internal predecessors, (3582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:46:19,041 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:46:19,041 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:46:19,041 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2022-01-19 00:46:19,042 INFO L402 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:46:19,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:46:19,042 INFO L85 PathProgramCache]: Analyzing trace with hash -441161904, now seen corresponding path program 16 times [2022-01-19 00:46:19,042 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:46:19,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97282147] [2022-01-19 00:46:19,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:46:19,042 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:46:19,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:46:19,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:46:19,165 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:46:19,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97282147] [2022-01-19 00:46:19,165 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97282147] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:46:19,165 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:46:19,165 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-19 00:46:19,165 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299691575] [2022-01-19 00:46:19,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:46:19,165 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-19 00:46:19,165 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:46:19,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-19 00:46:19,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-01-19 00:46:19,168 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 349 [2022-01-19 00:46:19,169 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1274 places, 1146 transitions, 19417 flow. Second operand has 12 states, 12 states have (on average 298.5) internal successors, (3582), 12 states have internal predecessors, (3582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:46:19,169 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:46:19,169 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 349 [2022-01-19 00:46:19,169 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:46:36,925 INFO L129 PetriNetUnfolder]: 9572/25810 cut-off events. [2022-01-19 00:46:36,926 INFO L130 PetriNetUnfolder]: For 1094087/1099374 co-relation queries the response was YES. [2022-01-19 00:46:37,995 INFO L84 FinitePrefix]: Finished finitePrefix Result has 212402 conditions, 25810 events. 9572/25810 cut-off events. For 1094087/1099374 co-relation queries the response was YES. Maximal size of possible extension queue 2013. Compared 307568 event pairs, 2691 based on Foata normal form. 94/23567 useless extension candidates. Maximal degree in co-relation 211941. Up to 6647 conditions per place. [2022-01-19 00:46:38,160 INFO L132 encePairwiseOnDemand]: 332/349 looper letters, 563 selfloop transitions, 348 changer transitions 37/1307 dead transitions. [2022-01-19 00:46:38,160 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1306 places, 1307 transitions, 23999 flow [2022-01-19 00:46:38,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-01-19 00:46:38,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2022-01-19 00:46:38,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 10552 transitions. [2022-01-19 00:46:38,165 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8638559148587802 [2022-01-19 00:46:38,165 INFO L72 ComplementDD]: Start complementDD. Operand 35 states and 10552 transitions. [2022-01-19 00:46:38,165 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 10552 transitions. [2022-01-19 00:46:38,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:46:38,166 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 35 states and 10552 transitions. [2022-01-19 00:46:38,171 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 36 states, 35 states have (on average 301.48571428571427) internal successors, (10552), 35 states have internal predecessors, (10552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:46:38,176 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 36 states, 36 states have (on average 349.0) internal successors, (12564), 36 states have internal predecessors, (12564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:46:38,176 INFO L81 ComplementDD]: Finished complementDD. Result has 36 states, 36 states have (on average 349.0) internal successors, (12564), 36 states have internal predecessors, (12564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:46:38,176 INFO L186 Difference]: Start difference. First operand has 1274 places, 1146 transitions, 19417 flow. Second operand 35 states and 10552 transitions. [2022-01-19 00:46:38,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1306 places, 1307 transitions, 23999 flow [2022-01-19 00:46:50,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1303 places, 1307 transitions, 23023 flow, removed 436 selfloop flow, removed 3 redundant places. [2022-01-19 00:46:50,149 INFO L242 Difference]: Finished difference. Result has 1327 places, 1200 transitions, 20946 flow [2022-01-19 00:46:50,150 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=18499, PETRI_DIFFERENCE_MINUEND_PLACES=1269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=296, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=829, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=20946, PETRI_PLACES=1327, PETRI_TRANSITIONS=1200} [2022-01-19 00:46:50,150 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 1008 predicate places. [2022-01-19 00:46:50,150 INFO L470 AbstractCegarLoop]: Abstraction has has 1327 places, 1200 transitions, 20946 flow [2022-01-19 00:46:50,151 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 298.5) internal successors, (3582), 12 states have internal predecessors, (3582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:46:50,151 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:46:50,151 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:46:50,151 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2022-01-19 00:46:50,151 INFO L402 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:46:50,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:46:50,151 INFO L85 PathProgramCache]: Analyzing trace with hash -298920850, now seen corresponding path program 17 times [2022-01-19 00:46:50,151 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:46:50,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101155310] [2022-01-19 00:46:50,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:46:50,152 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:46:50,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:46:50,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:46:50,266 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:46:50,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101155310] [2022-01-19 00:46:50,266 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101155310] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:46:50,266 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:46:50,267 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-19 00:46:50,267 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388465058] [2022-01-19 00:46:50,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:46:50,267 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-19 00:46:50,267 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:46:50,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-19 00:46:50,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-01-19 00:46:50,271 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 349 [2022-01-19 00:46:50,273 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1327 places, 1200 transitions, 20946 flow. Second operand has 12 states, 12 states have (on average 298.5) internal successors, (3582), 12 states have internal predecessors, (3582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:46:50,273 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:46:50,273 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 349 [2022-01-19 00:46:50,273 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:47:08,845 INFO L129 PetriNetUnfolder]: 9770/26288 cut-off events. [2022-01-19 00:47:08,845 INFO L130 PetriNetUnfolder]: For 1113321/1118600 co-relation queries the response was YES. [2022-01-19 00:47:10,107 INFO L84 FinitePrefix]: Finished finitePrefix Result has 219993 conditions, 26288 events. 9770/26288 cut-off events. For 1113321/1118600 co-relation queries the response was YES. Maximal size of possible extension queue 2064. Compared 314937 event pairs, 2787 based on Foata normal form. 94/23961 useless extension candidates. Maximal degree in co-relation 219510. Up to 7237 conditions per place. [2022-01-19 00:47:10,430 INFO L132 encePairwiseOnDemand]: 332/349 looper letters, 565 selfloop transitions, 356 changer transitions 25/1305 dead transitions. [2022-01-19 00:47:10,431 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1348 places, 1305 transitions, 24639 flow [2022-01-19 00:47:10,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-01-19 00:47:10,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-01-19 00:47:10,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 7255 transitions. [2022-01-19 00:47:10,434 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8661652340019103 [2022-01-19 00:47:10,434 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 7255 transitions. [2022-01-19 00:47:10,434 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 7255 transitions. [2022-01-19 00:47:10,435 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:47:10,435 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 7255 transitions. [2022-01-19 00:47:10,438 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 302.2916666666667) internal successors, (7255), 24 states have internal predecessors, (7255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:47:10,441 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 349.0) internal successors, (8725), 25 states have internal predecessors, (8725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:47:10,442 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 349.0) internal successors, (8725), 25 states have internal predecessors, (8725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:47:10,442 INFO L186 Difference]: Start difference. First operand has 1327 places, 1200 transitions, 20946 flow. Second operand 24 states and 7255 transitions. [2022-01-19 00:47:10,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1348 places, 1305 transitions, 24639 flow [2022-01-19 00:47:24,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1346 places, 1305 transitions, 24067 flow, removed 286 selfloop flow, removed 2 redundant places. [2022-01-19 00:47:24,050 INFO L242 Difference]: Finished difference. Result has 1354 places, 1229 transitions, 22210 flow [2022-01-19 00:47:24,051 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=20590, PETRI_DIFFERENCE_MINUEND_PLACES=1323, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=330, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=865, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=22210, PETRI_PLACES=1354, PETRI_TRANSITIONS=1229} [2022-01-19 00:47:24,051 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 1035 predicate places. [2022-01-19 00:47:24,051 INFO L470 AbstractCegarLoop]: Abstraction has has 1354 places, 1229 transitions, 22210 flow [2022-01-19 00:47:24,052 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 298.5) internal successors, (3582), 12 states have internal predecessors, (3582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:47:24,052 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:47:24,052 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:47:24,052 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2022-01-19 00:47:24,052 INFO L402 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:47:24,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:47:24,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1000156416, now seen corresponding path program 18 times [2022-01-19 00:47:24,052 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:47:24,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711598430] [2022-01-19 00:47:24,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:47:24,052 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:47:24,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:47:24,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:47:24,171 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:47:24,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711598430] [2022-01-19 00:47:24,171 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711598430] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:47:24,171 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:47:24,171 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-19 00:47:24,171 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529175236] [2022-01-19 00:47:24,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:47:24,172 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-19 00:47:24,172 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:47:24,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-19 00:47:24,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-01-19 00:47:24,174 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 349 [2022-01-19 00:47:24,175 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1354 places, 1229 transitions, 22210 flow. Second operand has 12 states, 12 states have (on average 298.5) internal successors, (3582), 12 states have internal predecessors, (3582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:47:24,176 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:47:24,176 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 349 [2022-01-19 00:47:24,176 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:47:45,185 INFO L129 PetriNetUnfolder]: 10044/27526 cut-off events. [2022-01-19 00:47:45,185 INFO L130 PetriNetUnfolder]: For 1047280/1052695 co-relation queries the response was YES. [2022-01-19 00:47:46,739 INFO L84 FinitePrefix]: Finished finitePrefix Result has 228381 conditions, 27526 events. 10044/27526 cut-off events. For 1047280/1052695 co-relation queries the response was YES. Maximal size of possible extension queue 2189. Compared 335456 event pairs, 2755 based on Foata normal form. 94/25152 useless extension candidates. Maximal degree in co-relation 227891. Up to 7195 conditions per place. [2022-01-19 00:47:46,916 INFO L132 encePairwiseOnDemand]: 332/349 looper letters, 583 selfloop transitions, 387 changer transitions 28/1357 dead transitions. [2022-01-19 00:47:46,916 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1380 places, 1357 transitions, 26330 flow [2022-01-19 00:47:46,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-01-19 00:47:46,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2022-01-19 00:47:46,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 8753 transitions. [2022-01-19 00:47:46,920 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8648354905641735 [2022-01-19 00:47:46,920 INFO L72 ComplementDD]: Start complementDD. Operand 29 states and 8753 transitions. [2022-01-19 00:47:46,920 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 8753 transitions. [2022-01-19 00:47:46,921 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:47:46,921 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 29 states and 8753 transitions. [2022-01-19 00:47:46,926 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 30 states, 29 states have (on average 301.82758620689657) internal successors, (8753), 29 states have internal predecessors, (8753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:47:46,930 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 30 states, 30 states have (on average 349.0) internal successors, (10470), 30 states have internal predecessors, (10470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:47:46,930 INFO L81 ComplementDD]: Finished complementDD. Result has 30 states, 30 states have (on average 349.0) internal successors, (10470), 30 states have internal predecessors, (10470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:47:46,930 INFO L186 Difference]: Start difference. First operand has 1354 places, 1229 transitions, 22210 flow. Second operand 29 states and 8753 transitions. [2022-01-19 00:47:46,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1380 places, 1357 transitions, 26330 flow [2022-01-19 00:48:01,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1377 places, 1357 transitions, 26109 flow, removed 109 selfloop flow, removed 3 redundant places. [2022-01-19 00:48:01,498 INFO L242 Difference]: Finished difference. Result has 1393 places, 1269 transitions, 24154 flow [2022-01-19 00:48:01,498 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=21995, PETRI_DIFFERENCE_MINUEND_PLACES=1349, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=349, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=867, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=24154, PETRI_PLACES=1393, PETRI_TRANSITIONS=1269} [2022-01-19 00:48:01,499 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 1074 predicate places. [2022-01-19 00:48:01,499 INFO L470 AbstractCegarLoop]: Abstraction has has 1393 places, 1269 transitions, 24154 flow [2022-01-19 00:48:01,499 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 298.5) internal successors, (3582), 12 states have internal predecessors, (3582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:48:01,499 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:48:01,499 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:48:01,499 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2022-01-19 00:48:01,499 INFO L402 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:48:01,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:48:01,500 INFO L85 PathProgramCache]: Analyzing trace with hash 243957376, now seen corresponding path program 19 times [2022-01-19 00:48:01,500 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:48:01,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286999914] [2022-01-19 00:48:01,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:48:01,500 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:48:01,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:48:01,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:48:01,618 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:48:01,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286999914] [2022-01-19 00:48:01,618 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286999914] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:48:01,618 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:48:01,618 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-19 00:48:01,619 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149160269] [2022-01-19 00:48:01,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:48:01,619 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-19 00:48:01,619 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:48:01,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-19 00:48:01,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-01-19 00:48:01,621 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 349 [2022-01-19 00:48:01,623 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1393 places, 1269 transitions, 24154 flow. Second operand has 12 states, 12 states have (on average 298.5) internal successors, (3582), 12 states have internal predecessors, (3582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:48:01,623 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:48:01,623 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 349 [2022-01-19 00:48:01,623 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:48:22,536 INFO L129 PetriNetUnfolder]: 10242/28043 cut-off events. [2022-01-19 00:48:22,536 INFO L130 PetriNetUnfolder]: For 1116462/1121905 co-relation queries the response was YES. [2022-01-19 00:48:23,970 INFO L84 FinitePrefix]: Finished finitePrefix Result has 239524 conditions, 28043 events. 10242/28043 cut-off events. For 1116462/1121905 co-relation queries the response was YES. Maximal size of possible extension queue 2257. Compared 342486 event pairs, 2783 based on Foata normal form. 94/25605 useless extension candidates. Maximal degree in co-relation 239020. Up to 7489 conditions per place. [2022-01-19 00:48:24,150 INFO L132 encePairwiseOnDemand]: 332/349 looper letters, 616 selfloop transitions, 389 changer transitions 29/1393 dead transitions. [2022-01-19 00:48:24,150 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1420 places, 1393 transitions, 28256 flow [2022-01-19 00:48:24,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-01-19 00:48:24,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-01-19 00:48:24,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 9056 transitions. [2022-01-19 00:48:24,154 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8649474689589303 [2022-01-19 00:48:24,154 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 9056 transitions. [2022-01-19 00:48:24,154 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 9056 transitions. [2022-01-19 00:48:24,155 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:48:24,155 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 9056 transitions. [2022-01-19 00:48:24,159 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 301.8666666666667) internal successors, (9056), 30 states have internal predecessors, (9056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:48:24,163 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 349.0) internal successors, (10819), 31 states have internal predecessors, (10819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:48:24,164 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 349.0) internal successors, (10819), 31 states have internal predecessors, (10819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:48:24,164 INFO L186 Difference]: Start difference. First operand has 1393 places, 1269 transitions, 24154 flow. Second operand 30 states and 9056 transitions. [2022-01-19 00:48:24,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1420 places, 1393 transitions, 28256 flow [2022-01-19 00:48:38,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1418 places, 1393 transitions, 27990 flow, removed 133 selfloop flow, removed 2 redundant places. [2022-01-19 00:48:38,927 INFO L242 Difference]: Finished difference. Result has 1434 places, 1306 transitions, 25941 flow [2022-01-19 00:48:38,928 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=23894, PETRI_DIFFERENCE_MINUEND_PLACES=1389, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=355, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=901, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=25941, PETRI_PLACES=1434, PETRI_TRANSITIONS=1306} [2022-01-19 00:48:38,928 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 1115 predicate places. [2022-01-19 00:48:38,928 INFO L470 AbstractCegarLoop]: Abstraction has has 1434 places, 1306 transitions, 25941 flow [2022-01-19 00:48:38,929 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 298.5) internal successors, (3582), 12 states have internal predecessors, (3582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:48:38,929 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:48:38,929 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:48:38,929 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2022-01-19 00:48:38,929 INFO L402 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:48:38,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:48:38,929 INFO L85 PathProgramCache]: Analyzing trace with hash 820381890, now seen corresponding path program 20 times [2022-01-19 00:48:38,929 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:48:38,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916746416] [2022-01-19 00:48:38,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:48:38,930 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:48:38,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:48:39,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:48:39,044 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:48:39,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916746416] [2022-01-19 00:48:39,045 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916746416] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:48:39,045 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:48:39,045 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-19 00:48:39,045 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405116402] [2022-01-19 00:48:39,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:48:39,045 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-19 00:48:39,045 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:48:39,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-19 00:48:39,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-01-19 00:48:39,048 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 349 [2022-01-19 00:48:39,049 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1434 places, 1306 transitions, 25941 flow. Second operand has 12 states, 12 states have (on average 298.5) internal successors, (3582), 12 states have internal predecessors, (3582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:48:39,049 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:48:39,049 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 349 [2022-01-19 00:48:39,049 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:49:01,648 INFO L129 PetriNetUnfolder]: 10287/28226 cut-off events. [2022-01-19 00:49:01,650 INFO L130 PetriNetUnfolder]: For 1158801/1164326 co-relation queries the response was YES. [2022-01-19 00:49:05,377 INFO L84 FinitePrefix]: Finished finitePrefix Result has 245751 conditions, 28226 events. 10287/28226 cut-off events. For 1158801/1164326 co-relation queries the response was YES. Maximal size of possible extension queue 2269. Compared 345564 event pairs, 2795 based on Foata normal form. 94/25772 useless extension candidates. Maximal degree in co-relation 245232. Up to 7645 conditions per place. [2022-01-19 00:49:05,642 INFO L132 encePairwiseOnDemand]: 331/349 looper letters, 562 selfloop transitions, 467 changer transitions 25/1413 dead transitions. [2022-01-19 00:49:05,642 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1460 places, 1413 transitions, 29695 flow [2022-01-19 00:49:05,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-01-19 00:49:05,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2022-01-19 00:49:05,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 8751 transitions. [2022-01-19 00:49:05,647 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8646378816322497 [2022-01-19 00:49:05,647 INFO L72 ComplementDD]: Start complementDD. Operand 29 states and 8751 transitions. [2022-01-19 00:49:05,647 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 8751 transitions. [2022-01-19 00:49:05,649 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:49:05,649 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 29 states and 8751 transitions. [2022-01-19 00:49:05,654 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 30 states, 29 states have (on average 301.7586206896552) internal successors, (8751), 29 states have internal predecessors, (8751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:05,659 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 30 states, 30 states have (on average 349.0) internal successors, (10470), 30 states have internal predecessors, (10470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:05,660 INFO L81 ComplementDD]: Finished complementDD. Result has 30 states, 30 states have (on average 349.0) internal successors, (10470), 30 states have internal predecessors, (10470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:05,660 INFO L186 Difference]: Start difference. First operand has 1434 places, 1306 transitions, 25941 flow. Second operand 29 states and 8751 transitions. [2022-01-19 00:49:05,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1460 places, 1413 transitions, 29695 flow [2022-01-19 00:49:21,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1458 places, 1413 transitions, 29375 flow, removed 160 selfloop flow, removed 2 redundant places. [2022-01-19 00:49:21,409 INFO L242 Difference]: Finished difference. Result has 1469 places, 1335 transitions, 27556 flow [2022-01-19 00:49:21,410 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=25643, PETRI_DIFFERENCE_MINUEND_PLACES=1430, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=442, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=854, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=27556, PETRI_PLACES=1469, PETRI_TRANSITIONS=1335} [2022-01-19 00:49:21,410 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 1150 predicate places. [2022-01-19 00:49:21,410 INFO L470 AbstractCegarLoop]: Abstraction has has 1469 places, 1335 transitions, 27556 flow [2022-01-19 00:49:21,411 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 298.5) internal successors, (3582), 12 states have internal predecessors, (3582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:21,411 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:49:21,411 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:49:21,411 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2022-01-19 00:49:21,411 INFO L402 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:49:21,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:49:21,412 INFO L85 PathProgramCache]: Analyzing trace with hash 998714846, now seen corresponding path program 21 times [2022-01-19 00:49:21,412 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:49:21,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605357099] [2022-01-19 00:49:21,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:49:21,412 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:49:21,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:49:21,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:49:21,534 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:49:21,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605357099] [2022-01-19 00:49:21,534 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605357099] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:49:21,534 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:49:21,534 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-19 00:49:21,534 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916791552] [2022-01-19 00:49:21,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:49:21,535 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-19 00:49:21,535 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:49:21,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-19 00:49:21,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-01-19 00:49:21,537 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 349 [2022-01-19 00:49:21,538 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1469 places, 1335 transitions, 27556 flow. Second operand has 12 states, 12 states have (on average 298.5) internal successors, (3582), 12 states have internal predecessors, (3582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:21,539 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:49:21,539 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 349 [2022-01-19 00:49:21,539 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:49:43,207 INFO L129 PetriNetUnfolder]: 10285/28428 cut-off events. [2022-01-19 00:49:43,207 INFO L130 PetriNetUnfolder]: For 1200788/1206389 co-relation queries the response was YES. [2022-01-19 00:49:44,887 INFO L84 FinitePrefix]: Finished finitePrefix Result has 250819 conditions, 28428 events. 10285/28428 cut-off events. For 1200788/1206389 co-relation queries the response was YES. Maximal size of possible extension queue 2278. Compared 349354 event pairs, 2809 based on Foata normal form. 94/25978 useless extension candidates. Maximal degree in co-relation 250290. Up to 7716 conditions per place. [2022-01-19 00:49:45,077 INFO L132 encePairwiseOnDemand]: 332/349 looper letters, 638 selfloop transitions, 396 changer transitions 29/1422 dead transitions. [2022-01-19 00:49:45,077 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1490 places, 1422 transitions, 30831 flow [2022-01-19 00:49:45,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-01-19 00:49:45,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2022-01-19 00:49:45,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 7257 transitions. [2022-01-19 00:49:45,080 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8664040114613181 [2022-01-19 00:49:45,081 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 7257 transitions. [2022-01-19 00:49:45,081 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 7257 transitions. [2022-01-19 00:49:45,081 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:49:45,081 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 7257 transitions. [2022-01-19 00:49:45,085 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 302.375) internal successors, (7257), 24 states have internal predecessors, (7257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:45,088 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 349.0) internal successors, (8725), 25 states have internal predecessors, (8725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:45,089 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 349.0) internal successors, (8725), 25 states have internal predecessors, (8725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:49:45,089 INFO L186 Difference]: Start difference. First operand has 1469 places, 1335 transitions, 27556 flow. Second operand 24 states and 7257 transitions. [2022-01-19 00:49:45,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1490 places, 1422 transitions, 30831 flow [2022-01-19 00:50:02,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1488 places, 1422 transitions, 30489 flow, removed 171 selfloop flow, removed 2 redundant places. [2022-01-19 00:50:02,933 INFO L242 Difference]: Finished difference. Result has 1496 places, 1348 transitions, 28521 flow [2022-01-19 00:50:02,933 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=27220, PETRI_DIFFERENCE_MINUEND_PLACES=1465, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1335, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=386, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=944, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=28521, PETRI_PLACES=1496, PETRI_TRANSITIONS=1348} [2022-01-19 00:50:02,934 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 1177 predicate places. [2022-01-19 00:50:02,934 INFO L470 AbstractCegarLoop]: Abstraction has has 1496 places, 1348 transitions, 28521 flow [2022-01-19 00:50:02,934 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 298.5) internal successors, (3582), 12 states have internal predecessors, (3582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:02,934 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:50:02,934 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:50:02,934 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2022-01-19 00:50:02,934 INFO L402 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:50:02,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:50:02,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1793256764, now seen corresponding path program 22 times [2022-01-19 00:50:02,935 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:50:02,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976439574] [2022-01-19 00:50:02,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:50:02,935 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:50:02,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:50:03,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:50:03,043 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:50:03,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976439574] [2022-01-19 00:50:03,043 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976439574] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:50:03,043 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:50:03,043 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-19 00:50:03,043 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324833745] [2022-01-19 00:50:03,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:50:03,043 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-19 00:50:03,044 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:50:03,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-19 00:50:03,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-01-19 00:50:03,046 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 349 [2022-01-19 00:50:03,047 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1496 places, 1348 transitions, 28521 flow. Second operand has 12 states, 12 states have (on average 298.5) internal successors, (3582), 12 states have internal predecessors, (3582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:03,047 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:50:03,048 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 349 [2022-01-19 00:50:03,048 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:50:28,384 INFO L129 PetriNetUnfolder]: 10499/29186 cut-off events. [2022-01-19 00:50:28,384 INFO L130 PetriNetUnfolder]: For 1235535/1241634 co-relation queries the response was YES. [2022-01-19 00:50:29,941 INFO L84 FinitePrefix]: Finished finitePrefix Result has 261737 conditions, 29186 events. 10499/29186 cut-off events. For 1235535/1241634 co-relation queries the response was YES. Maximal size of possible extension queue 2346. Compared 361365 event pairs, 2777 based on Foata normal form. 54/26636 useless extension candidates. Maximal degree in co-relation 261201. Up to 7837 conditions per place. [2022-01-19 00:50:30,125 INFO L132 encePairwiseOnDemand]: 331/349 looper letters, 603 selfloop transitions, 485 changer transitions 18/1465 dead transitions. [2022-01-19 00:50:30,126 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1524 places, 1465 transitions, 33673 flow [2022-01-19 00:50:30,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-01-19 00:50:30,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2022-01-19 00:50:30,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 9350 transitions. [2022-01-19 00:50:30,130 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.86422035308254 [2022-01-19 00:50:30,130 INFO L72 ComplementDD]: Start complementDD. Operand 31 states and 9350 transitions. [2022-01-19 00:50:30,130 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 9350 transitions. [2022-01-19 00:50:30,131 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:50:30,131 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 31 states and 9350 transitions. [2022-01-19 00:50:30,135 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 32 states, 31 states have (on average 301.61290322580646) internal successors, (9350), 31 states have internal predecessors, (9350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:30,140 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 32 states, 32 states have (on average 349.0) internal successors, (11168), 32 states have internal predecessors, (11168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:30,140 INFO L81 ComplementDD]: Finished complementDD. Result has 32 states, 32 states have (on average 349.0) internal successors, (11168), 32 states have internal predecessors, (11168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:30,140 INFO L186 Difference]: Start difference. First operand has 1496 places, 1348 transitions, 28521 flow. Second operand 31 states and 9350 transitions. [2022-01-19 00:50:30,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1524 places, 1465 transitions, 33673 flow [2022-01-19 00:50:48,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1521 places, 1465 transitions, 33412 flow, removed 129 selfloop flow, removed 3 redundant places. [2022-01-19 00:50:48,702 INFO L242 Difference]: Finished difference. Result has 1537 places, 1397 transitions, 30979 flow [2022-01-19 00:50:48,703 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=28262, PETRI_DIFFERENCE_MINUEND_PLACES=1491, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1348, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=438, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=900, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=30979, PETRI_PLACES=1537, PETRI_TRANSITIONS=1397} [2022-01-19 00:50:48,704 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 1218 predicate places. [2022-01-19 00:50:48,704 INFO L470 AbstractCegarLoop]: Abstraction has has 1537 places, 1397 transitions, 30979 flow [2022-01-19 00:50:48,704 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 298.5) internal successors, (3582), 12 states have internal predecessors, (3582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:48,705 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:50:48,705 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:50:48,705 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2022-01-19 00:50:48,705 INFO L402 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:50:48,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:50:48,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1246799128, now seen corresponding path program 23 times [2022-01-19 00:50:48,705 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:50:48,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923733578] [2022-01-19 00:50:48,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:50:48,706 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:50:48,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:50:48,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:50:48,838 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:50:48,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923733578] [2022-01-19 00:50:48,838 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923733578] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:50:48,838 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:50:48,838 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-19 00:50:48,838 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055507396] [2022-01-19 00:50:48,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:50:48,839 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-19 00:50:48,839 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:50:48,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-19 00:50:48,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-01-19 00:50:48,841 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 349 [2022-01-19 00:50:48,842 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1537 places, 1397 transitions, 30979 flow. Second operand has 12 states, 12 states have (on average 298.5) internal successors, (3582), 12 states have internal predecessors, (3582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:50:48,842 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:50:48,842 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 349 [2022-01-19 00:50:48,842 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 00:51:12,454 INFO L129 PetriNetUnfolder]: 10797/29919 cut-off events. [2022-01-19 00:51:12,455 INFO L130 PetriNetUnfolder]: For 1414750/1421119 co-relation queries the response was YES. [2022-01-19 00:51:14,468 INFO L84 FinitePrefix]: Finished finitePrefix Result has 279117 conditions, 29919 events. 10797/29919 cut-off events. For 1414750/1421119 co-relation queries the response was YES. Maximal size of possible extension queue 2429. Compared 370849 event pairs, 2895 based on Foata normal form. 54/27298 useless extension candidates. Maximal degree in co-relation 278567. Up to 8055 conditions per place. [2022-01-19 00:51:14,665 INFO L132 encePairwiseOnDemand]: 332/349 looper letters, 809 selfloop transitions, 307 changer transitions 17/1492 dead transitions. [2022-01-19 00:51:14,665 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1556 places, 1492 transitions, 35730 flow [2022-01-19 00:51:14,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-01-19 00:51:14,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-01-19 00:51:14,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 6657 transitions. [2022-01-19 00:51:14,668 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.867022662151602 [2022-01-19 00:51:14,668 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 6657 transitions. [2022-01-19 00:51:14,668 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 6657 transitions. [2022-01-19 00:51:14,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 00:51:14,669 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 6657 transitions. [2022-01-19 00:51:14,672 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 302.59090909090907) internal successors, (6657), 22 states have internal predecessors, (6657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:51:14,675 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 349.0) internal successors, (8027), 23 states have internal predecessors, (8027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:51:14,676 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 349.0) internal successors, (8027), 23 states have internal predecessors, (8027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:51:14,676 INFO L186 Difference]: Start difference. First operand has 1537 places, 1397 transitions, 30979 flow. Second operand 22 states and 6657 transitions. [2022-01-19 00:51:14,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1556 places, 1492 transitions, 35730 flow [2022-01-19 00:51:35,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1554 places, 1492 transitions, 35050 flow, removed 340 selfloop flow, removed 2 redundant places. [2022-01-19 00:51:35,794 INFO L242 Difference]: Finished difference. Result has 1566 places, 1430 transitions, 32601 flow [2022-01-19 00:51:35,794 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=30301, PETRI_DIFFERENCE_MINUEND_PLACES=1533, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1397, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=276, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=32601, PETRI_PLACES=1566, PETRI_TRANSITIONS=1430} [2022-01-19 00:51:35,795 INFO L334 CegarLoopForPetriNet]: 319 programPoint places, 1247 predicate places. [2022-01-19 00:51:35,795 INFO L470 AbstractCegarLoop]: Abstraction has has 1566 places, 1430 transitions, 32601 flow [2022-01-19 00:51:35,795 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 298.5) internal successors, (3582), 12 states have internal predecessors, (3582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:51:35,795 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 00:51:35,795 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 00:51:35,795 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2022-01-19 00:51:35,795 INFO L402 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 00:51:35,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 00:51:35,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1391391264, now seen corresponding path program 24 times [2022-01-19 00:51:35,796 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 00:51:35,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82526559] [2022-01-19 00:51:35,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 00:51:35,796 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 00:51:35,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 00:51:35,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 00:51:35,925 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 00:51:35,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82526559] [2022-01-19 00:51:35,925 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82526559] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 00:51:35,925 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 00:51:35,925 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-19 00:51:35,925 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820358501] [2022-01-19 00:51:35,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 00:51:35,926 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-19 00:51:35,926 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 00:51:35,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-19 00:51:35,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-01-19 00:51:35,928 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 349 [2022-01-19 00:51:35,929 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1566 places, 1430 transitions, 32601 flow. Second operand has 12 states, 12 states have (on average 298.5) internal successors, (3582), 12 states have internal predecessors, (3582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 00:51:35,929 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 00:51:35,930 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 349 [2022-01-19 00:51:35,930 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2022-01-19 00:51:52,024 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-01-19 00:51:53,115 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 [2022-01-19 00:51:53,957 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-01-19 00:51:53,958 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2022-01-19 00:51:53,958 WARN L594 AbstractCegarLoop]: Verification canceled: while executing Executor. [2022-01-19 00:51:53,960 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 4 remaining) [2022-01-19 00:51:53,960 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (1 of 4 remaining) [2022-01-19 00:51:53,961 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATION (0 of 4 remaining) [2022-01-19 00:51:53,963 INFO L732 BasicCegarLoop]: Path program histogram: [24, 20, 6, 5, 5, 4, 4, 3, 3, 1, 1, 1, 1] [2022-01-19 00:51:53,967 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-01-19 00:51:53,967 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-19 00:51:53,976 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.01 12:51:53 BasicIcfg [2022-01-19 00:51:53,976 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-19 00:51:53,977 INFO L158 Benchmark]: Toolchain (without parser) took 699933.51ms. Allocated memory was 358.6MB in the beginning and 16.0GB in the end (delta: 15.6GB). Free memory was 304.3MB in the beginning and 13.3GB in the end (delta: -13.0GB). Peak memory consumption was 8.3GB. Max. memory is 16.0GB. [2022-01-19 00:51:53,977 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 358.6MB. Free memory is still 320.8MB. There was no memory consumed. Max. memory is 16.0GB. [2022-01-19 00:51:53,977 INFO L158 Benchmark]: CACSL2BoogieTranslator took 243.61ms. Allocated memory is still 358.6MB. Free memory was 304.2MB in the beginning and 328.2MB in the end (delta: -24.0MB). Peak memory consumption was 11.2MB. Max. memory is 16.0GB. [2022-01-19 00:51:53,978 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.89ms. Allocated memory is still 358.6MB. Free memory was 328.2MB in the beginning and 326.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-19 00:51:53,978 INFO L158 Benchmark]: Boogie Preprocessor took 39.61ms. Allocated memory is still 358.6MB. Free memory was 326.1MB in the beginning and 323.9MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-19 00:51:53,978 INFO L158 Benchmark]: RCFGBuilder took 515.88ms. Allocated memory is still 358.6MB. Free memory was 323.9MB in the beginning and 303.0MB in the end (delta: 20.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. [2022-01-19 00:51:53,978 INFO L158 Benchmark]: TraceAbstraction took 699068.79ms. Allocated memory was 358.6MB in the beginning and 16.0GB in the end (delta: 15.6GB). Free memory was 301.8MB in the beginning and 13.3GB in the end (delta: -13.0GB). Peak memory consumption was 8.3GB. Max. memory is 16.0GB. [2022-01-19 00:51:53,979 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 358.6MB. Free memory is still 320.8MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 243.61ms. Allocated memory is still 358.6MB. Free memory was 304.2MB in the beginning and 328.2MB in the end (delta: -24.0MB). Peak memory consumption was 11.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 58.89ms. Allocated memory is still 358.6MB. Free memory was 328.2MB in the beginning and 326.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 39.61ms. Allocated memory is still 358.6MB. Free memory was 326.1MB in the beginning and 323.9MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 515.88ms. Allocated memory is still 358.6MB. Free memory was 323.9MB in the beginning and 303.0MB in the end (delta: 20.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. * TraceAbstraction took 699068.79ms. Allocated memory was 358.6MB in the beginning and 16.0GB in the end (delta: 15.6GB). Free memory was 301.8MB in the beginning and 13.3GB in the end (delta: -13.0GB). Peak memory consumption was 8.3GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 89]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 81]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 80]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 82]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 543 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.1s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 698.8s, OverallIterations: 78, TraceHistogramMax: 1, PathProgramHistogramMax: 24, EmptinessCheckTime: 0.0s, AutomataDifference: 689.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4441 SdHoareTripleChecker+Valid, 10.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4441 mSDsluCounter, 22588 SdHoareTripleChecker+Invalid, 7.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 25136 mSDsCounter, 109 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 18445 IncrementalHoareTripleChecker+Invalid, 18554 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 109 mSolverCounterUnsat, 3665 mSDtfsCounter, 18445 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2196 GetRequests, 726 SyntacticMatches, 0 SemanticMatches, 1470 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9003 ImplicationChecksByTransitivity, 10.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32601occurred in iteration=77, InterpolantAutomatonStates: 1322, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 21488 NumberOfCodeBlocks, 21488 NumberOfCodeBlocksAsserted, 78 NumberOfCheckSat, 21410 ConstructedInterpolants, 0 QuantifiedInterpolants, 51677 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 78 InterpolantComputations, 78 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown !ENTRY org.eclipse.osgi 4 0 2022-01-19 00:51:54.025 !MESSAGE Application error !STACK 1 org.eclipse.core.internal.resources.ResourceException(/)[568]: java.io.FileNotFoundException: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28f433960/.metadata/.plugins/org.eclipse.core.resources/.root/1.tree (No such file or directory) at java.base/java.io.FileOutputStream.open0(Native Method) at java.base/java.io.FileOutputStream.open(FileOutputStream.java:298) at java.base/java.io.FileOutputStream.(FileOutputStream.java:237) at java.base/java.io.FileOutputStream.(FileOutputStream.java:187) at org.eclipse.core.internal.localstore.SafeFileOutputStream.(SafeFileOutputStream.java:55) at org.eclipse.core.internal.resources.SaveManager.saveTree(SaveManager.java:1381) at org.eclipse.core.internal.resources.SaveManager.save(SaveManager.java:1168) at org.eclipse.core.internal.resources.Workspace.save(Workspace.java:2333) at org.eclipse.core.internal.resources.Workspace.save(Workspace.java:2322) at de.uni_freiburg.informatik.ultimate.core.coreplugin.UltimateCore.start(UltimateCore.java:191) at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203) at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134) at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104) at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401) at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255) at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method) at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62) at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43) at java.base/java.lang.reflect.Method.invoke(Method.java:566) at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:657) at org.eclipse.equinox.launcher.Main.basicRun(Main.java:594) at org.eclipse.equinox.launcher.Main.run(Main.java:1465) at org.eclipse.equinox.launcher.Main.main(Main.java:1438) An error has occurred. See the log file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28f433960/.metadata/.log.