/usr/bin/java -Xmx8000000000 -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-SemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/bench-exp2x9.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 20:49:46,369 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 20:49:46,372 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 20:49:46,430 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 20:49:46,433 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 20:49:46,436 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 20:49:46,439 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 20:49:46,443 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 20:49:46,448 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 20:49:46,448 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 20:49:46,449 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 20:49:46,450 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 20:49:46,450 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 20:49:46,451 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 20:49:46,452 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 20:49:46,453 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 20:49:46,453 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 20:49:46,454 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 20:49:46,456 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 20:49:46,457 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 20:49:46,458 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 20:49:46,468 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 20:49:46,470 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 20:49:46,472 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 20:49:46,486 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 20:49:46,486 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 20:49:46,487 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 20:49:46,488 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 20:49:46,489 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 20:49:46,489 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 20:49:46,490 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 20:49:46,491 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 20:49:46,493 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 20:49:46,493 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 20:49:46,494 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 20:49:46,494 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 20:49:46,495 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 20:49:46,495 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 20:49:46,495 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 20:49:46,496 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 20:49:46,496 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 20:49:46,497 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-SemanticLbe.epf [2022-12-05 20:49:46,532 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 20:49:46,533 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 20:49:46,534 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-05 20:49:46,534 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-05 20:49:46,535 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 20:49:46,535 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 20:49:46,535 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 20:49:46,536 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 20:49:46,536 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 20:49:46,536 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 20:49:46,537 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 20:49:46,537 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 20:49:46,537 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 20:49:46,537 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 20:49:46,537 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 20:49:46,537 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 20:49:46,537 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 20:49:46,538 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 20:49:46,538 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 20:49:46,538 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 20:49:46,538 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 20:49:46,538 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 20:49:46,538 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 20:49:46,538 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 20:49:46,539 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 20:49:46,539 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 20:49:46,539 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 20:49:46,539 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 20:49:46,539 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 20:49:46,539 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-05 20:49:46,540 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-12-05 20:49:46,844 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 20:49:46,860 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 20:49:46,862 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 20:49:46,863 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 20:49:46,864 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 20:49:46,866 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp2x9.wvr.c [2022-12-05 20:49:48,081 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 20:49:48,307 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 20:49:48,308 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x9.wvr.c [2022-12-05 20:49:48,313 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03174fe6b/65e2636b99f142b69d64d8341023c2a2/FLAG17acda2b8 [2022-12-05 20:49:48,323 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03174fe6b/65e2636b99f142b69d64d8341023c2a2 [2022-12-05 20:49:48,325 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 20:49:48,327 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 20:49:48,327 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 20:49:48,328 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 20:49:48,330 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 20:49:48,331 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 08:49:48" (1/1) ... [2022-12-05 20:49:48,331 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@351be6df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:49:48, skipping insertion in model container [2022-12-05 20:49:48,331 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 08:49:48" (1/1) ... [2022-12-05 20:49:48,337 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 20:49:48,358 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 20:49:48,539 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x9.wvr.c[2669,2682] [2022-12-05 20:49:48,543 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 20:49:48,553 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 20:49:48,589 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x9.wvr.c[2669,2682] [2022-12-05 20:49:48,590 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 20:49:48,607 INFO L208 MainTranslator]: Completed translation [2022-12-05 20:49:48,607 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:49:48 WrapperNode [2022-12-05 20:49:48,608 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 20:49:48,610 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 20:49:48,610 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 20:49:48,610 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 20:49:48,616 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:49:48" (1/1) ... [2022-12-05 20:49:48,631 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:49:48" (1/1) ... [2022-12-05 20:49:48,660 INFO L138 Inliner]: procedures = 20, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 91 [2022-12-05 20:49:48,661 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 20:49:48,662 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 20:49:48,662 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 20:49:48,662 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 20:49:48,669 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:49:48" (1/1) ... [2022-12-05 20:49:48,669 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:49:48" (1/1) ... [2022-12-05 20:49:48,683 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:49:48" (1/1) ... [2022-12-05 20:49:48,683 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:49:48" (1/1) ... [2022-12-05 20:49:48,687 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:49:48" (1/1) ... [2022-12-05 20:49:48,690 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:49:48" (1/1) ... [2022-12-05 20:49:48,691 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:49:48" (1/1) ... [2022-12-05 20:49:48,692 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:49:48" (1/1) ... [2022-12-05 20:49:48,694 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 20:49:48,695 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 20:49:48,695 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 20:49:48,695 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 20:49:48,696 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:49:48" (1/1) ... [2022-12-05 20:49:48,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 20:49:48,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 20:49:48,723 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-12-05 20:49:48,745 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-12-05 20:49:48,762 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 20:49:48,762 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-05 20:49:48,762 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-05 20:49:48,762 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-05 20:49:48,762 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-05 20:49:48,762 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-05 20:49:48,762 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-05 20:49:48,763 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-12-05 20:49:48,763 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-12-05 20:49:48,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 20:49:48,763 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 20:49:48,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 20:49:48,763 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 20:49:48,763 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 20:49:48,763 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-05 20:49:48,763 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 20:49:48,765 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 20:49:48,870 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 20:49:48,872 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 20:49:49,116 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 20:49:49,123 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 20:49:49,123 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-05 20:49:49,125 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 08:49:49 BoogieIcfgContainer [2022-12-05 20:49:49,125 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 20:49:49,126 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 20:49:49,127 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 20:49:49,129 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 20:49:49,129 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 08:49:48" (1/3) ... [2022-12-05 20:49:49,130 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50e0aad4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 08:49:49, skipping insertion in model container [2022-12-05 20:49:49,130 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:49:48" (2/3) ... [2022-12-05 20:49:49,130 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50e0aad4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 08:49:49, skipping insertion in model container [2022-12-05 20:49:49,130 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 08:49:49" (3/3) ... [2022-12-05 20:49:49,131 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp2x9.wvr.c [2022-12-05 20:49:49,146 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 20:49:49,146 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-05 20:49:49,146 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 20:49:49,212 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-12-05 20:49:49,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 145 places, 142 transitions, 316 flow [2022-12-05 20:49:49,306 INFO L130 PetriNetUnfolder]: 10/138 cut-off events. [2022-12-05 20:49:49,306 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-05 20:49:49,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 138 events. 10/138 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 134 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 97. Up to 2 conditions per place. [2022-12-05 20:49:49,313 INFO L82 GeneralOperation]: Start removeDead. Operand has 145 places, 142 transitions, 316 flow [2022-12-05 20:49:49,318 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 129 places, 126 transitions, 276 flow [2022-12-05 20:49:49,319 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 20:49:49,333 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 129 places, 126 transitions, 276 flow [2022-12-05 20:49:49,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 129 places, 126 transitions, 276 flow [2022-12-05 20:49:49,368 INFO L130 PetriNetUnfolder]: 10/126 cut-off events. [2022-12-05 20:49:49,368 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-05 20:49:49,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143 conditions, 126 events. 10/126 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 133 event pairs, 0 based on Foata normal form. 0/116 useless extension candidates. Maximal degree in co-relation 97. Up to 2 conditions per place. [2022-12-05 20:49:49,373 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 129 places, 126 transitions, 276 flow [2022-12-05 20:49:49,373 INFO L188 LiptonReduction]: Number of co-enabled transitions 3312 [2022-12-05 20:49:54,997 INFO L203 LiptonReduction]: Total number of compositions: 101 [2022-12-05 20:49:55,019 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 20:49:55,027 INFO L357 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@64525fd3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 20:49:55,027 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-05 20:49:55,046 INFO L130 PetriNetUnfolder]: 4/24 cut-off events. [2022-12-05 20:49:55,046 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-05 20:49:55,047 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:49:55,047 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:49:55,048 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 20:49:55,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:49:55,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1738926514, now seen corresponding path program 1 times [2022-12-05 20:49:55,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:49:55,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592626243] [2022-12-05 20:49:55,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:49:55,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:49:55,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:49:55,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:49:55,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:49:55,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592626243] [2022-12-05 20:49:55,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592626243] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:49:55,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:49:55,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 20:49:55,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047738890] [2022-12-05 20:49:55,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:49:55,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 20:49:55,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:49:55,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 20:49:55,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 20:49:55,634 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-05 20:49:55,635 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 74 flow. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:49:55,635 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:49:55,636 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-05 20:49:55,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:49:55,797 INFO L130 PetriNetUnfolder]: 497/677 cut-off events. [2022-12-05 20:49:55,797 INFO L131 PetriNetUnfolder]: For 45/45 co-relation queries the response was YES. [2022-12-05 20:49:55,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1448 conditions, 677 events. 497/677 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1759 event pairs, 117 based on Foata normal form. 1/414 useless extension candidates. Maximal degree in co-relation 1016. Up to 471 conditions per place. [2022-12-05 20:49:55,807 INFO L137 encePairwiseOnDemand]: 19/25 looper letters, 41 selfloop transitions, 5 changer transitions 1/47 dead transitions. [2022-12-05 20:49:55,807 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 47 transitions, 233 flow [2022-12-05 20:49:55,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 20:49:55,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 20:49:55,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2022-12-05 20:49:55,818 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.64 [2022-12-05 20:49:55,819 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 74 flow. Second operand 3 states and 48 transitions. [2022-12-05 20:49:55,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 47 transitions, 233 flow [2022-12-05 20:49:55,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 47 transitions, 203 flow, removed 0 selfloop flow, removed 8 redundant places. [2022-12-05 20:49:55,827 INFO L231 Difference]: Finished difference. Result has 29 places, 29 transitions, 91 flow [2022-12-05 20:49:55,829 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=91, PETRI_PLACES=29, PETRI_TRANSITIONS=29} [2022-12-05 20:49:55,833 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, -5 predicate places. [2022-12-05 20:49:55,833 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 29 transitions, 91 flow [2022-12-05 20:49:55,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:49:55,834 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:49:55,834 INFO L213 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] [2022-12-05 20:49:55,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 20:49:55,835 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 20:49:55,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:49:55,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1759079634, now seen corresponding path program 1 times [2022-12-05 20:49:55,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:49:55,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838030226] [2022-12-05 20:49:55,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:49:55,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:49:55,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:49:56,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:49:56,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:49:56,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838030226] [2022-12-05 20:49:56,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838030226] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:49:56,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:49:56,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:49:56,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787237020] [2022-12-05 20:49:56,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:49:56,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:49:56,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:49:56,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:49:56,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:49:56,102 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-05 20:49:56,103 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 29 transitions, 91 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:49:56,103 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:49:56,106 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-05 20:49:56,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:49:56,341 INFO L130 PetriNetUnfolder]: 699/957 cut-off events. [2022-12-05 20:49:56,341 INFO L131 PetriNetUnfolder]: For 344/344 co-relation queries the response was YES. [2022-12-05 20:49:56,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2436 conditions, 957 events. 699/957 cut-off events. For 344/344 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2889 event pairs, 35 based on Foata normal form. 26/983 useless extension candidates. Maximal degree in co-relation 838. Up to 461 conditions per place. [2022-12-05 20:49:56,346 INFO L137 encePairwiseOnDemand]: 20/25 looper letters, 72 selfloop transitions, 10 changer transitions 0/82 dead transitions. [2022-12-05 20:49:56,347 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 82 transitions, 405 flow [2022-12-05 20:49:56,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 20:49:56,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 20:49:56,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 76 transitions. [2022-12-05 20:49:56,348 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.608 [2022-12-05 20:49:56,348 INFO L175 Difference]: Start difference. First operand has 29 places, 29 transitions, 91 flow. Second operand 5 states and 76 transitions. [2022-12-05 20:49:56,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 82 transitions, 405 flow [2022-12-05 20:49:56,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 82 transitions, 397 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 20:49:56,351 INFO L231 Difference]: Finished difference. Result has 34 places, 36 transitions, 151 flow [2022-12-05 20:49:56,351 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=151, PETRI_PLACES=34, PETRI_TRANSITIONS=36} [2022-12-05 20:49:56,352 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 0 predicate places. [2022-12-05 20:49:56,352 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 36 transitions, 151 flow [2022-12-05 20:49:56,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:49:56,352 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:49:56,352 INFO L213 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] [2022-12-05 20:49:56,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 20:49:56,353 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 20:49:56,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:49:56,353 INFO L85 PathProgramCache]: Analyzing trace with hash -151813910, now seen corresponding path program 2 times [2022-12-05 20:49:56,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:49:56,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858843992] [2022-12-05 20:49:56,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:49:56,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:49:56,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:49:56,476 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:49:56,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:49:56,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858843992] [2022-12-05 20:49:56,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858843992] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:49:56,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:49:56,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:49:56,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083024880] [2022-12-05 20:49:56,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:49:56,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:49:56,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:49:56,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:49:56,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:49:56,478 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-05 20:49:56,478 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 36 transitions, 151 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:49:56,478 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:49:56,478 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-05 20:49:56,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:49:56,662 INFO L130 PetriNetUnfolder]: 811/1105 cut-off events. [2022-12-05 20:49:56,662 INFO L131 PetriNetUnfolder]: For 909/909 co-relation queries the response was YES. [2022-12-05 20:49:56,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3381 conditions, 1105 events. 811/1105 cut-off events. For 909/909 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3354 event pairs, 233 based on Foata normal form. 36/1141 useless extension candidates. Maximal degree in co-relation 955. Up to 523 conditions per place. [2022-12-05 20:49:56,669 INFO L137 encePairwiseOnDemand]: 20/25 looper letters, 72 selfloop transitions, 10 changer transitions 0/82 dead transitions. [2022-12-05 20:49:56,669 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 82 transitions, 456 flow [2022-12-05 20:49:56,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 20:49:56,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 20:49:56,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 76 transitions. [2022-12-05 20:49:56,670 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.608 [2022-12-05 20:49:56,670 INFO L175 Difference]: Start difference. First operand has 34 places, 36 transitions, 151 flow. Second operand 5 states and 76 transitions. [2022-12-05 20:49:56,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 82 transitions, 456 flow [2022-12-05 20:49:56,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 82 transitions, 456 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-05 20:49:56,674 INFO L231 Difference]: Finished difference. Result has 40 places, 39 transitions, 205 flow [2022-12-05 20:49:56,675 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=205, PETRI_PLACES=40, PETRI_TRANSITIONS=39} [2022-12-05 20:49:56,675 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 6 predicate places. [2022-12-05 20:49:56,675 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 39 transitions, 205 flow [2022-12-05 20:49:56,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:49:56,676 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:49:56,676 INFO L213 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] [2022-12-05 20:49:56,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 20:49:56,676 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 20:49:56,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:49:56,676 INFO L85 PathProgramCache]: Analyzing trace with hash 43416820, now seen corresponding path program 1 times [2022-12-05 20:49:56,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:49:56,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602596223] [2022-12-05 20:49:56,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:49:56,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:49:56,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:49:56,823 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:49:56,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:49:56,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602596223] [2022-12-05 20:49:56,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602596223] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 20:49:56,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [982199258] [2022-12-05 20:49:56,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:49:56,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 20:49:56,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 20:49:56,831 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-12-05 20:49:56,880 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-12-05 20:49:56,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:49:56,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-05 20:49:56,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 20:49:57,318 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:49:57,318 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 20:49:57,376 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:49:57,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [982199258] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 20:49:57,377 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 20:49:57,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-05 20:49:57,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777406741] [2022-12-05 20:49:57,377 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 20:49:57,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 20:49:57,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:49:57,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 20:49:57,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-05 20:49:57,380 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-05 20:49:57,380 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 39 transitions, 205 flow. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:49:57,380 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:49:57,380 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-05 20:49:57,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:49:57,822 INFO L130 PetriNetUnfolder]: 1503/2055 cut-off events. [2022-12-05 20:49:57,823 INFO L131 PetriNetUnfolder]: For 3695/3695 co-relation queries the response was YES. [2022-12-05 20:49:57,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7162 conditions, 2055 events. 1503/2055 cut-off events. For 3695/3695 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 7511 event pairs, 103 based on Foata normal form. 72/2127 useless extension candidates. Maximal degree in co-relation 3855. Up to 882 conditions per place. [2022-12-05 20:49:57,837 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 115 selfloop transitions, 11 changer transitions 1/127 dead transitions. [2022-12-05 20:49:57,837 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 127 transitions, 892 flow [2022-12-05 20:49:57,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 20:49:57,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 20:49:57,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 96 transitions. [2022-12-05 20:49:57,842 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.64 [2022-12-05 20:49:57,842 INFO L175 Difference]: Start difference. First operand has 40 places, 39 transitions, 205 flow. Second operand 6 states and 96 transitions. [2022-12-05 20:49:57,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 127 transitions, 892 flow [2022-12-05 20:49:57,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 127 transitions, 863 flow, removed 8 selfloop flow, removed 1 redundant places. [2022-12-05 20:49:57,852 INFO L231 Difference]: Finished difference. Result has 47 places, 44 transitions, 255 flow [2022-12-05 20:49:57,853 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=255, PETRI_PLACES=47, PETRI_TRANSITIONS=44} [2022-12-05 20:49:57,854 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 13 predicate places. [2022-12-05 20:49:57,854 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 44 transitions, 255 flow [2022-12-05 20:49:57,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:49:57,854 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:49:57,854 INFO L213 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] [2022-12-05 20:49:57,864 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-12-05 20:49:58,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 20:49:58,060 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 20:49:58,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:49:58,061 INFO L85 PathProgramCache]: Analyzing trace with hash -444036910, now seen corresponding path program 1 times [2022-12-05 20:49:58,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:49:58,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957584295] [2022-12-05 20:49:58,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:49:58,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:49:58,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:49:58,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:49:58,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:49:58,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957584295] [2022-12-05 20:49:58,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957584295] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:49:58,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:49:58,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:49:58,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727080134] [2022-12-05 20:49:58,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:49:58,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:49:58,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:49:58,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:49:58,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:49:58,184 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-05 20:49:58,185 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 44 transitions, 255 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:49:58,185 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:49:58,185 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-05 20:49:58,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:49:58,453 INFO L130 PetriNetUnfolder]: 1445/1997 cut-off events. [2022-12-05 20:49:58,454 INFO L131 PetriNetUnfolder]: For 5290/5290 co-relation queries the response was YES. [2022-12-05 20:49:58,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7978 conditions, 1997 events. 1445/1997 cut-off events. For 5290/5290 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 7476 event pairs, 119 based on Foata normal form. 58/2055 useless extension candidates. Maximal degree in co-relation 4487. Up to 831 conditions per place. [2022-12-05 20:49:58,468 INFO L137 encePairwiseOnDemand]: 20/25 looper letters, 91 selfloop transitions, 8 changer transitions 0/99 dead transitions. [2022-12-05 20:49:58,468 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 99 transitions, 683 flow [2022-12-05 20:49:58,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 20:49:58,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 20:49:58,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 75 transitions. [2022-12-05 20:49:58,470 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6 [2022-12-05 20:49:58,470 INFO L175 Difference]: Start difference. First operand has 47 places, 44 transitions, 255 flow. Second operand 5 states and 75 transitions. [2022-12-05 20:49:58,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 99 transitions, 683 flow [2022-12-05 20:49:58,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 99 transitions, 676 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 20:49:58,480 INFO L231 Difference]: Finished difference. Result has 51 places, 43 transitions, 263 flow [2022-12-05 20:49:58,480 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=263, PETRI_PLACES=51, PETRI_TRANSITIONS=43} [2022-12-05 20:49:58,482 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 17 predicate places. [2022-12-05 20:49:58,482 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 43 transitions, 263 flow [2022-12-05 20:49:58,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:49:58,482 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:49:58,482 INFO L213 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] [2022-12-05 20:49:58,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-05 20:49:58,483 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 20:49:58,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:49:58,483 INFO L85 PathProgramCache]: Analyzing trace with hash 236007172, now seen corresponding path program 2 times [2022-12-05 20:49:58,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:49:58,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233760092] [2022-12-05 20:49:58,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:49:58,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:49:58,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:49:58,675 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:49:58,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:49:58,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233760092] [2022-12-05 20:49:58,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233760092] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:49:58,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:49:58,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:49:58,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579390504] [2022-12-05 20:49:58,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:49:58,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:49:58,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:49:58,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:49:58,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:49:58,678 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-05 20:49:58,678 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 263 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:49:58,678 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:49:58,678 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-05 20:49:58,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:49:58,916 INFO L130 PetriNetUnfolder]: 1275/1751 cut-off events. [2022-12-05 20:49:58,916 INFO L131 PetriNetUnfolder]: For 5366/5366 co-relation queries the response was YES. [2022-12-05 20:49:58,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7328 conditions, 1751 events. 1275/1751 cut-off events. For 5366/5366 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 6131 event pairs, 65 based on Foata normal form. 34/1785 useless extension candidates. Maximal degree in co-relation 4225. Up to 710 conditions per place. [2022-12-05 20:49:58,930 INFO L137 encePairwiseOnDemand]: 20/25 looper letters, 102 selfloop transitions, 11 changer transitions 0/113 dead transitions. [2022-12-05 20:49:58,930 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 113 transitions, 919 flow [2022-12-05 20:49:58,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 20:49:58,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 20:49:58,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2022-12-05 20:49:58,932 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.576 [2022-12-05 20:49:58,932 INFO L175 Difference]: Start difference. First operand has 51 places, 43 transitions, 263 flow. Second operand 5 states and 72 transitions. [2022-12-05 20:49:58,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 113 transitions, 919 flow [2022-12-05 20:49:58,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 113 transitions, 894 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-05 20:49:58,941 INFO L231 Difference]: Finished difference. Result has 55 places, 48 transitions, 313 flow [2022-12-05 20:49:58,941 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=313, PETRI_PLACES=55, PETRI_TRANSITIONS=48} [2022-12-05 20:49:58,944 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 21 predicate places. [2022-12-05 20:49:58,944 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 48 transitions, 313 flow [2022-12-05 20:49:58,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:49:58,944 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:49:58,944 INFO L213 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] [2022-12-05 20:49:58,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 20:49:58,944 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 20:49:58,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:49:58,945 INFO L85 PathProgramCache]: Analyzing trace with hash 636522545, now seen corresponding path program 1 times [2022-12-05 20:49:58,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:49:58,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458867149] [2022-12-05 20:49:58,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:49:58,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:49:58,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:49:59,127 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:49:59,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:49:59,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458867149] [2022-12-05 20:49:59,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458867149] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:49:59,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:49:59,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:49:59,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935694264] [2022-12-05 20:49:59,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:49:59,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:49:59,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:49:59,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:49:59,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:49:59,129 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-05 20:49:59,129 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 48 transitions, 313 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:49:59,129 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:49:59,130 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-05 20:49:59,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:49:59,399 INFO L130 PetriNetUnfolder]: 1259/1735 cut-off events. [2022-12-05 20:49:59,399 INFO L131 PetriNetUnfolder]: For 5392/5392 co-relation queries the response was YES. [2022-12-05 20:49:59,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7856 conditions, 1735 events. 1259/1735 cut-off events. For 5392/5392 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 5988 event pairs, 261 based on Foata normal form. 16/1751 useless extension candidates. Maximal degree in co-relation 5018. Up to 1529 conditions per place. [2022-12-05 20:49:59,416 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 62 selfloop transitions, 9 changer transitions 11/82 dead transitions. [2022-12-05 20:49:59,417 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 82 transitions, 629 flow [2022-12-05 20:49:59,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 20:49:59,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 20:49:59,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2022-12-05 20:49:59,418 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.61 [2022-12-05 20:49:59,418 INFO L175 Difference]: Start difference. First operand has 55 places, 48 transitions, 313 flow. Second operand 4 states and 61 transitions. [2022-12-05 20:49:59,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 82 transitions, 629 flow [2022-12-05 20:49:59,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 82 transitions, 617 flow, removed 6 selfloop flow, removed 0 redundant places. [2022-12-05 20:49:59,427 INFO L231 Difference]: Finished difference. Result has 59 places, 51 transitions, 364 flow [2022-12-05 20:49:59,427 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=364, PETRI_PLACES=59, PETRI_TRANSITIONS=51} [2022-12-05 20:49:59,428 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 25 predicate places. [2022-12-05 20:49:59,429 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 51 transitions, 364 flow [2022-12-05 20:49:59,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:49:59,429 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:49:59,429 INFO L213 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] [2022-12-05 20:49:59,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 20:49:59,429 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 20:49:59,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:49:59,430 INFO L85 PathProgramCache]: Analyzing trace with hash 441524475, now seen corresponding path program 2 times [2022-12-05 20:49:59,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:49:59,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690055437] [2022-12-05 20:49:59,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:49:59,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:49:59,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:49:59,588 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:49:59,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:49:59,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690055437] [2022-12-05 20:49:59,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690055437] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 20:49:59,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1591576838] [2022-12-05 20:49:59,589 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-05 20:49:59,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 20:49:59,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 20:49:59,596 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-12-05 20:49:59,599 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-12-05 20:49:59,687 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-05 20:49:59,687 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 20:49:59,688 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-05 20:49:59,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 20:49:59,771 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:49:59,772 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 20:49:59,819 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:49:59,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1591576838] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 20:49:59,820 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 20:49:59,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-05 20:49:59,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487179980] [2022-12-05 20:49:59,820 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 20:49:59,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 20:49:59,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:49:59,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 20:49:59,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-05 20:49:59,821 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-05 20:49:59,821 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 51 transitions, 364 flow. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:49:59,822 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:49:59,822 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-05 20:49:59,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:50:00,184 INFO L130 PetriNetUnfolder]: 1555/2145 cut-off events. [2022-12-05 20:50:00,184 INFO L131 PetriNetUnfolder]: For 6492/6492 co-relation queries the response was YES. [2022-12-05 20:50:00,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9738 conditions, 2145 events. 1555/2145 cut-off events. For 6492/6492 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 7790 event pairs, 187 based on Foata normal form. 68/2213 useless extension candidates. Maximal degree in co-relation 6135. Up to 1119 conditions per place. [2022-12-05 20:50:00,201 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 120 selfloop transitions, 13 changer transitions 3/136 dead transitions. [2022-12-05 20:50:00,202 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 136 transitions, 1092 flow [2022-12-05 20:50:00,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-05 20:50:00,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-05 20:50:00,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 96 transitions. [2022-12-05 20:50:00,203 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.64 [2022-12-05 20:50:00,203 INFO L175 Difference]: Start difference. First operand has 59 places, 51 transitions, 364 flow. Second operand 6 states and 96 transitions. [2022-12-05 20:50:00,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 136 transitions, 1092 flow [2022-12-05 20:50:00,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 136 transitions, 1078 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-05 20:50:00,213 INFO L231 Difference]: Finished difference. Result has 64 places, 54 transitions, 411 flow [2022-12-05 20:50:00,213 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=411, PETRI_PLACES=64, PETRI_TRANSITIONS=54} [2022-12-05 20:50:00,213 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 30 predicate places. [2022-12-05 20:50:00,213 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 54 transitions, 411 flow [2022-12-05 20:50:00,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:50:00,214 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:50:00,214 INFO L213 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] [2022-12-05 20:50:00,221 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-12-05 20:50:00,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-12-05 20:50:00,419 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 20:50:00,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:50:00,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1119399486, now seen corresponding path program 2 times [2022-12-05 20:50:00,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:50:00,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15611003] [2022-12-05 20:50:00,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:50:00,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:50:00,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:50:00,550 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:50:00,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:50:00,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15611003] [2022-12-05 20:50:00,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15611003] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:50:00,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:50:00,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:50:00,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375533944] [2022-12-05 20:50:00,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:50:00,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:50:00,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:50:00,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:50:00,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:50:00,552 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-05 20:50:00,553 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 54 transitions, 411 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:50:00,553 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:50:00,553 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-05 20:50:00,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:50:00,828 INFO L130 PetriNetUnfolder]: 1795/2461 cut-off events. [2022-12-05 20:50:00,828 INFO L131 PetriNetUnfolder]: For 9933/9933 co-relation queries the response was YES. [2022-12-05 20:50:00,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12058 conditions, 2461 events. 1795/2461 cut-off events. For 9933/9933 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 8984 event pairs, 423 based on Foata normal form. 76/2537 useless extension candidates. Maximal degree in co-relation 10311. Up to 2001 conditions per place. [2022-12-05 20:50:00,849 INFO L137 encePairwiseOnDemand]: 19/25 looper letters, 87 selfloop transitions, 8 changer transitions 3/98 dead transitions. [2022-12-05 20:50:00,849 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 98 transitions, 869 flow [2022-12-05 20:50:00,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-05 20:50:00,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-05 20:50:00,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2022-12-05 20:50:00,850 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6 [2022-12-05 20:50:00,850 INFO L175 Difference]: Start difference. First operand has 64 places, 54 transitions, 411 flow. Second operand 4 states and 60 transitions. [2022-12-05 20:50:00,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 98 transitions, 869 flow [2022-12-05 20:50:00,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 98 transitions, 818 flow, removed 12 selfloop flow, removed 3 redundant places. [2022-12-05 20:50:00,868 INFO L231 Difference]: Finished difference. Result has 65 places, 55 transitions, 409 flow [2022-12-05 20:50:00,868 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=378, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=409, PETRI_PLACES=65, PETRI_TRANSITIONS=55} [2022-12-05 20:50:00,869 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 31 predicate places. [2022-12-05 20:50:00,869 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 55 transitions, 409 flow [2022-12-05 20:50:00,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:50:00,869 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:50:00,869 INFO L213 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] [2022-12-05 20:50:00,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-05 20:50:00,870 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 20:50:00,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:50:00,870 INFO L85 PathProgramCache]: Analyzing trace with hash -583294836, now seen corresponding path program 1 times [2022-12-05 20:50:00,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:50:00,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853358848] [2022-12-05 20:50:00,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:50:00,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:50:00,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:50:01,295 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:50:01,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:50:01,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853358848] [2022-12-05 20:50:01,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853358848] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 20:50:01,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1410340012] [2022-12-05 20:50:01,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:50:01,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 20:50:01,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 20:50:01,298 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-12-05 20:50:01,300 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-12-05 20:50:05,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:50:05,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-05 20:50:05,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 20:50:09,486 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:50:09,487 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 20:50:13,985 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:50:13,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1410340012] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 20:50:13,986 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 20:50:13,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 10 [2022-12-05 20:50:13,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731843029] [2022-12-05 20:50:13,986 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 20:50:13,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-05 20:50:13,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:50:13,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-05 20:50:13,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=98, Unknown=4, NotChecked=0, Total=132 [2022-12-05 20:50:13,987 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-05 20:50:13,987 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 55 transitions, 409 flow. Second operand has 12 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:50:13,987 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:50:13,988 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-05 20:50:13,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:50:19,707 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 20:50:31,988 WARN L233 SmtUtils]: Spent 11.38s on a formula simplification. DAG size of input: 71 DAG size of output: 45 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-05 20:50:33,962 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 20:50:36,013 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-05 20:50:39,093 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-05 20:50:41,193 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 20:50:43,334 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 20:50:45,344 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 20:50:49,889 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 20:50:52,416 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 20:50:54,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 20:50:57,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 20:50:59,216 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 20:51:01,237 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 20:51:03,494 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 20:51:05,539 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-05 20:51:07,779 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 20:51:10,015 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-05 20:51:12,029 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-05 20:51:15,261 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 20:51:18,253 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-05 20:51:20,846 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 20:51:23,027 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-05 20:51:25,210 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 20:51:27,567 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 20:51:30,197 INFO L130 PetriNetUnfolder]: 2595/3557 cut-off events. [2022-12-05 20:51:30,197 INFO L131 PetriNetUnfolder]: For 12966/12966 co-relation queries the response was YES. [2022-12-05 20:51:30,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17508 conditions, 3557 events. 2595/3557 cut-off events. For 12966/12966 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 14124 event pairs, 355 based on Foata normal form. 2/3559 useless extension candidates. Maximal degree in co-relation 15954. Up to 2533 conditions per place. [2022-12-05 20:51:30,223 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 142 selfloop transitions, 32 changer transitions 5/179 dead transitions. [2022-12-05 20:51:30,224 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 179 transitions, 1440 flow [2022-12-05 20:51:30,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-05 20:51:30,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-05 20:51:30,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 138 transitions. [2022-12-05 20:51:30,226 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.69 [2022-12-05 20:51:30,226 INFO L175 Difference]: Start difference. First operand has 65 places, 55 transitions, 409 flow. Second operand 8 states and 138 transitions. [2022-12-05 20:51:30,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 179 transitions, 1440 flow [2022-12-05 20:51:30,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 179 transitions, 1425 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-05 20:51:30,243 INFO L231 Difference]: Finished difference. Result has 74 places, 80 transitions, 760 flow [2022-12-05 20:51:30,243 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=394, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=760, PETRI_PLACES=74, PETRI_TRANSITIONS=80} [2022-12-05 20:51:30,244 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 40 predicate places. [2022-12-05 20:51:30,244 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 80 transitions, 760 flow [2022-12-05 20:51:30,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:51:30,244 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:51:30,245 INFO L213 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] [2022-12-05 20:51:30,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-05 20:51:30,450 WARN L477 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-12-05 20:51:30,451 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 20:51:30,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:51:30,452 INFO L85 PathProgramCache]: Analyzing trace with hash 659234307, now seen corresponding path program 1 times [2022-12-05 20:51:30,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:51:30,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586079642] [2022-12-05 20:51:30,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:51:30,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:51:30,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:51:30,988 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:51:30,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:51:30,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586079642] [2022-12-05 20:51:30,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586079642] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 20:51:30,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2008447531] [2022-12-05 20:51:30,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:51:30,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 20:51:30,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 20:51:30,990 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-12-05 20:51:30,992 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-12-05 20:53:03,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:53:03,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-05 20:53:03,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 20:53:05,390 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:53:05,390 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 20:53:06,905 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:53:06,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2008447531] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 20:53:06,905 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 20:53:06,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 10 [2022-12-05 20:53:06,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289785358] [2022-12-05 20:53:06,905 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 20:53:06,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-05 20:53:06,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:53:06,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-05 20:53:06,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-12-05 20:53:06,907 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-05 20:53:06,907 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 80 transitions, 760 flow. Second operand has 12 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:53:06,907 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:53:06,907 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-05 20:53:06,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:53:12,157 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 20:53:14,087 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 20:53:16,214 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 20:53:18,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 20:53:20,920 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 20:53:22,950 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 20:53:26,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 20:53:28,267 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 20:53:30,302 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-05 20:53:32,353 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 20:53:34,478 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 20:53:36,528 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 20:53:38,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 20:53:41,072 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 20:53:44,902 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 20:53:48,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 20:53:51,151 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-05 20:53:53,570 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 20:53:56,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-05 20:53:57,899 INFO L130 PetriNetUnfolder]: 3233/4458 cut-off events. [2022-12-05 20:53:57,899 INFO L131 PetriNetUnfolder]: For 20244/20244 co-relation queries the response was YES. [2022-12-05 20:53:57,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22605 conditions, 4458 events. 3233/4458 cut-off events. For 20244/20244 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 18465 event pairs, 663 based on Foata normal form. 3/4461 useless extension candidates. Maximal degree in co-relation 20460. Up to 3527 conditions per place. [2022-12-05 20:53:57,931 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 167 selfloop transitions, 30 changer transitions 6/203 dead transitions. [2022-12-05 20:53:57,932 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 203 transitions, 1792 flow [2022-12-05 20:53:57,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-05 20:53:57,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-05 20:53:57,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 141 transitions. [2022-12-05 20:53:57,934 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6266666666666667 [2022-12-05 20:53:57,934 INFO L175 Difference]: Start difference. First operand has 74 places, 80 transitions, 760 flow. Second operand 9 states and 141 transitions. [2022-12-05 20:53:57,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 203 transitions, 1792 flow [2022-12-05 20:53:57,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 203 transitions, 1717 flow, removed 34 selfloop flow, removed 1 redundant places. [2022-12-05 20:53:57,960 INFO L231 Difference]: Finished difference. Result has 86 places, 103 transitions, 985 flow [2022-12-05 20:53:57,961 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=685, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=985, PETRI_PLACES=86, PETRI_TRANSITIONS=103} [2022-12-05 20:53:57,961 INFO L294 CegarLoopForPetriNet]: 34 programPoint places, 52 predicate places. [2022-12-05 20:53:57,961 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 103 transitions, 985 flow [2022-12-05 20:53:57,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 20:53:57,962 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:53:57,962 INFO L213 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] [2022-12-05 20:53:57,973 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-05 20:53:58,173 WARN L477 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-12-05 20:53:58,174 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-05 20:53:58,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:53:58,175 INFO L85 PathProgramCache]: Analyzing trace with hash 736295555, now seen corresponding path program 2 times [2022-12-05 20:53:58,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:53:58,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362653903] [2022-12-05 20:53:58,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:53:58,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:53:58,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:53:58,658 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-05 20:53:58,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:53:58,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362653903] [2022-12-05 20:53:58,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362653903] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 20:53:58,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [88403164] [2022-12-05 20:53:58,658 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-05 20:53:58,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 20:53:58,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 20:53:58,660 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-12-05 20:53:58,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process Received shutdown request... [2022-12-05 21:04:20,702 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-12-05 21:04:20,703 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-12-05 21:04:21,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 [2022-12-05 21:04:21,903 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forcibly destroying the process [2022-12-05 21:04:21,912 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 137 [2022-12-05 21:04:21,913 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-05 21:04:21,913 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-12-05 21:04:21,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2022-12-05 21:04:21,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140890854] [2022-12-05 21:04:21,914 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-12-05 21:04:21,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-05 21:04:21,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 21:04:21,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-05 21:04:21,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-05 21:04:21,915 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-05 21:04:21,915 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 103 transitions, 985 flow. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-05 21:04:21,915 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 21:04:21,915 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-05 21:04:21,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 21:04:21,917 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-05 21:04:21,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-05 21:04:21,917 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2022-12-05 21:04:21,918 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2022-12-05 21:04:21,919 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-05 21:04:21,919 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-05 21:04:21,919 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2022-12-05 21:04:21,919 INFO L458 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 1, 1] [2022-12-05 21:04:21,922 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 21:04:21,922 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 21:04:21,924 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 09:04:21 BasicIcfg [2022-12-05 21:04:21,924 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 21:04:21,925 INFO L158 Benchmark]: Toolchain (without parser) took 873598.36ms. Allocated memory was 184.5MB in the beginning and 352.3MB in the end (delta: 167.8MB). Free memory was 161.6MB in the beginning and 252.5MB in the end (delta: -90.9MB). Peak memory consumption was 77.6MB. Max. memory is 8.0GB. [2022-12-05 21:04:21,925 INFO L158 Benchmark]: CDTParser took 0.68ms. Allocated memory is still 184.5MB. Free memory is still 162.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 21:04:21,925 INFO L158 Benchmark]: CACSL2BoogieTranslator took 281.72ms. Allocated memory is still 184.5MB. Free memory was 161.6MB in the beginning and 149.7MB in the end (delta: 11.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-05 21:04:21,925 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.56ms. Allocated memory is still 184.5MB. Free memory was 149.7MB in the beginning and 148.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 21:04:21,927 INFO L158 Benchmark]: Boogie Preprocessor took 32.48ms. Allocated memory is still 184.5MB. Free memory was 148.2MB in the beginning and 146.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-05 21:04:21,928 INFO L158 Benchmark]: RCFGBuilder took 430.23ms. Allocated memory is still 184.5MB. Free memory was 146.6MB in the beginning and 130.3MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-12-05 21:04:21,928 INFO L158 Benchmark]: TraceAbstraction took 872797.97ms. Allocated memory was 184.5MB in the beginning and 352.3MB in the end (delta: 167.8MB). Free memory was 129.8MB in the beginning and 252.5MB in the end (delta: -122.7MB). Peak memory consumption was 46.1MB. Max. memory is 8.0GB. [2022-12-05 21:04:21,930 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.68ms. Allocated memory is still 184.5MB. Free memory is still 162.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 281.72ms. Allocated memory is still 184.5MB. Free memory was 161.6MB in the beginning and 149.7MB in the end (delta: 11.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 50.56ms. Allocated memory is still 184.5MB. Free memory was 149.7MB in the beginning and 148.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.48ms. Allocated memory is still 184.5MB. Free memory was 148.2MB in the beginning and 146.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 430.23ms. Allocated memory is still 184.5MB. Free memory was 146.6MB in the beginning and 130.3MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 872797.97ms. Allocated memory was 184.5MB in the beginning and 352.3MB in the end (delta: 167.8MB). Free memory was 129.8MB in the beginning and 252.5MB in the end (delta: -122.7MB). Peak memory consumption was 46.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.6s, 129 PlacesBefore, 34 PlacesAfterwards, 126 TransitionsBefore, 25 TransitionsAfterwards, 3312 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 42 TrivialYvCompositions, 53 ConcurrentYvCompositions, 6 ChoiceCompositions, 101 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1721, independent: 1721, independent conditional: 1721, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1721, independent: 1721, independent conditional: 0, independent unconditional: 1721, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1721, independent: 1721, independent conditional: 0, independent unconditional: 1721, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1721, independent: 1721, independent conditional: 0, independent unconditional: 1721, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1721, independent: 1721, independent conditional: 0, independent unconditional: 1721, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1721, independent: 1721, independent conditional: 0, independent unconditional: 1721, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1721, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1721, unknown conditional: 0, unknown unconditional: 1721] , Statistics on independence cache: Total cache size (in pairs): 2951, Positive cache size: 2951, Positive conditional cache size: 0, Positive unconditional cache size: 2951, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - TimeoutResultAtElement [Line: 116]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 107]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 109]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 106]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 108]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 181 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: 872.7s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 130.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.8s, HoareTripleCheckerStatistics: 38 mSolverCounterUnknown, 573 SdHoareTripleChecker+Valid, 108.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 573 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 107.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2225 IncrementalHoareTripleChecker+Invalid, 2278 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 0 mSDtfsCounter, 2225 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 226 GetRequests, 162 SyntacticMatches, 4 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 31.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=985occurred in iteration=11, InterpolantAutomatonStates: 60, 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, 96.7s SatisfiabilityAnalysisTime, 15.5s InterpolantComputationTime, 356 NumberOfCodeBlocks, 356 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 426 ConstructedInterpolants, 0 QuantifiedInterpolants, 12524 SizeOfPredicates, 18 NumberOfNonLiveVariables, 806 ConjunctsInSsa, 43 ConjunctsInUnsatCore, 20 InterpolantComputations, 7 PerfectInterpolantSequences, 6/26 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