/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/bench-exp2x4.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-27 19:44:39,682 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-27 19:44:39,693 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-27 19:44:39,719 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-27 19:44:39,719 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-27 19:44:39,721 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-27 19:44:39,723 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-27 19:44:39,726 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-27 19:44:39,741 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-27 19:44:39,742 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-27 19:44:39,742 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-27 19:44:39,743 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-27 19:44:39,743 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-27 19:44:39,744 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-27 19:44:39,744 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-27 19:44:39,745 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-27 19:44:39,745 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-27 19:44:39,746 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-27 19:44:39,747 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-27 19:44:39,748 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-27 19:44:39,749 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-27 19:44:39,754 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-27 19:44:39,755 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-27 19:44:39,755 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-27 19:44:39,757 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-27 19:44:39,757 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-27 19:44:39,757 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-27 19:44:39,758 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-27 19:44:39,758 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-27 19:44:39,759 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-27 19:44:39,759 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-27 19:44:39,759 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-27 19:44:39,760 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-27 19:44:39,760 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-27 19:44:39,761 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-27 19:44:39,761 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-27 19:44:39,761 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-27 19:44:39,761 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-27 19:44:39,762 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-27 19:44:39,762 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-27 19:44:39,762 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-27 19:44:39,766 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-VariableLbe.epf [2023-01-27 19:44:39,780 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-27 19:44:39,780 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-27 19:44:39,784 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-27 19:44:39,784 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-27 19:44:39,785 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-27 19:44:39,785 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-27 19:44:39,785 INFO L138 SettingsManager]: * Use SBE=true [2023-01-27 19:44:39,785 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-27 19:44:39,785 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-27 19:44:39,786 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-27 19:44:39,786 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-27 19:44:39,786 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-27 19:44:39,786 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-27 19:44:39,786 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-27 19:44:39,787 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-27 19:44:39,787 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-27 19:44:39,787 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-27 19:44:39,787 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-27 19:44:39,787 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-27 19:44:39,787 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-27 19:44:39,787 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-27 19:44:39,787 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-27 19:44:39,787 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-27 19:44:39,788 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 19:44:39,788 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-27 19:44:39,788 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-27 19:44:39,788 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-27 19:44:39,788 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-27 19:44:39,788 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-27 19:44:39,788 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-27 19:44:39,788 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-27 19:44:39,788 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC 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 [2023-01-27 19:44:39,941 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-27 19:44:39,962 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-27 19:44:39,964 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-27 19:44:39,966 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-27 19:44:39,966 INFO L275 PluginConnector]: CDTParser initialized [2023-01-27 19:44:39,967 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp2x4.wvr.c [2023-01-27 19:44:40,917 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-27 19:44:41,125 INFO L351 CDTParser]: Found 1 translation units. [2023-01-27 19:44:41,125 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x4.wvr.c [2023-01-27 19:44:41,131 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1f6fab4b/1b3d6bc8ce344ed39a82c4c5dae8b89e/FLAGa7d7b2c9b [2023-01-27 19:44:41,143 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1f6fab4b/1b3d6bc8ce344ed39a82c4c5dae8b89e [2023-01-27 19:44:41,145 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-27 19:44:41,147 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-27 19:44:41,147 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-27 19:44:41,147 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-27 19:44:41,150 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-27 19:44:41,150 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 07:44:41" (1/1) ... [2023-01-27 19:44:41,151 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9dae79b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 07:44:41, skipping insertion in model container [2023-01-27 19:44:41,151 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 07:44:41" (1/1) ... [2023-01-27 19:44:41,155 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-27 19:44:41,169 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-27 19:44:41,379 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x4.wvr.c[2309,2322] [2023-01-27 19:44:41,383 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 19:44:41,398 INFO L203 MainTranslator]: Completed pre-run [2023-01-27 19:44:41,413 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x4.wvr.c[2309,2322] [2023-01-27 19:44:41,417 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 19:44:41,426 INFO L208 MainTranslator]: Completed translation [2023-01-27 19:44:41,426 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 07:44:41 WrapperNode [2023-01-27 19:44:41,426 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-27 19:44:41,427 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-27 19:44:41,427 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-27 19:44:41,427 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-27 19:44:41,432 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 07:44:41" (1/1) ... [2023-01-27 19:44:41,436 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 07:44:41" (1/1) ... [2023-01-27 19:44:41,459 INFO L138 Inliner]: procedures = 20, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 96 [2023-01-27 19:44:41,459 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-27 19:44:41,460 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-27 19:44:41,460 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-27 19:44:41,460 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-27 19:44:41,466 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 07:44:41" (1/1) ... [2023-01-27 19:44:41,466 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 07:44:41" (1/1) ... [2023-01-27 19:44:41,476 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 07:44:41" (1/1) ... [2023-01-27 19:44:41,476 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 07:44:41" (1/1) ... [2023-01-27 19:44:41,479 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 07:44:41" (1/1) ... [2023-01-27 19:44:41,481 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 07:44:41" (1/1) ... [2023-01-27 19:44:41,482 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 07:44:41" (1/1) ... [2023-01-27 19:44:41,482 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 07:44:41" (1/1) ... [2023-01-27 19:44:41,484 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-27 19:44:41,484 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-27 19:44:41,485 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-27 19:44:41,485 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-27 19:44:41,485 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 07:44:41" (1/1) ... [2023-01-27 19:44:41,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 19:44:41,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 19:44:41,522 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) [2023-01-27 19:44:41,524 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 [2023-01-27 19:44:41,567 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-27 19:44:41,567 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-01-27 19:44:41,567 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-01-27 19:44:41,567 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-01-27 19:44:41,568 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-01-27 19:44:41,568 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-01-27 19:44:41,568 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-01-27 19:44:41,568 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-01-27 19:44:41,568 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-01-27 19:44:41,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-27 19:44:41,568 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-27 19:44:41,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-27 19:44:41,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-27 19:44:41,568 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-27 19:44:41,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-01-27 19:44:41,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-27 19:44:41,569 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-27 19:44:41,683 INFO L236 CfgBuilder]: Building ICFG [2023-01-27 19:44:41,684 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-27 19:44:41,861 INFO L277 CfgBuilder]: Performing block encoding [2023-01-27 19:44:41,866 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-27 19:44:41,866 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-01-27 19:44:41,873 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 07:44:41 BoogieIcfgContainer [2023-01-27 19:44:41,873 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-27 19:44:41,874 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-27 19:44:41,874 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-27 19:44:41,876 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-27 19:44:41,876 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 07:44:41" (1/3) ... [2023-01-27 19:44:41,877 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33b87623 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 07:44:41, skipping insertion in model container [2023-01-27 19:44:41,877 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 07:44:41" (2/3) ... [2023-01-27 19:44:41,877 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33b87623 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 07:44:41, skipping insertion in model container [2023-01-27 19:44:41,877 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 07:44:41" (3/3) ... [2023-01-27 19:44:41,878 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp2x4.wvr.c [2023-01-27 19:44:41,889 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-27 19:44:41,889 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-01-27 19:44:41,889 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-27 19:44:41,941 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-01-27 19:44:41,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 130 places, 127 transitions, 286 flow [2023-01-27 19:44:42,006 INFO L130 PetriNetUnfolder]: 10/123 cut-off events. [2023-01-27 19:44:42,006 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-01-27 19:44:42,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 123 events. 10/123 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 62 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2023-01-27 19:44:42,011 INFO L82 GeneralOperation]: Start removeDead. Operand has 130 places, 127 transitions, 286 flow [2023-01-27 19:44:42,013 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 114 places, 111 transitions, 246 flow [2023-01-27 19:44:42,016 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-27 19:44:42,022 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 114 places, 111 transitions, 246 flow [2023-01-27 19:44:42,024 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 114 places, 111 transitions, 246 flow [2023-01-27 19:44:42,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 111 transitions, 246 flow [2023-01-27 19:44:42,046 INFO L130 PetriNetUnfolder]: 10/111 cut-off events. [2023-01-27 19:44:42,047 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-01-27 19:44:42,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 111 events. 10/111 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 61 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2023-01-27 19:44:42,049 INFO L119 LiptonReduction]: Number of co-enabled transitions 1512 [2023-01-27 19:44:44,904 INFO L134 LiptonReduction]: Checked pairs total: 1649 [2023-01-27 19:44:44,904 INFO L136 LiptonReduction]: Total number of compositions: 99 [2023-01-27 19:44:44,925 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-27 19:44:44,929 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;@71434961, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-27 19:44:44,930 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-01-27 19:44:44,959 INFO L130 PetriNetUnfolder]: 4/24 cut-off events. [2023-01-27 19:44:44,960 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-01-27 19:44:44,960 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 19:44:44,960 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 19:44:44,961 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)] === [2023-01-27 19:44:44,965 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 19:44:44,965 INFO L85 PathProgramCache]: Analyzing trace with hash 340783593, now seen corresponding path program 1 times [2023-01-27 19:44:44,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 19:44:44,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645055010] [2023-01-27 19:44:44,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 19:44:44,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 19:44:45,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 19:44:45,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 19:44:45,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 19:44:45,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645055010] [2023-01-27 19:44:45,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645055010] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 19:44:45,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 19:44:45,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-01-27 19:44:45,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790102983] [2023-01-27 19:44:45,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 19:44:45,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-27 19:44:45,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 19:44:45,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-27 19:44:45,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-27 19:44:45,533 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 226 [2023-01-27 19:44:45,536 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 19:44:45,537 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 19:44:45,537 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 226 [2023-01-27 19:44:45,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 19:44:45,638 INFO L130 PetriNetUnfolder]: 497/677 cut-off events. [2023-01-27 19:44:45,639 INFO L131 PetriNetUnfolder]: For 49/49 co-relation queries the response was YES. [2023-01-27 19:44:45,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1448 conditions, 677 events. 497/677 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1778 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. [2023-01-27 19:44:45,643 INFO L137 encePairwiseOnDemand]: 220/226 looper letters, 41 selfloop transitions, 5 changer transitions 1/47 dead transitions. [2023-01-27 19:44:45,643 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 47 transitions, 233 flow [2023-01-27 19:44:45,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-27 19:44:45,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-27 19:44:45,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 306 transitions. [2023-01-27 19:44:45,652 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45132743362831856 [2023-01-27 19:44:45,653 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 306 transitions. [2023-01-27 19:44:45,653 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 306 transitions. [2023-01-27 19:44:45,654 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 19:44:45,655 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 306 transitions. [2023-01-27 19:44:45,658 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 19:44:45,661 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 226.0) internal successors, (904), 4 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 19:44:45,662 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 226.0) internal successors, (904), 4 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 19:44:45,663 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 74 flow. Second operand 3 states and 306 transitions. [2023-01-27 19:44:45,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 47 transitions, 233 flow [2023-01-27 19:44:45,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 47 transitions, 203 flow, removed 0 selfloop flow, removed 8 redundant places. [2023-01-27 19:44:45,668 INFO L231 Difference]: Finished difference. Result has 29 places, 29 transitions, 91 flow [2023-01-27 19:44:45,669 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, 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} [2023-01-27 19:44:45,671 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, -5 predicate places. [2023-01-27 19:44:45,671 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 29 transitions, 91 flow [2023-01-27 19:44:45,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 19:44:45,672 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 19:44:45,672 INFO L208 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] [2023-01-27 19:44:45,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-27 19:44:45,672 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)] === [2023-01-27 19:44:45,673 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 19:44:45,673 INFO L85 PathProgramCache]: Analyzing trace with hash -321644511, now seen corresponding path program 1 times [2023-01-27 19:44:45,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 19:44:45,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293897969] [2023-01-27 19:44:45,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 19:44:45,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 19:44:45,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 19:44:45,885 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 19:44:45,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 19:44:45,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293897969] [2023-01-27 19:44:45,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293897969] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 19:44:45,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 19:44:45,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 19:44:45,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111499606] [2023-01-27 19:44:45,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 19:44:45,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 19:44:45,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 19:44:45,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 19:44:45,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-27 19:44:45,895 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 226 [2023-01-27 19:44:45,895 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 29 transitions, 91 flow. Second operand has 4 states, 4 states have (on average 89.5) internal successors, (358), 4 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 19:44:45,895 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 19:44:45,895 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 226 [2023-01-27 19:44:45,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 19:44:46,010 INFO L130 PetriNetUnfolder]: 461/641 cut-off events. [2023-01-27 19:44:46,010 INFO L131 PetriNetUnfolder]: For 177/177 co-relation queries the response was YES. [2023-01-27 19:44:46,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1641 conditions, 641 events. 461/641 cut-off events. For 177/177 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1830 event pairs, 17 based on Foata normal form. 36/677 useless extension candidates. Maximal degree in co-relation 586. Up to 435 conditions per place. [2023-01-27 19:44:46,014 INFO L137 encePairwiseOnDemand]: 219/226 looper letters, 50 selfloop transitions, 9 changer transitions 1/60 dead transitions. [2023-01-27 19:44:46,014 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 60 transitions, 289 flow [2023-01-27 19:44:46,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-27 19:44:46,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-27 19:44:46,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 398 transitions. [2023-01-27 19:44:46,018 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44026548672566373 [2023-01-27 19:44:46,018 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 398 transitions. [2023-01-27 19:44:46,018 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 398 transitions. [2023-01-27 19:44:46,019 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 19:44:46,019 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 398 transitions. [2023-01-27 19:44:46,020 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 99.5) internal successors, (398), 4 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 19:44:46,022 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 226.0) internal successors, (1130), 5 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 19:44:46,023 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 226.0) internal successors, (1130), 5 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 19:44:46,023 INFO L175 Difference]: Start difference. First operand has 29 places, 29 transitions, 91 flow. Second operand 4 states and 398 transitions. [2023-01-27 19:44:46,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 60 transitions, 289 flow [2023-01-27 19:44:46,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 60 transitions, 282 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-27 19:44:46,025 INFO L231 Difference]: Finished difference. Result has 32 places, 33 transitions, 127 flow [2023-01-27 19:44:46,025 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=127, PETRI_PLACES=32, PETRI_TRANSITIONS=33} [2023-01-27 19:44:46,026 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2023-01-27 19:44:46,026 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 33 transitions, 127 flow [2023-01-27 19:44:46,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 89.5) internal successors, (358), 4 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 19:44:46,026 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 19:44:46,026 INFO L208 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] [2023-01-27 19:44:46,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-27 19:44:46,027 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)] === [2023-01-27 19:44:46,027 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 19:44:46,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1574738466, now seen corresponding path program 1 times [2023-01-27 19:44:46,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 19:44:46,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434213702] [2023-01-27 19:44:46,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 19:44:46,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 19:44:46,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 19:44:46,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 19:44:46,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 19:44:46,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434213702] [2023-01-27 19:44:46,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434213702] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 19:44:46,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 19:44:46,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 19:44:46,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936453696] [2023-01-27 19:44:46,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 19:44:46,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 19:44:46,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 19:44:46,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 19:44:46,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-27 19:44:46,237 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 226 [2023-01-27 19:44:46,237 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 33 transitions, 127 flow. Second operand has 4 states, 4 states have (on average 89.5) internal successors, (358), 4 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 19:44:46,237 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 19:44:46,237 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 226 [2023-01-27 19:44:46,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 19:44:46,355 INFO L130 PetriNetUnfolder]: 431/611 cut-off events. [2023-01-27 19:44:46,355 INFO L131 PetriNetUnfolder]: For 478/478 co-relation queries the response was YES. [2023-01-27 19:44:46,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1721 conditions, 611 events. 431/611 cut-off events. For 478/478 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1711 event pairs, 47 based on Foata normal form. 30/641 useless extension candidates. Maximal degree in co-relation 523. Up to 405 conditions per place. [2023-01-27 19:44:46,358 INFO L137 encePairwiseOnDemand]: 219/226 looper letters, 44 selfloop transitions, 11 changer transitions 11/66 dead transitions. [2023-01-27 19:44:46,359 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 66 transitions, 359 flow [2023-01-27 19:44:46,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-27 19:44:46,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-27 19:44:46,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 398 transitions. [2023-01-27 19:44:46,360 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44026548672566373 [2023-01-27 19:44:46,360 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 398 transitions. [2023-01-27 19:44:46,360 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 398 transitions. [2023-01-27 19:44:46,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 19:44:46,360 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 398 transitions. [2023-01-27 19:44:46,361 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 99.5) internal successors, (398), 4 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 19:44:46,363 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 226.0) internal successors, (1130), 5 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 19:44:46,363 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 226.0) internal successors, (1130), 5 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 19:44:46,363 INFO L175 Difference]: Start difference. First operand has 32 places, 33 transitions, 127 flow. Second operand 4 states and 398 transitions. [2023-01-27 19:44:46,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 66 transitions, 359 flow [2023-01-27 19:44:46,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 66 transitions, 341 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-27 19:44:46,368 INFO L231 Difference]: Finished difference. Result has 34 places, 37 transitions, 162 flow [2023-01-27 19:44:46,368 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=162, PETRI_PLACES=34, PETRI_TRANSITIONS=37} [2023-01-27 19:44:46,369 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 0 predicate places. [2023-01-27 19:44:46,372 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 37 transitions, 162 flow [2023-01-27 19:44:46,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 89.5) internal successors, (358), 4 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 19:44:46,372 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 19:44:46,372 INFO L208 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] [2023-01-27 19:44:46,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-27 19:44:46,373 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)] === [2023-01-27 19:44:46,373 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 19:44:46,373 INFO L85 PathProgramCache]: Analyzing trace with hash 763566634, now seen corresponding path program 1 times [2023-01-27 19:44:46,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 19:44:46,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383639517] [2023-01-27 19:44:46,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 19:44:46,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 19:44:46,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 19:44:46,527 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 19:44:46,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 19:44:46,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383639517] [2023-01-27 19:44:46,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383639517] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 19:44:46,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260462190] [2023-01-27 19:44:46,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 19:44:46,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 19:44:46,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 19:44:46,530 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) [2023-01-27 19:44:46,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-01-27 19:44:46,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 19:44:46,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 7 conjunts are in the unsatisfiable core [2023-01-27 19:44:46,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 19:44:46,937 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 19:44:46,938 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 19:44:46,999 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 19:44:46,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1260462190] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 19:44:46,999 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 19:44:46,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-01-27 19:44:46,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762521069] [2023-01-27 19:44:46,999 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 19:44:47,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-27 19:44:47,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 19:44:47,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-27 19:44:47,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-01-27 19:44:47,001 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 226 [2023-01-27 19:44:47,002 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 37 transitions, 162 flow. Second operand has 7 states, 7 states have (on average 92.0) internal successors, (644), 7 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 19:44:47,002 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 19:44:47,002 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 226 [2023-01-27 19:44:47,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 19:44:47,207 INFO L130 PetriNetUnfolder]: 809/1129 cut-off events. [2023-01-27 19:44:47,207 INFO L131 PetriNetUnfolder]: For 716/716 co-relation queries the response was YES. [2023-01-27 19:44:47,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3396 conditions, 1129 events. 809/1129 cut-off events. For 716/716 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3542 event pairs, 185 based on Foata normal form. 30/1159 useless extension candidates. Maximal degree in co-relation 819. Up to 422 conditions per place. [2023-01-27 19:44:47,212 INFO L137 encePairwiseOnDemand]: 219/226 looper letters, 85 selfloop transitions, 14 changer transitions 3/102 dead transitions. [2023-01-27 19:44:47,213 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 102 transitions, 567 flow [2023-01-27 19:44:47,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-27 19:44:47,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-27 19:44:47,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 600 transitions. [2023-01-27 19:44:47,214 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4424778761061947 [2023-01-27 19:44:47,214 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 600 transitions. [2023-01-27 19:44:47,214 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 600 transitions. [2023-01-27 19:44:47,215 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 19:44:47,215 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 600 transitions. [2023-01-27 19:44:47,216 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 100.0) internal successors, (600), 6 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 19:44:47,217 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 226.0) internal successors, (1582), 7 states have internal predecessors, (1582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 19:44:47,218 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 226.0) internal successors, (1582), 7 states have internal predecessors, (1582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 19:44:47,218 INFO L175 Difference]: Start difference. First operand has 34 places, 37 transitions, 162 flow. Second operand 6 states and 600 transitions. [2023-01-27 19:44:47,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 102 transitions, 567 flow [2023-01-27 19:44:47,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 102 transitions, 558 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-01-27 19:44:47,220 INFO L231 Difference]: Finished difference. Result has 41 places, 42 transitions, 224 flow [2023-01-27 19:44:47,220 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=224, PETRI_PLACES=41, PETRI_TRANSITIONS=42} [2023-01-27 19:44:47,221 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 7 predicate places. [2023-01-27 19:44:47,221 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 42 transitions, 224 flow [2023-01-27 19:44:47,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 92.0) internal successors, (644), 7 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 19:44:47,221 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 19:44:47,221 INFO L208 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] [2023-01-27 19:44:47,237 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-01-27 19:44:47,426 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 [2023-01-27 19:44:47,427 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)] === [2023-01-27 19:44:47,427 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 19:44:47,428 INFO L85 PathProgramCache]: Analyzing trace with hash -266488156, now seen corresponding path program 2 times [2023-01-27 19:44:47,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 19:44:47,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117881214] [2023-01-27 19:44:47,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 19:44:47,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 19:44:47,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 19:44:47,574 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 19:44:47,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 19:44:47,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117881214] [2023-01-27 19:44:47,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117881214] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 19:44:47,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 19:44:47,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 19:44:47,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057835943] [2023-01-27 19:44:47,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 19:44:47,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 19:44:47,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 19:44:47,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 19:44:47,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-27 19:44:47,576 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 226 [2023-01-27 19:44:47,576 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 42 transitions, 224 flow. Second operand has 4 states, 4 states have (on average 89.5) internal successors, (358), 4 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 19:44:47,577 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 19:44:47,577 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 226 [2023-01-27 19:44:47,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 19:44:47,742 INFO L130 PetriNetUnfolder]: 897/1245 cut-off events. [2023-01-27 19:44:47,743 INFO L131 PetriNetUnfolder]: For 1855/1855 co-relation queries the response was YES. [2023-01-27 19:44:47,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4386 conditions, 1245 events. 897/1245 cut-off events. For 1855/1855 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 3982 event pairs, 229 based on Foata normal form. 28/1273 useless extension candidates. Maximal degree in co-relation 2498. Up to 937 conditions per place. [2023-01-27 19:44:47,749 INFO L137 encePairwiseOnDemand]: 220/226 looper letters, 59 selfloop transitions, 10 changer transitions 3/72 dead transitions. [2023-01-27 19:44:47,749 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 72 transitions, 473 flow [2023-01-27 19:44:47,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-27 19:44:47,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-27 19:44:47,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 396 transitions. [2023-01-27 19:44:47,751 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43805309734513276 [2023-01-27 19:44:47,751 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 396 transitions. [2023-01-27 19:44:47,751 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 396 transitions. [2023-01-27 19:44:47,751 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 19:44:47,751 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 396 transitions. [2023-01-27 19:44:47,752 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 99.0) internal successors, (396), 4 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 19:44:47,753 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 226.0) internal successors, (1130), 5 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 19:44:47,755 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 226.0) internal successors, (1130), 5 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 19:44:47,755 INFO L175 Difference]: Start difference. First operand has 41 places, 42 transitions, 224 flow. Second operand 4 states and 396 transitions. [2023-01-27 19:44:47,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 72 transitions, 473 flow [2023-01-27 19:44:47,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 72 transitions, 462 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-01-27 19:44:47,760 INFO L231 Difference]: Finished difference. Result has 44 places, 43 transitions, 246 flow [2023-01-27 19:44:47,760 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=246, PETRI_PLACES=44, PETRI_TRANSITIONS=43} [2023-01-27 19:44:47,762 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 10 predicate places. [2023-01-27 19:44:47,762 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 43 transitions, 246 flow [2023-01-27 19:44:47,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 89.5) internal successors, (358), 4 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 19:44:47,762 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 19:44:47,762 INFO L208 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] [2023-01-27 19:44:47,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-27 19:44:47,762 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)] === [2023-01-27 19:44:47,763 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 19:44:47,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1410911463, now seen corresponding path program 2 times [2023-01-27 19:44:47,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 19:44:47,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612403636] [2023-01-27 19:44:47,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 19:44:47,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 19:44:47,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 19:44:47,879 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 19:44:47,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 19:44:47,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612403636] [2023-01-27 19:44:47,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612403636] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 19:44:47,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [676651059] [2023-01-27 19:44:47,879 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-27 19:44:47,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 19:44:47,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 19:44:47,881 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) [2023-01-27 19:44:47,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-01-27 19:44:47,956 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-27 19:44:47,956 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 19:44:47,957 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 7 conjunts are in the unsatisfiable core [2023-01-27 19:44:47,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 19:44:48,028 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 19:44:48,028 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 19:44:48,072 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 19:44:48,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [676651059] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 19:44:48,072 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 19:44:48,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-01-27 19:44:48,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570035504] [2023-01-27 19:44:48,073 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 19:44:48,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-27 19:44:48,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 19:44:48,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-27 19:44:48,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-01-27 19:44:48,074 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 226 [2023-01-27 19:44:48,075 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 43 transitions, 246 flow. Second operand has 7 states, 7 states have (on average 90.28571428571429) internal successors, (632), 7 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 19:44:48,075 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 19:44:48,075 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 226 [2023-01-27 19:44:48,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 19:44:48,416 INFO L130 PetriNetUnfolder]: 1793/2461 cut-off events. [2023-01-27 19:44:48,416 INFO L131 PetriNetUnfolder]: For 4636/4636 co-relation queries the response was YES. [2023-01-27 19:44:48,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9082 conditions, 2461 events. 1793/2461 cut-off events. For 4636/4636 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 9125 event pairs, 325 based on Foata normal form. 104/2565 useless extension candidates. Maximal degree in co-relation 4890. Up to 1139 conditions per place. [2023-01-27 19:44:48,430 INFO L137 encePairwiseOnDemand]: 219/226 looper letters, 111 selfloop transitions, 14 changer transitions 3/128 dead transitions. [2023-01-27 19:44:48,430 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 128 transitions, 880 flow [2023-01-27 19:44:48,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-27 19:44:48,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-27 19:44:48,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 604 transitions. [2023-01-27 19:44:48,432 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44542772861356933 [2023-01-27 19:44:48,432 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 604 transitions. [2023-01-27 19:44:48,432 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 604 transitions. [2023-01-27 19:44:48,432 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 19:44:48,433 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 604 transitions. [2023-01-27 19:44:48,434 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 100.66666666666667) internal successors, (604), 6 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 19:44:48,435 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 226.0) internal successors, (1582), 7 states have internal predecessors, (1582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 19:44:48,435 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 226.0) internal successors, (1582), 7 states have internal predecessors, (1582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 19:44:48,435 INFO L175 Difference]: Start difference. First operand has 44 places, 43 transitions, 246 flow. Second operand 6 states and 604 transitions. [2023-01-27 19:44:48,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 128 transitions, 880 flow [2023-01-27 19:44:48,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 128 transitions, 844 flow, removed 8 selfloop flow, removed 2 redundant places. [2023-01-27 19:44:48,447 INFO L231 Difference]: Finished difference. Result has 50 places, 48 transitions, 296 flow [2023-01-27 19:44:48,448 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=296, PETRI_PLACES=50, PETRI_TRANSITIONS=48} [2023-01-27 19:44:48,448 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 16 predicate places. [2023-01-27 19:44:48,448 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 48 transitions, 296 flow [2023-01-27 19:44:48,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 90.28571428571429) internal successors, (632), 7 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 19:44:48,449 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 19:44:48,449 INFO L208 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] [2023-01-27 19:44:48,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-01-27 19:44:48,654 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,SelfDestructingSolverStorable5 [2023-01-27 19:44:48,654 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)] === [2023-01-27 19:44:48,654 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 19:44:48,654 INFO L85 PathProgramCache]: Analyzing trace with hash -115641799, now seen corresponding path program 1 times [2023-01-27 19:44:48,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 19:44:48,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410888031] [2023-01-27 19:44:48,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 19:44:48,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 19:44:48,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 19:44:48,749 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 19:44:48,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 19:44:48,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410888031] [2023-01-27 19:44:48,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410888031] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 19:44:48,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [367377567] [2023-01-27 19:44:48,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 19:44:48,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 19:44:48,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 19:44:48,751 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) [2023-01-27 19:44:48,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-01-27 19:44:48,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 19:44:48,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 7 conjunts are in the unsatisfiable core [2023-01-27 19:44:48,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 19:44:48,913 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 19:44:48,913 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 19:44:48,951 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 19:44:48,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [367377567] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 19:44:48,952 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 19:44:48,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-01-27 19:44:48,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027671861] [2023-01-27 19:44:48,952 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 19:44:48,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-27 19:44:48,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 19:44:48,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-27 19:44:48,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-01-27 19:44:48,954 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 226 [2023-01-27 19:44:48,954 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 48 transitions, 296 flow. Second operand has 7 states, 7 states have (on average 90.28571428571429) internal successors, (632), 7 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 19:44:48,954 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 19:44:48,954 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 226 [2023-01-27 19:44:48,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 19:44:49,270 INFO L130 PetriNetUnfolder]: 2267/3107 cut-off events. [2023-01-27 19:44:49,271 INFO L131 PetriNetUnfolder]: For 8064/8064 co-relation queries the response was YES. [2023-01-27 19:44:49,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12686 conditions, 3107 events. 2267/3107 cut-off events. For 8064/8064 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 11984 event pairs, 505 based on Foata normal form. 76/3183 useless extension candidates. Maximal degree in co-relation 6978. Up to 1779 conditions per place. [2023-01-27 19:44:49,289 INFO L137 encePairwiseOnDemand]: 219/226 looper letters, 114 selfloop transitions, 14 changer transitions 3/131 dead transitions. [2023-01-27 19:44:49,290 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 131 transitions, 935 flow [2023-01-27 19:44:49,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-27 19:44:49,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-27 19:44:49,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 604 transitions. [2023-01-27 19:44:49,291 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44542772861356933 [2023-01-27 19:44:49,291 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 604 transitions. [2023-01-27 19:44:49,291 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 604 transitions. [2023-01-27 19:44:49,292 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 19:44:49,292 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 604 transitions. [2023-01-27 19:44:49,293 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 100.66666666666667) internal successors, (604), 6 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 19:44:49,294 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 226.0) internal successors, (1582), 7 states have internal predecessors, (1582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 19:44:49,294 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 226.0) internal successors, (1582), 7 states have internal predecessors, (1582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 19:44:49,294 INFO L175 Difference]: Start difference. First operand has 50 places, 48 transitions, 296 flow. Second operand 6 states and 604 transitions. [2023-01-27 19:44:49,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 131 transitions, 935 flow [2023-01-27 19:44:49,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 131 transitions, 924 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-01-27 19:44:49,310 INFO L231 Difference]: Finished difference. Result has 56 places, 51 transitions, 348 flow [2023-01-27 19:44:49,310 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=285, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=348, PETRI_PLACES=56, PETRI_TRANSITIONS=51} [2023-01-27 19:44:49,310 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 22 predicate places. [2023-01-27 19:44:49,310 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 51 transitions, 348 flow [2023-01-27 19:44:49,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 90.28571428571429) internal successors, (632), 7 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 19:44:49,311 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 19:44:49,311 INFO L208 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] [2023-01-27 19:44:49,333 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-01-27 19:44:49,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 19:44:49,516 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)] === [2023-01-27 19:44:49,516 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 19:44:49,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1691541935, now seen corresponding path program 1 times [2023-01-27 19:44:49,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 19:44:49,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605667718] [2023-01-27 19:44:49,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 19:44:49,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 19:44:49,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 19:44:49,872 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 19:44:49,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 19:44:49,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605667718] [2023-01-27 19:44:49,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605667718] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 19:44:49,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1820683155] [2023-01-27 19:44:49,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 19:44:49,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 19:44:49,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 19:44:49,894 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) [2023-01-27 19:44:49,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-01-27 19:44:51,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 19:44:51,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 16 conjunts are in the unsatisfiable core [2023-01-27 19:44:51,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 19:45:03,667 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 19:45:03,668 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 19:45:12,635 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 19:45:12,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1820683155] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 19:45:12,636 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 19:45:12,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2023-01-27 19:45:12,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330586292] [2023-01-27 19:45:12,636 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 19:45:12,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-01-27 19:45:12,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 19:45:12,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-01-27 19:45:12,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=114, Unknown=9, NotChecked=0, Total=156 [2023-01-27 19:45:12,639 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 226 [2023-01-27 19:45:12,640 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 51 transitions, 348 flow. Second operand has 13 states, 13 states have (on average 89.0) internal successors, (1157), 13 states have internal predecessors, (1157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 19:45:12,640 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 19:45:12,640 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 226 [2023-01-27 19:45:12,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 19:45:22,694 WARN L222 SmtUtils]: Spent 6.45s on a formula simplification. DAG size of input: 62 DAG size of output: 46 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 19:45:24,758 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 [] [2023-01-27 19:45:26,850 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 [] [2023-01-27 19:45:28,912 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 [] [2023-01-27 19:45:31,687 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 [] [2023-01-27 19:45:32,836 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-27 19:45:34,934 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 [] [2023-01-27 19:45:36,962 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 [] [2023-01-27 19:45:39,227 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 [] [2023-01-27 19:45:52,241 WARN L222 SmtUtils]: Spent 12.55s on a formula simplification. DAG size of input: 71 DAG size of output: 58 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 19:45:54,793 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 [] [2023-01-27 19:45:56,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-27 19:46:00,390 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 [] [2023-01-27 19:46:03,549 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 [] [2023-01-27 19:46:05,700 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 [] [2023-01-27 19:46:08,614 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 [] [2023-01-27 19:46:22,667 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 [] [2023-01-27 19:46:32,109 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-27 19:46:34,082 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 [] [2023-01-27 19:46:36,373 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 [] [2023-01-27 19:46:44,039 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 [] [2023-01-27 19:46:48,099 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 [] [2023-01-27 19:46:54,123 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 [] [2023-01-27 19:46:56,529 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-27 19:47:00,252 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 [] [2023-01-27 19:47:03,387 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 [] [2023-01-27 19:47:04,779 INFO L130 PetriNetUnfolder]: 3203/4384 cut-off events. [2023-01-27 19:47:04,779 INFO L131 PetriNetUnfolder]: For 16001/16001 co-relation queries the response was YES. [2023-01-27 19:47:04,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19513 conditions, 4384 events. 3203/4384 cut-off events. For 16001/16001 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 18001 event pairs, 629 based on Foata normal form. 2/4386 useless extension candidates. Maximal degree in co-relation 16483. Up to 3239 conditions per place. [2023-01-27 19:47:04,830 INFO L137 encePairwiseOnDemand]: 209/226 looper letters, 142 selfloop transitions, 54 changer transitions 5/201 dead transitions. [2023-01-27 19:47:04,831 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 201 transitions, 1539 flow [2023-01-27 19:47:04,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-01-27 19:47:04,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-01-27 19:47:04,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1188 transitions. [2023-01-27 19:47:04,855 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43805309734513276 [2023-01-27 19:47:04,855 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1188 transitions. [2023-01-27 19:47:04,855 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1188 transitions. [2023-01-27 19:47:04,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 19:47:04,856 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1188 transitions. [2023-01-27 19:47:04,858 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 99.0) internal successors, (1188), 12 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 19:47:04,860 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 226.0) internal successors, (2938), 13 states have internal predecessors, (2938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 19:47:04,862 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 226.0) internal successors, (2938), 13 states have internal predecessors, (2938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 19:47:04,862 INFO L175 Difference]: Start difference. First operand has 56 places, 51 transitions, 348 flow. Second operand 12 states and 1188 transitions. [2023-01-27 19:47:04,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 201 transitions, 1539 flow [2023-01-27 19:47:04,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 201 transitions, 1470 flow, removed 6 selfloop flow, removed 3 redundant places. [2023-01-27 19:47:04,876 INFO L231 Difference]: Finished difference. Result has 71 places, 96 transitions, 833 flow [2023-01-27 19:47:04,876 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=833, PETRI_PLACES=71, PETRI_TRANSITIONS=96} [2023-01-27 19:47:04,878 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 37 predicate places. [2023-01-27 19:47:04,878 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 96 transitions, 833 flow [2023-01-27 19:47:04,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 89.0) internal successors, (1157), 13 states have internal predecessors, (1157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 19:47:04,878 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 19:47:04,878 INFO L208 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] [2023-01-27 19:47:04,897 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-01-27 19:47:05,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 19:47:05,084 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)] === [2023-01-27 19:47:05,084 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 19:47:05,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1719575699, now seen corresponding path program 2 times [2023-01-27 19:47:05,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 19:47:05,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926125974] [2023-01-27 19:47:05,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 19:47:05,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 19:47:05,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 19:47:05,510 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 19:47:05,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 19:47:05,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926125974] [2023-01-27 19:47:05,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926125974] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 19:47:05,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2082949618] [2023-01-27 19:47:05,511 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-27 19:47:05,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 19:47:05,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 19:47:05,512 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) [2023-01-27 19:47:05,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-01-27 19:47:10,840 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-27 19:47:10,840 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 19:47:10,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 17 conjunts are in the unsatisfiable core [2023-01-27 19:47:10,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 19:48:14,857 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 19:48:14,857 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 19:48:35,828 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 19:48:35,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2082949618] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 19:48:35,829 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 19:48:35,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 5] total 15 [2023-01-27 19:48:35,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207774268] [2023-01-27 19:48:35,829 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 19:48:35,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-01-27 19:48:35,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 19:48:35,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-01-27 19:48:35,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=172, Unknown=27, NotChecked=0, Total=272 [2023-01-27 19:48:35,831 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 226 [2023-01-27 19:48:35,832 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 96 transitions, 833 flow. Second operand has 17 states, 17 states have (on average 87.82352941176471) internal successors, (1493), 17 states have internal predecessors, (1493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 19:48:35,832 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 19:48:35,832 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 226 [2023-01-27 19:48:35,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 19:48:38,041 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 [] [2023-01-27 19:48:47,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-27 19:48:50,034 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 [] [2023-01-27 19:48:52,043 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 [] [2023-01-27 19:48:54,195 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 [] [2023-01-27 19:48:56,235 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-27 19:48:58,240 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 [] [2023-01-27 19:49:00,246 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 [] [2023-01-27 19:49:02,273 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~x1~0 4294967296)) (.cse1 (* 3 c_~x4~0)) (.cse10 (mod (div c_~x3~0 4) 4294967296)) (.cse9 (= (+ c_~x1~0 (* (div c_~x2~0 4294967296) 4294967296)) (+ (* 4294967296 (div c_~x1~0 4294967296)) c_~x2~0))) (.cse3 (* c_~x3~0 4))) (and (< 0 .cse0) (= .cse0 (mod c_~x2~0 4294967296)) (= (mod .cse1 4) 0) (= (mod c_~x3~0 4) 0) (let ((.cse2 (div c_~n~0 4294967296)) (.cse5 (div c_~x3~0 4294967296)) (.cse4 (div c_~x4~0 4294967296))) (or (<= (+ (* 17179869184 .cse2) .cse3 (* .cse4 12884901888) 17179869188) (+ .cse1 (* 17179869184 .cse5) (* c_~n~0 4))) (let ((.cse8 (* .cse4 4294967296))) (let ((.cse7 (+ c_~x3~0 .cse8)) (.cse6 (* 4294967296 .cse5))) (and (<= (+ .cse6 c_~x4~0) .cse7) (or (< .cse7 (+ .cse6 c_~x4~0 1)) (<= (+ (* 4294967296 .cse2) 6 c_~x4~0) (+ c_~n~0 .cse8))) .cse9))))) (< .cse10 (mod c_~n~0 4294967296)) (< 0 .cse10) (= (mod (div (- c_~x4~0) (- 4)) 4294967296) .cse10) (or (let ((.cse11 (mod c_~x3~0 4294967296))) (< (+ (* (div (+ (- 1) (* (mod c_~x4~0 1073741824) 4) (- .cse11)) 4294967296) 4294967296) (* 4 (mod c_~x3~0 1073741824))) (+ .cse11 1))) (let ((.cse13 (+ c_~x3~0 (* 1073741824 (div (* 4 c_~x4~0) 4294967296)))) (.cse12 (* 1073741824 (div .cse3 4294967296)))) (and (<= (+ .cse12 c_~x4~0) .cse13) (< .cse13 (+ .cse12 c_~x4~0 1)) .cse9))))) is different from false [2023-01-27 19:49:04,331 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 [] [2023-01-27 19:49:30,919 WARN L222 SmtUtils]: Spent 17.94s on a formula simplification. DAG size of input: 54 DAG size of output: 35 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 19:49:33,221 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 [] [2023-01-27 19:49:35,226 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 [] [2023-01-27 19:49:42,910 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 [] [2023-01-27 19:49:54,876 WARN L222 SmtUtils]: Spent 9.18s on a formula simplification. DAG size of input: 70 DAG size of output: 49 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 19:49:56,881 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 [] [2023-01-27 19:49:58,886 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 [] [2023-01-27 19:50:00,930 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 [] [2023-01-27 19:50:02,939 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 [] [2023-01-27 19:50:05,007 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 [] [2023-01-27 19:50:07,011 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 [] [2023-01-27 19:50:09,225 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 [] [2023-01-27 19:50:11,230 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 [] [2023-01-27 19:50:20,476 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 [] [2023-01-27 19:50:22,975 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 [] [2023-01-27 19:50:25,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 [] [2023-01-27 19:50:27,420 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 [] [2023-01-27 19:50:29,826 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 [] [2023-01-27 19:50:31,157 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-27 19:50:33,316 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 [] [2023-01-27 19:50:36,202 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 [] [2023-01-27 19:50:38,208 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 [] [2023-01-27 19:50:40,213 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 [] [2023-01-27 19:50:43,801 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 [] [2023-01-27 19:50:45,806 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 [] [2023-01-27 19:50:47,857 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-01-27 19:50:50,753 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 [] [2023-01-27 19:50:52,757 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 [] [2023-01-27 19:50:54,143 INFO L130 PetriNetUnfolder]: 4597/6323 cut-off events. [2023-01-27 19:50:54,144 INFO L131 PetriNetUnfolder]: For 29187/29187 co-relation queries the response was YES. [2023-01-27 19:50:54,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32759 conditions, 6323 events. 4597/6323 cut-off events. For 29187/29187 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 28258 event pairs, 393 based on Foata normal form. 32/6355 useless extension candidates. Maximal degree in co-relation 31922. Up to 4532 conditions per place. [2023-01-27 19:50:54,224 INFO L137 encePairwiseOnDemand]: 210/226 looper letters, 187 selfloop transitions, 88 changer transitions 19/294 dead transitions. [2023-01-27 19:50:54,224 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 294 transitions, 2767 flow [2023-01-27 19:50:54,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-01-27 19:50:54,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-01-27 19:50:54,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1379 transitions. [2023-01-27 19:50:54,227 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4358407079646018 [2023-01-27 19:50:54,227 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1379 transitions. [2023-01-27 19:50:54,228 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1379 transitions. [2023-01-27 19:50:54,228 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 19:50:54,228 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1379 transitions. [2023-01-27 19:50:54,230 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 98.5) internal successors, (1379), 14 states have internal predecessors, (1379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 19:50:54,233 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 226.0) internal successors, (3390), 15 states have internal predecessors, (3390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 19:50:54,233 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 226.0) internal successors, (3390), 15 states have internal predecessors, (3390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 19:50:54,233 INFO L175 Difference]: Start difference. First operand has 71 places, 96 transitions, 833 flow. Second operand 14 states and 1379 transitions. [2023-01-27 19:50:54,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 294 transitions, 2767 flow [2023-01-27 19:50:54,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 294 transitions, 2658 flow, removed 50 selfloop flow, removed 1 redundant places. [2023-01-27 19:50:54,278 INFO L231 Difference]: Finished difference. Result has 92 places, 168 transitions, 1681 flow [2023-01-27 19:50:54,278 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=726, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1681, PETRI_PLACES=92, PETRI_TRANSITIONS=168} [2023-01-27 19:50:54,279 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 58 predicate places. [2023-01-27 19:50:54,279 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 168 transitions, 1681 flow [2023-01-27 19:50:54,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 87.82352941176471) internal successors, (1493), 17 states have internal predecessors, (1493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 19:50:54,279 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 19:50:54,279 INFO L208 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] [2023-01-27 19:50:54,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-01-27 19:50:54,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 19:50:54,485 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)] === [2023-01-27 19:50:54,486 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 19:50:54,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1802692589, now seen corresponding path program 3 times [2023-01-27 19:50:54,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 19:50:54,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333109269] [2023-01-27 19:50:54,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 19:50:54,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 19:50:54,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 19:50:54,800 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 19:50:54,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 19:50:54,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333109269] [2023-01-27 19:50:54,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333109269] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 19:50:54,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1923279977] [2023-01-27 19:50:54,800 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-27 19:50:54,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 19:50:54,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 19:50:54,801 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 19:50:54,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-01-27 19:50:55,012 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-01-27 19:50:55,012 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 19:50:55,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 17 conjunts are in the unsatisfiable core [2023-01-27 19:50:55,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 19:51:23,838 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 19:51:23,839 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 19:51:25,203 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 19:51:25,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1923279977] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 19:51:25,203 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 19:51:25,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2023-01-27 19:51:25,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582358211] [2023-01-27 19:51:25,205 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 19:51:25,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-01-27 19:51:25,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 19:51:25,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-01-27 19:51:25,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=156, Unknown=6, NotChecked=0, Total=240 [2023-01-27 19:51:25,208 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 226 [2023-01-27 19:51:25,209 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 168 transitions, 1681 flow. Second operand has 16 states, 16 states have (on average 88.0625) internal successors, (1409), 16 states have internal predecessors, (1409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 19:51:25,209 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 19:51:25,209 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 226 [2023-01-27 19:51:25,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 19:51:27,486 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 [] [2023-01-27 19:51:46,073 WARN L222 SmtUtils]: Spent 15.96s on a formula simplification. DAG size of input: 73 DAG size of output: 27 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 19:51:48,641 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 [] [2023-01-27 19:51:50,647 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 [] [2023-01-27 19:51:52,669 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 [] [2023-01-27 19:51:54,678 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 [] [2023-01-27 19:51:57,294 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 [] [2023-01-27 19:51:59,345 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 [] [2023-01-27 19:52:01,349 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 [] [2023-01-27 19:52:04,241 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 [] [2023-01-27 19:52:06,246 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 [] [2023-01-27 19:52:09,242 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 [] [2023-01-27 19:52:11,450 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 [] [2023-01-27 19:52:14,093 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 [] [2023-01-27 19:52:16,404 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 [] [2023-01-27 19:52:18,914 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 [] [2023-01-27 19:52:21,244 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 [] [2023-01-27 19:52:23,254 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 [] [2023-01-27 19:52:25,259 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 [] [2023-01-27 19:52:27,295 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 [] [2023-01-27 19:52:29,300 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 [] [2023-01-27 19:52:30,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-27 19:52:32,488 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-27 19:52:34,491 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 [] [2023-01-27 19:52:36,504 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 [] [2023-01-27 19:52:38,511 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 [] [2023-01-27 19:52:41,367 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 [] [2023-01-27 19:52:46,698 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 [] [2023-01-27 19:52:48,705 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 [] [2023-01-27 19:52:50,817 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 [] [2023-01-27 19:52:51,951 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-27 19:52:54,011 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 [] [2023-01-27 19:52:55,981 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-27 19:52:57,991 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 [] [2023-01-27 19:53:00,013 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 [] [2023-01-27 19:53:05,363 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 [] [2023-01-27 19:53:08,200 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 [] [2023-01-27 19:53:11,005 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 [] [2023-01-27 19:53:12,106 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-27 19:53:14,111 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 [] [2023-01-27 19:53:16,658 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 [] [2023-01-27 19:53:18,798 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 [] [2023-01-27 19:53:31,551 WARN L222 SmtUtils]: Spent 6.43s on a formula simplification. DAG size of input: 45 DAG size of output: 37 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 19:53:33,559 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 [] [2023-01-27 19:53:35,868 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 [] [2023-01-27 19:53:37,919 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 [] [2023-01-27 19:53:39,924 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 [] [2023-01-27 19:53:41,977 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 [] [2023-01-27 19:53:44,483 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 [] [2023-01-27 19:53:46,997 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 [] [2023-01-27 19:53:57,156 WARN L222 SmtUtils]: Spent 5.87s on a formula simplification. DAG size of input: 33 DAG size of output: 26 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 19:54:00,848 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 [] [2023-01-27 19:54:03,753 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 [] [2023-01-27 19:54:05,768 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 [] [2023-01-27 19:54:07,883 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 [] [2023-01-27 19:54:09,895 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 [] [2023-01-27 19:54:11,241 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-01-27 19:54:13,248 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 [] [2023-01-27 19:54:15,836 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 [] [2023-01-27 19:54:18,194 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 [] [2023-01-27 19:54:20,617 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 [] [2023-01-27 19:54:22,121 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-27 19:54:23,900 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-27 19:54:25,912 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 [] [2023-01-27 19:54:30,775 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-27 19:54:33,053 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 [] [2023-01-27 19:54:35,372 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 [] [2023-01-27 19:54:37,588 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 [] [2023-01-27 19:54:41,523 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 [] [2023-01-27 19:54:43,538 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 [] [2023-01-27 19:54:47,674 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 [] [2023-01-27 19:54:50,420 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 [] [2023-01-27 19:54:52,453 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 [] [2023-01-27 19:54:54,463 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 [] [2023-01-27 19:54:55,799 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-27 19:54:57,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-27 19:55:00,229 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-27 19:55:02,379 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 [] [2023-01-27 19:55:04,405 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 [] [2023-01-27 19:55:06,618 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 [] [2023-01-27 19:55:08,623 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 [] [2023-01-27 19:55:10,625 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 [] [2023-01-27 19:55:12,633 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 [] [2023-01-27 19:55:14,590 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-27 19:55:16,804 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 [] [2023-01-27 19:55:18,963 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 [] [2023-01-27 19:55:21,569 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-27 19:55:23,307 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-27 19:55:25,633 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-27 19:55:29,585 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 [] [2023-01-27 19:55:32,999 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 [] [2023-01-27 19:55:35,007 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 [] [2023-01-27 19:55:37,188 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 [] [2023-01-27 19:55:38,951 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-01-27 19:55:40,777 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-27 19:55:42,271 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-27 19:55:44,464 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 [] [2023-01-27 19:55:45,588 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-27 19:55:48,229 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 [] [2023-01-27 19:55:49,409 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-27 19:55:51,429 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-27 19:55:51,796 INFO L130 PetriNetUnfolder]: 5857/8205 cut-off events. [2023-01-27 19:55:51,796 INFO L131 PetriNetUnfolder]: For 70221/70221 co-relation queries the response was YES. [2023-01-27 19:55:51,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53771 conditions, 8205 events. 5857/8205 cut-off events. For 70221/70221 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 39734 event pairs, 446 based on Foata normal form. 31/8236 useless extension candidates. Maximal degree in co-relation 53047. Up to 5021 conditions per place. [2023-01-27 19:55:51,845 INFO L137 encePairwiseOnDemand]: 210/226 looper letters, 236 selfloop transitions, 190 changer transitions 16/442 dead transitions. [2023-01-27 19:55:51,845 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 442 transitions, 5269 flow [2023-01-27 19:55:51,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-01-27 19:55:51,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-01-27 19:55:51,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1587 transitions. [2023-01-27 19:55:51,848 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43888274336283184 [2023-01-27 19:55:51,848 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1587 transitions. [2023-01-27 19:55:51,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1587 transitions. [2023-01-27 19:55:51,849 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 19:55:51,849 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1587 transitions. [2023-01-27 19:55:51,851 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 99.1875) internal successors, (1587), 16 states have internal predecessors, (1587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 19:55:51,854 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 226.0) internal successors, (3842), 17 states have internal predecessors, (3842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 19:55:51,855 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 226.0) internal successors, (3842), 17 states have internal predecessors, (3842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 19:55:51,855 INFO L175 Difference]: Start difference. First operand has 92 places, 168 transitions, 1681 flow. Second operand 16 states and 1587 transitions. [2023-01-27 19:55:51,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 442 transitions, 5269 flow [2023-01-27 19:55:51,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 442 transitions, 4926 flow, removed 167 selfloop flow, removed 1 redundant places. [2023-01-27 19:55:52,001 INFO L231 Difference]: Finished difference. Result has 116 places, 297 transitions, 3545 flow [2023-01-27 19:55:52,001 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=1456, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=3545, PETRI_PLACES=116, PETRI_TRANSITIONS=297} [2023-01-27 19:55:52,002 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 82 predicate places. [2023-01-27 19:55:52,002 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 297 transitions, 3545 flow [2023-01-27 19:55:52,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 88.0625) internal successors, (1409), 16 states have internal predecessors, (1409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 19:55:52,002 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 19:55:52,002 INFO L208 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] [2023-01-27 19:55:52,008 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-01-27 19:55:52,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 19:55:52,208 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)] === [2023-01-27 19:55:52,208 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 19:55:52,208 INFO L85 PathProgramCache]: Analyzing trace with hash 428160059, now seen corresponding path program 1 times [2023-01-27 19:55:52,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 19:55:52,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511514219] [2023-01-27 19:55:52,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 19:55:52,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 19:55:52,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 19:55:52,553 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 19:55:52,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 19:55:52,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511514219] [2023-01-27 19:55:52,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511514219] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 19:55:52,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1326446703] [2023-01-27 19:55:52,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 19:55:52,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 19:55:52,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 19:55:52,570 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 19:55:52,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-01-27 19:55:53,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 19:55:53,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 15 conjunts are in the unsatisfiable core [2023-01-27 19:55:53,915 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 19:55:56,455 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 19:55:56,455 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 19:55:57,006 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 19:55:57,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1326446703] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 19:55:57,007 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 19:55:57,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 10 [2023-01-27 19:55:57,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433077133] [2023-01-27 19:55:57,007 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 19:55:57,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-01-27 19:55:57,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 19:55:57,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-01-27 19:55:57,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2023-01-27 19:55:57,010 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 226 [2023-01-27 19:55:57,011 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 297 transitions, 3545 flow. Second operand has 12 states, 12 states have (on average 89.25) internal successors, (1071), 12 states have internal predecessors, (1071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 19:55:57,011 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 19:55:57,011 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 226 [2023-01-27 19:55:57,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 19:56:05,504 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-01-27 19:56:06,855 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-01-27 19:56:08,882 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 [] [2023-01-27 19:56:11,229 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 [] [2023-01-27 19:56:13,771 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 [] [2023-01-27 19:56:15,776 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 [] [2023-01-27 19:56:18,099 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 [] [2023-01-27 19:56:21,695 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 [] [2023-01-27 19:56:24,141 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-27 19:56:33,777 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 [] [2023-01-27 19:56:34,917 INFO L130 PetriNetUnfolder]: 6563/9164 cut-off events. [2023-01-27 19:56:34,917 INFO L131 PetriNetUnfolder]: For 136743/136743 co-relation queries the response was YES. [2023-01-27 19:56:34,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72849 conditions, 9164 events. 6563/9164 cut-off events. For 136743/136743 co-relation queries the response was YES. Maximal size of possible extension queue 399. Compared 44830 event pairs, 548 based on Foata normal form. 2/9166 useless extension candidates. Maximal degree in co-relation 71985. Up to 8140 conditions per place. [2023-01-27 19:56:34,978 INFO L137 encePairwiseOnDemand]: 219/226 looper letters, 366 selfloop transitions, 29 changer transitions 5/400 dead transitions. [2023-01-27 19:56:34,978 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 400 transitions, 5392 flow [2023-01-27 19:56:34,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-27 19:56:34,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-27 19:56:34,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 810 transitions. [2023-01-27 19:56:34,981 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4480088495575221 [2023-01-27 19:56:34,981 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 810 transitions. [2023-01-27 19:56:34,981 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 810 transitions. [2023-01-27 19:56:34,981 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 19:56:34,981 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 810 transitions. [2023-01-27 19:56:34,982 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 101.25) internal successors, (810), 8 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 19:56:34,984 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 226.0) internal successors, (2034), 9 states have internal predecessors, (2034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 19:56:34,984 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 226.0) internal successors, (2034), 9 states have internal predecessors, (2034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 19:56:34,984 INFO L175 Difference]: Start difference. First operand has 116 places, 297 transitions, 3545 flow. Second operand 8 states and 810 transitions. [2023-01-27 19:56:34,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 400 transitions, 5392 flow [2023-01-27 19:56:35,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 400 transitions, 4924 flow, removed 231 selfloop flow, removed 1 redundant places. [2023-01-27 19:56:35,278 INFO L231 Difference]: Finished difference. Result has 125 places, 314 transitions, 3376 flow [2023-01-27 19:56:35,278 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=3101, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3376, PETRI_PLACES=125, PETRI_TRANSITIONS=314} [2023-01-27 19:56:35,278 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 91 predicate places. [2023-01-27 19:56:35,278 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 314 transitions, 3376 flow [2023-01-27 19:56:35,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 89.25) internal successors, (1071), 12 states have internal predecessors, (1071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 19:56:35,279 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 19:56:35,279 INFO L208 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] [2023-01-27 19:56:35,286 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-01-27 19:56:35,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 19:56:35,486 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)] === [2023-01-27 19:56:35,487 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 19:56:35,487 INFO L85 PathProgramCache]: Analyzing trace with hash 2065853577, now seen corresponding path program 2 times [2023-01-27 19:56:35,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 19:56:35,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867199779] [2023-01-27 19:56:35,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 19:56:35,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 19:56:35,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 19:56:35,811 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 19:56:35,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 19:56:35,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867199779] [2023-01-27 19:56:35,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867199779] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 19:56:35,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2049742495] [2023-01-27 19:56:35,811 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-27 19:56:35,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 19:56:35,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 19:56:35,813 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 19:56:35,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-01-27 19:56:37,959 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-27 19:56:37,959 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 19:56:37,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 15 conjunts are in the unsatisfiable core [2023-01-27 19:56:37,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 19:56:40,180 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 19:56:40,180 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 19:56:40,388 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 19:56:40,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2049742495] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 19:56:40,388 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 19:56:40,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 10 [2023-01-27 19:56:40,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531813681] [2023-01-27 19:56:40,389 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 19:56:40,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-01-27 19:56:40,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 19:56:40,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-01-27 19:56:40,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2023-01-27 19:56:40,390 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 226 [2023-01-27 19:56:40,390 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 314 transitions, 3376 flow. Second operand has 12 states, 12 states have (on average 89.0) internal successors, (1068), 12 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 19:56:40,391 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 19:56:40,391 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 226 [2023-01-27 19:56:40,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 19:56:47,196 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-27 19:56:49,096 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-27 19:56:53,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-27 19:56:56,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 [] [2023-01-27 19:56:57,716 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 [] [2023-01-27 19:57:01,100 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 [] [2023-01-27 19:57:04,731 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 [] [2023-01-27 19:57:08,154 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-27 19:57:12,953 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-01-27 19:57:15,294 INFO L130 PetriNetUnfolder]: 7391/10297 cut-off events. [2023-01-27 19:57:15,295 INFO L131 PetriNetUnfolder]: For 146520/146520 co-relation queries the response was YES. [2023-01-27 19:57:15,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80298 conditions, 10297 events. 7391/10297 cut-off events. For 146520/146520 co-relation queries the response was YES. Maximal size of possible extension queue 433. Compared 50893 event pairs, 858 based on Foata normal form. 3/10300 useless extension candidates. Maximal degree in co-relation 79375. Up to 9204 conditions per place. [2023-01-27 19:57:15,378 INFO L137 encePairwiseOnDemand]: 219/226 looper letters, 390 selfloop transitions, 32 changer transitions 6/428 dead transitions. [2023-01-27 19:57:15,379 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 428 transitions, 5422 flow [2023-01-27 19:57:15,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-27 19:57:15,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-01-27 19:57:15,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 907 transitions. [2023-01-27 19:57:15,397 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44591937069813176 [2023-01-27 19:57:15,397 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 907 transitions. [2023-01-27 19:57:15,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 907 transitions. [2023-01-27 19:57:15,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 19:57:15,397 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 907 transitions. [2023-01-27 19:57:15,399 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 100.77777777777777) internal successors, (907), 9 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 19:57:15,400 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 226.0) internal successors, (2260), 10 states have internal predecessors, (2260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 19:57:15,401 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 226.0) internal successors, (2260), 10 states have internal predecessors, (2260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 19:57:15,401 INFO L175 Difference]: Start difference. First operand has 125 places, 314 transitions, 3376 flow. Second operand 9 states and 907 transitions. [2023-01-27 19:57:15,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 428 transitions, 5422 flow [2023-01-27 19:57:15,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 428 transitions, 5343 flow, removed 35 selfloop flow, removed 1 redundant places. [2023-01-27 19:57:15,658 INFO L231 Difference]: Finished difference. Result has 136 places, 333 transitions, 3627 flow [2023-01-27 19:57:15,659 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=3297, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3627, PETRI_PLACES=136, PETRI_TRANSITIONS=333} [2023-01-27 19:57:15,659 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 102 predicate places. [2023-01-27 19:57:15,659 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 333 transitions, 3627 flow [2023-01-27 19:57:15,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 89.0) internal successors, (1068), 12 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 19:57:15,660 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 19:57:15,660 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 19:57:15,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-01-27 19:57:15,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-01-27 19:57:15,867 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-27 19:57:15,868 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 19:57:15,868 INFO L85 PathProgramCache]: Analyzing trace with hash -634653945, now seen corresponding path program 3 times [2023-01-27 19:57:15,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 19:57:15,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925136506] [2023-01-27 19:57:15,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 19:57:15,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 19:57:15,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 19:57:16,122 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 19:57:16,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 19:57:16,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925136506] [2023-01-27 19:57:16,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925136506] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 19:57:16,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1204433677] [2023-01-27 19:57:16,123 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-27 19:57:16,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 19:57:16,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 19:57:16,129 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 19:57:16,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-01-27 19:58:34,180 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-01-27 19:58:34,180 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 19:58:34,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 11 conjunts are in the unsatisfiable core [2023-01-27 19:58:34,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 19:58:34,454 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 19:58:34,454 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 19:58:35,002 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 19:58:35,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1204433677] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 19:58:35,002 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 19:58:35,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 13 [2023-01-27 19:58:35,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869192667] [2023-01-27 19:58:35,002 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 19:58:35,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-01-27 19:58:35,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 19:58:35,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-01-27 19:58:35,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2023-01-27 19:58:35,003 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 226 [2023-01-27 19:58:35,004 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 333 transitions, 3627 flow. Second operand has 14 states, 14 states have (on average 87.78571428571429) internal successors, (1229), 14 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 19:58:35,004 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 19:58:35,004 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 226 [2023-01-27 19:58:35,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 19:58:37,322 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 [] [2023-01-27 19:58:42,354 INFO L130 PetriNetUnfolder]: 11465/15885 cut-off events. [2023-01-27 19:58:42,354 INFO L131 PetriNetUnfolder]: For 244032/244032 co-relation queries the response was YES. [2023-01-27 19:58:42,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125503 conditions, 15885 events. 11465/15885 cut-off events. For 244032/244032 co-relation queries the response was YES. Maximal size of possible extension queue 645. Compared 83544 event pairs, 935 based on Foata normal form. 208/16093 useless extension candidates. Maximal degree in co-relation 124311. Up to 6797 conditions per place. [2023-01-27 19:58:42,528 INFO L137 encePairwiseOnDemand]: 219/226 looper letters, 527 selfloop transitions, 174 changer transitions 3/704 dead transitions. [2023-01-27 19:58:42,528 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 704 transitions, 9026 flow [2023-01-27 19:58:42,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-01-27 19:58:42,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-01-27 19:58:42,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1818 transitions. [2023-01-27 19:58:42,547 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4469026548672566 [2023-01-27 19:58:42,547 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1818 transitions. [2023-01-27 19:58:42,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1818 transitions. [2023-01-27 19:58:42,547 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 19:58:42,548 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1818 transitions. [2023-01-27 19:58:42,550 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 101.0) internal successors, (1818), 18 states have internal predecessors, (1818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 19:58:42,553 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 226.0) internal successors, (4294), 19 states have internal predecessors, (4294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 19:58:42,554 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 226.0) internal successors, (4294), 19 states have internal predecessors, (4294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 19:58:42,554 INFO L175 Difference]: Start difference. First operand has 136 places, 333 transitions, 3627 flow. Second operand 18 states and 1818 transitions. [2023-01-27 19:58:42,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 704 transitions, 9026 flow [2023-01-27 19:58:42,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 704 transitions, 8891 flow, removed 63 selfloop flow, removed 1 redundant places. [2023-01-27 19:58:42,983 INFO L231 Difference]: Finished difference. Result has 162 places, 358 transitions, 4412 flow [2023-01-27 19:58:42,983 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=3492, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=333, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=151, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=4412, PETRI_PLACES=162, PETRI_TRANSITIONS=358} [2023-01-27 19:58:42,984 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 128 predicate places. [2023-01-27 19:58:42,985 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 358 transitions, 4412 flow [2023-01-27 19:58:42,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 87.78571428571429) internal successors, (1229), 14 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 19:58:42,986 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 19:58:42,986 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 19:58:42,997 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-01-27 19:58:43,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-01-27 19:58:43,196 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-27 19:58:43,196 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 19:58:43,196 INFO L85 PathProgramCache]: Analyzing trace with hash 394005194, now seen corresponding path program 4 times [2023-01-27 19:58:43,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 19:58:43,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444890743] [2023-01-27 19:58:43,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 19:58:43,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 19:58:43,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 19:58:43,322 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 19:58:43,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 19:58:43,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444890743] [2023-01-27 19:58:43,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444890743] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 19:58:43,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [443989396] [2023-01-27 19:58:43,322 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-01-27 19:58:43,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 19:58:43,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 19:58:43,324 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 19:58:43,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-01-27 19:58:44,457 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-01-27 19:58:44,457 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 19:58:44,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 11 conjunts are in the unsatisfiable core [2023-01-27 19:58:44,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 19:58:45,059 INFO L208 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2023-01-27 19:58:46,814 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 19:58:46,814 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 19:58:46,890 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 19:58:46,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [443989396] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 19:58:46,890 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 19:58:46,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-01-27 19:58:46,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379558087] [2023-01-27 19:58:46,890 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 19:58:46,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-01-27 19:58:46,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 19:58:46,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-01-27 19:58:46,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-01-27 19:58:46,891 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 226 [2023-01-27 19:58:46,892 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 358 transitions, 4412 flow. Second operand has 11 states, 11 states have (on average 97.36363636363636) internal successors, (1071), 11 states have internal predecessors, (1071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 19:58:46,892 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 19:58:46,892 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 226 [2023-01-27 19:58:46,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 19:58:49,629 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-01-27 19:58:51,738 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 [0] [2023-01-27 19:58:54,141 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-01-27 19:58:56,163 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 [] [2023-01-27 19:58:58,662 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 [0] [2023-01-27 19:59:00,771 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-01-27 19:59:03,021 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-01-27 19:59:05,121 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 [0] [2023-01-27 19:59:09,888 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 [0] [2023-01-27 19:59:12,358 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 [0] [2023-01-27 19:59:14,370 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 [0] Received shutdown request... [2023-01-27 19:59:14,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-01-27 19:59:14,481 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-01-27 19:59:14,486 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-27 19:59:14,486 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 [2023-01-27 19:59:14,486 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-01-27 19:59:14,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-01-27 19:59:14,686 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (11states, 92/226 universal loopers) in iteration 14,while PetriNetUnfolder was constructing finite prefix that currently has 37924 conditions, 4632 events (3495/4631 cut-off events. For 105007/105007 co-relation queries the response was YES. Maximal size of possible extension queue 705. Compared 22201 event pairs, 337 based on Foata normal form. 84/5421 useless extension candidates. Maximal degree in co-relation 37859. Up to 1799 conditions per place.). [2023-01-27 19:59:14,688 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2023-01-27 19:59:14,688 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-01-27 19:59:14,688 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-01-27 19:59:14,688 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2023-01-27 19:59:14,688 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 2, 2, 1, 1, 1] [2023-01-27 19:59:14,691 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-27 19:59:14,691 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-27 19:59:14,694 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.01 07:59:14 BasicIcfg [2023-01-27 19:59:14,694 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-27 19:59:14,694 INFO L158 Benchmark]: Toolchain (without parser) took 873547.78ms. Allocated memory was 721.4MB in the beginning and 866.1MB in the end (delta: 144.7MB). Free memory was 683.3MB in the beginning and 325.6MB in the end (delta: 357.7MB). Peak memory consumption was 505.0MB. Max. memory is 16.0GB. [2023-01-27 19:59:14,694 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 373.3MB. Free memory is still 322.2MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-27 19:59:14,694 INFO L158 Benchmark]: CACSL2BoogieTranslator took 279.25ms. Allocated memory is still 721.4MB. Free memory was 682.8MB in the beginning and 671.8MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. [2023-01-27 19:59:14,695 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.21ms. Allocated memory is still 721.4MB. Free memory was 671.8MB in the beginning and 670.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-27 19:59:14,695 INFO L158 Benchmark]: Boogie Preprocessor took 24.22ms. Allocated memory is still 721.4MB. Free memory was 670.3MB in the beginning and 668.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-27 19:59:14,695 INFO L158 Benchmark]: RCFGBuilder took 388.31ms. Allocated memory is still 721.4MB. Free memory was 668.7MB in the beginning and 653.4MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.0GB. [2023-01-27 19:59:14,695 INFO L158 Benchmark]: TraceAbstraction took 872819.77ms. Allocated memory was 721.4MB in the beginning and 866.1MB in the end (delta: 144.7MB). Free memory was 653.0MB in the beginning and 325.6MB in the end (delta: 327.4MB). Peak memory consumption was 475.7MB. Max. memory is 16.0GB. [2023-01-27 19:59:14,696 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.10ms. Allocated memory is still 373.3MB. Free memory is still 322.2MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 279.25ms. Allocated memory is still 721.4MB. Free memory was 682.8MB in the beginning and 671.8MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 32.21ms. Allocated memory is still 721.4MB. Free memory was 671.8MB in the beginning and 670.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 24.22ms. Allocated memory is still 721.4MB. Free memory was 670.3MB in the beginning and 668.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 388.31ms. Allocated memory is still 721.4MB. Free memory was 668.7MB in the beginning and 653.4MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.0GB. * TraceAbstraction took 872819.77ms. Allocated memory was 721.4MB in the beginning and 866.1MB in the end (delta: 144.7MB). Free memory was 653.0MB in the beginning and 325.6MB in the end (delta: 327.4MB). Peak memory consumption was 475.7MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.9s, 114 PlacesBefore, 34 PlacesAfterwards, 111 TransitionsBefore, 25 TransitionsAfterwards, 1512 CoEnabledTransitionPairs, 6 FixpointIterations, 50 TrivialSequentialCompositions, 29 ConcurrentSequentialCompositions, 6 TrivialYvCompositions, 8 ConcurrentYvCompositions, 6 ChoiceCompositions, 99 TotalNumberOfCompositions, 1649 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1649, independent: 1649, independent conditional: 0, independent unconditional: 1649, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 814, independent: 814, independent conditional: 0, independent unconditional: 814, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1649, independent: 835, independent conditional: 0, independent unconditional: 835, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 814, unknown conditional: 0, unknown unconditional: 814] , Statistics on independence cache: Total cache size (in pairs): 62, Positive cache size: 62, Positive conditional cache size: 0, Positive unconditional cache size: 62, 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 - TimeoutResultAtElement [Line: 96]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (11states, 92/226 universal loopers) in iteration 14,while PetriNetUnfolder was constructing finite prefix that currently has 37924 conditions, 4632 events (3495/4631 cut-off events. For 105007/105007 co-relation queries the response was YES. Maximal size of possible extension queue 705. Compared 22201 event pairs, 337 based on Foata normal form. 84/5421 useless extension candidates. Maximal degree in co-relation 37859. Up to 1799 conditions per place.). - TimeoutResultAtElement [Line: 87]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (11states, 92/226 universal loopers) in iteration 14,while PetriNetUnfolder was constructing finite prefix that currently has 37924 conditions, 4632 events (3495/4631 cut-off events. For 105007/105007 co-relation queries the response was YES. Maximal size of possible extension queue 705. Compared 22201 event pairs, 337 based on Foata normal form. 84/5421 useless extension candidates. Maximal degree in co-relation 37859. Up to 1799 conditions per place.). - TimeoutResultAtElement [Line: 89]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (11states, 92/226 universal loopers) in iteration 14,while PetriNetUnfolder was constructing finite prefix that currently has 37924 conditions, 4632 events (3495/4631 cut-off events. For 105007/105007 co-relation queries the response was YES. Maximal size of possible extension queue 705. Compared 22201 event pairs, 337 based on Foata normal form. 84/5421 useless extension candidates. Maximal degree in co-relation 37859. Up to 1799 conditions per place.). - TimeoutResultAtElement [Line: 88]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (11states, 92/226 universal loopers) in iteration 14,while PetriNetUnfolder was constructing finite prefix that currently has 37924 conditions, 4632 events (3495/4631 cut-off events. For 105007/105007 co-relation queries the response was YES. Maximal size of possible extension queue 705. Compared 22201 event pairs, 337 based on Foata normal form. 84/5421 useless extension candidates. Maximal degree in co-relation 37859. Up to 1799 conditions per place.). - TimeoutResultAtElement [Line: 86]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (11states, 92/226 universal loopers) in iteration 14,while PetriNetUnfolder was constructing finite prefix that currently has 37924 conditions, 4632 events (3495/4631 cut-off events. For 105007/105007 co-relation queries the response was YES. Maximal size of possible extension queue 705. Compared 22201 event pairs, 337 based on Foata normal form. 84/5421 useless extension candidates. Maximal degree in co-relation 37859. Up to 1799 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 146 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: 14, TraceHistogramMax: 2, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 628.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.0s, HoareTripleCheckerStatistics: 147 mSolverCounterUnknown, 1281 SdHoareTripleChecker+Valid, 455.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1281 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 452.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 197 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 79 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5506 IncrementalHoareTripleChecker+Invalid, 5929 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 79 mSolverCounterUnsat, 0 mSDtfsCounter, 5506 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 537 GetRequests, 378 SyntacticMatches, 14 SemanticMatches, 145 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 451 ImplicationChecksByTransitivity, 285.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4412occurred in iteration=13, InterpolantAutomatonStates: 110, 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, 89.6s SatisfiabilityAnalysisTime, 149.1s InterpolantComputationTime, 545 NumberOfCodeBlocks, 545 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 740 ConstructedInterpolants, 2 QuantifiedInterpolants, 24535 SizeOfPredicates, 51 NumberOfNonLiveVariables, 2027 ConjunctsInSsa, 123 ConjunctsInUnsatCore, 34 InterpolantComputations, 4 PerfectInterpolantSequences, 9/66 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