/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe-After.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/bench-exp2x3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bf34d27 [2022-01-19 12:39:45,607 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-19 12:39:45,609 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-19 12:39:45,659 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-19 12:39:45,659 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-19 12:39:45,661 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-19 12:39:45,663 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-19 12:39:45,665 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-19 12:39:45,667 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-19 12:39:45,670 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-19 12:39:45,671 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-19 12:39:45,672 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-19 12:39:45,672 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-19 12:39:45,673 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-19 12:39:45,674 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-19 12:39:45,676 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-19 12:39:45,676 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-19 12:39:45,677 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-19 12:39:45,678 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-19 12:39:45,682 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-19 12:39:45,683 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-19 12:39:45,683 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-19 12:39:45,684 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-19 12:39:45,685 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-19 12:39:45,690 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-19 12:39:45,690 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-19 12:39:45,690 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-19 12:39:45,691 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-19 12:39:45,691 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-19 12:39:45,692 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-19 12:39:45,692 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-19 12:39:45,692 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-19 12:39:45,693 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-19 12:39:45,694 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-19 12:39:45,695 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-19 12:39:45,695 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-19 12:39:45,695 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-19 12:39:45,695 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-19 12:39:45,695 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-19 12:39:45,696 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-19 12:39:45,696 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-19 12:39:45,697 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe-After.epf [2022-01-19 12:39:45,718 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-19 12:39:45,718 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-19 12:39:45,719 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-19 12:39:45,719 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-19 12:39:45,719 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-19 12:39:45,719 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-19 12:39:45,720 INFO L138 SettingsManager]: * Use SBE=true [2022-01-19 12:39:45,720 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-19 12:39:45,720 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-19 12:39:45,720 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-19 12:39:45,721 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-19 12:39:45,721 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-19 12:39:45,721 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-19 12:39:45,721 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-19 12:39:45,721 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-19 12:39:45,721 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-19 12:39:45,721 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-19 12:39:45,721 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-19 12:39:45,722 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-19 12:39:45,722 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-19 12:39:45,722 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-19 12:39:45,722 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-19 12:39:45,722 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-19 12:39:45,722 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 12:39:45,722 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-19 12:39:45,722 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-19 12:39:45,722 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-19 12:39:45,723 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-19 12:39:45,723 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-19 12:39:45,723 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-19 12:39:45,723 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-19 12:39:45,723 INFO L138 SettingsManager]: * When to check the insufficient erros location relative to the other error locations=AFTER [2022-01-19 12:39:45,723 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 12:39:45,926 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-19 12:39:45,952 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-19 12:39:45,954 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-19 12:39:45,955 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-19 12:39:45,956 INFO L275 PluginConnector]: CDTParser initialized [2022-01-19 12:39:45,957 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp2x3.wvr.c [2022-01-19 12:39:46,001 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/804341616/9c7097cae12f490a86a2ec6829fd1a77/FLAG4394c6f58 [2022-01-19 12:39:46,306 INFO L306 CDTParser]: Found 1 translation units. [2022-01-19 12:39:46,306 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x3.wvr.c [2022-01-19 12:39:46,311 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/804341616/9c7097cae12f490a86a2ec6829fd1a77/FLAG4394c6f58 [2022-01-19 12:39:46,728 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/804341616/9c7097cae12f490a86a2ec6829fd1a77 [2022-01-19 12:39:46,730 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-19 12:39:46,731 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-19 12:39:46,747 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-19 12:39:46,747 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-19 12:39:46,759 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-19 12:39:46,760 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 12:39:46" (1/1) ... [2022-01-19 12:39:46,760 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c6a2318 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:39:46, skipping insertion in model container [2022-01-19 12:39:46,760 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 12:39:46" (1/1) ... [2022-01-19 12:39:46,767 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-19 12:39:46,795 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-19 12:39:46,947 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/bench-exp2x3.wvr.c[2237,2250] [2022-01-19 12:39:46,953 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 12:39:46,959 INFO L203 MainTranslator]: Completed pre-run [2022-01-19 12:39:46,997 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/bench-exp2x3.wvr.c[2237,2250] [2022-01-19 12:39:46,998 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 12:39:47,008 INFO L208 MainTranslator]: Completed translation [2022-01-19 12:39:47,008 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:39:47 WrapperNode [2022-01-19 12:39:47,008 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-19 12:39:47,009 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-19 12:39:47,009 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-19 12:39:47,009 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-19 12:39:47,018 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:39:47" (1/1) ... [2022-01-19 12:39:47,031 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:39:47" (1/1) ... [2022-01-19 12:39:47,053 INFO L137 Inliner]: procedures = 20, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 91 [2022-01-19 12:39:47,054 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-19 12:39:47,055 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-19 12:39:47,055 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-19 12:39:47,055 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-19 12:39:47,061 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:39:47" (1/1) ... [2022-01-19 12:39:47,061 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:39:47" (1/1) ... [2022-01-19 12:39:47,066 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:39:47" (1/1) ... [2022-01-19 12:39:47,066 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:39:47" (1/1) ... [2022-01-19 12:39:47,081 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:39:47" (1/1) ... [2022-01-19 12:39:47,084 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:39:47" (1/1) ... [2022-01-19 12:39:47,085 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:39:47" (1/1) ... [2022-01-19 12:39:47,086 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-19 12:39:47,087 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-19 12:39:47,087 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-19 12:39:47,087 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-19 12:39:47,089 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:39:47" (1/1) ... [2022-01-19 12:39:47,094 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 12:39:47,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 12:39:47,146 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 12:39:47,235 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 12:39:47,254 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-19 12:39:47,254 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-01-19 12:39:47,254 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-01-19 12:39:47,255 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-01-19 12:39:47,255 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-01-19 12:39:47,255 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-01-19 12:39:47,255 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-01-19 12:39:47,255 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-01-19 12:39:47,255 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-01-19 12:39:47,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-19 12:39:47,255 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-19 12:39:47,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-19 12:39:47,256 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-19 12:39:47,256 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-19 12:39:47,256 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-19 12:39:47,256 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-19 12:39:47,257 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 12:39:47,350 INFO L234 CfgBuilder]: Building ICFG [2022-01-19 12:39:47,351 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-19 12:39:47,516 INFO L275 CfgBuilder]: Performing block encoding [2022-01-19 12:39:47,521 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-19 12:39:47,521 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-01-19 12:39:47,523 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 12:39:47 BoogieIcfgContainer [2022-01-19 12:39:47,523 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-19 12:39:47,524 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-19 12:39:47,524 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-19 12:39:47,526 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-19 12:39:47,526 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.01 12:39:46" (1/3) ... [2022-01-19 12:39:47,526 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26298efe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 12:39:47, skipping insertion in model container [2022-01-19 12:39:47,526 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 12:39:47" (2/3) ... [2022-01-19 12:39:47,527 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26298efe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 12:39:47, skipping insertion in model container [2022-01-19 12:39:47,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 12:39:47" (3/3) ... [2022-01-19 12:39:47,527 INFO L111 eAbstractionObserver]: Analyzing ICFG bench-exp2x3.wvr.c [2022-01-19 12:39:47,531 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-19 12:39:47,531 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-19 12:39:47,531 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-19 12:39:47,555 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:39:47,556 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:39:47,556 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:39:47,556 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:39:47,557 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:39:47,557 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:39:47,557 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:39:47,557 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:39:47,558 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:39:47,558 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:39:47,558 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:39:47,558 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:39:47,559 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:39:47,559 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:39:47,559 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:39:47,559 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:39:47,561 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:39:47,561 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:39:47,562 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:39:47,562 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:39:47,563 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:39:47,563 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:39:47,564 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:39:47,564 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 12:39:47,568 INFO L148 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-01-19 12:39:47,596 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 12:39:47,600 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 12:39:47,600 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-01-19 12:39:47,607 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 128 places, 125 transitions, 282 flow [2022-01-19 12:39:47,641 INFO L129 PetriNetUnfolder]: 10/121 cut-off events. [2022-01-19 12:39:47,641 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-01-19 12:39:47,644 INFO L84 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 121 events. 10/121 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 53 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 84. Up to 2 conditions per place. [2022-01-19 12:39:47,644 INFO L82 GeneralOperation]: Start removeDead. Operand has 128 places, 125 transitions, 282 flow [2022-01-19 12:39:47,647 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 108 transitions, 240 flow [2022-01-19 12:39:47,665 INFO L129 PetriNetUnfolder]: 10/107 cut-off events. [2022-01-19 12:39:47,665 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-01-19 12:39:47,665 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 12:39:47,666 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] [2022-01-19 12:39:47,666 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-19 12:39:47,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 12:39:47,670 INFO L85 PathProgramCache]: Analyzing trace with hash -121838707, now seen corresponding path program 1 times [2022-01-19 12:39:47,675 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 12:39:47,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112964239] [2022-01-19 12:39:47,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 12:39:47,676 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 12:39:47,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 12:39:47,823 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 12:39:47,824 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 12:39:47,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112964239] [2022-01-19 12:39:47,824 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112964239] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 12:39:47,824 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 12:39:47,825 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-19 12:39:47,826 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861576278] [2022-01-19 12:39:47,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 12:39:47,834 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-19 12:39:47,834 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 12:39:47,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-19 12:39:47,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-19 12:39:47,866 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 125 [2022-01-19 12:39:47,871 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 108 transitions, 240 flow. Second operand has 2 states, 2 states have (on average 115.0) internal successors, (230), 2 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 12:39:47,871 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 12:39:47,871 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 125 [2022-01-19 12:39:47,872 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 12:39:47,945 INFO L129 PetriNetUnfolder]: 4/102 cut-off events. [2022-01-19 12:39:47,945 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-01-19 12:39:47,946 INFO L84 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 102 events. 4/102 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 40 event pairs, 0 based on Foata normal form. 18/114 useless extension candidates. Maximal degree in co-relation 83. Up to 9 conditions per place. [2022-01-19 12:39:47,963 INFO L132 encePairwiseOnDemand]: 119/125 looper letters, 8 selfloop transitions, 0 changer transitions 2/102 dead transitions. [2022-01-19 12:39:47,963 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 102 transitions, 244 flow [2022-01-19 12:39:47,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-19 12:39:47,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-01-19 12:39:47,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 234 transitions. [2022-01-19 12:39:47,974 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.936 [2022-01-19 12:39:47,975 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 234 transitions. [2022-01-19 12:39:47,975 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 234 transitions. [2022-01-19 12:39:47,976 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 12:39:47,978 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 234 transitions. [2022-01-19 12:39:47,980 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 117.0) internal successors, (234), 2 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 12:39:47,984 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 12:39:47,984 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 12:39:47,985 INFO L186 Difference]: Start difference. First operand has 111 places, 108 transitions, 240 flow. Second operand 2 states and 234 transitions. [2022-01-19 12:39:47,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 102 transitions, 244 flow [2022-01-19 12:39:47,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 102 transitions, 228 flow, removed 0 selfloop flow, removed 8 redundant places. [2022-01-19 12:39:47,991 INFO L242 Difference]: Finished difference. Result has 104 places, 100 transitions, 208 flow [2022-01-19 12:39:47,994 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=208, PETRI_PLACES=104, PETRI_TRANSITIONS=100} [2022-01-19 12:39:47,997 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, -7 predicate places. [2022-01-19 12:39:47,997 INFO L470 AbstractCegarLoop]: Abstraction has has 104 places, 100 transitions, 208 flow [2022-01-19 12:39:47,997 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 115.0) internal successors, (230), 2 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 12:39:47,998 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 12:39:47,999 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 12:39:47,999 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-19 12:39:48,002 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-19 12:39:48,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 12:39:48,009 INFO L85 PathProgramCache]: Analyzing trace with hash 560355165, now seen corresponding path program 1 times [2022-01-19 12:39:48,009 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 12:39:48,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7656516] [2022-01-19 12:39:48,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 12:39:48,009 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 12:39:48,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 12:39:48,376 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 12:39:48,377 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 12:39:48,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7656516] [2022-01-19 12:39:48,377 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7656516] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 12:39:48,377 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 12:39:48,377 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 12:39:48,378 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880817544] [2022-01-19 12:39:48,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 12:39:48,380 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 12:39:48,380 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 12:39:48,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 12:39:48,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-01-19 12:39:48,383 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 125 [2022-01-19 12:39:48,383 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 100 transitions, 208 flow. Second operand has 7 states, 7 states have (on average 84.0) internal successors, (588), 7 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 12:39:48,383 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 12:39:48,383 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 125 [2022-01-19 12:39:48,384 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 12:39:48,705 INFO L129 PetriNetUnfolder]: 895/1602 cut-off events. [2022-01-19 12:39:48,705 INFO L130 PetriNetUnfolder]: For 80/135 co-relation queries the response was YES. [2022-01-19 12:39:48,710 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2918 conditions, 1602 events. 895/1602 cut-off events. For 80/135 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 7810 event pairs, 272 based on Foata normal form. 2/1156 useless extension candidates. Maximal degree in co-relation 2915. Up to 796 conditions per place. [2022-01-19 12:39:48,718 INFO L132 encePairwiseOnDemand]: 115/125 looper letters, 47 selfloop transitions, 7 changer transitions 4/122 dead transitions. [2022-01-19 12:39:48,719 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 122 transitions, 375 flow [2022-01-19 12:39:48,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 12:39:48,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 12:39:48,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 619 transitions. [2022-01-19 12:39:48,724 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7074285714285714 [2022-01-19 12:39:48,724 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 619 transitions. [2022-01-19 12:39:48,724 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 619 transitions. [2022-01-19 12:39:48,726 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 12:39:48,726 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 619 transitions. [2022-01-19 12:39:48,728 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 88.42857142857143) internal successors, (619), 7 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 12:39:48,730 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 125.0) internal successors, (1000), 8 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 12:39:48,731 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 125.0) internal successors, (1000), 8 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 12:39:48,731 INFO L186 Difference]: Start difference. First operand has 104 places, 100 transitions, 208 flow. Second operand 7 states and 619 transitions. [2022-01-19 12:39:48,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 122 transitions, 375 flow [2022-01-19 12:39:48,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 122 transitions, 375 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-01-19 12:39:48,735 INFO L242 Difference]: Finished difference. Result has 111 places, 104 transitions, 249 flow [2022-01-19 12:39:48,735 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=249, PETRI_PLACES=111, PETRI_TRANSITIONS=104} [2022-01-19 12:39:48,736 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 0 predicate places. [2022-01-19 12:39:48,736 INFO L470 AbstractCegarLoop]: Abstraction has has 111 places, 104 transitions, 249 flow [2022-01-19 12:39:48,736 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 84.0) internal successors, (588), 7 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 12:39:48,736 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 12:39:48,737 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] [2022-01-19 12:39:48,737 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-19 12:39:48,737 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-19 12:39:48,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 12:39:48,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1307809793, now seen corresponding path program 1 times [2022-01-19 12:39:48,738 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 12:39:48,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001521933] [2022-01-19 12:39:48,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 12:39:48,738 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 12:39:48,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 12:39:48,906 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 12:39:48,906 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 12:39:48,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001521933] [2022-01-19 12:39:48,906 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001521933] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 12:39:48,906 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 12:39:48,906 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 12:39:48,907 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118063184] [2022-01-19 12:39:48,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 12:39:48,907 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 12:39:48,907 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 12:39:48,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 12:39:48,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-19 12:39:48,908 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 125 [2022-01-19 12:39:48,909 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 104 transitions, 249 flow. Second operand has 6 states, 6 states have (on average 88.66666666666667) internal successors, (532), 6 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 12:39:48,909 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 12:39:48,909 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 125 [2022-01-19 12:39:48,909 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 12:39:49,254 INFO L129 PetriNetUnfolder]: 1373/2607 cut-off events. [2022-01-19 12:39:49,254 INFO L130 PetriNetUnfolder]: For 392/412 co-relation queries the response was YES. [2022-01-19 12:39:49,261 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5134 conditions, 2607 events. 1373/2607 cut-off events. For 392/412 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 15742 event pairs, 505 based on Foata normal form. 0/1875 useless extension candidates. Maximal degree in co-relation 5127. Up to 542 conditions per place. [2022-01-19 12:39:49,273 INFO L132 encePairwiseOnDemand]: 114/125 looper letters, 70 selfloop transitions, 14 changer transitions 0/154 dead transitions. [2022-01-19 12:39:49,273 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 154 transitions, 552 flow [2022-01-19 12:39:49,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 12:39:49,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 12:39:49,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 672 transitions. [2022-01-19 12:39:49,275 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.768 [2022-01-19 12:39:49,275 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 672 transitions. [2022-01-19 12:39:49,275 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 672 transitions. [2022-01-19 12:39:49,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 12:39:49,276 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 672 transitions. [2022-01-19 12:39:49,277 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 96.0) internal successors, (672), 7 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 12:39:49,278 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 125.0) internal successors, (1000), 8 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 12:39:49,278 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 125.0) internal successors, (1000), 8 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 12:39:49,278 INFO L186 Difference]: Start difference. First operand has 111 places, 104 transitions, 249 flow. Second operand 7 states and 672 transitions. [2022-01-19 12:39:49,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 154 transitions, 552 flow [2022-01-19 12:39:49,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 154 transitions, 531 flow, removed 6 selfloop flow, removed 5 redundant places. [2022-01-19 12:39:49,284 INFO L242 Difference]: Finished difference. Result has 114 places, 110 transitions, 318 flow [2022-01-19 12:39:49,285 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=318, PETRI_PLACES=114, PETRI_TRANSITIONS=110} [2022-01-19 12:39:49,286 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 3 predicate places. [2022-01-19 12:39:49,286 INFO L470 AbstractCegarLoop]: Abstraction has has 114 places, 110 transitions, 318 flow [2022-01-19 12:39:49,286 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 88.66666666666667) internal successors, (532), 6 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 12:39:49,287 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 12:39:49,287 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] [2022-01-19 12:39:49,287 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-19 12:39:49,287 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-19 12:39:49,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 12:39:49,289 INFO L85 PathProgramCache]: Analyzing trace with hash 2113143597, now seen corresponding path program 2 times [2022-01-19 12:39:49,289 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 12:39:49,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223089348] [2022-01-19 12:39:49,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 12:39:49,289 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 12:39:49,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 12:39:49,468 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 12:39:49,468 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 12:39:49,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223089348] [2022-01-19 12:39:49,468 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223089348] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 12:39:49,468 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 12:39:49,468 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 12:39:49,469 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112626765] [2022-01-19 12:39:49,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 12:39:49,469 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 12:39:49,469 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 12:39:49,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 12:39:49,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-01-19 12:39:49,470 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 125 [2022-01-19 12:39:49,471 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 110 transitions, 318 flow. Second operand has 6 states, 6 states have (on average 83.33333333333333) internal successors, (500), 6 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 12:39:49,471 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 12:39:49,471 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 125 [2022-01-19 12:39:49,471 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 12:39:49,778 INFO L129 PetriNetUnfolder]: 1489/2668 cut-off events. [2022-01-19 12:39:49,778 INFO L130 PetriNetUnfolder]: For 2290/2290 co-relation queries the response was YES. [2022-01-19 12:39:49,783 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6864 conditions, 2668 events. 1489/2668 cut-off events. For 2290/2290 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 14987 event pairs, 322 based on Foata normal form. 35/2191 useless extension candidates. Maximal degree in co-relation 6856. Up to 1708 conditions per place. [2022-01-19 12:39:49,795 INFO L132 encePairwiseOnDemand]: 114/125 looper letters, 64 selfloop transitions, 12 changer transitions 1/139 dead transitions. [2022-01-19 12:39:49,795 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 139 transitions, 576 flow [2022-01-19 12:39:49,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-19 12:39:49,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-01-19 12:39:49,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 539 transitions. [2022-01-19 12:39:49,796 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7186666666666667 [2022-01-19 12:39:49,796 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 539 transitions. [2022-01-19 12:39:49,796 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 539 transitions. [2022-01-19 12:39:49,797 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 12:39:49,797 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 539 transitions. [2022-01-19 12:39:49,798 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 89.83333333333333) internal successors, (539), 6 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 12:39:49,799 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 125.0) internal successors, (875), 7 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 12:39:49,800 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 125.0) internal successors, (875), 7 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 12:39:49,800 INFO L186 Difference]: Start difference. First operand has 114 places, 110 transitions, 318 flow. Second operand 6 states and 539 transitions. [2022-01-19 12:39:49,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 139 transitions, 576 flow [2022-01-19 12:39:49,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 139 transitions, 572 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-01-19 12:39:49,808 INFO L242 Difference]: Finished difference. Result has 119 places, 115 transitions, 384 flow [2022-01-19 12:39:49,808 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=314, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=384, PETRI_PLACES=119, PETRI_TRANSITIONS=115} [2022-01-19 12:39:49,809 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 8 predicate places. [2022-01-19 12:39:49,809 INFO L470 AbstractCegarLoop]: Abstraction has has 119 places, 115 transitions, 384 flow [2022-01-19 12:39:49,809 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 83.33333333333333) internal successors, (500), 6 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 12:39:49,809 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 12:39:49,809 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] [2022-01-19 12:39:49,809 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-19 12:39:49,810 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-19 12:39:49,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 12:39:49,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1971798559, now seen corresponding path program 1 times [2022-01-19 12:39:49,810 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 12:39:49,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171856641] [2022-01-19 12:39:49,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 12:39:49,811 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 12:39:49,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 12:39:50,036 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 12:39:50,037 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 12:39:50,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171856641] [2022-01-19 12:39:50,037 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171856641] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 12:39:50,037 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 12:39:50,037 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 12:39:50,037 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692799792] [2022-01-19 12:39:50,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 12:39:50,038 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 12:39:50,038 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 12:39:50,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 12:39:50,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-01-19 12:39:50,039 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 125 [2022-01-19 12:39:50,040 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 115 transitions, 384 flow. Second operand has 6 states, 6 states have (on average 83.33333333333333) internal successors, (500), 6 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 12:39:50,040 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 12:39:50,040 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 125 [2022-01-19 12:39:50,040 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 12:39:50,410 INFO L129 PetriNetUnfolder]: 1464/2715 cut-off events. [2022-01-19 12:39:50,410 INFO L130 PetriNetUnfolder]: For 3938/4007 co-relation queries the response was YES. [2022-01-19 12:39:50,415 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7544 conditions, 2715 events. 1464/2715 cut-off events. For 3938/4007 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 15956 event pairs, 475 based on Foata normal form. 1/2224 useless extension candidates. Maximal degree in co-relation 7533. Up to 1708 conditions per place. [2022-01-19 12:39:50,434 INFO L132 encePairwiseOnDemand]: 114/125 looper letters, 70 selfloop transitions, 19 changer transitions 1/152 dead transitions. [2022-01-19 12:39:50,434 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 152 transitions, 765 flow [2022-01-19 12:39:50,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-19 12:39:50,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-01-19 12:39:50,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 540 transitions. [2022-01-19 12:39:50,436 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.72 [2022-01-19 12:39:50,436 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 540 transitions. [2022-01-19 12:39:50,436 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 540 transitions. [2022-01-19 12:39:50,436 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 12:39:50,437 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 540 transitions. [2022-01-19 12:39:50,438 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 90.0) internal successors, (540), 6 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 12:39:50,439 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 125.0) internal successors, (875), 7 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 12:39:50,439 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 125.0) internal successors, (875), 7 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 12:39:50,439 INFO L186 Difference]: Start difference. First operand has 119 places, 115 transitions, 384 flow. Second operand 6 states and 540 transitions. [2022-01-19 12:39:50,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 152 transitions, 765 flow [2022-01-19 12:39:50,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 152 transitions, 723 flow, removed 4 selfloop flow, removed 4 redundant places. [2022-01-19 12:39:50,447 INFO L242 Difference]: Finished difference. Result has 122 places, 124 transitions, 476 flow [2022-01-19 12:39:50,447 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=476, PETRI_PLACES=122, PETRI_TRANSITIONS=124} [2022-01-19 12:39:50,449 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 11 predicate places. [2022-01-19 12:39:50,449 INFO L470 AbstractCegarLoop]: Abstraction has has 122 places, 124 transitions, 476 flow [2022-01-19 12:39:50,450 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 83.33333333333333) internal successors, (500), 6 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 12:39:50,450 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 12:39:50,450 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] [2022-01-19 12:39:50,450 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-19 12:39:50,450 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-19 12:39:50,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 12:39:50,451 INFO L85 PathProgramCache]: Analyzing trace with hash 760466257, now seen corresponding path program 1 times [2022-01-19 12:39:50,451 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 12:39:50,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384155398] [2022-01-19 12:39:50,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 12:39:50,451 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 12:39:50,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 12:39:50,637 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 12:39:50,637 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 12:39:50,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384155398] [2022-01-19 12:39:50,637 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384155398] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 12:39:50,637 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 12:39:50,637 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 12:39:50,638 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101684570] [2022-01-19 12:39:50,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 12:39:50,638 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 12:39:50,638 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 12:39:50,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 12:39:50,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-01-19 12:39:50,639 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 125 [2022-01-19 12:39:50,640 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 124 transitions, 476 flow. Second operand has 6 states, 6 states have (on average 83.33333333333333) internal successors, (500), 6 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 12:39:50,640 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 12:39:50,640 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 125 [2022-01-19 12:39:50,640 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 12:39:50,932 INFO L129 PetriNetUnfolder]: 1403/2671 cut-off events. [2022-01-19 12:39:50,932 INFO L130 PetriNetUnfolder]: For 3760/3827 co-relation queries the response was YES. [2022-01-19 12:39:50,937 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7957 conditions, 2671 events. 1403/2671 cut-off events. For 3760/3827 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 16153 event pairs, 417 based on Foata normal form. 13/2526 useless extension candidates. Maximal degree in co-relation 7944. Up to 1673 conditions per place. [2022-01-19 12:39:50,948 INFO L132 encePairwiseOnDemand]: 115/125 looper letters, 68 selfloop transitions, 21 changer transitions 1/152 dead transitions. [2022-01-19 12:39:50,948 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 152 transitions, 778 flow [2022-01-19 12:39:50,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-19 12:39:50,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-01-19 12:39:50,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 537 transitions. [2022-01-19 12:39:50,950 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.716 [2022-01-19 12:39:50,950 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 537 transitions. [2022-01-19 12:39:50,950 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 537 transitions. [2022-01-19 12:39:50,950 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 12:39:50,950 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 537 transitions. [2022-01-19 12:39:50,952 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 89.5) internal successors, (537), 6 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 12:39:50,953 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 125.0) internal successors, (875), 7 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 12:39:50,953 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 125.0) internal successors, (875), 7 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 12:39:50,953 INFO L186 Difference]: Start difference. First operand has 122 places, 124 transitions, 476 flow. Second operand 6 states and 537 transitions. [2022-01-19 12:39:50,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 152 transitions, 778 flow [2022-01-19 12:39:50,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 152 transitions, 757 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-01-19 12:39:50,959 INFO L242 Difference]: Finished difference. Result has 126 places, 128 transitions, 548 flow [2022-01-19 12:39:50,959 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=435, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=548, PETRI_PLACES=126, PETRI_TRANSITIONS=128} [2022-01-19 12:39:50,961 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 15 predicate places. [2022-01-19 12:39:50,962 INFO L470 AbstractCegarLoop]: Abstraction has has 126 places, 128 transitions, 548 flow [2022-01-19 12:39:50,962 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 83.33333333333333) internal successors, (500), 6 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 12:39:50,963 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 12:39:50,963 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] [2022-01-19 12:39:50,963 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-19 12:39:50,963 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-19 12:39:50,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 12:39:50,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1466145333, now seen corresponding path program 1 times [2022-01-19 12:39:50,964 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 12:39:50,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253588229] [2022-01-19 12:39:50,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 12:39:50,964 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 12:39:50,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 12:39:51,117 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 12:39:51,117 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 12:39:51,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253588229] [2022-01-19 12:39:51,117 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253588229] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 12:39:51,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1020426939] [2022-01-19 12:39:51,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 12:39:51,117 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 12:39:51,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 12:39:51,119 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 12:39:51,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-19 12:39:51,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 12:39:51,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 7 conjunts are in the unsatisfiable core [2022-01-19 12:39:51,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 12:39:51,555 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 12:39:51,556 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 12:39:51,823 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 12:39:51,823 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1020426939] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 12:39:51,823 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 12:39:51,824 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2022-01-19 12:39:51,824 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671207347] [2022-01-19 12:39:51,824 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 12:39:51,824 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-19 12:39:51,824 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 12:39:51,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-19 12:39:51,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-01-19 12:39:51,826 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 125 [2022-01-19 12:39:51,827 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 128 transitions, 548 flow. Second operand has 14 states, 14 states have (on average 82.5) internal successors, (1155), 14 states have internal predecessors, (1155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 12:39:51,827 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 12:39:51,827 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 125 [2022-01-19 12:39:51,827 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 12:39:52,594 INFO L129 PetriNetUnfolder]: 2685/4833 cut-off events. [2022-01-19 12:39:52,595 INFO L130 PetriNetUnfolder]: For 7692/7803 co-relation queries the response was YES. [2022-01-19 12:39:52,606 INFO L84 FinitePrefix]: Finished finitePrefix Result has 14636 conditions, 4833 events. 2685/4833 cut-off events. For 7692/7803 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 31694 event pairs, 362 based on Foata normal form. 170/4828 useless extension candidates. Maximal degree in co-relation 14621. Up to 1149 conditions per place. [2022-01-19 12:39:52,627 INFO L132 encePairwiseOnDemand]: 110/125 looper letters, 171 selfloop transitions, 32 changer transitions 2/267 dead transitions. [2022-01-19 12:39:52,627 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 267 transitions, 1690 flow [2022-01-19 12:39:52,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-19 12:39:52,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-01-19 12:39:52,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1251 transitions. [2022-01-19 12:39:52,630 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7148571428571429 [2022-01-19 12:39:52,630 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1251 transitions. [2022-01-19 12:39:52,630 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1251 transitions. [2022-01-19 12:39:52,630 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 12:39:52,630 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1251 transitions. [2022-01-19 12:39:52,632 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 89.35714285714286) internal successors, (1251), 14 states have internal predecessors, (1251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 12:39:52,634 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 125.0) internal successors, (1875), 15 states have internal predecessors, (1875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 12:39:52,634 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 125.0) internal successors, (1875), 15 states have internal predecessors, (1875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 12:39:52,634 INFO L186 Difference]: Start difference. First operand has 126 places, 128 transitions, 548 flow. Second operand 14 states and 1251 transitions. [2022-01-19 12:39:52,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 267 transitions, 1690 flow [2022-01-19 12:39:52,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 267 transitions, 1653 flow, removed 10 selfloop flow, removed 3 redundant places. [2022-01-19 12:39:52,644 INFO L242 Difference]: Finished difference. Result has 145 places, 138 transitions, 699 flow [2022-01-19 12:39:52,644 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=469, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=699, PETRI_PLACES=145, PETRI_TRANSITIONS=138} [2022-01-19 12:39:52,645 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 34 predicate places. [2022-01-19 12:39:52,645 INFO L470 AbstractCegarLoop]: Abstraction has has 145 places, 138 transitions, 699 flow [2022-01-19 12:39:52,645 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 82.5) internal successors, (1155), 14 states have internal predecessors, (1155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 12:39:52,646 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 12:39:52,646 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] [2022-01-19 12:39:52,680 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-19 12:39:52,863 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 12:39:52,864 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-19 12:39:52,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 12:39:52,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1425051441, now seen corresponding path program 2 times [2022-01-19 12:39:52,864 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 12:39:52,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33598815] [2022-01-19 12:39:52,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 12:39:52,864 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 12:39:52,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 12:39:52,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 12:39:52,941 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 12:39:52,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33598815] [2022-01-19 12:39:52,942 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33598815] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 12:39:52,942 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 12:39:52,942 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 12:39:52,942 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833072023] [2022-01-19 12:39:52,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 12:39:52,942 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 12:39:52,942 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 12:39:52,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 12:39:52,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-19 12:39:52,943 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 125 [2022-01-19 12:39:52,944 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 138 transitions, 699 flow. Second operand has 6 states, 6 states have (on average 88.66666666666667) internal successors, (532), 6 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 12:39:52,944 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 12:39:52,944 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 125 [2022-01-19 12:39:52,944 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 12:39:53,382 INFO L129 PetriNetUnfolder]: 2785/5234 cut-off events. [2022-01-19 12:39:53,382 INFO L130 PetriNetUnfolder]: For 13554/13634 co-relation queries the response was YES. [2022-01-19 12:39:53,400 INFO L84 FinitePrefix]: Finished finitePrefix Result has 19198 conditions, 5234 events. 2785/5234 cut-off events. For 13554/13634 co-relation queries the response was YES. Maximal size of possible extension queue 364. Compared 36975 event pairs, 388 based on Foata normal form. 141/5158 useless extension candidates. Maximal degree in co-relation 19175. Up to 1693 conditions per place. [2022-01-19 12:39:53,423 INFO L132 encePairwiseOnDemand]: 114/125 looper letters, 98 selfloop transitions, 21 changer transitions 0/195 dead transitions. [2022-01-19 12:39:53,423 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 195 transitions, 1275 flow [2022-01-19 12:39:53,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 12:39:53,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 12:39:53,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 668 transitions. [2022-01-19 12:39:53,425 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7634285714285715 [2022-01-19 12:39:53,425 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 668 transitions. [2022-01-19 12:39:53,425 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 668 transitions. [2022-01-19 12:39:53,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 12:39:53,425 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 668 transitions. [2022-01-19 12:39:53,426 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 95.42857142857143) internal successors, (668), 7 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 12:39:53,427 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 125.0) internal successors, (1000), 8 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 12:39:53,428 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 125.0) internal successors, (1000), 8 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 12:39:53,428 INFO L186 Difference]: Start difference. First operand has 145 places, 138 transitions, 699 flow. Second operand 7 states and 668 transitions. [2022-01-19 12:39:53,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 195 transitions, 1275 flow [2022-01-19 12:39:53,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 195 transitions, 1261 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-01-19 12:39:53,454 INFO L242 Difference]: Finished difference. Result has 151 places, 141 transitions, 792 flow [2022-01-19 12:39:53,454 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=685, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=792, PETRI_PLACES=151, PETRI_TRANSITIONS=141} [2022-01-19 12:39:53,454 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 40 predicate places. [2022-01-19 12:39:53,454 INFO L470 AbstractCegarLoop]: Abstraction has has 151 places, 141 transitions, 792 flow [2022-01-19 12:39:53,455 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 88.66666666666667) internal successors, (532), 6 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 12:39:53,455 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 12:39:53,455 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] [2022-01-19 12:39:53,455 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-19 12:39:53,455 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-19 12:39:53,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 12:39:53,455 INFO L85 PathProgramCache]: Analyzing trace with hash -655880267, now seen corresponding path program 2 times [2022-01-19 12:39:53,455 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 12:39:53,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324618826] [2022-01-19 12:39:53,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 12:39:53,456 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 12:39:53,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 12:39:53,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 12:39:53,589 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 12:39:53,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324618826] [2022-01-19 12:39:53,589 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324618826] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 12:39:53,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [128542011] [2022-01-19 12:39:53,589 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 12:39:53,590 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 12:39:53,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 12:39:53,590 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 12:39:53,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-19 12:39:53,678 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 12:39:53,679 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 12:39:53,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 7 conjunts are in the unsatisfiable core [2022-01-19 12:39:53,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 12:39:53,929 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 12:39:53,930 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 12:39:54,144 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 12:39:54,145 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [128542011] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 12:39:54,145 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 12:39:54,145 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2022-01-19 12:39:54,145 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466661122] [2022-01-19 12:39:54,145 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 12:39:54,146 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-19 12:39:54,146 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 12:39:54,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-19 12:39:54,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-01-19 12:39:54,147 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 125 [2022-01-19 12:39:54,148 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 141 transitions, 792 flow. Second operand has 14 states, 14 states have (on average 81.85714285714286) internal successors, (1146), 14 states have internal predecessors, (1146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 12:39:54,148 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 12:39:54,148 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 125 [2022-01-19 12:39:54,148 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 12:39:55,287 INFO L129 PetriNetUnfolder]: 4341/7678 cut-off events. [2022-01-19 12:39:55,288 INFO L130 PetriNetUnfolder]: For 29767/29842 co-relation queries the response was YES. [2022-01-19 12:39:55,315 INFO L84 FinitePrefix]: Finished finitePrefix Result has 31790 conditions, 7678 events. 4341/7678 cut-off events. For 29767/29842 co-relation queries the response was YES. Maximal size of possible extension queue 487. Compared 54910 event pairs, 1161 based on Foata normal form. 150/7599 useless extension candidates. Maximal degree in co-relation 31764. Up to 2702 conditions per place. [2022-01-19 12:39:55,432 INFO L132 encePairwiseOnDemand]: 110/125 looper letters, 223 selfloop transitions, 32 changer transitions 2/319 dead transitions. [2022-01-19 12:39:55,432 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 319 transitions, 2721 flow [2022-01-19 12:39:55,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-19 12:39:55,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-01-19 12:39:55,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1247 transitions. [2022-01-19 12:39:55,445 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7125714285714285 [2022-01-19 12:39:55,445 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1247 transitions. [2022-01-19 12:39:55,445 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1247 transitions. [2022-01-19 12:39:55,446 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 12:39:55,446 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1247 transitions. [2022-01-19 12:39:55,448 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 89.07142857142857) internal successors, (1247), 14 states have internal predecessors, (1247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 12:39:55,449 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 125.0) internal successors, (1875), 15 states have internal predecessors, (1875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 12:39:55,450 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 125.0) internal successors, (1875), 15 states have internal predecessors, (1875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 12:39:55,450 INFO L186 Difference]: Start difference. First operand has 151 places, 141 transitions, 792 flow. Second operand 14 states and 1247 transitions. [2022-01-19 12:39:55,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 319 transitions, 2721 flow [2022-01-19 12:39:55,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 319 transitions, 2644 flow, removed 28 selfloop flow, removed 3 redundant places. [2022-01-19 12:39:55,577 INFO L242 Difference]: Finished difference. Result has 168 places, 150 transitions, 950 flow [2022-01-19 12:39:55,577 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=773, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=950, PETRI_PLACES=168, PETRI_TRANSITIONS=150} [2022-01-19 12:39:55,577 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 57 predicate places. [2022-01-19 12:39:55,577 INFO L470 AbstractCegarLoop]: Abstraction has has 168 places, 150 transitions, 950 flow [2022-01-19 12:39:55,578 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 81.85714285714286) internal successors, (1146), 14 states have internal predecessors, (1146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 12:39:55,578 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 12:39:55,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] [2022-01-19 12:39:55,597 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-19 12:39:55,794 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-01-19 12:39:55,794 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-19 12:39:55,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 12:39:55,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1429212971, now seen corresponding path program 1 times [2022-01-19 12:39:55,794 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 12:39:55,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737834592] [2022-01-19 12:39:55,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 12:39:55,795 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 12:39:55,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 12:39:56,276 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 12:39:56,276 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 12:39:56,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737834592] [2022-01-19 12:39:56,276 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737834592] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 12:39:56,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2111689100] [2022-01-19 12:39:56,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 12:39:56,277 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 12:39:56,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 12:39:56,292 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 12:39:56,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-19 12:39:56,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 12:39:56,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 17 conjunts are in the unsatisfiable core [2022-01-19 12:39:56,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 12:40:18,393 INFO L884 QuantifierPusher]: Run 10 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2022-01-19 12:40:19,810 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 12:40:19,810 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 12:40:41,468 INFO L884 QuantifierPusher]: Run 10 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2022-01-19 12:40:42,067 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 12:40:42,067 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2111689100] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 12:40:42,068 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 12:40:42,068 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 27 [2022-01-19 12:40:42,068 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562965678] [2022-01-19 12:40:42,068 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 12:40:42,068 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-19 12:40:42,068 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 12:40:42,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-19 12:40:42,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=545, Unknown=11, NotChecked=0, Total=702 [2022-01-19 12:40:42,070 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 125 [2022-01-19 12:40:42,071 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 150 transitions, 950 flow. Second operand has 27 states, 27 states have (on average 80.5925925925926) internal successors, (2176), 27 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 12:40:42,071 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 12:40:42,072 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 125 [2022-01-19 12:40:42,072 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 12:40:45,074 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:40:47,514 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:40:56,178 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:40:58,846 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:41:00,289 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:41:02,298 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:41:51,336 WARN L228 SmtUtils]: Spent 38.83s on a formula simplification. DAG size of input: 74 DAG size of output: 22 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 12:41:52,464 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:41:58,460 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:42:00,952 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:42:03,056 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:42:05,552 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:42:08,004 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:42:09,452 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:42:11,087 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:42:13,354 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:42:15,379 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:42:17,827 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:42:19,843 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:42:21,852 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:42:25,147 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:42:37,384 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:43:00,776 WARN L228 SmtUtils]: Spent 10.08s on a formula simplification. DAG size of input: 82 DAG size of output: 79 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 12:43:03,045 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:43:16,479 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:43:21,860 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:43:43,676 WARN L228 SmtUtils]: Spent 19.49s on a formula simplification. DAG size of input: 79 DAG size of output: 76 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 12:43:46,409 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:44:10,922 WARN L228 SmtUtils]: Spent 16.99s on a formula simplification. DAG size of input: 92 DAG size of output: 81 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 12:44:32,546 WARN L228 SmtUtils]: Spent 20.08s on a formula simplification. DAG size of input: 84 DAG size of output: 81 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 12:44:40,267 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:44:47,031 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:44:52,650 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:44:54,098 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:44:56,060 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:45:19,759 WARN L228 SmtUtils]: Spent 17.55s on a formula simplification. DAG size of input: 70 DAG size of output: 65 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 12:45:30,224 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:45:32,254 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:46:01,104 WARN L228 SmtUtils]: Spent 26.33s on a formula simplification. DAG size of input: 94 DAG size of output: 83 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 12:46:03,151 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:46:06,329 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:46:08,339 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:46:10,381 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:46:12,596 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:46:15,007 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:46:17,003 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:46:26,987 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:46:29,013 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:46:43,163 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:46:46,081 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:46:48,248 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:46:50,535 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:46:52,561 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:46:53,724 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:46:57,052 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:46:58,584 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:47:00,605 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:47:03,289 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:47:05,317 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:47:07,326 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:47:12,268 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:47:20,160 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:47:50,647 WARN L228 SmtUtils]: Spent 22.86s on a formula simplification. DAG size of input: 71 DAG size of output: 34 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 12:47:53,019 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:48:00,909 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:48:02,345 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:48:04,382 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:48:26,370 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:48:28,822 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:48:39,627 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:48:42,225 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:48:48,098 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:48:49,326 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:48:50,595 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:48:52,644 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:48:53,735 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:48:55,092 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:48:57,776 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:49:00,265 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:49:02,646 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:49:07,263 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:49:10,005 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:49:12,246 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:49:14,594 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:49:18,640 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:49:22,280 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:49:23,596 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:49:26,469 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:49:28,841 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:49:30,861 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:49:32,872 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:49:34,890 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:49:37,592 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:49:40,666 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:49:42,677 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:49:46,353 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:49:48,916 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:49:50,926 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:49:52,933 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:49:55,298 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:49:57,314 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:49:59,327 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:50:06,450 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:50:08,581 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:50:11,981 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:50:18,271 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:50:22,533 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:50:25,391 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:50:27,456 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:50:30,215 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:50:32,251 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:50:34,805 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:50:47,308 WARN L228 SmtUtils]: Spent 6.21s on a formula simplification. DAG size of input: 68 DAG size of output: 47 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 12:51:05,628 INFO L129 PetriNetUnfolder]: 13726/24675 cut-off events. [2022-01-19 12:51:05,628 INFO L130 PetriNetUnfolder]: For 117818/118093 co-relation queries the response was YES. [2022-01-19 12:51:05,754 INFO L84 FinitePrefix]: Finished finitePrefix Result has 108280 conditions, 24675 events. 13726/24675 cut-off events. For 117818/118093 co-relation queries the response was YES. Maximal size of possible extension queue 1451. Compared 216603 event pairs, 1287 based on Foata normal form. 66/24127 useless extension candidates. Maximal degree in co-relation 108247. Up to 8654 conditions per place. [2022-01-19 12:51:05,966 INFO L132 encePairwiseOnDemand]: 102/125 looper letters, 631 selfloop transitions, 357 changer transitions 20/1070 dead transitions. [2022-01-19 12:51:05,966 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 1070 transitions, 10402 flow [2022-01-19 12:51:05,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-01-19 12:51:05,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2022-01-19 12:51:05,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 5820 transitions. [2022-01-19 12:51:05,976 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7163076923076923 [2022-01-19 12:51:05,976 INFO L72 ComplementDD]: Start complementDD. Operand 65 states and 5820 transitions. [2022-01-19 12:51:05,976 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 5820 transitions. [2022-01-19 12:51:05,978 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 12:51:05,979 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 65 states and 5820 transitions. [2022-01-19 12:51:05,988 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 66 states, 65 states have (on average 89.53846153846153) internal successors, (5820), 65 states have internal predecessors, (5820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 12:51:05,997 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 66 states, 66 states have (on average 125.0) internal successors, (8250), 66 states have internal predecessors, (8250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 12:51:05,998 INFO L81 ComplementDD]: Finished complementDD. Result has 66 states, 66 states have (on average 125.0) internal successors, (8250), 66 states have internal predecessors, (8250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 12:51:05,998 INFO L186 Difference]: Start difference. First operand has 168 places, 150 transitions, 950 flow. Second operand 65 states and 5820 transitions. [2022-01-19 12:51:05,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 1070 transitions, 10402 flow [2022-01-19 12:51:06,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 1070 transitions, 10217 flow, removed 70 selfloop flow, removed 7 redundant places. [2022-01-19 12:51:06,359 INFO L242 Difference]: Finished difference. Result has 260 places, 501 transitions, 5487 flow [2022-01-19 12:51:06,359 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=891, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=65, PETRI_FLOW=5487, PETRI_PLACES=260, PETRI_TRANSITIONS=501} [2022-01-19 12:51:06,360 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 149 predicate places. [2022-01-19 12:51:06,360 INFO L470 AbstractCegarLoop]: Abstraction has has 260 places, 501 transitions, 5487 flow [2022-01-19 12:51:06,360 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 80.5925925925926) internal successors, (2176), 27 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 12:51:06,360 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 12:51:06,360 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] [2022-01-19 12:51:06,365 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-01-19 12:51:06,564 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 12:51:06,564 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-19 12:51:06,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 12:51:06,565 INFO L85 PathProgramCache]: Analyzing trace with hash 2074825137, now seen corresponding path program 2 times [2022-01-19 12:51:06,565 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 12:51:06,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036909557] [2022-01-19 12:51:06,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 12:51:06,566 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 12:51:06,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 12:51:07,024 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 12:51:07,024 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 12:51:07,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036909557] [2022-01-19 12:51:07,025 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036909557] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 12:51:07,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [619555589] [2022-01-19 12:51:07,025 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 12:51:07,025 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 12:51:07,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 12:51:07,026 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 12:51:07,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-19 12:51:07,348 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 12:51:07,348 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 12:51:07,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 19 conjunts are in the unsatisfiable core [2022-01-19 12:51:07,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 12:51:32,398 INFO L884 QuantifierPusher]: Run 10 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2022-01-19 12:51:33,963 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 12:51:33,963 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 12:51:40,920 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 12:51:40,921 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [619555589] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 12:51:40,921 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 12:51:40,921 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 27 [2022-01-19 12:51:40,921 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729067712] [2022-01-19 12:51:40,921 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 12:51:40,922 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-19 12:51:40,922 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 12:51:40,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-19 12:51:40,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=555, Unknown=1, NotChecked=0, Total=702 [2022-01-19 12:51:40,924 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 125 [2022-01-19 12:51:40,925 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 501 transitions, 5487 flow. Second operand has 27 states, 27 states have (on average 80.55555555555556) internal successors, (2175), 27 states have internal predecessors, (2175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 12:51:40,925 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 12:51:40,925 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 125 [2022-01-19 12:51:40,925 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 12:51:43,790 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:51:45,793 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:51:47,926 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:52:01,999 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:52:04,416 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:52:05,864 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:52:08,260 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:52:21,967 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:52:23,976 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:52:26,005 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:52:27,037 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:52:31,433 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:52:38,164 WARN L228 SmtUtils]: Spent 5.64s on a formula simplification. DAG size of input: 65 DAG size of output: 63 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 12:52:41,542 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:52:50,415 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:52:57,187 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:53:04,079 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:53:06,229 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:53:09,391 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:53:13,037 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:53:20,836 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:53:25,655 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:53:28,255 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:53:32,448 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:53:36,235 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 12:53:48,951 WARN L228 SmtUtils]: Spent 5.54s on a formula simplification. DAG size of input: 55 DAG size of output: 40 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 12:53:50,086 INFO L129 PetriNetUnfolder]: 17759/31124 cut-off events. [2022-01-19 12:53:50,086 INFO L130 PetriNetUnfolder]: For 281484/288050 co-relation queries the response was YES. [2022-01-19 12:53:50,310 INFO L84 FinitePrefix]: Finished finitePrefix Result has 173566 conditions, 31124 events. 17759/31124 cut-off events. For 281484/288050 co-relation queries the response was YES. Maximal size of possible extension queue 1933. Compared 277116 event pairs, 2492 based on Foata normal form. 66/30072 useless extension candidates. Maximal degree in co-relation 173499. Up to 15862 conditions per place. [2022-01-19 12:53:50,511 INFO L132 encePairwiseOnDemand]: 107/125 looper letters, 524 selfloop transitions, 477 changer transitions 12/1075 dead transitions. [2022-01-19 12:53:50,512 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 1075 transitions, 14289 flow [2022-01-19 12:53:50,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-01-19 12:53:50,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2022-01-19 12:53:50,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 2751 transitions. [2022-01-19 12:53:50,516 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7099354838709677 [2022-01-19 12:53:50,516 INFO L72 ComplementDD]: Start complementDD. Operand 31 states and 2751 transitions. [2022-01-19 12:53:50,516 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 2751 transitions. [2022-01-19 12:53:50,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 12:53:50,517 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 31 states and 2751 transitions. [2022-01-19 12:53:50,520 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 32 states, 31 states have (on average 88.74193548387096) internal successors, (2751), 31 states have internal predecessors, (2751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 12:53:50,523 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 32 states, 32 states have (on average 125.0) internal successors, (4000), 32 states have internal predecessors, (4000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 12:53:50,524 INFO L81 ComplementDD]: Finished complementDD. Result has 32 states, 32 states have (on average 125.0) internal successors, (4000), 32 states have internal predecessors, (4000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 12:53:50,524 INFO L186 Difference]: Start difference. First operand has 260 places, 501 transitions, 5487 flow. Second operand 31 states and 2751 transitions. [2022-01-19 12:53:50,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 1075 transitions, 14289 flow [2022-01-19 12:53:52,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 1075 transitions, 13320 flow, removed 472 selfloop flow, removed 12 redundant places. [2022-01-19 12:53:52,687 INFO L242 Difference]: Finished difference. Result has 285 places, 799 transitions, 10454 flow [2022-01-19 12:53:52,688 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=4834, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=501, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=223, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=10454, PETRI_PLACES=285, PETRI_TRANSITIONS=799} [2022-01-19 12:53:52,688 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 174 predicate places. [2022-01-19 12:53:52,688 INFO L470 AbstractCegarLoop]: Abstraction has has 285 places, 799 transitions, 10454 flow [2022-01-19 12:53:52,689 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 80.55555555555556) internal successors, (2175), 27 states have internal predecessors, (2175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 12:53:52,689 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 12:53:52,689 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] [2022-01-19 12:53:52,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-19 12:53:52,894 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 12:53:52,894 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2022-01-19 12:53:52,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 12:53:52,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1260449477, now seen corresponding path program 1 times [2022-01-19 12:53:52,894 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 12:53:52,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346731199] [2022-01-19 12:53:52,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 12:53:52,895 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 12:53:52,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 12:53:53,231 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 12:53:53,231 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 12:53:53,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346731199] [2022-01-19 12:53:53,231 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346731199] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 12:53:53,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1770036992] [2022-01-19 12:53:53,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 12:53:53,231 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 12:53:53,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 12:53:53,240 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 12:53:53,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-19 12:53:53,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 12:53:53,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 19 conjunts are in the unsatisfiable core [2022-01-19 12:53:53,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 12:54:11,211 INFO L884 QuantifierPusher]: Run 10 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2022-01-19 12:54:14,261 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 12:54:14,261 INFO L328 TraceCheckSpWp]: Computing backward predicates... Received shutdown request... [2022-01-19 12:54:23,689 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 12:54:23,696 WARN L244 SmtUtils]: Removed 2 from assertion stack [2022-01-19 12:54:23,697 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-01-19 12:54:23,702 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-01-19 12:54:23,711 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-01-19 12:54:23,898 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-01-19 12:54:23,898 WARN L594 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was analyzing trace of length 97 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 13 for 0ms.. [2022-01-19 12:54:23,899 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (3 of 5 remaining) [2022-01-19 12:54:23,899 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (2 of 5 remaining) [2022-01-19 12:54:23,900 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATION (1 of 5 remaining) [2022-01-19 12:54:23,900 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATION (0 of 5 remaining) [2022-01-19 12:54:23,909 INFO L732 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1, 1, 1] [2022-01-19 12:54:23,911 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-01-19 12:54:23,911 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-19 12:54:23,912 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.01 12:54:23 BasicIcfg [2022-01-19 12:54:23,913 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-19 12:54:23,913 INFO L158 Benchmark]: Toolchain (without parser) took 877181.70ms. Allocated memory was 402.7MB in the beginning and 1.1GB in the end (delta: 692.1MB). Free memory was 347.3MB in the beginning and 535.4MB in the end (delta: -188.1MB). Peak memory consumption was 505.0MB. Max. memory is 16.0GB. [2022-01-19 12:54:23,913 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 402.7MB. Free memory is still 364.2MB. There was no memory consumed. Max. memory is 16.0GB. [2022-01-19 12:54:23,913 INFO L158 Benchmark]: CACSL2BoogieTranslator took 261.30ms. Allocated memory is still 402.7MB. Free memory was 347.1MB in the beginning and 372.9MB in the end (delta: -25.8MB). Peak memory consumption was 10.9MB. Max. memory is 16.0GB. [2022-01-19 12:54:23,913 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.77ms. Allocated memory is still 402.7MB. Free memory was 372.9MB in the beginning and 370.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-19 12:54:23,913 INFO L158 Benchmark]: Boogie Preprocessor took 31.55ms. Allocated memory is still 402.7MB. Free memory was 370.9MB in the beginning and 369.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.0GB. [2022-01-19 12:54:23,913 INFO L158 Benchmark]: RCFGBuilder took 436.02ms. Allocated memory is still 402.7MB. Free memory was 369.9MB in the beginning and 355.2MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.0GB. [2022-01-19 12:54:23,914 INFO L158 Benchmark]: TraceAbstraction took 876389.01ms. Allocated memory was 402.7MB in the beginning and 1.1GB in the end (delta: 692.1MB). Free memory was 355.2MB in the beginning and 535.4MB in the end (delta: -180.2MB). Peak memory consumption was 512.9MB. Max. memory is 16.0GB. [2022-01-19 12:54:23,914 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.13ms. Allocated memory is still 402.7MB. Free memory is still 364.2MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 261.30ms. Allocated memory is still 402.7MB. Free memory was 347.1MB in the beginning and 372.9MB in the end (delta: -25.8MB). Peak memory consumption was 10.9MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 44.77ms. Allocated memory is still 402.7MB. Free memory was 372.9MB in the beginning and 370.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 31.55ms. Allocated memory is still 402.7MB. Free memory was 370.9MB in the beginning and 369.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.0GB. * RCFGBuilder took 436.02ms. Allocated memory is still 402.7MB. Free memory was 369.9MB in the beginning and 355.2MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.0GB. * TraceAbstraction took 876389.01ms. Allocated memory was 402.7MB in the beginning and 1.1GB in the end (delta: 692.1MB). Free memory was 355.2MB in the beginning and 535.4MB in the end (delta: -180.2MB). Peak memory consumption was 512.9MB. 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: 92]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was analyzing trace of length 97 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 13 for 0ms.. - TimeoutResultAtElement [Line: 85]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 97 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 13 for 0ms.. - TimeoutResultAtElement [Line: 84]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 97 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 13 for 0ms.. - TimeoutResultAtElement [Line: 83]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 97 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 13 for 0ms.. - 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 CegarLoopForPetriNet was analyzing trace of length 97 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 13 for 0ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 140 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 876.3s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 760.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 86 mSolverCounterUnknown, 2109 SdHoareTripleChecker+Valid, 340.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2109 mSDsluCounter, 693 SdHoareTripleChecker+Invalid, 336.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2223 mSDsCounter, 260 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6551 IncrementalHoareTripleChecker+Invalid, 6897 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 260 mSolverCounterUnsat, 187 mSDtfsCounter, 6551 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 933 GetRequests, 727 SyntacticMatches, 6 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2800 ImplicationChecksByTransitivity, 470.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10454occurred in iteration=11, InterpolantAutomatonStates: 165, 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.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 82.2s InterpolantComputationTime, 1414 NumberOfCodeBlocks, 1414 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1775 ConstructedInterpolants, 0 QuantifiedInterpolants, 32801 SizeOfPredicates, 46 NumberOfNonLiveVariables, 1010 ConjunctsInSsa, 50 ConjunctsInUnsatCore, 19 InterpolantComputations, 7 PerfectInterpolantSequences, 6/23 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