/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/parallel-parallel-sum-1-dsl.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-27 21:01:01,894 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-27 21:01:01,895 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-27 21:01:01,920 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-27 21:01:01,920 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-27 21:01:01,922 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-27 21:01:01,925 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-27 21:01:01,927 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-27 21:01:01,928 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-27 21:01:01,932 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-27 21:01:01,933 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-27 21:01:01,935 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-27 21:01:01,935 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-27 21:01:01,939 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-27 21:01:01,940 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-27 21:01:01,941 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-27 21:01:01,941 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-27 21:01:01,941 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-27 21:01:01,943 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-27 21:01:01,946 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-27 21:01:01,947 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-27 21:01:01,948 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-27 21:01:01,948 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-27 21:01:01,949 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-27 21:01:01,950 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-27 21:01:01,951 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-27 21:01:01,951 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-27 21:01:01,951 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-27 21:01:01,951 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-27 21:01:01,952 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-27 21:01:01,952 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-27 21:01:01,952 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-27 21:01:01,953 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-27 21:01:01,953 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-27 21:01:01,954 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-27 21:01:01,954 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-27 21:01:01,954 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-27 21:01:01,954 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-27 21:01:01,954 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-27 21:01:01,955 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-27 21:01:01,955 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-27 21:01:01,958 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 21:01:01,984 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-27 21:01:01,985 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-27 21:01:01,986 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-27 21:01:01,986 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-27 21:01:01,986 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-27 21:01:01,987 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-27 21:01:01,987 INFO L138 SettingsManager]: * Use SBE=true [2023-01-27 21:01:01,987 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-27 21:01:01,987 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-27 21:01:01,987 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-27 21:01:01,988 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-27 21:01:01,988 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-27 21:01:01,988 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-27 21:01:01,988 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-27 21:01:01,988 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-27 21:01:01,988 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-27 21:01:01,988 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-27 21:01:01,988 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-27 21:01:01,988 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-27 21:01:01,988 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-27 21:01:01,988 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-27 21:01:01,989 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-27 21:01:01,989 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-27 21:01:01,989 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 21:01:01,989 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-27 21:01:01,989 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-27 21:01:01,989 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-27 21:01:01,989 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-27 21:01:01,989 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-27 21:01:01,989 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-27 21:01:01,989 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-27 21:01:01,989 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 21:01:02,138 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-27 21:01:02,151 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-27 21:01:02,153 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-27 21:01:02,153 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-27 21:01:02,154 INFO L275 PluginConnector]: CDTParser initialized [2023-01-27 21:01:02,154 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-parallel-sum-1-dsl.wvr.c [2023-01-27 21:01:03,131 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-27 21:01:03,311 INFO L351 CDTParser]: Found 1 translation units. [2023-01-27 21:01:03,311 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-parallel-sum-1-dsl.wvr.c [2023-01-27 21:01:03,316 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97d7b7225/b279846e68ce4968b0b5db8696b52b7c/FLAGac3a936f7 [2023-01-27 21:01:03,326 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97d7b7225/b279846e68ce4968b0b5db8696b52b7c [2023-01-27 21:01:03,327 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-27 21:01:03,328 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-27 21:01:03,329 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-27 21:01:03,329 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-27 21:01:03,333 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-27 21:01:03,334 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 09:01:03" (1/1) ... [2023-01-27 21:01:03,334 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3333e636 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:01:03, skipping insertion in model container [2023-01-27 21:01:03,334 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 09:01:03" (1/1) ... [2023-01-27 21:01:03,349 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-27 21:01:03,362 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-27 21:01:03,462 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/parallel-parallel-sum-1-dsl.wvr.c[4372,4385] [2023-01-27 21:01:03,469 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 21:01:03,483 INFO L203 MainTranslator]: Completed pre-run [2023-01-27 21:01:03,501 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/parallel-parallel-sum-1-dsl.wvr.c[4372,4385] [2023-01-27 21:01:03,509 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 21:01:03,514 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 21:01:03,514 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 21:01:03,519 INFO L208 MainTranslator]: Completed translation [2023-01-27 21:01:03,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:01:03 WrapperNode [2023-01-27 21:01:03,519 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-27 21:01:03,520 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-27 21:01:03,520 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-27 21:01:03,520 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-27 21:01:03,524 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:01:03" (1/1) ... [2023-01-27 21:01:03,531 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:01:03" (1/1) ... [2023-01-27 21:01:03,549 INFO L138 Inliner]: procedures = 29, calls = 95, calls flagged for inlining = 21, calls inlined = 27, statements flattened = 303 [2023-01-27 21:01:03,550 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-27 21:01:03,550 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-27 21:01:03,550 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-27 21:01:03,551 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-27 21:01:03,557 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:01:03" (1/1) ... [2023-01-27 21:01:03,557 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:01:03" (1/1) ... [2023-01-27 21:01:03,561 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:01:03" (1/1) ... [2023-01-27 21:01:03,561 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:01:03" (1/1) ... [2023-01-27 21:01:03,568 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:01:03" (1/1) ... [2023-01-27 21:01:03,573 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:01:03" (1/1) ... [2023-01-27 21:01:03,574 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:01:03" (1/1) ... [2023-01-27 21:01:03,575 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:01:03" (1/1) ... [2023-01-27 21:01:03,578 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-27 21:01:03,578 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-27 21:01:03,578 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-27 21:01:03,578 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-27 21:01:03,579 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:01:03" (1/1) ... [2023-01-27 21:01:03,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 21:01:03,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 21:01:03,602 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 21:01:03,604 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 21:01:03,629 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-27 21:01:03,629 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-27 21:01:03,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-27 21:01:03,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-01-27 21:01:03,629 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-01-27 21:01:03,629 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-01-27 21:01:03,629 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-01-27 21:01:03,631 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-01-27 21:01:03,631 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-01-27 21:01:03,632 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-01-27 21:01:03,632 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-01-27 21:01:03,632 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-01-27 21:01:03,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-27 21:01:03,632 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2023-01-27 21:01:03,632 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2023-01-27 21:01:03,632 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2023-01-27 21:01:03,632 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2023-01-27 21:01:03,632 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-27 21:01:03,632 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-27 21:01:03,633 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-01-27 21:01:03,633 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-27 21:01:03,633 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-27 21:01:03,633 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-27 21:01:03,634 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 21:01:03,781 INFO L236 CfgBuilder]: Building ICFG [2023-01-27 21:01:03,783 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-27 21:01:04,103 INFO L277 CfgBuilder]: Performing block encoding [2023-01-27 21:01:04,257 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-27 21:01:04,257 INFO L302 CfgBuilder]: Removed 5 assume(true) statements. [2023-01-27 21:01:04,259 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 09:01:04 BoogieIcfgContainer [2023-01-27 21:01:04,259 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-27 21:01:04,261 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-27 21:01:04,261 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-27 21:01:04,263 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-27 21:01:04,263 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 09:01:03" (1/3) ... [2023-01-27 21:01:04,265 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1453df98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 09:01:04, skipping insertion in model container [2023-01-27 21:01:04,265 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 09:01:03" (2/3) ... [2023-01-27 21:01:04,265 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1453df98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 09:01:04, skipping insertion in model container [2023-01-27 21:01:04,265 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 09:01:04" (3/3) ... [2023-01-27 21:01:04,266 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-parallel-sum-1-dsl.wvr.c [2023-01-27 21:01:04,277 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-27 21:01:04,277 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-01-27 21:01:04,277 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-27 21:01:04,360 INFO L144 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2023-01-27 21:01:04,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 263 places, 262 transitions, 596 flow [2023-01-27 21:01:04,482 INFO L130 PetriNetUnfolder]: 18/234 cut-off events. [2023-01-27 21:01:04,482 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2023-01-27 21:01:04,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 263 conditions, 234 events. 18/234 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 313 event pairs, 0 based on Foata normal form. 0/215 useless extension candidates. Maximal degree in co-relation 203. Up to 3 conditions per place. [2023-01-27 21:01:04,489 INFO L82 GeneralOperation]: Start removeDead. Operand has 263 places, 262 transitions, 596 flow [2023-01-27 21:01:04,494 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 227 places, 226 transitions, 500 flow [2023-01-27 21:01:04,497 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-27 21:01:04,512 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 227 places, 226 transitions, 500 flow [2023-01-27 21:01:04,514 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 227 places, 226 transitions, 500 flow [2023-01-27 21:01:04,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 227 places, 226 transitions, 500 flow [2023-01-27 21:01:04,561 INFO L130 PetriNetUnfolder]: 18/226 cut-off events. [2023-01-27 21:01:04,562 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2023-01-27 21:01:04,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 255 conditions, 226 events. 18/226 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 312 event pairs, 0 based on Foata normal form. 0/208 useless extension candidates. Maximal degree in co-relation 203. Up to 3 conditions per place. [2023-01-27 21:01:04,568 INFO L119 LiptonReduction]: Number of co-enabled transitions 7920 [2023-01-27 21:01:09,435 INFO L134 LiptonReduction]: Checked pairs total: 33320 [2023-01-27 21:01:09,435 INFO L136 LiptonReduction]: Total number of compositions: 192 [2023-01-27 21:01:09,444 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-27 21:01:09,448 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;@45a922ba, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-27 21:01:09,448 INFO L358 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2023-01-27 21:01:09,457 INFO L130 PetriNetUnfolder]: 9/64 cut-off events. [2023-01-27 21:01:09,457 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2023-01-27 21:01:09,457 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:01:09,458 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, 1, 1, 1, 1, 1, 1, 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 21:01:09,458 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-01-27 21:01:09,461 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:01:09,461 INFO L85 PathProgramCache]: Analyzing trace with hash -773500682, now seen corresponding path program 1 times [2023-01-27 21:01:09,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:01:09,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883423595] [2023-01-27 21:01:09,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:01:09,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:01:09,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:01:09,965 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 21:01:09,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:01:09,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883423595] [2023-01-27 21:01:09,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883423595] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 21:01:09,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 21:01:09,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 21:01:09,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107514452] [2023-01-27 21:01:09,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 21:01:09,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 21:01:09,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:01:09,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 21:01:09,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-27 21:01:09,996 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 458 [2023-01-27 21:01:10,000 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 65 transitions, 178 flow. Second operand has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 0 states have call successors, (0), 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 21:01:10,000 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:01:10,000 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 458 [2023-01-27 21:01:10,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:01:12,505 INFO L130 PetriNetUnfolder]: 24447/32779 cut-off events. [2023-01-27 21:01:12,505 INFO L131 PetriNetUnfolder]: For 5201/5216 co-relation queries the response was YES. [2023-01-27 21:01:12,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69555 conditions, 32779 events. 24447/32779 cut-off events. For 5201/5216 co-relation queries the response was YES. Maximal size of possible extension queue 856. Compared 171485 event pairs, 10465 based on Foata normal form. 4/25142 useless extension candidates. Maximal degree in co-relation 68091. Up to 12303 conditions per place. [2023-01-27 21:01:12,637 INFO L137 encePairwiseOnDemand]: 451/458 looper letters, 109 selfloop transitions, 8 changer transitions 1/138 dead transitions. [2023-01-27 21:01:12,637 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 138 transitions, 641 flow [2023-01-27 21:01:12,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-27 21:01:12,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-27 21:01:12,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 971 transitions. [2023-01-27 21:01:12,652 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5300218340611353 [2023-01-27 21:01:12,652 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 971 transitions. [2023-01-27 21:01:12,652 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 971 transitions. [2023-01-27 21:01:12,655 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:01:12,656 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 971 transitions. [2023-01-27 21:01:12,660 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 242.75) internal successors, (971), 4 states have internal predecessors, (971), 0 states have call successors, (0), 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 21:01:12,665 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 458.0) internal successors, (2290), 5 states have internal predecessors, (2290), 0 states have call successors, (0), 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 21:01:12,666 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 458.0) internal successors, (2290), 5 states have internal predecessors, (2290), 0 states have call successors, (0), 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 21:01:12,667 INFO L175 Difference]: Start difference. First operand has 75 places, 65 transitions, 178 flow. Second operand 4 states and 971 transitions. [2023-01-27 21:01:12,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 138 transitions, 641 flow [2023-01-27 21:01:12,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 138 transitions, 555 flow, removed 0 selfloop flow, removed 12 redundant places. [2023-01-27 21:01:12,771 INFO L231 Difference]: Finished difference. Result has 68 places, 72 transitions, 199 flow [2023-01-27 21:01:12,772 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=458, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=199, PETRI_PLACES=68, PETRI_TRANSITIONS=72} [2023-01-27 21:01:12,775 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, -7 predicate places. [2023-01-27 21:01:12,775 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 72 transitions, 199 flow [2023-01-27 21:01:12,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 0 states have call successors, (0), 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 21:01:12,775 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:01:12,776 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, 1, 1, 1, 1, 1, 1, 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 21:01:12,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-27 21:01:12,776 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-01-27 21:01:12,782 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:01:12,782 INFO L85 PathProgramCache]: Analyzing trace with hash -549139452, now seen corresponding path program 2 times [2023-01-27 21:01:12,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:01:12,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206623137] [2023-01-27 21:01:12,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:01:12,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:01:12,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:01:12,986 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 21:01:12,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:01:12,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206623137] [2023-01-27 21:01:12,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206623137] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 21:01:12,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 21:01:12,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 21:01:12,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035772878] [2023-01-27 21:01:12,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 21:01:12,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 21:01:12,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:01:12,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 21:01:12,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-27 21:01:12,989 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 458 [2023-01-27 21:01:12,990 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 72 transitions, 199 flow. Second operand has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 0 states have call successors, (0), 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 21:01:12,990 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:01:12,990 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 458 [2023-01-27 21:01:12,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:01:16,335 INFO L130 PetriNetUnfolder]: 40211/54287 cut-off events. [2023-01-27 21:01:16,335 INFO L131 PetriNetUnfolder]: For 11968/11968 co-relation queries the response was YES. [2023-01-27 21:01:16,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120541 conditions, 54287 events. 40211/54287 cut-off events. For 11968/11968 co-relation queries the response was YES. Maximal size of possible extension queue 1398. Compared 304734 event pairs, 15979 based on Foata normal form. 1/41699 useless extension candidates. Maximal degree in co-relation 43207. Up to 22845 conditions per place. [2023-01-27 21:01:16,553 INFO L137 encePairwiseOnDemand]: 451/458 looper letters, 115 selfloop transitions, 11 changer transitions 1/147 dead transitions. [2023-01-27 21:01:16,553 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 147 transitions, 654 flow [2023-01-27 21:01:16,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-27 21:01:16,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-27 21:01:16,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 973 transitions. [2023-01-27 21:01:16,557 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5311135371179039 [2023-01-27 21:01:16,557 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 973 transitions. [2023-01-27 21:01:16,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 973 transitions. [2023-01-27 21:01:16,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:01:16,558 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 973 transitions. [2023-01-27 21:01:16,559 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 243.25) internal successors, (973), 4 states have internal predecessors, (973), 0 states have call successors, (0), 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 21:01:16,562 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 458.0) internal successors, (2290), 5 states have internal predecessors, (2290), 0 states have call successors, (0), 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 21:01:16,563 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 458.0) internal successors, (2290), 5 states have internal predecessors, (2290), 0 states have call successors, (0), 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 21:01:16,563 INFO L175 Difference]: Start difference. First operand has 68 places, 72 transitions, 199 flow. Second operand 4 states and 973 transitions. [2023-01-27 21:01:16,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 147 transitions, 654 flow [2023-01-27 21:01:16,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 147 transitions, 654 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-01-27 21:01:16,570 INFO L231 Difference]: Finished difference. Result has 73 places, 79 transitions, 278 flow [2023-01-27 21:01:16,570 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=458, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=278, PETRI_PLACES=73, PETRI_TRANSITIONS=79} [2023-01-27 21:01:16,571 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, -2 predicate places. [2023-01-27 21:01:16,572 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 79 transitions, 278 flow [2023-01-27 21:01:16,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 0 states have call successors, (0), 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 21:01:16,572 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:01:16,572 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, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:01:16,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-27 21:01:16,573 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-01-27 21:01:16,575 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:01:16,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1731748126, now seen corresponding path program 1 times [2023-01-27 21:01:16,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:01:16,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252724740] [2023-01-27 21:01:16,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:01:16,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:01:16,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:01:16,778 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 21:01:16,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:01:16,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252724740] [2023-01-27 21:01:16,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252724740] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 21:01:16,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 21:01:16,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 21:01:16,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925826144] [2023-01-27 21:01:16,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 21:01:16,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 21:01:16,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:01:16,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 21:01:16,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-27 21:01:16,781 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 458 [2023-01-27 21:01:16,782 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 79 transitions, 278 flow. Second operand has 5 states, 5 states have (on average 207.8) internal successors, (1039), 5 states have internal predecessors, (1039), 0 states have call successors, (0), 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 21:01:16,783 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:01:16,783 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 458 [2023-01-27 21:01:16,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:01:21,317 INFO L130 PetriNetUnfolder]: 52244/70746 cut-off events. [2023-01-27 21:01:21,317 INFO L131 PetriNetUnfolder]: For 34959/34959 co-relation queries the response was YES. [2023-01-27 21:01:21,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169029 conditions, 70746 events. 52244/70746 cut-off events. For 34959/34959 co-relation queries the response was YES. Maximal size of possible extension queue 1811. Compared 414211 event pairs, 34723 based on Foata normal form. 0/54996 useless extension candidates. Maximal degree in co-relation 71207. Up to 50266 conditions per place. [2023-01-27 21:01:21,731 INFO L137 encePairwiseOnDemand]: 452/458 looper letters, 121 selfloop transitions, 5 changer transitions 0/146 dead transitions. [2023-01-27 21:01:21,731 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 146 transitions, 753 flow [2023-01-27 21:01:21,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 21:01:21,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 21:01:21,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1112 transitions. [2023-01-27 21:01:21,734 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.485589519650655 [2023-01-27 21:01:21,734 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1112 transitions. [2023-01-27 21:01:21,734 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1112 transitions. [2023-01-27 21:01:21,735 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:01:21,735 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1112 transitions. [2023-01-27 21:01:21,738 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 222.4) internal successors, (1112), 5 states have internal predecessors, (1112), 0 states have call successors, (0), 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 21:01:21,741 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 458.0) internal successors, (2748), 6 states have internal predecessors, (2748), 0 states have call successors, (0), 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 21:01:21,742 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 458.0) internal successors, (2748), 6 states have internal predecessors, (2748), 0 states have call successors, (0), 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 21:01:21,742 INFO L175 Difference]: Start difference. First operand has 73 places, 79 transitions, 278 flow. Second operand 5 states and 1112 transitions. [2023-01-27 21:01:21,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 146 transitions, 753 flow [2023-01-27 21:01:21,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 146 transitions, 749 flow, removed 2 selfloop flow, removed 0 redundant places. [2023-01-27 21:01:21,760 INFO L231 Difference]: Finished difference. Result has 80 places, 83 transitions, 324 flow [2023-01-27 21:01:21,761 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=458, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=324, PETRI_PLACES=80, PETRI_TRANSITIONS=83} [2023-01-27 21:01:21,761 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, 5 predicate places. [2023-01-27 21:01:21,761 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 83 transitions, 324 flow [2023-01-27 21:01:21,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 207.8) internal successors, (1039), 5 states have internal predecessors, (1039), 0 states have call successors, (0), 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 21:01:21,762 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:01:21,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:01:21,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-27 21:01:21,762 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-01-27 21:01:21,763 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:01:21,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1011656969, now seen corresponding path program 1 times [2023-01-27 21:01:21,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:01:21,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316498046] [2023-01-27 21:01:21,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:01:21,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:01:21,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:01:21,917 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 21:01:21,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:01:21,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316498046] [2023-01-27 21:01:21,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316498046] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 21:01:21,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 21:01:21,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-27 21:01:21,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504605370] [2023-01-27 21:01:21,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 21:01:21,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-27 21:01:21,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:01:21,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-27 21:01:21,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-27 21:01:21,920 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 458 [2023-01-27 21:01:21,921 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 83 transitions, 324 flow. Second operand has 5 states, 5 states have (on average 207.8) internal successors, (1039), 5 states have internal predecessors, (1039), 0 states have call successors, (0), 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 21:01:21,921 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:01:21,921 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 458 [2023-01-27 21:01:21,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:01:25,817 INFO L130 PetriNetUnfolder]: 43919/59576 cut-off events. [2023-01-27 21:01:25,817 INFO L131 PetriNetUnfolder]: For 33750/33750 co-relation queries the response was YES. [2023-01-27 21:01:25,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146471 conditions, 59576 events. 43919/59576 cut-off events. For 33750/33750 co-relation queries the response was YES. Maximal size of possible extension queue 1587. Compared 341974 event pairs, 30832 based on Foata normal form. 0/50903 useless extension candidates. Maximal degree in co-relation 134447. Up to 50266 conditions per place. [2023-01-27 21:01:26,080 INFO L137 encePairwiseOnDemand]: 452/458 looper letters, 58 selfloop transitions, 2 changer transitions 51/131 dead transitions. [2023-01-27 21:01:26,081 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 131 transitions, 677 flow [2023-01-27 21:01:26,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 21:01:26,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 21:01:26,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1103 transitions. [2023-01-27 21:01:26,083 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4816593886462882 [2023-01-27 21:01:26,083 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1103 transitions. [2023-01-27 21:01:26,083 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1103 transitions. [2023-01-27 21:01:26,084 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:01:26,084 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1103 transitions. [2023-01-27 21:01:26,086 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 220.6) internal successors, (1103), 5 states have internal predecessors, (1103), 0 states have call successors, (0), 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 21:01:26,089 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 458.0) internal successors, (2748), 6 states have internal predecessors, (2748), 0 states have call successors, (0), 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 21:01:26,090 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 458.0) internal successors, (2748), 6 states have internal predecessors, (2748), 0 states have call successors, (0), 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 21:01:26,090 INFO L175 Difference]: Start difference. First operand has 80 places, 83 transitions, 324 flow. Second operand 5 states and 1103 transitions. [2023-01-27 21:01:26,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 131 transitions, 677 flow [2023-01-27 21:01:26,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 131 transitions, 673 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-01-27 21:01:26,101 INFO L231 Difference]: Finished difference. Result has 85 places, 80 transitions, 302 flow [2023-01-27 21:01:26,101 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=458, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=302, PETRI_PLACES=85, PETRI_TRANSITIONS=80} [2023-01-27 21:01:26,102 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, 10 predicate places. [2023-01-27 21:01:26,102 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 80 transitions, 302 flow [2023-01-27 21:01:26,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 207.8) internal successors, (1039), 5 states have internal predecessors, (1039), 0 states have call successors, (0), 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 21:01:26,103 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:01:26,103 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:01:26,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-27 21:01:26,103 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-01-27 21:01:26,103 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:01:26,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1272608977, now seen corresponding path program 1 times [2023-01-27 21:01:26,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:01:26,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256082807] [2023-01-27 21:01:26,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:01:26,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:01:26,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:01:26,531 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:01:26,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:01:26,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256082807] [2023-01-27 21:01:26,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256082807] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 21:01:26,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564789205] [2023-01-27 21:01:26,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:01:26,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:01:26,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 21:01:26,534 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 21:01:26,535 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 21:01:26,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:01:26,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 11 conjunts are in the unsatisfiable core [2023-01-27 21:01:26,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 21:01:26,795 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:01:26,796 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 21:01:26,837 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:01:26,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1564789205] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 21:01:26,837 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 21:01:26,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-01-27 21:01:26,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437211442] [2023-01-27 21:01:26,838 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 21:01:26,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-01-27 21:01:26,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:01:26,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-01-27 21:01:26,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2023-01-27 21:01:26,840 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 458 [2023-01-27 21:01:26,842 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 80 transitions, 302 flow. Second operand has 11 states, 11 states have (on average 205.27272727272728) internal successors, (2258), 11 states have internal predecessors, (2258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:01:26,842 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:01:26,842 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 458 [2023-01-27 21:01:26,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:01:31,483 INFO L130 PetriNetUnfolder]: 50674/69621 cut-off events. [2023-01-27 21:01:31,483 INFO L131 PetriNetUnfolder]: For 48114/48114 co-relation queries the response was YES. [2023-01-27 21:01:31,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175548 conditions, 69621 events. 50674/69621 cut-off events. For 48114/48114 co-relation queries the response was YES. Maximal size of possible extension queue 1807. Compared 428541 event pairs, 15551 based on Foata normal form. 3638/69221 useless extension candidates. Maximal degree in co-relation 175527. Up to 28288 conditions per place. [2023-01-27 21:01:31,780 INFO L137 encePairwiseOnDemand]: 450/458 looper letters, 159 selfloop transitions, 8 changer transitions 0/187 dead transitions. [2023-01-27 21:01:31,780 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 187 transitions, 1059 flow [2023-01-27 21:01:31,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 21:01:31,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 21:01:31,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1544 transitions. [2023-01-27 21:01:31,783 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4815970056144729 [2023-01-27 21:01:31,783 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1544 transitions. [2023-01-27 21:01:31,783 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1544 transitions. [2023-01-27 21:01:31,784 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:01:31,784 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1544 transitions. [2023-01-27 21:01:31,786 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 220.57142857142858) internal successors, (1544), 7 states have internal predecessors, (1544), 0 states have call successors, (0), 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 21:01:31,789 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 458.0) internal successors, (3664), 8 states have internal predecessors, (3664), 0 states have call successors, (0), 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 21:01:31,789 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 458.0) internal successors, (3664), 8 states have internal predecessors, (3664), 0 states have call successors, (0), 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 21:01:31,790 INFO L175 Difference]: Start difference. First operand has 85 places, 80 transitions, 302 flow. Second operand 7 states and 1544 transitions. [2023-01-27 21:01:31,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 187 transitions, 1059 flow [2023-01-27 21:01:31,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 187 transitions, 1035 flow, removed 10 selfloop flow, removed 4 redundant places. [2023-01-27 21:01:31,813 INFO L231 Difference]: Finished difference. Result has 88 places, 86 transitions, 368 flow [2023-01-27 21:01:31,813 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=458, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=368, PETRI_PLACES=88, PETRI_TRANSITIONS=86} [2023-01-27 21:01:31,815 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, 13 predicate places. [2023-01-27 21:01:31,815 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 86 transitions, 368 flow [2023-01-27 21:01:31,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 205.27272727272728) internal successors, (2258), 11 states have internal predecessors, (2258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:01:31,816 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:01:31,816 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:01:31,822 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 21:01:32,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:01:32,021 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-01-27 21:01:32,021 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:01:32,021 INFO L85 PathProgramCache]: Analyzing trace with hash 2079067074, now seen corresponding path program 1 times [2023-01-27 21:01:32,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:01:32,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003031826] [2023-01-27 21:01:32,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:01:32,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:01:32,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:01:32,207 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:01:32,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:01:32,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003031826] [2023-01-27 21:01:32,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003031826] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 21:01:32,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [933220884] [2023-01-27 21:01:32,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:01:32,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:01:32,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 21:01:32,211 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 21:01:32,213 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 21:01:32,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:01:32,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 13 conjunts are in the unsatisfiable core [2023-01-27 21:01:32,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 21:01:32,397 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:01:32,397 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 21:01:32,439 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:01:32,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [933220884] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 21:01:32,440 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 21:01:32,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-01-27 21:01:32,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245193964] [2023-01-27 21:01:32,440 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 21:01:32,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-01-27 21:01:32,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:01:32,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-01-27 21:01:32,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2023-01-27 21:01:32,443 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 458 [2023-01-27 21:01:32,444 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 86 transitions, 368 flow. Second operand has 11 states, 11 states have (on average 205.27272727272728) internal successors, (2258), 11 states have internal predecessors, (2258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:01:32,444 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:01:32,444 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 458 [2023-01-27 21:01:32,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:01:36,014 INFO L130 PetriNetUnfolder]: 40749/56313 cut-off events. [2023-01-27 21:01:36,014 INFO L131 PetriNetUnfolder]: For 64677/64677 co-relation queries the response was YES. [2023-01-27 21:01:36,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156646 conditions, 56313 events. 40749/56313 cut-off events. For 64677/64677 co-relation queries the response was YES. Maximal size of possible extension queue 1566. Compared 339564 event pairs, 12668 based on Foata normal form. 2458/55154 useless extension candidates. Maximal degree in co-relation 143767. Up to 26698 conditions per place. [2023-01-27 21:01:36,342 INFO L137 encePairwiseOnDemand]: 450/458 looper letters, 100 selfloop transitions, 5 changer transitions 51/176 dead transitions. [2023-01-27 21:01:36,342 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 176 transitions, 1023 flow [2023-01-27 21:01:36,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-27 21:01:36,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-27 21:01:36,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1535 transitions. [2023-01-27 21:01:36,345 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47878976918278227 [2023-01-27 21:01:36,345 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1535 transitions. [2023-01-27 21:01:36,345 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1535 transitions. [2023-01-27 21:01:36,346 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:01:36,346 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1535 transitions. [2023-01-27 21:01:36,348 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 219.28571428571428) internal successors, (1535), 7 states have internal predecessors, (1535), 0 states have call successors, (0), 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 21:01:36,351 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 458.0) internal successors, (3664), 8 states have internal predecessors, (3664), 0 states have call successors, (0), 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 21:01:36,351 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 458.0) internal successors, (3664), 8 states have internal predecessors, (3664), 0 states have call successors, (0), 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 21:01:36,351 INFO L175 Difference]: Start difference. First operand has 88 places, 86 transitions, 368 flow. Second operand 7 states and 1535 transitions. [2023-01-27 21:01:36,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 176 transitions, 1023 flow [2023-01-27 21:01:36,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 176 transitions, 1007 flow, removed 7 selfloop flow, removed 2 redundant places. [2023-01-27 21:01:36,373 INFO L231 Difference]: Finished difference. Result has 96 places, 85 transitions, 362 flow [2023-01-27 21:01:36,373 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=458, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=362, PETRI_PLACES=96, PETRI_TRANSITIONS=85} [2023-01-27 21:01:36,373 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, 21 predicate places. [2023-01-27 21:01:36,374 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 85 transitions, 362 flow [2023-01-27 21:01:36,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 205.27272727272728) internal successors, (2258), 11 states have internal predecessors, (2258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 21:01:36,374 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:01:36,374 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:01:36,379 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-01-27 21:01:36,581 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 21:01:36,581 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-01-27 21:01:36,582 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:01:36,582 INFO L85 PathProgramCache]: Analyzing trace with hash -982059132, now seen corresponding path program 1 times [2023-01-27 21:01:36,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:01:36,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488768541] [2023-01-27 21:01:36,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:01:36,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:01:36,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:01:36,780 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:01:36,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:01:36,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488768541] [2023-01-27 21:01:36,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488768541] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 21:01:36,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1186446033] [2023-01-27 21:01:36,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:01:36,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:01:36,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 21:01:36,798 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 21:01:36,799 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 21:01:36,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:01:36,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 11 conjunts are in the unsatisfiable core [2023-01-27 21:01:36,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 21:01:37,015 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 21:01:37,015 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 21:01:37,086 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:01:37,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1186446033] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 21:01:37,087 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 21:01:37,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2023-01-27 21:01:37,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311305671] [2023-01-27 21:01:37,087 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 21:01:37,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-01-27 21:01:37,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:01:37,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-01-27 21:01:37,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2023-01-27 21:01:37,089 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 458 [2023-01-27 21:01:37,091 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 85 transitions, 362 flow. Second operand has 13 states, 13 states have (on average 206.6153846153846) internal successors, (2686), 13 states have internal predecessors, (2686), 0 states have call successors, (0), 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 21:01:37,091 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:01:37,091 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 458 [2023-01-27 21:01:37,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:01:40,686 INFO L130 PetriNetUnfolder]: 28494/38831 cut-off events. [2023-01-27 21:01:40,686 INFO L131 PetriNetUnfolder]: For 64304/64304 co-relation queries the response was YES. [2023-01-27 21:01:40,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122203 conditions, 38831 events. 28494/38831 cut-off events. For 64304/64304 co-relation queries the response was YES. Maximal size of possible extension queue 1074. Compared 213410 event pairs, 15424 based on Foata normal form. 1152/38010 useless extension candidates. Maximal degree in co-relation 122162. Up to 32677 conditions per place. [2023-01-27 21:01:40,864 INFO L137 encePairwiseOnDemand]: 451/458 looper letters, 89 selfloop transitions, 7 changer transitions 0/116 dead transitions. [2023-01-27 21:01:40,864 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 116 transitions, 693 flow [2023-01-27 21:01:40,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-27 21:01:40,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-27 21:01:40,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1280 transitions. [2023-01-27 21:01:40,867 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4657933042212518 [2023-01-27 21:01:40,867 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1280 transitions. [2023-01-27 21:01:40,867 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1280 transitions. [2023-01-27 21:01:40,868 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:01:40,868 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1280 transitions. [2023-01-27 21:01:40,869 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 213.33333333333334) internal successors, (1280), 6 states have internal predecessors, (1280), 0 states have call successors, (0), 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 21:01:40,872 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 458.0) internal successors, (3206), 7 states have internal predecessors, (3206), 0 states have call successors, (0), 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 21:01:40,872 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 458.0) internal successors, (3206), 7 states have internal predecessors, (3206), 0 states have call successors, (0), 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 21:01:40,872 INFO L175 Difference]: Start difference. First operand has 96 places, 85 transitions, 362 flow. Second operand 6 states and 1280 transitions. [2023-01-27 21:01:40,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 116 transitions, 693 flow [2023-01-27 21:01:40,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 116 transitions, 651 flow, removed 19 selfloop flow, removed 7 redundant places. [2023-01-27 21:01:40,888 INFO L231 Difference]: Finished difference. Result has 91 places, 87 transitions, 368 flow [2023-01-27 21:01:40,889 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=458, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=368, PETRI_PLACES=91, PETRI_TRANSITIONS=87} [2023-01-27 21:01:40,889 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, 16 predicate places. [2023-01-27 21:01:40,889 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 87 transitions, 368 flow [2023-01-27 21:01:40,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 206.6153846153846) internal successors, (2686), 13 states have internal predecessors, (2686), 0 states have call successors, (0), 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 21:01:40,890 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:01:40,890 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:01:40,902 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-01-27 21:01:41,095 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 21:01:41,096 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-01-27 21:01:41,096 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:01:41,096 INFO L85 PathProgramCache]: Analyzing trace with hash -140044149, now seen corresponding path program 1 times [2023-01-27 21:01:41,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:01:41,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679612099] [2023-01-27 21:01:41,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:01:41,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:01:41,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:01:41,255 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 21:01:41,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:01:41,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679612099] [2023-01-27 21:01:41,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679612099] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 21:01:41,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [603159047] [2023-01-27 21:01:41,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:01:41,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:01:41,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 21:01:41,273 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 21:01:41,273 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 21:01:41,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:01:41,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 13 conjunts are in the unsatisfiable core [2023-01-27 21:01:41,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 21:01:41,482 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 21:01:41,482 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 21:01:41,536 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:01:41,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [603159047] provided 1 perfect and 1 imperfect interpolant sequences [2023-01-27 21:01:41,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-01-27 21:01:41,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 11 [2023-01-27 21:01:41,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412120363] [2023-01-27 21:01:41,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 21:01:41,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-27 21:01:41,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:01:41,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-27 21:01:41,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2023-01-27 21:01:41,538 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 458 [2023-01-27 21:01:41,539 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 87 transitions, 368 flow. Second operand has 6 states, 6 states have (on average 207.0) internal successors, (1242), 6 states have internal predecessors, (1242), 0 states have call successors, (0), 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 21:01:41,539 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:01:41,539 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 458 [2023-01-27 21:01:41,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:01:44,079 INFO L130 PetriNetUnfolder]: 21901/29265 cut-off events. [2023-01-27 21:01:44,080 INFO L131 PetriNetUnfolder]: For 41498/41498 co-relation queries the response was YES. [2023-01-27 21:01:44,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92241 conditions, 29265 events. 21901/29265 cut-off events. For 41498/41498 co-relation queries the response was YES. Maximal size of possible extension queue 806. Compared 147207 event pairs, 10095 based on Foata normal form. 816/28638 useless extension candidates. Maximal degree in co-relation 92202. Up to 25062 conditions per place. [2023-01-27 21:01:44,193 INFO L137 encePairwiseOnDemand]: 451/458 looper letters, 93 selfloop transitions, 7 changer transitions 0/120 dead transitions. [2023-01-27 21:01:44,193 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 120 transitions, 714 flow [2023-01-27 21:01:44,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-27 21:01:44,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-27 21:01:44,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1280 transitions. [2023-01-27 21:01:44,198 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4657933042212518 [2023-01-27 21:01:44,198 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1280 transitions. [2023-01-27 21:01:44,198 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1280 transitions. [2023-01-27 21:01:44,199 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:01:44,199 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1280 transitions. [2023-01-27 21:01:44,201 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 213.33333333333334) internal successors, (1280), 6 states have internal predecessors, (1280), 0 states have call successors, (0), 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 21:01:44,203 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 458.0) internal successors, (3206), 7 states have internal predecessors, (3206), 0 states have call successors, (0), 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 21:01:44,203 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 458.0) internal successors, (3206), 7 states have internal predecessors, (3206), 0 states have call successors, (0), 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 21:01:44,203 INFO L175 Difference]: Start difference. First operand has 91 places, 87 transitions, 368 flow. Second operand 6 states and 1280 transitions. [2023-01-27 21:01:44,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 120 transitions, 714 flow [2023-01-27 21:01:44,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 120 transitions, 689 flow, removed 6 selfloop flow, removed 4 redundant places. [2023-01-27 21:01:44,221 INFO L231 Difference]: Finished difference. Result has 93 places, 89 transitions, 384 flow [2023-01-27 21:01:44,221 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=458, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=384, PETRI_PLACES=93, PETRI_TRANSITIONS=89} [2023-01-27 21:01:44,222 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, 18 predicate places. [2023-01-27 21:01:44,222 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 89 transitions, 384 flow [2023-01-27 21:01:44,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 207.0) internal successors, (1242), 6 states have internal predecessors, (1242), 0 states have call successors, (0), 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 21:01:44,222 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:01:44,223 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:01:44,228 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-01-27 21:01:44,428 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 21:01:44,428 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-01-27 21:01:44,428 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:01:44,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1310477910, now seen corresponding path program 1 times [2023-01-27 21:01:44,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:01:44,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47291398] [2023-01-27 21:01:44,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:01:44,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:01:44,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:01:45,467 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-27 21:01:45,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:01:45,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47291398] [2023-01-27 21:01:45,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47291398] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 21:01:45,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1856716925] [2023-01-27 21:01:45,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:01:45,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:01:45,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 21:01:45,468 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 21:01:45,470 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 21:01:45,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:01:45,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 62 conjunts are in the unsatisfiable core [2023-01-27 21:01:45,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 21:01:45,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 21:01:45,830 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-01-27 21:01:45,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 21:01:45,990 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-01-27 21:01:46,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 21:01:46,052 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-01-27 21:01:46,084 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-01-27 21:01:46,150 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-27 21:01:46,150 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 21:01:46,379 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4 (* 4 c_~i_7~0)))) (and (forall ((v_ArrVal_496 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (< (+ c_~s_6~0 (select (select (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_496) |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_497) c_~X_0~0.base) .cse0)) (+ 1 c_~s_2~0))) (forall ((v_ArrVal_496 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (<= c_~s_2~0 (+ c_~s_6~0 (select (select (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_496) |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_497) c_~X_0~0.base) .cse0)))))) is different from false [2023-01-27 21:01:46,430 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4))) (and (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_31| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_31| |c_#StackHeapBarrier|) (forall ((v_ArrVal_496 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_496) |v_thread4Thread1of1ForFork0_~#t6~0.base_31| v_ArrVal_497) c_~X_0~0.base) .cse0) (+ 1 c_~s_2~0))))) (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_31| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_31| |c_#StackHeapBarrier|) (forall ((v_ArrVal_496 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (<= c_~s_2~0 (select (select (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_496) |v_thread4Thread1of1ForFork0_~#t6~0.base_31| v_ArrVal_497) c_~X_0~0.base) .cse0))))))) is different from false [2023-01-27 21:01:46,453 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4))) (and (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_31| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_31| |c_#StackHeapBarrier|) (forall ((v_ArrVal_496 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_496) |v_thread4Thread1of1ForFork0_~#t6~0.base_31| v_ArrVal_497) c_~X_0~0.base) .cse0) (+ c_~t_4~0 1 c_~s_2~0))))) (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_31| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_31| |c_#StackHeapBarrier|) (forall ((v_ArrVal_496 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (<= (+ c_~t_4~0 c_~s_2~0) (select (select (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_496) |v_thread4Thread1of1ForFork0_~#t6~0.base_31| v_ArrVal_497) c_~X_0~0.base) .cse0))))))) is different from false [2023-01-27 21:01:47,834 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4))) (and (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_34| Int)) (or (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_31| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_31| |c_#StackHeapBarrier|) (forall ((v_ArrVal_496 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (<= (+ c_~t_4~0 c_~s_2~0) (select (select (store (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_34| v_ArrVal_496) |v_thread4Thread1of1ForFork0_~#t6~0.base_31| v_ArrVal_497) c_~X_0~0.base) .cse0))))) (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_34| |c_#StackHeapBarrier|))) (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_34| Int)) (or (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_31| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_31| |c_#StackHeapBarrier|) (forall ((v_ArrVal_496 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_34| v_ArrVal_496) |v_thread4Thread1of1ForFork0_~#t6~0.base_31| v_ArrVal_497) c_~X_0~0.base) .cse0) (+ c_~t_4~0 1 c_~s_2~0))))) (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_34| |c_#StackHeapBarrier|))))) is different from false [2023-01-27 21:01:47,919 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4))) (and (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_34| Int) (v_ArrVal_495 (Array Int Int))) (or (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_31| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_31| |c_#StackHeapBarrier|) (forall ((v_ArrVal_496 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_495) |v_thread4Thread1of1ForFork0_~#t5~0.base_34| v_ArrVal_496) |v_thread4Thread1of1ForFork0_~#t6~0.base_31| v_ArrVal_497) c_~X_0~0.base) .cse0) (+ c_~t_4~0 1 c_~s_2~0))))) (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_34| |c_#StackHeapBarrier|))) (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_34| Int) (v_ArrVal_495 (Array Int Int))) (or (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_31| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_31| |c_#StackHeapBarrier|) (forall ((v_ArrVal_496 (Array Int Int)) (v_ArrVal_497 (Array Int Int))) (<= (+ c_~t_4~0 c_~s_2~0) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_495) |v_thread4Thread1of1ForFork0_~#t5~0.base_34| v_ArrVal_496) |v_thread4Thread1of1ForFork0_~#t6~0.base_31| v_ArrVal_497) c_~X_0~0.base) .cse0))))) (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_34| |c_#StackHeapBarrier|))))) is different from false [2023-01-27 21:01:47,982 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 21:01:47,982 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 216 treesize of output 146 [2023-01-27 21:01:47,987 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 122 [2023-01-27 21:01:47,993 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 114 [2023-01-27 21:01:47,998 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 54 [2023-01-27 21:01:48,122 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-27 21:01:48,123 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-27 21:01:48,123 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-27 21:01:48,254 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-27 21:01:48,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1856716925] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 21:01:48,254 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 21:01:48,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 31 [2023-01-27 21:01:48,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260644751] [2023-01-27 21:01:48,254 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 21:01:48,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-01-27 21:01:48,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:01:48,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-01-27 21:01:48,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=660, Unknown=9, NotChecked=280, Total=1056 [2023-01-27 21:01:48,258 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 458 [2023-01-27 21:01:48,261 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 89 transitions, 384 flow. Second operand has 33 states, 33 states have (on average 171.15151515151516) internal successors, (5648), 33 states have internal predecessors, (5648), 0 states have call successors, (0), 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 21:01:48,261 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:01:48,261 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 458 [2023-01-27 21:01:48,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:01:57,966 INFO L130 PetriNetUnfolder]: 80622/105027 cut-off events. [2023-01-27 21:01:57,966 INFO L131 PetriNetUnfolder]: For 135851/135851 co-relation queries the response was YES. [2023-01-27 21:01:58,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 327904 conditions, 105027 events. 80622/105027 cut-off events. For 135851/135851 co-relation queries the response was YES. Maximal size of possible extension queue 2137. Compared 573223 event pairs, 17446 based on Foata normal form. 1/101225 useless extension candidates. Maximal degree in co-relation 327864. Up to 45218 conditions per place. [2023-01-27 21:01:58,635 INFO L137 encePairwiseOnDemand]: 441/458 looper letters, 527 selfloop transitions, 117 changer transitions 1/655 dead transitions. [2023-01-27 21:01:58,636 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 655 transitions, 3884 flow [2023-01-27 21:01:58,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-01-27 21:01:58,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2023-01-27 21:01:58,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 4427 transitions. [2023-01-27 21:01:58,643 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4202582115056009 [2023-01-27 21:01:58,644 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 4427 transitions. [2023-01-27 21:01:58,644 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 4427 transitions. [2023-01-27 21:01:58,645 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:01:58,645 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 4427 transitions. [2023-01-27 21:01:58,655 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 192.47826086956522) internal successors, (4427), 23 states have internal predecessors, (4427), 0 states have call successors, (0), 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 21:01:58,663 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 458.0) internal successors, (10992), 24 states have internal predecessors, (10992), 0 states have call successors, (0), 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 21:01:58,664 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 458.0) internal successors, (10992), 24 states have internal predecessors, (10992), 0 states have call successors, (0), 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 21:01:58,664 INFO L175 Difference]: Start difference. First operand has 93 places, 89 transitions, 384 flow. Second operand 23 states and 4427 transitions. [2023-01-27 21:01:58,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 655 transitions, 3884 flow [2023-01-27 21:01:58,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 655 transitions, 3864 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-01-27 21:01:58,745 INFO L231 Difference]: Finished difference. Result has 125 places, 217 transitions, 1483 flow [2023-01-27 21:01:58,745 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=458, PETRI_DIFFERENCE_MINUEND_FLOW=370, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=1483, PETRI_PLACES=125, PETRI_TRANSITIONS=217} [2023-01-27 21:01:58,745 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, 50 predicate places. [2023-01-27 21:01:58,745 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 217 transitions, 1483 flow [2023-01-27 21:01:58,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 171.15151515151516) internal successors, (5648), 33 states have internal predecessors, (5648), 0 states have call successors, (0), 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 21:01:58,747 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:01:58,747 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:01:58,752 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-01-27 21:01:58,951 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 21:01:58,954 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-01-27 21:01:58,954 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:01:58,954 INFO L85 PathProgramCache]: Analyzing trace with hash 906209572, now seen corresponding path program 2 times [2023-01-27 21:01:58,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:01:58,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595933941] [2023-01-27 21:01:58,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:01:58,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:01:58,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:01:59,631 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-27 21:01:59,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:01:59,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595933941] [2023-01-27 21:01:59,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595933941] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 21:01:59,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1125555395] [2023-01-27 21:01:59,632 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-27 21:01:59,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:01:59,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 21:01:59,633 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 21:01:59,635 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 21:01:59,781 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-27 21:01:59,781 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 21:01:59,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 80 conjunts are in the unsatisfiable core [2023-01-27 21:01:59,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 21:01:59,845 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-01-27 21:01:59,870 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-01-27 21:01:59,907 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-01-27 21:02:00,013 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-01-27 21:02:00,068 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-01-27 21:02:00,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 21:02:00,280 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-01-27 21:02:00,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 21:02:00,400 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-01-27 21:02:00,437 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-27 21:02:00,439 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 21:02:00,439 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 10 [2023-01-27 21:02:00,511 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:02:00,511 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 21:02:00,637 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~X_0~0.offset 4 (* 4 c_~i_7~0)))) (and (forall ((v_ArrVal_579 (Array Int Int))) (<= c_~s_2~0 (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_579) c_~X_0~0.base) .cse0)))) (forall ((v_ArrVal_579 (Array Int Int))) (< (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_579) c_~X_0~0.base) .cse0)) (+ 1 c_~s_2~0))))) is different from false [2023-01-27 21:02:15,692 WARN L222 SmtUtils]: Spent 7.37s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 21:02:33,384 WARN L222 SmtUtils]: Spent 9.46s on a formula simplification that was a NOOP. DAG size: 38 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 21:04:46,220 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 21:04:46,221 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 60 [2023-01-27 21:04:46,271 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 21:04:46,272 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 758774 treesize of output 739326 [2023-01-27 21:04:46,712 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1434 treesize of output 1306 [2023-01-27 21:04:46,742 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 21:04:46,743 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1306 treesize of output 1202 [2023-01-27 21:04:46,771 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1194 treesize of output 1130 [2023-01-27 21:04:46,800 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 21:04:46,800 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1130 treesize of output 914 [2023-01-27 21:04:46,833 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 21:04:46,834 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 439 treesize of output 420 [2023-01-27 21:04:46,867 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 21:04:46,867 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 466 treesize of output 419 [2023-01-27 21:04:48,614 INFO L208 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2023-01-27 21:04:48,674 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-01-27 21:04:48,674 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 1 [2023-01-27 21:04:52,777 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:04:52,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1125555395] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 21:04:52,777 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 21:04:52,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 19, 19] total 45 [2023-01-27 21:04:52,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380220640] [2023-01-27 21:04:52,778 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 21:04:52,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2023-01-27 21:04:52,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:04:52,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2023-01-27 21:04:52,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=1741, Unknown=112, NotChecked=88, Total=2162 [2023-01-27 21:04:52,790 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 458 [2023-01-27 21:04:52,798 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 217 transitions, 1483 flow. Second operand has 47 states, 47 states have (on average 152.2127659574468) internal successors, (7154), 47 states have internal predecessors, (7154), 0 states have call successors, (0), 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 21:04:52,799 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:04:52,799 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 458 [2023-01-27 21:04:52,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:05:18,107 WARN L222 SmtUtils]: Spent 6.05s on a formula simplification that was a NOOP. DAG size: 53 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 21:05:20,251 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 [1] [2023-01-27 21:05:22,262 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 [1] [2023-01-27 21:05:24,278 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 [1] [2023-01-27 21:05:26,280 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 [1] [2023-01-27 21:05:28,283 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 [1] [2023-01-27 21:05:30,331 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 [1] [2023-01-27 21:05:32,633 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:05:51,000 WARN L222 SmtUtils]: Spent 6.05s on a formula simplification that was a NOOP. DAG size: 55 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 21:05:53,384 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 [1] [2023-01-27 21:05:55,403 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 [1] [2023-01-27 21:05:57,409 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 [1] [2023-01-27 21:05:59,410 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 [1] [2023-01-27 21:06:01,416 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 [1] [2023-01-27 21:06:23,113 WARN L222 SmtUtils]: Spent 17.34s on a formula simplification. DAG size of input: 68 DAG size of output: 48 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 21:06:25,336 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 [1] [2023-01-27 21:06:27,360 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 [1] [2023-01-27 21:06:29,361 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 [1] [2023-01-27 21:06:31,369 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 [1] [2023-01-27 21:06:33,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 [1] [2023-01-27 21:06:35,386 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 [1] [2023-01-27 21:06:37,388 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 [1] [2023-01-27 21:06:39,390 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 [1] [2023-01-27 21:06:41,398 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 [1] [2023-01-27 21:06:43,399 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 [1] [2023-01-27 21:06:45,452 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 [1] [2023-01-27 21:06:57,352 WARN L222 SmtUtils]: Spent 9.35s on a formula simplification. DAG size of input: 83 DAG size of output: 63 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 21:07:18,976 WARN L222 SmtUtils]: Spent 6.04s on a formula simplification that was a NOOP. DAG size: 59 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 21:07:30,284 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 [1] [2023-01-27 21:07:32,302 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:07:34,308 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 [1] [2023-01-27 21:07:36,310 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 [1] [2023-01-27 21:07:38,313 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 [1] [2023-01-27 21:07:47,692 WARN L222 SmtUtils]: Spent 8.23s on a formula simplification. DAG size of input: 73 DAG size of output: 53 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 21:07:48,278 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_~X_0~0.offset 4 (* 4 c_~i_7~0))) (.cse2 (+ 1 c_~s_2~0)) (.cse1 (+ c_~X_0~0.offset 4)) (.cse0 (< c_~i_3~0 c_~n_1~0))) (and (<= 1 c_~n_1~0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t4~0#1.base|) (or .cse0 (and (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_37| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_37| |c_#StackHeapBarrier|) (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_33| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_33| |c_#StackHeapBarrier|) (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int))) (<= c_~s_2~0 (select (select (store (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_37| v_ArrVal_578) |v_thread4Thread1of1ForFork0_~#t6~0.base_33| v_ArrVal_579) c_~X_0~0.base) .cse1))))))) (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_37| Int)) (or (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_33| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_33| |c_#StackHeapBarrier|) (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_37| v_ArrVal_578) |v_thread4Thread1of1ForFork0_~#t6~0.base_33| v_ArrVal_579) c_~X_0~0.base) .cse1) .cse2)))) (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_37| |c_#StackHeapBarrier|))))) (< |c_#StackHeapBarrier| |c_thread1Thread1of1ForFork3_~#t3~0.base|) (forall ((v_ArrVal_579 (Array Int Int))) (<= c_~s_2~0 (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_579) c_~X_0~0.base) .cse3)))) (< c_~X_0~0.base |c_#StackHeapBarrier|) (< |c_#StackHeapBarrier| |c_thread1Thread1of1ForFork3_~#t2~0.base|) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_#StackHeapBarrier|) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (forall ((v_ArrVal_579 (Array Int Int))) (< (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_579) c_~X_0~0.base) .cse3)) .cse2)) (or .cse0 (and (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int))) (<= c_~s_2~0 (+ c_~s_6~0 (select (select (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_578) |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_579) c_~X_0~0.base) .cse3)))) (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int))) (< (+ c_~s_6~0 (select (select (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_578) |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_579) c_~X_0~0.base) .cse3)) .cse2)))) (or (and (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_33| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_33| |c_#StackHeapBarrier|) (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_578) |v_thread4Thread1of1ForFork0_~#t6~0.base_33| v_ArrVal_579) c_~X_0~0.base) .cse1) .cse2)))) (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_33| Int)) (or (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int))) (<= c_~s_2~0 (select (select (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_578) |v_thread4Thread1of1ForFork0_~#t6~0.base_33| v_ArrVal_579) c_~X_0~0.base) .cse1))) (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_33| |c_#StackHeapBarrier|)))) .cse0) (= c_~X_0~0.offset 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|))) is different from false [2023-01-27 21:07:59,272 WARN L222 SmtUtils]: Spent 8.19s on a formula simplification. DAG size of input: 71 DAG size of output: 51 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 21:08:00,907 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 1 c_~s_2~0)) (.cse5 (+ c_~X_0~0.offset 4 (* 4 c_~i_7~0)))) (let ((.cse3 (forall ((v_ArrVal_579 (Array Int Int))) (<= c_~s_2~0 (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_579) c_~X_0~0.base) .cse5))))) (.cse4 (forall ((v_ArrVal_579 (Array Int Int))) (< (+ c_~s_6~0 (select (select (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t6~0.base| v_ArrVal_579) c_~X_0~0.base) .cse5)) .cse2))) (.cse1 (+ c_~X_0~0.offset 4)) (.cse0 (< c_~i_3~0 c_~n_1~0))) (and (<= 1 c_~n_1~0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t4~0#1.base|) (or .cse0 (and (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_37| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_37| |c_#StackHeapBarrier|) (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_33| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_33| |c_#StackHeapBarrier|) (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int))) (<= c_~s_2~0 (select (select (store (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_37| v_ArrVal_578) |v_thread4Thread1of1ForFork0_~#t6~0.base_33| v_ArrVal_579) c_~X_0~0.base) .cse1))))))) (forall ((|v_thread4Thread1of1ForFork0_~#t5~0.base_37| Int)) (or (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_33| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_33| |c_#StackHeapBarrier|) (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |v_thread4Thread1of1ForFork0_~#t5~0.base_37| v_ArrVal_578) |v_thread4Thread1of1ForFork0_~#t6~0.base_33| v_ArrVal_579) c_~X_0~0.base) .cse1) .cse2)))) (<= |v_thread4Thread1of1ForFork0_~#t5~0.base_37| |c_#StackHeapBarrier|))))) (< |c_#StackHeapBarrier| |c_thread1Thread1of1ForFork3_~#t3~0.base|) .cse3 (< c_~X_0~0.base |c_#StackHeapBarrier|) (< |c_#StackHeapBarrier| |c_thread1Thread1of1ForFork3_~#t2~0.base|) (or .cse0 (and .cse3 .cse4)) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_#StackHeapBarrier|) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) .cse4 (or (and (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_33| Int)) (or (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_33| |c_#StackHeapBarrier|) (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_578) |v_thread4Thread1of1ForFork0_~#t6~0.base_33| v_ArrVal_579) c_~X_0~0.base) .cse1) .cse2)))) (forall ((|v_thread4Thread1of1ForFork0_~#t6~0.base_33| Int)) (or (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int))) (<= c_~s_2~0 (select (select (store (store |c_#memory_int| |c_thread4Thread1of1ForFork0_~#t5~0.base| v_ArrVal_578) |v_thread4Thread1of1ForFork0_~#t6~0.base_33| v_ArrVal_579) c_~X_0~0.base) .cse1))) (<= |v_thread4Thread1of1ForFork0_~#t6~0.base_33| |c_#StackHeapBarrier|)))) .cse0) (= c_~X_0~0.offset 0) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|)))) is different from false [2023-01-27 21:08:26,383 WARN L222 SmtUtils]: Spent 6.04s on a formula simplification that was a NOOP. DAG size: 58 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 21:08:29,671 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 [1] [2023-01-27 21:08:31,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 [1] [2023-01-27 21:08:33,677 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 [1] [2023-01-27 21:08:35,680 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 [1] [2023-01-27 21:08:37,681 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 [1] [2023-01-27 21:08:39,683 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 [1] [2023-01-27 21:08:41,685 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 [1] [2023-01-27 21:08:43,704 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:09:13,856 WARN L222 SmtUtils]: Spent 6.04s on a formula simplification that was a NOOP. DAG size: 56 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 21:09:15,859 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 [1] [2023-01-27 21:09:17,860 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 [1] [2023-01-27 21:09:21,262 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 [1] [2023-01-27 21:09:23,265 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 [1] [2023-01-27 21:09:25,268 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 [1] [2023-01-27 21:09:27,271 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 [1] [2023-01-27 21:09:29,274 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 [1] [2023-01-27 21:09:31,277 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 [1] [2023-01-27 21:09:33,288 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 [1] [2023-01-27 21:09:35,295 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 [1] [2023-01-27 21:09:38,718 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 [1] [2023-01-27 21:09:42,316 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 [1] [2023-01-27 21:09:46,065 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 [1] [2023-01-27 21:09:48,070 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 [1] [2023-01-27 21:09:50,076 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 [1] [2023-01-27 21:09:52,081 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 [1] [2023-01-27 21:09:56,269 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 [1] [2023-01-27 21:09:58,274 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 [1] [2023-01-27 21:10:00,279 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 [1] [2023-01-27 21:10:02,285 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 [1] [2023-01-27 21:10:06,027 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:10:09,893 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 [1] [2023-01-27 21:10:11,896 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 [1] [2023-01-27 21:10:16,969 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 [1] [2023-01-27 21:10:20,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 [1] [2023-01-27 21:10:22,698 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 [1] [2023-01-27 21:10:24,752 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 [1] [2023-01-27 21:10:27,789 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 [1] [2023-01-27 21:10:30,089 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 [1] [2023-01-27 21:10:32,090 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 [1] [2023-01-27 21:10:34,097 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 [1] [2023-01-27 21:10:35,206 INFO L130 PetriNetUnfolder]: 147715/192629 cut-off events. [2023-01-27 21:10:35,207 INFO L131 PetriNetUnfolder]: For 575834/576108 co-relation queries the response was YES. [2023-01-27 21:10:35,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 728954 conditions, 192629 events. 147715/192629 cut-off events. For 575834/576108 co-relation queries the response was YES. Maximal size of possible extension queue 3993. Compared 1138466 event pairs, 21233 based on Foata normal form. 268/185281 useless extension candidates. Maximal degree in co-relation 728902. Up to 93651 conditions per place. [2023-01-27 21:10:36,658 INFO L137 encePairwiseOnDemand]: 423/458 looper letters, 1014 selfloop transitions, 359 changer transitions 31/1414 dead transitions. [2023-01-27 21:10:36,658 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 1414 transitions, 10488 flow [2023-01-27 21:10:36,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2023-01-27 21:10:36,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2023-01-27 21:10:36,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 9178 transitions. [2023-01-27 21:10:36,670 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3710981724082161 [2023-01-27 21:10:36,670 INFO L72 ComplementDD]: Start complementDD. Operand 54 states and 9178 transitions. [2023-01-27 21:10:36,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 9178 transitions. [2023-01-27 21:10:36,673 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 21:10:36,673 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 54 states and 9178 transitions. [2023-01-27 21:10:36,682 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 55 states, 54 states have (on average 169.96296296296296) internal successors, (9178), 54 states have internal predecessors, (9178), 0 states have call successors, (0), 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 21:10:36,698 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 55 states, 55 states have (on average 458.0) internal successors, (25190), 55 states have internal predecessors, (25190), 0 states have call successors, (0), 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 21:10:36,700 INFO L81 ComplementDD]: Finished complementDD. Result has 55 states, 55 states have (on average 458.0) internal successors, (25190), 55 states have internal predecessors, (25190), 0 states have call successors, (0), 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 21:10:36,700 INFO L175 Difference]: Start difference. First operand has 125 places, 217 transitions, 1483 flow. Second operand 54 states and 9178 transitions. [2023-01-27 21:10:36,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 1414 transitions, 10488 flow [2023-01-27 21:10:46,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 1414 transitions, 10395 flow, removed 43 selfloop flow, removed 2 redundant places. [2023-01-27 21:10:46,088 INFO L231 Difference]: Finished difference. Result has 218 places, 562 transitions, 5574 flow [2023-01-27 21:10:46,088 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=458, PETRI_DIFFERENCE_MINUEND_FLOW=1426, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=54, PETRI_FLOW=5574, PETRI_PLACES=218, PETRI_TRANSITIONS=562} [2023-01-27 21:10:46,089 INFO L281 CegarLoopForPetriNet]: 75 programPoint places, 143 predicate places. [2023-01-27 21:10:46,089 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 562 transitions, 5574 flow [2023-01-27 21:10:46,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 152.2127659574468) internal successors, (7154), 47 states have internal predecessors, (7154), 0 states have call successors, (0), 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 21:10:46,090 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 21:10:46,090 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:10:46,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-01-27 21:10:46,325 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 21:10:46,325 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-01-27 21:10:46,326 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 21:10:46,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1156224530, now seen corresponding path program 3 times [2023-01-27 21:10:46,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 21:10:46,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103775860] [2023-01-27 21:10:46,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 21:10:46,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 21:10:46,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 21:10:47,518 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:10:47,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 21:10:47,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103775860] [2023-01-27 21:10:47,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103775860] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 21:10:47,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786238254] [2023-01-27 21:10:47,518 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-27 21:10:47,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 21:10:47,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 21:10:47,519 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 21:10:47,524 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 21:10:47,747 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-01-27 21:10:47,747 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 21:10:47,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 92 conjunts are in the unsatisfiable core [2023-01-27 21:10:47,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 21:10:47,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 21:10:47,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 21:10:47,777 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-01-27 21:10:47,780 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 20 [2023-01-27 21:10:47,870 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-01-27 21:10:47,911 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-01-27 21:10:47,970 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-01-27 21:10:48,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 21:10:48,019 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2023-01-27 21:10:48,063 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-01-27 21:10:48,063 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-01-27 21:10:48,120 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-01-27 21:10:48,120 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-01-27 21:10:48,167 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-27 21:10:48,167 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-01-27 21:10:48,242 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-01-27 21:10:48,441 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-01-27 21:10:48,518 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-01-27 21:10:48,572 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 21:10:48,573 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 15 [2023-01-27 21:10:48,758 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:10:48,758 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 21:10:49,090 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~i_3~0 1))) (and (forall ((v_ArrVal_666 (Array Int Int)) (v_~i_3~0_137 Int)) (or (< v_~i_3~0_137 c_~n_1~0) (< .cse0 v_~i_3~0_137) (<= c_~s_6~0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_666) c_~X_0~0.base) (+ (* v_~i_3~0_137 4) c_~X_0~0.offset)) c_~s_2~0)))) (forall ((v_ArrVal_666 (Array Int Int)) (v_~i_3~0_137 Int)) (or (< (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork3_~#t3~0.base| v_ArrVal_666) c_~X_0~0.base) (+ (* v_~i_3~0_137 4) c_~X_0~0.offset)) c_~s_2~0) (+ c_~s_6~0 1)) (< v_~i_3~0_137 c_~n_1~0) (< .cse0 v_~i_3~0_137))))) is different from false [2023-01-27 21:11:10,929 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 21:11:10,929 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 54 [2023-01-27 21:11:10,993 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 21:11:10,994 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1527798 treesize of output 1462270 [2023-01-27 21:11:11,242 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 704 treesize of output 656 [2023-01-27 21:11:11,266 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 21:11:11,266 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 656 treesize of output 620 [2023-01-27 21:11:11,283 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 612 treesize of output 516 [2023-01-27 21:11:11,305 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 21:11:11,305 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 516 treesize of output 436 [2023-01-27 21:11:11,330 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 21:11:11,330 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 224 treesize of output 211 [2023-01-27 21:11:12,205 INFO L208 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2023-01-27 21:11:12,255 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 21:11:12,255 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 56 [2023-01-27 21:11:12,293 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 21:11:12,295 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 207350 treesize of output 199166 [2023-01-27 21:11:12,499 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 768 treesize of output 720 [2023-01-27 21:11:12,515 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 720 treesize of output 624 [2023-01-27 21:11:12,537 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 21:11:12,538 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 624 treesize of output 544 [2023-01-27 21:11:12,572 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 21:11:12,572 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 257 treesize of output 244 [2023-01-27 21:11:12,598 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 21:11:12,598 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 278 treesize of output 243 [2023-01-27 21:11:13,943 INFO L208 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2023-01-27 21:11:14,332 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 21:11:14,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1786238254] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 21:11:14,332 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 21:11:14,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18, 18] total 50 [2023-01-27 21:11:14,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378592055] [2023-01-27 21:11:14,332 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 21:11:14,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2023-01-27 21:11:14,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 21:11:14,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2023-01-27 21:11:14,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=2327, Unknown=54, NotChecked=98, Total=2652 [2023-01-27 21:11:14,336 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 458 [2023-01-27 21:11:14,339 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 562 transitions, 5574 flow. Second operand has 52 states, 52 states have (on average 146.0) internal successors, (7592), 52 states have internal predecessors, (7592), 0 states have call successors, (0), 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 21:11:14,339 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 21:11:14,339 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 458 [2023-01-27 21:11:14,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 21:11:21,095 WARN L222 SmtUtils]: Spent 6.15s on a formula simplification that was a NOOP. DAG size: 122 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 21:11:23,119 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 [1] [2023-01-27 21:11:25,139 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 [1] [2023-01-27 21:11:55,690 WARN L222 SmtUtils]: Spent 28.11s on a formula simplification that was a NOOP. DAG size: 117 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 21:12:04,281 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:12:13,347 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 [1] [2023-01-27 21:12:15,353 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 [1] [2023-01-27 21:12:17,525 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 [1] [2023-01-27 21:12:19,536 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 [1] [2023-01-27 21:12:21,952 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 [1] [2023-01-27 21:12:54,453 WARN L222 SmtUtils]: Spent 26.25s on a formula simplification that was a NOOP. DAG size: 115 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 21:12:56,708 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 [1] [2023-01-27 21:12:58,950 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 [1] [2023-01-27 21:13:00,960 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 [1] [2023-01-27 21:13:02,984 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 [1] [2023-01-27 21:13:06,003 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 [1] [2023-01-27 21:13:07,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:13:09,517 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 [1] [2023-01-27 21:13:11,531 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 [1] [2023-01-27 21:13:12,744 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:13:39,932 WARN L222 SmtUtils]: Spent 22.80s on a formula simplification that was a NOOP. DAG size: 125 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 21:13:42,366 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 [1] [2023-01-27 21:13:44,693 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:13:46,698 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 [1] [2023-01-27 21:13:49,293 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 [1] [2023-01-27 21:13:51,110 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 21:13:53,116 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 [1] [2023-01-27 21:13:55,132 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 [1] [2023-01-27 21:14:21,169 WARN L222 SmtUtils]: Spent 25.07s on a formula simplification that was a NOOP. DAG size: 123 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 21:14:24,704 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 [1] [2023-01-27 21:15:16,853 WARN L222 SmtUtils]: Spent 51.38s on a formula simplification. DAG size of input: 143 DAG size of output: 131 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2023-01-27 21:15:27,270 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 21:15:27,277 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-27 21:15:28,295 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 21:15:28,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-01-27 21:15:28,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-01-27 21:15:28,327 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Not enough levels on assertion stack at de.uni_freiburg.informatik.ultimate.logic.NoopScript.pop(NoopScript.java:272) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:138) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.pop(UndoableWrapperScript.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.restore(UndoableWrapperScript.java:87) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:236) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:160) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:376) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.NestedWordAutomataUtils.getSuccessorState(NestedWordAutomataUtils.java:483) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePetriNet$DifferenceSuccessorTransitionProvider.getOrConstructTransition(DifferencePetriNet.java:279) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePetriNet$DifferenceSuccessorTransitionProvider.getTransitions(DifferencePetriNet.java:261) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.addFullyInstantiatedCandidate(PossibleExtensions.java:168) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:195) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.update(PossibleExtensions.java:135) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolder.computeUnfoldingHelper(PetriNetUnfolder.java:209) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolder.computeUnfolding(PetriNetUnfolder.java:168) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolder.(PetriNetUnfolder.java:129) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.FinitePrefix.(FinitePrefix.java:76) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.FinitePrefix.(FinitePrefix.java:64) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePairwiseOnDemand.(DifferencePairwiseOnDemand.java:125) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNet.enhanceAnddeterminizeInterpolantAutomaton(CegarLoopForPetriNet.java:481) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNet.refineAbstraction(CegarLoopForPetriNet.java:227) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-01-27 21:15:28,330 INFO L158 Benchmark]: Toolchain (without parser) took 865002.16ms. Allocated memory was 593.5MB in the beginning and 12.8GB in the end (delta: 12.2GB). Free memory was 554.2MB in the beginning and 7.2GB in the end (delta: -6.7GB). Peak memory consumption was 5.5GB. Max. memory is 16.0GB. [2023-01-27 21:15:28,330 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 390.1MB. Free memory is still 339.6MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-27 21:15:28,330 INFO L158 Benchmark]: CACSL2BoogieTranslator took 190.52ms. Allocated memory is still 593.5MB. Free memory was 553.8MB in the beginning and 541.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-01-27 21:15:28,331 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.18ms. Allocated memory is still 593.5MB. Free memory was 541.3MB in the beginning and 538.4MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-27 21:15:28,331 INFO L158 Benchmark]: Boogie Preprocessor took 27.43ms. Allocated memory is still 593.5MB. Free memory was 538.4MB in the beginning and 536.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-27 21:15:28,331 INFO L158 Benchmark]: RCFGBuilder took 681.04ms. Allocated memory is still 593.5MB. Free memory was 536.3MB in the beginning and 549.4MB in the end (delta: -13.1MB). Peak memory consumption was 53.4MB. Max. memory is 16.0GB. [2023-01-27 21:15:28,331 INFO L158 Benchmark]: TraceAbstraction took 864068.66ms. Allocated memory was 593.5MB in the beginning and 12.8GB in the end (delta: 12.2GB). Free memory was 549.4MB in the beginning and 7.2GB in the end (delta: -6.7GB). Peak memory consumption was 5.5GB. Max. memory is 16.0GB. [2023-01-27 21:15:28,332 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 390.1MB. Free memory is still 339.6MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 190.52ms. Allocated memory is still 593.5MB. Free memory was 553.8MB in the beginning and 541.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 30.18ms. Allocated memory is still 593.5MB. Free memory was 541.3MB in the beginning and 538.4MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 27.43ms. Allocated memory is still 593.5MB. Free memory was 538.4MB in the beginning and 536.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 681.04ms. Allocated memory is still 593.5MB. Free memory was 536.3MB in the beginning and 549.4MB in the end (delta: -13.1MB). Peak memory consumption was 53.4MB. Max. memory is 16.0GB. * TraceAbstraction took 864068.66ms. Allocated memory was 593.5MB in the beginning and 12.8GB in the end (delta: 12.2GB). Free memory was 549.4MB in the beginning and 7.2GB in the end (delta: -6.7GB). Peak memory consumption was 5.5GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.9s, 227 PlacesBefore, 75 PlacesAfterwards, 226 TransitionsBefore, 65 TransitionsAfterwards, 7920 CoEnabledTransitionPairs, 8 FixpointIterations, 103 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 17 TrivialYvCompositions, 14 ConcurrentYvCompositions, 9 ChoiceCompositions, 192 TotalNumberOfCompositions, 33320 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 19758, independent: 19225, independent conditional: 0, independent unconditional: 19225, dependent: 533, dependent conditional: 0, dependent unconditional: 533, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 4264, independent: 4201, independent conditional: 0, independent unconditional: 4201, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 19758, independent: 15024, independent conditional: 0, independent unconditional: 15024, dependent: 470, dependent conditional: 0, dependent unconditional: 470, unknown: 4264, unknown conditional: 0, unknown unconditional: 4264] , Statistics on independence cache: Total cache size (in pairs): 712, Positive cache size: 674, Positive conditional cache size: 0, Positive unconditional cache size: 674, Negative cache size: 38, Negative conditional cache size: 0, Negative unconditional cache size: 38, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - ExceptionOrErrorResult: SMTLIBException: Not enough levels on assertion stack de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Not enough levels on assertion stack: de.uni_freiburg.informatik.ultimate.logic.NoopScript.pop(NoopScript.java:272) RESULT: Ultimate could not prove your program: Toolchain returned no result. Completed graceful shutdown