/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-Before.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 06:43:54,273 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-19 06:43:54,275 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-19 06:43:54,334 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-19 06:43:54,335 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-19 06:43:54,339 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-19 06:43:54,341 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-19 06:43:54,344 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-19 06:43:54,346 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-19 06:43:54,348 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-19 06:43:54,349 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-19 06:43:54,349 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-19 06:43:54,350 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-19 06:43:54,350 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-19 06:43:54,351 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-19 06:43:54,352 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-19 06:43:54,352 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-19 06:43:54,353 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-19 06:43:54,354 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-19 06:43:54,355 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-19 06:43:54,356 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-19 06:43:54,362 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-19 06:43:54,365 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-19 06:43:54,367 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-19 06:43:54,374 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-19 06:43:54,374 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-19 06:43:54,374 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-19 06:43:54,375 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-19 06:43:54,376 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-19 06:43:54,376 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-19 06:43:54,377 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-19 06:43:54,377 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-19 06:43:54,379 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-19 06:43:54,379 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-19 06:43:54,380 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-19 06:43:54,380 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-19 06:43:54,381 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-19 06:43:54,381 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-19 06:43:54,381 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-19 06:43:54,382 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-19 06:43:54,382 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-19 06:43:54,383 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-Before.epf [2022-01-19 06:43:54,417 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-19 06:43:54,417 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-19 06:43:54,419 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-19 06:43:54,419 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-19 06:43:54,419 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-19 06:43:54,419 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-19 06:43:54,419 INFO L138 SettingsManager]: * Use SBE=true [2022-01-19 06:43:54,420 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-19 06:43:54,420 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-19 06:43:54,420 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-19 06:43:54,421 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-19 06:43:54,421 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-19 06:43:54,421 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-19 06:43:54,421 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-19 06:43:54,421 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-19 06:43:54,421 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-19 06:43:54,422 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-19 06:43:54,422 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-19 06:43:54,422 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-19 06:43:54,422 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-19 06:43:54,422 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-19 06:43:54,422 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-19 06:43:54,422 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-19 06:43:54,422 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 06:43:54,423 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-19 06:43:54,423 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-19 06:43:54,423 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-19 06:43:54,423 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-19 06:43:54,423 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-19 06:43:54,423 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-19 06:43:54,423 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-19 06:43:54,423 INFO L138 SettingsManager]: * When to check the insufficient erros location relative to the other error locations=BEFORE [2022-01-19 06:43:54,424 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 06:43:54,607 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-19 06:43:54,625 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-19 06:43:54,627 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-19 06:43:54,628 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-19 06:43:54,631 INFO L275 PluginConnector]: CDTParser initialized [2022-01-19 06:43:54,632 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 06:43:54,683 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70ac90c51/4f11d17fe87d430fb33e5744faa46784/FLAGf13661d3c [2022-01-19 06:43:55,039 INFO L306 CDTParser]: Found 1 translation units. [2022-01-19 06:43:55,040 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x3.wvr.c [2022-01-19 06:43:55,046 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70ac90c51/4f11d17fe87d430fb33e5744faa46784/FLAGf13661d3c [2022-01-19 06:43:55,059 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70ac90c51/4f11d17fe87d430fb33e5744faa46784 [2022-01-19 06:43:55,061 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-19 06:43:55,062 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-19 06:43:55,064 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-19 06:43:55,064 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-19 06:43:55,066 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-19 06:43:55,067 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 06:43:55" (1/1) ... [2022-01-19 06:43:55,067 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1335c776 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:43:55, skipping insertion in model container [2022-01-19 06:43:55,068 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 06:43:55" (1/1) ... [2022-01-19 06:43:55,073 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-19 06:43:55,085 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-19 06:43:55,231 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 06:43:55,234 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 06:43:55,241 INFO L203 MainTranslator]: Completed pre-run [2022-01-19 06:43:55,258 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 06:43:55,259 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 06:43:55,270 INFO L208 MainTranslator]: Completed translation [2022-01-19 06:43:55,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:43:55 WrapperNode [2022-01-19 06:43:55,271 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-19 06:43:55,272 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-19 06:43:55,272 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-19 06:43:55,272 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-19 06:43:55,277 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:43:55" (1/1) ... [2022-01-19 06:43:55,283 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:43:55" (1/1) ... [2022-01-19 06:43:55,309 INFO L137 Inliner]: procedures = 20, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 91 [2022-01-19 06:43:55,309 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-19 06:43:55,310 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-19 06:43:55,310 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-19 06:43:55,310 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-19 06:43:55,318 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:43:55" (1/1) ... [2022-01-19 06:43:55,318 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:43:55" (1/1) ... [2022-01-19 06:43:55,324 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:43:55" (1/1) ... [2022-01-19 06:43:55,324 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:43:55" (1/1) ... [2022-01-19 06:43:55,341 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:43:55" (1/1) ... [2022-01-19 06:43:55,344 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:43:55" (1/1) ... [2022-01-19 06:43:55,345 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:43:55" (1/1) ... [2022-01-19 06:43:55,347 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-19 06:43:55,347 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-19 06:43:55,348 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-19 06:43:55,348 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-19 06:43:55,354 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:43:55" (1/1) ... [2022-01-19 06:43:55,359 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 06:43:55,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:43:55,383 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 06:43:55,393 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 06:43:55,418 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-19 06:43:55,419 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-01-19 06:43:55,419 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-01-19 06:43:55,419 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-01-19 06:43:55,419 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-01-19 06:43:55,419 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-01-19 06:43:55,419 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-01-19 06:43:55,419 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-01-19 06:43:55,420 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-01-19 06:43:55,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-19 06:43:55,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-19 06:43:55,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-19 06:43:55,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-19 06:43:55,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-19 06:43:55,420 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-19 06:43:55,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-19 06:43:55,422 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 06:43:55,502 INFO L234 CfgBuilder]: Building ICFG [2022-01-19 06:43:55,503 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-19 06:43:55,701 INFO L275 CfgBuilder]: Performing block encoding [2022-01-19 06:43:55,707 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-19 06:43:55,708 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-01-19 06:43:55,709 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 06:43:55 BoogieIcfgContainer [2022-01-19 06:43:55,709 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-19 06:43:55,711 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-19 06:43:55,711 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-19 06:43:55,715 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-19 06:43:55,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.01 06:43:55" (1/3) ... [2022-01-19 06:43:55,716 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fd6d3ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 06:43:55, skipping insertion in model container [2022-01-19 06:43:55,716 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 06:43:55" (2/3) ... [2022-01-19 06:43:55,716 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fd6d3ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 06:43:55, skipping insertion in model container [2022-01-19 06:43:55,716 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 06:43:55" (3/3) ... [2022-01-19 06:43:55,718 INFO L111 eAbstractionObserver]: Analyzing ICFG bench-exp2x3.wvr.c [2022-01-19 06:43:55,721 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-19 06:43:55,722 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-19 06:43:55,722 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-19 06:43:55,757 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:43:55,757 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:43:55,759 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:43:55,759 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:43:55,760 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:43:55,760 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:43:55,760 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:43:55,760 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:43:55,762 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:43:55,762 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:43:55,763 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:43:55,763 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:43:55,764 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:43:55,764 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:43:55,765 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:43:55,765 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:43:55,768 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:43:55,768 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:43:55,771 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:43:55,771 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:43:55,773 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:43:55,773 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:43:55,774 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:43:55,774 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 06:43:55,779 INFO L148 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-01-19 06:43:55,820 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 06:43:55,826 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 06:43:55,827 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-01-19 06:43:55,837 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 128 places, 125 transitions, 282 flow [2022-01-19 06:43:55,909 INFO L129 PetriNetUnfolder]: 10/121 cut-off events. [2022-01-19 06:43:55,910 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-01-19 06:43:55,914 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 06:43:55,914 INFO L82 GeneralOperation]: Start removeDead. Operand has 128 places, 125 transitions, 282 flow [2022-01-19 06:43:55,924 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 108 transitions, 240 flow [2022-01-19 06:43:55,961 INFO L129 PetriNetUnfolder]: 10/107 cut-off events. [2022-01-19 06:43:55,962 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-01-19 06:43:55,962 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:43:55,962 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 06:43:55,963 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 06:43:55,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:43:55,968 INFO L85 PathProgramCache]: Analyzing trace with hash -121838707, now seen corresponding path program 1 times [2022-01-19 06:43:55,977 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:43:55,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801336557] [2022-01-19 06:43:55,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:43:55,978 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:43:56,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:43:56,202 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 06:43:56,202 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:43:56,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801336557] [2022-01-19 06:43:56,203 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801336557] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 06:43:56,203 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 06:43:56,203 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-19 06:43:56,205 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147613032] [2022-01-19 06:43:56,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 06:43:56,214 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-19 06:43:56,214 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:43:56,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-19 06:43:56,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-19 06:43:56,250 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 125 [2022-01-19 06:43:56,255 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 06:43:56,255 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:43:56,255 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 125 [2022-01-19 06:43:56,256 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:43:56,307 INFO L129 PetriNetUnfolder]: 4/102 cut-off events. [2022-01-19 06:43:56,308 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-01-19 06:43:56,309 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 06:43:56,311 INFO L132 encePairwiseOnDemand]: 119/125 looper letters, 8 selfloop transitions, 0 changer transitions 2/102 dead transitions. [2022-01-19 06:43:56,311 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 102 transitions, 244 flow [2022-01-19 06:43:56,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-19 06:43:56,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-01-19 06:43:56,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 234 transitions. [2022-01-19 06:43:56,324 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.936 [2022-01-19 06:43:56,324 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 234 transitions. [2022-01-19 06:43:56,325 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 234 transitions. [2022-01-19 06:43:56,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:43:56,328 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 234 transitions. [2022-01-19 06:43:56,333 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 06:43:56,343 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 06:43:56,343 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 06:43:56,345 INFO L186 Difference]: Start difference. First operand has 111 places, 108 transitions, 240 flow. Second operand 2 states and 234 transitions. [2022-01-19 06:43:56,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 102 transitions, 244 flow [2022-01-19 06:43:56,350 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 06:43:56,353 INFO L242 Difference]: Finished difference. Result has 104 places, 100 transitions, 208 flow [2022-01-19 06:43:56,354 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 06:43:56,358 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, -7 predicate places. [2022-01-19 06:43:56,358 INFO L470 AbstractCegarLoop]: Abstraction has has 104 places, 100 transitions, 208 flow [2022-01-19 06:43:56,359 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 06:43:56,359 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:43:56,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] [2022-01-19 06:43:56,361 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-19 06:43:56,363 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 06:43:56,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:43:56,369 INFO L85 PathProgramCache]: Analyzing trace with hash 560355165, now seen corresponding path program 1 times [2022-01-19 06:43:56,369 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:43:56,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850017162] [2022-01-19 06:43:56,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:43:56,370 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:43:56,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:43:56,726 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 06:43:56,727 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:43:56,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850017162] [2022-01-19 06:43:56,727 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850017162] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 06:43:56,727 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 06:43:56,727 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-19 06:43:56,728 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289168628] [2022-01-19 06:43:56,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 06:43:56,729 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 06:43:56,729 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:43:56,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 06:43:56,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-01-19 06:43:56,731 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 125 [2022-01-19 06:43:56,732 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 06:43:56,732 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:43:56,732 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 125 [2022-01-19 06:43:56,732 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:43:57,051 INFO L129 PetriNetUnfolder]: 895/1602 cut-off events. [2022-01-19 06:43:57,051 INFO L130 PetriNetUnfolder]: For 80/135 co-relation queries the response was YES. [2022-01-19 06:43:57,055 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 06:43:57,066 INFO L132 encePairwiseOnDemand]: 115/125 looper letters, 47 selfloop transitions, 7 changer transitions 4/122 dead transitions. [2022-01-19 06:43:57,066 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 122 transitions, 375 flow [2022-01-19 06:43:57,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 06:43:57,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 06:43:57,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 619 transitions. [2022-01-19 06:43:57,070 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7074285714285714 [2022-01-19 06:43:57,070 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 619 transitions. [2022-01-19 06:43:57,070 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 619 transitions. [2022-01-19 06:43:57,070 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:43:57,070 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 619 transitions. [2022-01-19 06:43:57,072 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 06:43:57,074 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 06:43:57,075 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 06:43:57,075 INFO L186 Difference]: Start difference. First operand has 104 places, 100 transitions, 208 flow. Second operand 7 states and 619 transitions. [2022-01-19 06:43:57,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 122 transitions, 375 flow [2022-01-19 06:43:57,076 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 06:43:57,078 INFO L242 Difference]: Finished difference. Result has 111 places, 104 transitions, 249 flow [2022-01-19 06:43:57,079 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 06:43:57,079 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 0 predicate places. [2022-01-19 06:43:57,080 INFO L470 AbstractCegarLoop]: Abstraction has has 111 places, 104 transitions, 249 flow [2022-01-19 06:43:57,080 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 06:43:57,080 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:43:57,080 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 06:43:57,080 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-19 06:43:57,081 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 06:43:57,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:43:57,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1307809793, now seen corresponding path program 1 times [2022-01-19 06:43:57,081 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:43:57,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972031446] [2022-01-19 06:43:57,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:43:57,082 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:43:57,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:43:57,245 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 06:43:57,246 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:43:57,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972031446] [2022-01-19 06:43:57,246 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972031446] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 06:43:57,246 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 06:43:57,246 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 06:43:57,247 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43695815] [2022-01-19 06:43:57,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 06:43:57,248 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 06:43:57,249 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:43:57,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 06:43:57,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-19 06:43:57,251 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 125 [2022-01-19 06:43:57,252 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 06:43:57,252 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:43:57,252 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 125 [2022-01-19 06:43:57,252 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:43:57,620 INFO L129 PetriNetUnfolder]: 1373/2607 cut-off events. [2022-01-19 06:43:57,620 INFO L130 PetriNetUnfolder]: For 392/412 co-relation queries the response was YES. [2022-01-19 06:43:57,631 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 06:43:57,647 INFO L132 encePairwiseOnDemand]: 114/125 looper letters, 70 selfloop transitions, 14 changer transitions 0/154 dead transitions. [2022-01-19 06:43:57,647 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 154 transitions, 552 flow [2022-01-19 06:43:57,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 06:43:57,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 06:43:57,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 672 transitions. [2022-01-19 06:43:57,650 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.768 [2022-01-19 06:43:57,650 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 672 transitions. [2022-01-19 06:43:57,650 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 672 transitions. [2022-01-19 06:43:57,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:43:57,650 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 672 transitions. [2022-01-19 06:43:57,652 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 06:43:57,653 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 06:43:57,654 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 06:43:57,654 INFO L186 Difference]: Start difference. First operand has 111 places, 104 transitions, 249 flow. Second operand 7 states and 672 transitions. [2022-01-19 06:43:57,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 154 transitions, 552 flow [2022-01-19 06:43:57,656 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 06:43:57,659 INFO L242 Difference]: Finished difference. Result has 114 places, 110 transitions, 318 flow [2022-01-19 06:43:57,659 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 06:43:57,660 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 3 predicate places. [2022-01-19 06:43:57,660 INFO L470 AbstractCegarLoop]: Abstraction has has 114 places, 110 transitions, 318 flow [2022-01-19 06:43:57,660 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 06:43:57,660 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:43:57,660 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 06:43:57,661 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-19 06:43:57,661 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 06:43:57,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:43:57,661 INFO L85 PathProgramCache]: Analyzing trace with hash 2113143597, now seen corresponding path program 2 times [2022-01-19 06:43:57,662 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:43:57,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013944272] [2022-01-19 06:43:57,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:43:57,662 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:43:57,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:43:57,853 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 06:43:57,853 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:43:57,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013944272] [2022-01-19 06:43:57,853 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013944272] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 06:43:57,854 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 06:43:57,854 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 06:43:57,854 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226532873] [2022-01-19 06:43:57,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 06:43:57,854 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 06:43:57,854 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:43:57,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 06:43:57,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-01-19 06:43:57,856 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 125 [2022-01-19 06:43:57,857 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 06:43:57,857 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:43:57,857 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 125 [2022-01-19 06:43:57,857 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:43:58,297 INFO L129 PetriNetUnfolder]: 1489/2668 cut-off events. [2022-01-19 06:43:58,297 INFO L130 PetriNetUnfolder]: For 2290/2290 co-relation queries the response was YES. [2022-01-19 06:43:58,304 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 06:43:58,321 INFO L132 encePairwiseOnDemand]: 114/125 looper letters, 64 selfloop transitions, 12 changer transitions 1/139 dead transitions. [2022-01-19 06:43:58,322 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 139 transitions, 576 flow [2022-01-19 06:43:58,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-19 06:43:58,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-01-19 06:43:58,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 539 transitions. [2022-01-19 06:43:58,324 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7186666666666667 [2022-01-19 06:43:58,324 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 539 transitions. [2022-01-19 06:43:58,324 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 539 transitions. [2022-01-19 06:43:58,324 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:43:58,324 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 539 transitions. [2022-01-19 06:43:58,326 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 06:43:58,327 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 06:43:58,328 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 06:43:58,328 INFO L186 Difference]: Start difference. First operand has 114 places, 110 transitions, 318 flow. Second operand 6 states and 539 transitions. [2022-01-19 06:43:58,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 139 transitions, 576 flow [2022-01-19 06:43:58,335 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 06:43:58,338 INFO L242 Difference]: Finished difference. Result has 119 places, 115 transitions, 384 flow [2022-01-19 06:43:58,338 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 06:43:58,339 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 8 predicate places. [2022-01-19 06:43:58,339 INFO L470 AbstractCegarLoop]: Abstraction has has 119 places, 115 transitions, 384 flow [2022-01-19 06:43:58,340 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 06:43:58,340 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:43:58,340 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 06:43:58,340 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-19 06:43:58,340 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 06:43:58,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:43:58,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1971798559, now seen corresponding path program 1 times [2022-01-19 06:43:58,342 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:43:58,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647651906] [2022-01-19 06:43:58,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:43:58,343 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:43:58,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:43:58,636 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 06:43:58,637 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:43:58,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647651906] [2022-01-19 06:43:58,637 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647651906] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 06:43:58,637 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 06:43:58,637 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 06:43:58,637 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911625509] [2022-01-19 06:43:58,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 06:43:58,638 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 06:43:58,638 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:43:58,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 06:43:58,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-01-19 06:43:58,639 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 125 [2022-01-19 06:43:58,640 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 06:43:58,640 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:43:58,640 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 125 [2022-01-19 06:43:58,640 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:43:59,069 INFO L129 PetriNetUnfolder]: 1464/2715 cut-off events. [2022-01-19 06:43:59,069 INFO L130 PetriNetUnfolder]: For 3938/4007 co-relation queries the response was YES. [2022-01-19 06:43:59,077 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 06:43:59,096 INFO L132 encePairwiseOnDemand]: 114/125 looper letters, 70 selfloop transitions, 19 changer transitions 1/152 dead transitions. [2022-01-19 06:43:59,096 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 152 transitions, 765 flow [2022-01-19 06:43:59,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-19 06:43:59,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-01-19 06:43:59,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 540 transitions. [2022-01-19 06:43:59,099 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.72 [2022-01-19 06:43:59,099 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 540 transitions. [2022-01-19 06:43:59,099 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 540 transitions. [2022-01-19 06:43:59,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:43:59,099 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 540 transitions. [2022-01-19 06:43:59,101 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 06:43:59,102 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 06:43:59,102 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 06:43:59,102 INFO L186 Difference]: Start difference. First operand has 119 places, 115 transitions, 384 flow. Second operand 6 states and 540 transitions. [2022-01-19 06:43:59,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 152 transitions, 765 flow [2022-01-19 06:43:59,108 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 06:43:59,111 INFO L242 Difference]: Finished difference. Result has 122 places, 124 transitions, 476 flow [2022-01-19 06:43:59,111 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 06:43:59,113 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 11 predicate places. [2022-01-19 06:43:59,114 INFO L470 AbstractCegarLoop]: Abstraction has has 122 places, 124 transitions, 476 flow [2022-01-19 06:43:59,114 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 06:43:59,114 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:43:59,114 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 06:43:59,114 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-19 06:43:59,115 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 06:43:59,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:43:59,116 INFO L85 PathProgramCache]: Analyzing trace with hash 760466257, now seen corresponding path program 1 times [2022-01-19 06:43:59,116 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:43:59,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654254737] [2022-01-19 06:43:59,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:43:59,116 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:43:59,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:43:59,330 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 06:43:59,330 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:43:59,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654254737] [2022-01-19 06:43:59,331 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654254737] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 06:43:59,331 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 06:43:59,331 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 06:43:59,331 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595763800] [2022-01-19 06:43:59,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 06:43:59,332 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 06:43:59,332 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:43:59,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 06:43:59,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-01-19 06:43:59,333 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 125 [2022-01-19 06:43:59,333 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 06:43:59,334 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:43:59,334 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 125 [2022-01-19 06:43:59,334 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:43:59,742 INFO L129 PetriNetUnfolder]: 1403/2671 cut-off events. [2022-01-19 06:43:59,742 INFO L130 PetriNetUnfolder]: For 3760/3827 co-relation queries the response was YES. [2022-01-19 06:43:59,750 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 06:43:59,764 INFO L132 encePairwiseOnDemand]: 115/125 looper letters, 68 selfloop transitions, 21 changer transitions 1/152 dead transitions. [2022-01-19 06:43:59,764 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 152 transitions, 778 flow [2022-01-19 06:43:59,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-19 06:43:59,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-01-19 06:43:59,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 537 transitions. [2022-01-19 06:43:59,766 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.716 [2022-01-19 06:43:59,766 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 537 transitions. [2022-01-19 06:43:59,767 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 537 transitions. [2022-01-19 06:43:59,767 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:43:59,767 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 537 transitions. [2022-01-19 06:43:59,769 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 06:43:59,771 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 06:43:59,771 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 06:43:59,771 INFO L186 Difference]: Start difference. First operand has 122 places, 124 transitions, 476 flow. Second operand 6 states and 537 transitions. [2022-01-19 06:43:59,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 152 transitions, 778 flow [2022-01-19 06:43:59,777 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 06:43:59,779 INFO L242 Difference]: Finished difference. Result has 126 places, 128 transitions, 548 flow [2022-01-19 06:43:59,779 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 06:43:59,781 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 15 predicate places. [2022-01-19 06:43:59,781 INFO L470 AbstractCegarLoop]: Abstraction has has 126 places, 128 transitions, 548 flow [2022-01-19 06:43:59,783 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 06:43:59,783 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:43:59,784 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 06:43:59,784 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-19 06:43:59,784 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 06:43:59,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:43:59,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1466145333, now seen corresponding path program 1 times [2022-01-19 06:43:59,785 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:43:59,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124184656] [2022-01-19 06:43:59,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:43:59,785 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:43:59,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:44:00,010 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 06:44:00,010 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:44:00,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124184656] [2022-01-19 06:44:00,010 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124184656] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:44:00,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394127948] [2022-01-19 06:44:00,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:44:00,011 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:44:00,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:44:00,019 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 06:44:00,048 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 06:44:00,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:44:00,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 7 conjunts are in the unsatisfiable core [2022-01-19 06:44:00,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:44:00,565 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 06:44:00,565 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:44:00,872 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 06:44:00,873 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394127948] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:44:00,873 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:44:00,873 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2022-01-19 06:44:00,873 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878724296] [2022-01-19 06:44:00,873 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:44:00,874 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-19 06:44:00,874 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:44:00,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-19 06:44:00,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-01-19 06:44:00,876 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 125 [2022-01-19 06:44:00,877 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 06:44:00,877 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:44:00,877 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 125 [2022-01-19 06:44:00,877 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:44:01,885 INFO L129 PetriNetUnfolder]: 2685/4833 cut-off events. [2022-01-19 06:44:01,885 INFO L130 PetriNetUnfolder]: For 7692/7803 co-relation queries the response was YES. [2022-01-19 06:44:01,900 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 06:44:01,932 INFO L132 encePairwiseOnDemand]: 110/125 looper letters, 171 selfloop transitions, 32 changer transitions 2/267 dead transitions. [2022-01-19 06:44:01,932 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 267 transitions, 1690 flow [2022-01-19 06:44:01,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-19 06:44:01,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-01-19 06:44:01,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1251 transitions. [2022-01-19 06:44:01,936 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7148571428571429 [2022-01-19 06:44:01,936 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1251 transitions. [2022-01-19 06:44:01,936 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1251 transitions. [2022-01-19 06:44:01,937 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:44:01,937 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1251 transitions. [2022-01-19 06:44:01,939 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 06:44:01,942 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 06:44:01,942 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 06:44:01,942 INFO L186 Difference]: Start difference. First operand has 126 places, 128 transitions, 548 flow. Second operand 14 states and 1251 transitions. [2022-01-19 06:44:01,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 267 transitions, 1690 flow [2022-01-19 06:44:01,952 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 06:44:01,955 INFO L242 Difference]: Finished difference. Result has 145 places, 138 transitions, 699 flow [2022-01-19 06:44:01,955 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 06:44:01,955 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 34 predicate places. [2022-01-19 06:44:01,955 INFO L470 AbstractCegarLoop]: Abstraction has has 145 places, 138 transitions, 699 flow [2022-01-19 06:44:01,956 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 06:44:01,956 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:44:01,956 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 06:44:01,982 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 06:44:02,179 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 06:44:02,179 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 06:44:02,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:44:02,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1425051441, now seen corresponding path program 2 times [2022-01-19 06:44:02,180 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:44:02,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305358646] [2022-01-19 06:44:02,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:44:02,180 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:44:02,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:44:02,257 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 06:44:02,258 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:44:02,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305358646] [2022-01-19 06:44:02,258 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305358646] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 06:44:02,258 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 06:44:02,258 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-19 06:44:02,258 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305771837] [2022-01-19 06:44:02,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 06:44:02,259 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 06:44:02,259 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:44:02,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 06:44:02,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-19 06:44:02,260 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 125 [2022-01-19 06:44:02,261 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 06:44:02,261 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:44:02,261 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 125 [2022-01-19 06:44:02,261 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:44:02,909 INFO L129 PetriNetUnfolder]: 2785/5234 cut-off events. [2022-01-19 06:44:02,909 INFO L130 PetriNetUnfolder]: For 13554/13634 co-relation queries the response was YES. [2022-01-19 06:44:02,935 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 06:44:02,968 INFO L132 encePairwiseOnDemand]: 114/125 looper letters, 98 selfloop transitions, 21 changer transitions 0/195 dead transitions. [2022-01-19 06:44:02,968 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 195 transitions, 1275 flow [2022-01-19 06:44:02,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 06:44:02,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 06:44:02,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 668 transitions. [2022-01-19 06:44:02,970 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7634285714285715 [2022-01-19 06:44:02,971 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 668 transitions. [2022-01-19 06:44:02,971 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 668 transitions. [2022-01-19 06:44:02,971 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:44:02,971 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 668 transitions. [2022-01-19 06:44:02,973 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 06:44:02,974 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 06:44:02,974 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 06:44:02,974 INFO L186 Difference]: Start difference. First operand has 145 places, 138 transitions, 699 flow. Second operand 7 states and 668 transitions. [2022-01-19 06:44:02,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 195 transitions, 1275 flow [2022-01-19 06:44:03,012 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 06:44:03,014 INFO L242 Difference]: Finished difference. Result has 151 places, 141 transitions, 792 flow [2022-01-19 06:44:03,015 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 06:44:03,015 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 40 predicate places. [2022-01-19 06:44:03,015 INFO L470 AbstractCegarLoop]: Abstraction has has 151 places, 141 transitions, 792 flow [2022-01-19 06:44:03,016 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 06:44:03,016 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:44:03,016 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 06:44:03,016 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-19 06:44:03,016 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 06:44:03,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:44:03,017 INFO L85 PathProgramCache]: Analyzing trace with hash -655880267, now seen corresponding path program 2 times [2022-01-19 06:44:03,017 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:44:03,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193532217] [2022-01-19 06:44:03,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:44:03,017 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:44:03,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:44:03,221 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 06:44:03,221 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:44:03,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193532217] [2022-01-19 06:44:03,221 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193532217] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:44:03,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1543381282] [2022-01-19 06:44:03,222 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 06:44:03,222 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:44:03,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:44:03,224 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 06:44:03,250 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 06:44:03,331 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 06:44:03,332 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 06:44:03,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 7 conjunts are in the unsatisfiable core [2022-01-19 06:44:03,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:44:03,664 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 06:44:03,665 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:44:03,930 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 06:44:03,930 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1543381282] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:44:03,930 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:44:03,931 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2022-01-19 06:44:03,931 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3695876] [2022-01-19 06:44:03,931 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:44:03,931 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-19 06:44:03,931 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:44:03,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-19 06:44:03,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-01-19 06:44:03,933 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 125 [2022-01-19 06:44:03,934 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 06:44:03,934 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:44:03,934 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 125 [2022-01-19 06:44:03,935 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:44:05,299 INFO L129 PetriNetUnfolder]: 4341/7678 cut-off events. [2022-01-19 06:44:05,300 INFO L130 PetriNetUnfolder]: For 29767/29842 co-relation queries the response was YES. [2022-01-19 06:44:05,339 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 06:44:05,387 INFO L132 encePairwiseOnDemand]: 110/125 looper letters, 223 selfloop transitions, 32 changer transitions 2/319 dead transitions. [2022-01-19 06:44:05,387 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 319 transitions, 2721 flow [2022-01-19 06:44:05,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-19 06:44:05,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-01-19 06:44:05,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1247 transitions. [2022-01-19 06:44:05,391 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7125714285714285 [2022-01-19 06:44:05,391 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1247 transitions. [2022-01-19 06:44:05,391 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1247 transitions. [2022-01-19 06:44:05,392 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:44:05,392 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1247 transitions. [2022-01-19 06:44:05,394 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 06:44:05,397 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 06:44:05,397 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 06:44:05,397 INFO L186 Difference]: Start difference. First operand has 151 places, 141 transitions, 792 flow. Second operand 14 states and 1247 transitions. [2022-01-19 06:44:05,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 319 transitions, 2721 flow [2022-01-19 06:44:05,496 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 06:44:05,500 INFO L242 Difference]: Finished difference. Result has 168 places, 150 transitions, 950 flow [2022-01-19 06:44:05,500 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 06:44:05,501 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 57 predicate places. [2022-01-19 06:44:05,502 INFO L470 AbstractCegarLoop]: Abstraction has has 168 places, 150 transitions, 950 flow [2022-01-19 06:44:05,503 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 06:44:05,503 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:44:05,503 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 06:44:05,527 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 06:44:05,719 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 06:44:05,720 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 06:44:05,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:44:05,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1429212971, now seen corresponding path program 1 times [2022-01-19 06:44:05,720 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:44:05,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818251670] [2022-01-19 06:44:05,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:44:05,721 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:44:05,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:44:06,157 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 06:44:06,157 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:44:06,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818251670] [2022-01-19 06:44:06,157 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818251670] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:44:06,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [774463313] [2022-01-19 06:44:06,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:44:06,158 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:44:06,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:44:06,164 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 06:44:06,165 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 06:44:06,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:44:06,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 17 conjunts are in the unsatisfiable core [2022-01-19 06:44:06,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:44:29,672 INFO L884 QuantifierPusher]: Run 10 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2022-01-19 06:44:31,001 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 06:44:31,001 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:44:48,630 INFO L884 QuantifierPusher]: Run 10 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2022-01-19 06:44:49,163 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 06:44:49,163 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [774463313] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:44:49,163 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:44:49,163 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 27 [2022-01-19 06:44:49,164 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602473757] [2022-01-19 06:44:49,164 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:44:49,164 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-19 06:44:49,164 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:44:49,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-19 06:44:49,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=546, Unknown=12, NotChecked=0, Total=702 [2022-01-19 06:44:49,167 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 125 [2022-01-19 06:44:49,169 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 06:44:49,169 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:44:49,169 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 125 [2022-01-19 06:44:49,169 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:44:51,472 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 06:44:53,831 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 06:44:55,161 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 06:44:57,164 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 06:45:24,814 WARN L228 SmtUtils]: Spent 21.56s on a formula simplification. DAG size of input: 70 DAG size of output: 22 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:45:56,010 WARN L228 SmtUtils]: Spent 28.42s on a formula simplification. DAG size of input: 71 DAG size of output: 29 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:46:11,346 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 06:46:14,389 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 06:46:17,459 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 06:46:19,904 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 06:46:23,480 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 06:46:44,823 WARN L228 SmtUtils]: Spent 15.02s on a formula simplification. DAG size of input: 78 DAG size of output: 66 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:46:50,365 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 06:47:22,086 WARN L228 SmtUtils]: Spent 25.68s on a formula simplification. DAG size of input: 88 DAG size of output: 69 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:47:38,084 WARN L228 SmtUtils]: Spent 12.96s on a formula simplification. DAG size of input: 80 DAG size of output: 70 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:47:58,788 WARN L228 SmtUtils]: Spent 17.98s 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 06:48:01,457 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 06:48:03,705 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 06:48:05,713 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 06:48:35,282 WARN L228 SmtUtils]: Spent 20.33s on a formula simplification. DAG size of input: 90 DAG size of output: 72 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:48:38,831 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 06:48:40,883 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 06:48:42,930 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 06:48:45,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 06:48:48,104 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 06:48:50,211 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 06:48:51,297 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 06:48:54,341 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 06:48:56,718 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 06:48:58,026 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 06:49:10,402 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 06:49:12,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 06:49:14,653 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 06:49:16,663 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 06:49:19,198 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 06:49:23,053 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 06:49:24,754 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 06:49:26,784 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 06:49:28,646 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 06:49:31,274 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 06:49:40,143 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 06:49:42,025 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 06:49:44,408 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 06:49:46,345 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 06:49:48,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 06:49:51,823 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 06:50:01,147 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 06:50:03,241 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 06:50:23,880 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 06:50:25,886 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 06:50:28,046 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 06:50:30,646 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 06:50:34,608 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 06:50:37,417 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 06:50:39,424 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 06:50:41,438 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 06:51:08,304 WARN L228 SmtUtils]: Spent 14.70s on a formula simplification. DAG size of input: 77 DAG size of output: 74 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:51:11,412 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 06:51:13,589 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 06:51:24,359 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 06:51:25,878 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 06:51:30,315 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 06:51:32,754 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 06:51:52,409 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 06:51:54,438 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 06:51:56,621 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 06:51:57,871 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 06:51:58,982 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 06:52:00,513 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 06:52:02,529 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 06:52:03,866 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 06:52:06,012 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 06:52:10,854 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 06:52:12,863 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 06:52:15,026 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 06:52:17,041 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 06:52:19,264 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 06:52:21,603 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 06:52:22,904 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 06:52:24,915 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 06:52:26,304 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 06:52:28,937 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 06:52:31,408 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 06:52:35,343 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 06:52:37,440 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 06:52:39,078 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 06:52:42,275 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 06:52:43,714 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 06:52:46,632 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 06:52:49,506 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 06:52:51,514 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 06:52:53,549 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 06:52:55,656 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 06:52:58,761 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 06:53:02,720 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 06:53:05,615 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 06:53:18,949 INFO L129 PetriNetUnfolder]: 12049/21726 cut-off events. [2022-01-19 06:53:18,949 INFO L130 PetriNetUnfolder]: For 103830/104193 co-relation queries the response was YES. [2022-01-19 06:53:19,059 INFO L84 FinitePrefix]: Finished finitePrefix Result has 95363 conditions, 21726 events. 12049/21726 cut-off events. For 103830/104193 co-relation queries the response was YES. Maximal size of possible extension queue 1300. Compared 188831 event pairs, 918 based on Foata normal form. 88/21263 useless extension candidates. Maximal degree in co-relation 95330. Up to 8154 conditions per place. [2022-01-19 06:53:19,202 INFO L132 encePairwiseOnDemand]: 105/125 looper letters, 547 selfloop transitions, 281 changer transitions 20/910 dead transitions. [2022-01-19 06:53:19,202 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 910 transitions, 8706 flow [2022-01-19 06:53:19,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-01-19 06:53:19,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2022-01-19 06:53:19,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 4917 transitions. [2022-01-19 06:53:19,214 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7152 [2022-01-19 06:53:19,214 INFO L72 ComplementDD]: Start complementDD. Operand 55 states and 4917 transitions. [2022-01-19 06:53:19,214 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 4917 transitions. [2022-01-19 06:53:19,217 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:53:19,217 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 55 states and 4917 transitions. [2022-01-19 06:53:19,226 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 56 states, 55 states have (on average 89.4) internal successors, (4917), 55 states have internal predecessors, (4917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:53:19,238 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 56 states, 56 states have (on average 125.0) internal successors, (7000), 56 states have internal predecessors, (7000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:53:19,239 INFO L81 ComplementDD]: Finished complementDD. Result has 56 states, 56 states have (on average 125.0) internal successors, (7000), 56 states have internal predecessors, (7000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:53:19,240 INFO L186 Difference]: Start difference. First operand has 168 places, 150 transitions, 950 flow. Second operand 55 states and 4917 transitions. [2022-01-19 06:53:19,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 910 transitions, 8706 flow [2022-01-19 06:53:19,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 910 transitions, 8563 flow, removed 49 selfloop flow, removed 7 redundant places. [2022-01-19 06:53:19,610 INFO L242 Difference]: Finished difference. Result has 239 places, 424 transitions, 4477 flow [2022-01-19 06:53:19,610 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=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=55, PETRI_FLOW=4477, PETRI_PLACES=239, PETRI_TRANSITIONS=424} [2022-01-19 06:53:19,612 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 128 predicate places. [2022-01-19 06:53:19,612 INFO L470 AbstractCegarLoop]: Abstraction has has 239 places, 424 transitions, 4477 flow [2022-01-19 06:53:19,613 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 06:53:19,613 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:53:19,613 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 06:53:19,621 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 06:53:19,818 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 06:53:19,818 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 06:53:19,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:53:19,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1425971563, now seen corresponding path program 2 times [2022-01-19 06:53:19,819 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:53:19,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539021968] [2022-01-19 06:53:19,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:53:19,819 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:53:19,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:53:20,243 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 06:53:20,243 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:53:20,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539021968] [2022-01-19 06:53:20,243 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539021968] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:53:20,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1107082998] [2022-01-19 06:53:20,243 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 06:53:20,243 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:53:20,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:53:20,248 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 06:53:20,251 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 06:53:20,637 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 06:53:20,637 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 06:53:20,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 17 conjunts are in the unsatisfiable core [2022-01-19 06:53:20,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:53:37,049 INFO L884 QuantifierPusher]: Run 10 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2022-01-19 06:53:39,157 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 06:53:39,157 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:53:52,366 INFO L884 QuantifierPusher]: Run 10 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2022-01-19 06:53:54,004 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 06:53:54,004 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1107082998] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:53:54,004 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:53:54,004 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 26 [2022-01-19 06:53:54,005 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624517320] [2022-01-19 06:53:54,005 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:53:54,006 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-01-19 06:53:54,006 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:53:54,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-01-19 06:53:54,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=512, Unknown=1, NotChecked=0, Total=650 [2022-01-19 06:53:54,008 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 125 [2022-01-19 06:53:54,010 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 424 transitions, 4477 flow. Second operand has 26 states, 26 states have (on average 80.73076923076923) internal successors, (2099), 26 states have internal predecessors, (2099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:53:54,010 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:53:54,010 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 125 [2022-01-19 06:53:54,010 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:53:56,704 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 06:53:58,713 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 06:54:00,725 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 06:54:14,865 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 06:54:16,886 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 06:54:19,821 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 06:54:22,127 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 06:54:24,147 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 06:54:26,575 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 06:54:28,586 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 06:54:30,747 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 06:54:36,498 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 06:54:38,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 06:54:40,738 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 06:54:49,121 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 06:54:55,623 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 06:55:16,238 WARN L228 SmtUtils]: Spent 10.34s on a formula simplification. DAG size of input: 74 DAG size of output: 72 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-19 06:55:19,095 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 06:55:22,134 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 06:55:25,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 06:55:27,132 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 06:55:28,332 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 06:55:37,816 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 06:55:39,844 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 06:55:41,880 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 06:55:46,771 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 06:55:51,695 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 06:55:53,561 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 06:55:56,119 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 06:55:58,947 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 06:56:03,663 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 06:56:05,672 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 06:56:13,974 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 06:56:16,014 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 06:56:19,728 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 06:56:25,273 INFO L129 PetriNetUnfolder]: 16735/29376 cut-off events. [2022-01-19 06:56:25,277 INFO L130 PetriNetUnfolder]: For 224703/224769 co-relation queries the response was YES. [2022-01-19 06:56:25,623 INFO L84 FinitePrefix]: Finished finitePrefix Result has 155399 conditions, 29376 events. 16735/29376 cut-off events. For 224703/224769 co-relation queries the response was YES. Maximal size of possible extension queue 1843. Compared 263166 event pairs, 1823 based on Foata normal form. 23/28948 useless extension candidates. Maximal degree in co-relation 155343. Up to 14513 conditions per place. [2022-01-19 06:56:25,977 INFO L132 encePairwiseOnDemand]: 109/125 looper letters, 530 selfloop transitions, 426 changer transitions 12/1030 dead transitions. [2022-01-19 06:56:25,977 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 1030 transitions, 12988 flow [2022-01-19 06:56:25,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-01-19 06:56:25,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2022-01-19 06:56:25,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 2945 transitions. [2022-01-19 06:56:25,997 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.713939393939394 [2022-01-19 06:56:25,997 INFO L72 ComplementDD]: Start complementDD. Operand 33 states and 2945 transitions. [2022-01-19 06:56:25,997 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 2945 transitions. [2022-01-19 06:56:25,998 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 06:56:25,998 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 33 states and 2945 transitions. [2022-01-19 06:56:26,004 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 34 states, 33 states have (on average 89.24242424242425) internal successors, (2945), 33 states have internal predecessors, (2945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:56:26,010 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 34 states, 34 states have (on average 125.0) internal successors, (4250), 34 states have internal predecessors, (4250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:56:26,011 INFO L81 ComplementDD]: Finished complementDD. Result has 34 states, 34 states have (on average 125.0) internal successors, (4250), 34 states have internal predecessors, (4250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:56:26,012 INFO L186 Difference]: Start difference. First operand has 239 places, 424 transitions, 4477 flow. Second operand 33 states and 2945 transitions. [2022-01-19 06:56:26,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 1030 transitions, 12988 flow [2022-01-19 06:56:27,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 1030 transitions, 12163 flow, removed 400 selfloop flow, removed 12 redundant places. [2022-01-19 06:56:27,757 INFO L242 Difference]: Finished difference. Result has 265 places, 723 transitions, 9287 flow [2022-01-19 06:56:27,757 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=3946, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=424, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=177, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=9287, PETRI_PLACES=265, PETRI_TRANSITIONS=723} [2022-01-19 06:56:27,758 INFO L334 CegarLoopForPetriNet]: 111 programPoint places, 154 predicate places. [2022-01-19 06:56:27,758 INFO L470 AbstractCegarLoop]: Abstraction has has 265 places, 723 transitions, 9287 flow [2022-01-19 06:56:27,759 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 80.73076923076923) internal successors, (2099), 26 states have internal predecessors, (2099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:56:27,759 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 06:56:27,759 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-19 06:56:27,765 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-01-19 06:56:27,963 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 06:56:27,963 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 06:56:27,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 06:56:27,964 INFO L85 PathProgramCache]: Analyzing trace with hash 197601397, now seen corresponding path program 1 times [2022-01-19 06:56:27,964 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 06:56:27,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854072790] [2022-01-19 06:56:27,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:56:27,965 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 06:56:28,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:56:28,681 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 06:56:28,681 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 06:56:28,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854072790] [2022-01-19 06:56:28,681 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854072790] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 06:56:28,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1079414811] [2022-01-19 06:56:28,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 06:56:28,682 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 06:56:28,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 06:56:28,683 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 06:56:28,725 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 06:56:28,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 06:56:28,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 19 conjunts are in the unsatisfiable core [2022-01-19 06:56:28,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 06:56:40,774 INFO L884 QuantifierPusher]: Run 10 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2022-01-19 06:56:41,624 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 06:56:41,624 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 06:57:02,611 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 06:57:02,611 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1079414811] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 06:57:02,611 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 06:57:02,611 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 28 [2022-01-19 06:57:02,612 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826351113] [2022-01-19 06:57:02,612 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 06:57:02,612 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-01-19 06:57:02,612 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 06:57:02,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-01-19 06:57:02,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=581, Unknown=1, NotChecked=0, Total=756 [2022-01-19 06:57:02,615 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 125 [2022-01-19 06:57:02,617 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 723 transitions, 9287 flow. Second operand has 28 states, 28 states have (on average 80.64285714285714) internal successors, (2258), 28 states have internal predecessors, (2258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 06:57:02,617 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 06:57:02,617 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 125 [2022-01-19 06:57:02,617 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 06:57:06,823 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 06:57:09,388 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 06:57:12,488 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 06:57:14,504 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 06:57:19,447 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 06:57:27,537 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 06:57:29,571 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 06:57:32,917 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 06:57:35,386 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-01-19 06:57:46,806 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 06:57:48,814 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 06:57:51,300 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 06:57:53,308 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 06:58:01,937 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 06:58:12,889 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 06:58:16,634 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 [] Received shutdown request... [2022-01-19 06:58:18,498 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 06:58:18,498 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 06:58:18,653 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 06:58:18,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-01-19 06:58:18,874 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-01-19 06:58:18,878 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-01-19 06:58:19,074 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 06:58:19,074 WARN L594 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (28states, 78/125 universal loopers) in iteration 12,while PetriNetUnfolder was constructing finite prefix that currently has 36963 conditions, 5715 events (3083/5714 cut-off events. For 70526/70559 co-relation queries the response was YES. Maximal size of possible extension queue 1608. Compared 53553 event pairs, 568 based on Foata normal form. 1/6702 useless extension candidates. Maximal degree in co-relation 36901. Up to 3112 conditions per place.). [2022-01-19 06:58:19,076 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (3 of 5 remaining) [2022-01-19 06:58:19,076 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (2 of 5 remaining) [2022-01-19 06:58:19,076 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATION (1 of 5 remaining) [2022-01-19 06:58:19,076 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATION (0 of 5 remaining) [2022-01-19 06:58:19,082 INFO L732 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1, 1, 1] [2022-01-19 06:58:19,084 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-01-19 06:58:19,084 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-19 06:58:19,085 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.01 06:58:19 BasicIcfg [2022-01-19 06:58:19,086 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-19 06:58:19,086 INFO L158 Benchmark]: Toolchain (without parser) took 864023.62ms. Allocated memory was 400.6MB in the beginning and 847.2MB in the end (delta: 446.7MB). Free memory was 342.4MB in the beginning and 650.9MB in the end (delta: -308.5MB). Peak memory consumption was 653.6MB. Max. memory is 16.0GB. [2022-01-19 06:58:19,087 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 400.6MB. Free memory was 358.8MB in the beginning and 358.7MB in the end (delta: 69.5kB). There was no memory consumed. Max. memory is 16.0GB. [2022-01-19 06:58:19,087 INFO L158 Benchmark]: CACSL2BoogieTranslator took 207.57ms. Allocated memory was 400.6MB in the beginning and 545.3MB in the end (delta: 144.7MB). Free memory was 342.2MB in the beginning and 514.3MB in the end (delta: -172.1MB). Peak memory consumption was 8.5MB. Max. memory is 16.0GB. [2022-01-19 06:58:19,087 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.29ms. Allocated memory is still 545.3MB. Free memory was 514.3MB in the beginning and 512.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-19 06:58:19,088 INFO L158 Benchmark]: Boogie Preprocessor took 37.21ms. Allocated memory is still 545.3MB. Free memory was 512.2MB in the beginning and 511.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.0GB. [2022-01-19 06:58:19,088 INFO L158 Benchmark]: RCFGBuilder took 362.02ms. Allocated memory is still 545.3MB. Free memory was 511.2MB in the beginning and 494.4MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.0GB. [2022-01-19 06:58:19,088 INFO L158 Benchmark]: TraceAbstraction took 863374.67ms. Allocated memory was 545.3MB in the beginning and 847.2MB in the end (delta: 302.0MB). Free memory was 494.4MB in the beginning and 650.9MB in the end (delta: -156.6MB). Peak memory consumption was 662.9MB. Max. memory is 16.0GB. [2022-01-19 06:58:19,089 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.11ms. Allocated memory is still 400.6MB. Free memory was 358.8MB in the beginning and 358.7MB in the end (delta: 69.5kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 207.57ms. Allocated memory was 400.6MB in the beginning and 545.3MB in the end (delta: 144.7MB). Free memory was 342.2MB in the beginning and 514.3MB in the end (delta: -172.1MB). Peak memory consumption was 8.5MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 37.29ms. Allocated memory is still 545.3MB. Free memory was 514.3MB in the beginning and 512.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 37.21ms. Allocated memory is still 545.3MB. Free memory was 512.2MB in the beginning and 511.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.0GB. * RCFGBuilder took 362.02ms. Allocated memory is still 545.3MB. Free memory was 511.2MB in the beginning and 494.4MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.0GB. * TraceAbstraction took 863374.67ms. Allocated memory was 545.3MB in the beginning and 847.2MB in the end (delta: 302.0MB). Free memory was 494.4MB in the beginning and 650.9MB in the end (delta: -156.6MB). Peak memory consumption was 662.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 enhancing Floyd-Hoare automaton (28states, 78/125 universal loopers) in iteration 12,while PetriNetUnfolder was constructing finite prefix that currently has 36963 conditions, 5715 events (3083/5714 cut-off events. For 70526/70559 co-relation queries the response was YES. Maximal size of possible extension queue 1608. Compared 53553 event pairs, 568 based on Foata normal form. 1/6702 useless extension candidates. Maximal degree in co-relation 36901. Up to 3112 conditions per place.). - 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 enhancing Floyd-Hoare automaton (28states, 78/125 universal loopers) in iteration 12,while PetriNetUnfolder was constructing finite prefix that currently has 36963 conditions, 5715 events (3083/5714 cut-off events. For 70526/70559 co-relation queries the response was YES. Maximal size of possible extension queue 1608. Compared 53553 event pairs, 568 based on Foata normal form. 1/6702 useless extension candidates. Maximal degree in co-relation 36901. Up to 3112 conditions per place.). - 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 enhancing Floyd-Hoare automaton (28states, 78/125 universal loopers) in iteration 12,while PetriNetUnfolder was constructing finite prefix that currently has 36963 conditions, 5715 events (3083/5714 cut-off events. For 70526/70559 co-relation queries the response was YES. Maximal size of possible extension queue 1608. Compared 53553 event pairs, 568 based on Foata normal form. 1/6702 useless extension candidates. Maximal degree in co-relation 36901. Up to 3112 conditions per place.). - 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 enhancing Floyd-Hoare automaton (28states, 78/125 universal loopers) in iteration 12,while PetriNetUnfolder was constructing finite prefix that currently has 36963 conditions, 5715 events (3083/5714 cut-off events. For 70526/70559 co-relation queries the response was YES. Maximal size of possible extension queue 1608. Compared 53553 event pairs, 568 based on Foata normal form. 1/6702 useless extension candidates. Maximal degree in co-relation 36901. Up to 3112 conditions per place.). - 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 enhancing Floyd-Hoare automaton (28states, 78/125 universal loopers) in iteration 12,while PetriNetUnfolder was constructing finite prefix that currently has 36963 conditions, 5715 events (3083/5714 cut-off events. For 70526/70559 co-relation queries the response was YES. Maximal size of possible extension queue 1608. Compared 53553 event pairs, 568 based on Foata normal form. 1/6702 useless extension candidates. Maximal degree in co-relation 36901. Up to 3112 conditions per place.). - 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: 863.3s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 746.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 102 mSolverCounterUnknown, 2332 SdHoareTripleChecker+Valid, 374.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2332 mSDsluCounter, 682 SdHoareTripleChecker+Invalid, 371.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2090 mSDsCounter, 272 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6592 IncrementalHoareTripleChecker+Invalid, 6966 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 272 mSolverCounterUnsat, 192 mSDtfsCounter, 6592 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1142 GetRequests, 905 SyntacticMatches, 10 SemanticMatches, 227 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2767 ImplicationChecksByTransitivity, 432.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9287occurred in iteration=11, InterpolantAutomatonStates: 157, 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, 1.2s SatisfiabilityAnalysisTime, 114.0s InterpolantComputationTime, 1606 NumberOfCodeBlocks, 1606 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 2060 ConstructedInterpolants, 0 QuantifiedInterpolants, 45439 SizeOfPredicates, 59 NumberOfNonLiveVariables, 1264 ConjunctsInSsa, 67 ConjunctsInUnsatCore, 22 InterpolantComputations, 7 PerfectInterpolantSequences, 6/29 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